%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC094+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n029.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 : Tue Jul 19 22:01:40 EDT 2022
% Result : Theorem 0.61s 0.80s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 13
% Syntax : Number of clauses : 21 ( 11 unt; 0 nHn; 21 RR)
% Number of literals : 45 ( 0 equ; 31 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
ssList(skc3),
file('SWC094+1.p',unknown),
[] ).
cnf(4,axiom,
ssList(nil),
file('SWC094+1.p',unknown),
[] ).
cnf(5,axiom,
cyclefreeP(nil),
file('SWC094+1.p',unknown),
[] ).
cnf(6,axiom,
totalorderP(nil),
file('SWC094+1.p',unknown),
[] ).
cnf(7,axiom,
strictorderP(nil),
file('SWC094+1.p',unknown),
[] ).
cnf(8,axiom,
totalorderedP(nil),
file('SWC094+1.p',unknown),
[] ).
cnf(9,axiom,
strictorderedP(nil),
file('SWC094+1.p',unknown),
[] ).
cnf(10,axiom,
duplicatefreeP(nil),
file('SWC094+1.p',unknown),
[] ).
cnf(11,axiom,
equalelemsP(nil),
file('SWC094+1.p',unknown),
[] ).
cnf(74,axiom,
( ~ ssList(u)
| equal(app(nil,u),u) ),
file('SWC094+1.p',unknown),
[] ).
cnf(75,axiom,
( ~ ssList(u)
| equal(app(u,nil),u) ),
file('SWC094+1.p',unknown),
[] ).
cnf(151,axiom,
( ~ ssList(u)
| ~ ssList(v)
| ~ ssList(w)
| equal(app(app(w,v),u),app(w,app(v,u))) ),
file('SWC094+1.p',unknown),
[] ).
cnf(179,axiom,
( ~ ssList(u)
| ~ ssList(v)
| ~ ssList(w)
| ~ equal(app(app(u,v),w),skc3)
| ~ equal(app(u,w),skc3) ),
file('SWC094+1.p',unknown),
[] ).
cnf(194,plain,
( ~ ssList(u)
| ~ ssList(v)
| ~ ssList(w)
| ~ equal(app(u,app(v,w)),skc3)
| ~ equal(app(u,w),skc3) ),
inference(rew,[status(thm),theory(equality)],[151,179]),
[iquote('0:Rew:151.3,179.3')] ).
cnf(272,plain,
equal(app(skc3,nil),skc3),
inference(res,[status(thm),theory(equality)],[1,75]),
[iquote('0:Res:1.0,75.0')] ).
cnf(398,plain,
( ~ ssList(u)
| ~ ssList(v)
| ~ equal(app(u,app(nil,v)),skc3)
| ~ equal(app(u,v),skc3) ),
inference(res,[status(thm),theory(equality)],[4,194]),
[iquote('0:Res:4.0,194.1')] ).
cnf(457,plain,
( ~ ssList(u)
| ~ ssList(v)
| ~ equal(app(u,v),skc3)
| ~ equal(app(u,v),skc3) ),
inference(rew,[status(thm),theory(equality)],[74,398]),
[iquote('0:Rew:74.1,398.2')] ).
cnf(458,plain,
( ~ ssList(u)
| ~ ssList(v)
| ~ equal(app(v,u),skc3) ),
inference(obv,[status(thm),theory(equality)],[457]),
[iquote('0:Obv:457.2')] ).
cnf(1190,plain,
( ~ ssList(nil)
| ~ ssList(skc3)
| ~ equal(skc3,skc3) ),
inference(spl,[status(thm),theory(equality)],[272,458]),
[iquote('0:SpL:272.0,458.2')] ).
cnf(1336,plain,
( ~ ssList(nil)
| ~ ssList(skc3) ),
inference(obv,[status(thm),theory(equality)],[1190]),
[iquote('0:Obv:1190.2')] ).
cnf(1337,plain,
$false,
inference(ssi,[status(thm)],[1336,1,11,10,7,6,5,9,8,4]),
[iquote('0:SSi:1336.1,1336.0,1.0,11.0,10.0,7.0,6.0,5.0,9.0,8.0,4.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC094+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12 % Command : run_spass %d %s
% 0.13/0.33 % Computer : n029.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sat Jun 11 21:18:38 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.61/0.80
% 0.61/0.80 SPASS V 3.9
% 0.61/0.80 SPASS beiseite: Proof found.
% 0.61/0.80 % SZS status Theorem
% 0.61/0.80 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.61/0.80 SPASS derived 738 clauses, backtracked 372 clauses, performed 7 splits and kept 901 clauses.
% 0.61/0.80 SPASS allocated 98930 KBytes.
% 0.61/0.80 SPASS spent 0:00:00.44 on the problem.
% 0.61/0.80 0:00:00.05 for the input.
% 0.61/0.80 0:00:00.07 for the FLOTTER CNF translation.
% 0.61/0.80 0:00:00.01 for inferences.
% 0.61/0.80 0:00:00.00 for the backtracking.
% 0.61/0.80 0:00:00.21 for the reduction.
% 0.61/0.80
% 0.61/0.80
% 0.61/0.80 Here is a proof with depth 2, length 21 :
% 0.61/0.80 % SZS output start Refutation
% See solution above
% 0.61/0.80 Formulae used in the proof : co1 ax17 ax60 ax62 ax64 ax66 ax69 ax72 ax74 ax28 ax84 ax82
% 0.61/0.80
%------------------------------------------------------------------------------