%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : KRS030+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n027.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Sun Jul 17 03:30:19 EDT 2022
% Result : Satisfiable 0.19s 0.44s
% Output : Saturation 0.19s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(40,plain,
( ~ cp(u)
| ~ rinvS(v,w)
| ~ rf(w,u)
| cSatisfiable(w)
| cp(v) ),
inference(res,[status(thm),theory(equality)],[14,37]),
[iquote('0:Res:14.1,37.1')] ).
cnf(37,plain,
( ~ cp(u)
| ~ rs(v,w)
| ~ rf(v,u)
| cSatisfiable(v)
| cp(w) ),
inference(res,[status(thm),theory(equality)],[17,21]),
[iquote('0:Res:17.1,21.1')] ).
cnf(39,plain,
( ~ rinvS(u,v)
| ~ rf(v,w)
| equal(w,u) ),
inference(res,[status(thm),theory(equality)],[14,29]),
[iquote('0:Res:14.1,29.0')] ).
cnf(38,plain,
( ~ rinvS(u,v)
| ~ rf1(v,w)
| equal(w,u) ),
inference(res,[status(thm),theory(equality)],[14,27]),
[iquote('0:Res:14.1,27.0')] ).
cnf(29,plain,
( ~ rs(u,v)
| ~ rf(u,w)
| equal(w,v) ),
inference(res,[status(thm),theory(equality)],[16,18]),
[iquote('0:Res:16.1,18.0')] ).
cnf(27,plain,
( ~ rs(u,v)
| ~ rf1(u,w)
| equal(w,v) ),
inference(res,[status(thm),theory(equality)],[17,19]),
[iquote('0:Res:17.1,19.0')] ).
cnf(25,plain,
( ~ rinvS(u,v)
| ~ rs(v,w)
| equal(w,u) ),
inference(res,[status(thm),theory(equality)],[14,20]),
[iquote('0:Res:14.1,20.0')] ).
cnf(35,plain,
( ~ cSatisfiable(u)
| ~ rinvS(v,u)
| equal(v,skf3(u)) ),
inference(res,[status(thm),theory(equality)],[14,33]),
[iquote('0:Res:14.1,33.1')] ).
cnf(34,plain,
( ~ cSatisfiable(u)
| ~ rinvS(v,u)
| equal(v,skf2(u)) ),
inference(res,[status(thm),theory(equality)],[14,31]),
[iquote('0:Res:14.1,31.1')] ).
cnf(21,axiom,
( ~ cp(u)
| ~ rf1(v,w)
| ~ rf(v,u)
| cSatisfiable(v)
| cp(w) ),
file('KRS030+1.p',unknown),
[] ).
cnf(33,plain,
( ~ cSatisfiable(u)
| ~ rs(u,v)
| equal(v,skf3(u)) ),
inference(res,[status(thm),theory(equality)],[16,28]),
[iquote('0:Res:16.1,28.1')] ).
cnf(31,plain,
( ~ cSatisfiable(u)
| ~ rs(u,v)
| equal(v,skf2(u)) ),
inference(res,[status(thm),theory(equality)],[17,26]),
[iquote('0:Res:17.1,26.1')] ).
cnf(28,plain,
( ~ cSatisfiable(u)
| ~ rf(u,v)
| equal(v,skf3(u)) ),
inference(res,[status(thm),theory(equality)],[9,18]),
[iquote('0:Res:9.1,18.0')] ).
cnf(26,plain,
( ~ cSatisfiable(u)
| ~ rf1(u,v)
| equal(v,skf2(u)) ),
inference(res,[status(thm),theory(equality)],[8,19]),
[iquote('0:Res:8.1,19.0')] ).
cnf(18,axiom,
( ~ rf(u,v)
| ~ rf(u,w)
| equal(w,v) ),
file('KRS030+1.p',unknown),
[] ).
cnf(19,axiom,
( ~ rf1(u,v)
| ~ rf1(u,w)
| equal(w,v) ),
file('KRS030+1.p',unknown),
[] ).
cnf(20,axiom,
( ~ rs(u,v)
| ~ rs(u,w)
| equal(w,v) ),
file('KRS030+1.p',unknown),
[] ).
cnf(16,axiom,
( ~ rs(u,v)
| rf(u,v) ),
file('KRS030+1.p',unknown),
[] ).
cnf(17,axiom,
( ~ rs(u,v)
| rf1(u,v) ),
file('KRS030+1.p',unknown),
[] ).
cnf(10,axiom,
( ~ rinvF(u,v)
| rf(v,u) ),
file('KRS030+1.p',unknown),
[] ).
cnf(12,axiom,
( ~ rinvF1(u,v)
| rf1(v,u) ),
file('KRS030+1.p',unknown),
[] ).
cnf(14,axiom,
( ~ rinvS(u,v)
| rs(v,u) ),
file('KRS030+1.p',unknown),
[] ).
cnf(11,axiom,
( ~ rf(u,v)
| rinvF(v,u) ),
file('KRS030+1.p',unknown),
[] ).
cnf(13,axiom,
( ~ rf1(u,v)
| rinvF1(v,u) ),
file('KRS030+1.p',unknown),
[] ).
cnf(15,axiom,
( ~ rs(u,v)
| rinvS(v,u) ),
file('KRS030+1.p',unknown),
[] ).
cnf(8,axiom,
( ~ cSatisfiable(u)
| rf1(u,skf2(u)) ),
file('KRS030+1.p',unknown),
[] ).
cnf(9,axiom,
( ~ cSatisfiable(u)
| rf(u,skf3(u)) ),
file('KRS030+1.p',unknown),
[] ).
cnf(7,axiom,
( ~ xsd_integer(u)
| ~ xsd_string(u) ),
file('KRS030+1.p',unknown),
[] ).
cnf(5,axiom,
( xsd_string(u)
| xsd_integer(u) ),
file('KRS030+1.p',unknown),
[] ).
cnf(6,axiom,
~ cp(skf2(u)),
file('KRS030+1.p',unknown),
[] ).
cnf(4,axiom,
cp(skf3(u)),
file('KRS030+1.p',unknown),
[] ).
cnf(3,axiom,
~ cowlNothing(u),
file('KRS030+1.p',unknown),
[] ).
cnf(1,axiom,
cowlThing(u),
file('KRS030+1.p',unknown),
[] ).
cnf(2,axiom,
cSatisfiable(i2003_11_14_17_15_26245),
file('KRS030+1.p',unknown),
[] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KRS030+1 : TPTP v8.1.0. Released v3.1.0.
% 0.13/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n027.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue Jun 7 12:27:10 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.44
% 0.19/0.44 SPASS V 3.9
% 0.19/0.44 SPASS beiseite: Completion found.
% 0.19/0.44 % SZS status CounterSatisfiable
% 0.19/0.44 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.44 SPASS derived 19 clauses, backtracked 0 clauses, performed 0 splits and kept 34 clauses.
% 0.19/0.44 SPASS allocated 97740 KBytes.
% 0.19/0.44 SPASS spent 0:00:00.09 on the problem.
% 0.19/0.44 0:00:00.04 for the input.
% 0.19/0.44 0:00:00.03 for the FLOTTER CNF translation.
% 0.19/0.44 0:00:00.00 for inferences.
% 0.19/0.44 0:00:00.00 for the backtracking.
% 0.19/0.44 0:00:00.00 for the reduction.
% 0.19/0.44
% 0.19/0.44
% 0.19/0.44 The saturated set of worked-off clauses is :
% 0.19/0.44 % SZS output start Saturation
% See solution above
%------------------------------------------------------------------------------