%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC009-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n012.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:03 EDT 2022
% Result : Unsatisfiable 18.90s 19.16s
% Output : Refutation 18.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 17
% Syntax : Number of clauses : 27 ( 17 unt; 0 nHn; 27 RR)
% Number of literals : 59 ( 0 equ; 40 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
ssList(sk1),
file('SWC009-1.p',unknown),
[] ).
cnf(5,axiom,
equal(sk4,sk2),
file('SWC009-1.p',unknown),
[] ).
cnf(6,axiom,
equal(sk3,sk1),
file('SWC009-1.p',unknown),
[] ).
cnf(7,axiom,
( ~ ssList(u)
| ~ ssList(v)
| ~ ssList(w)
| ~ equal(app(app(u,v),w),sk2)
| ~ equal(app(u,w),sk1) ),
file('SWC009-1.p',unknown),
[] ).
cnf(8,axiom,
ssList(sk5),
file('SWC009-1.p',unknown),
[] ).
cnf(9,axiom,
equal(app(sk3,sk5),sk4),
file('SWC009-1.p',unknown),
[] ).
cnf(10,axiom,
strictorderedP(sk3),
file('SWC009-1.p',unknown),
[] ).
cnf(13,axiom,
equalelemsP(nil),
file('SWC009-1.p',unknown),
[] ).
cnf(14,axiom,
duplicatefreeP(nil),
file('SWC009-1.p',unknown),
[] ).
cnf(15,axiom,
strictorderedP(nil),
file('SWC009-1.p',unknown),
[] ).
cnf(16,axiom,
totalorderedP(nil),
file('SWC009-1.p',unknown),
[] ).
cnf(17,axiom,
strictorderP(nil),
file('SWC009-1.p',unknown),
[] ).
cnf(18,axiom,
totalorderP(nil),
file('SWC009-1.p',unknown),
[] ).
cnf(19,axiom,
cyclefreeP(nil),
file('SWC009-1.p',unknown),
[] ).
cnf(20,axiom,
ssList(nil),
file('SWC009-1.p',unknown),
[] ).
cnf(85,axiom,
( ~ ssList(u)
| equal(app(u,nil),u) ),
file('SWC009-1.p',unknown),
[] ).
cnf(161,axiom,
( ~ ssList(u)
| ~ ssList(v)
| ~ ssList(w)
| equal(app(app(u,v),w),app(u,app(v,w))) ),
file('SWC009-1.p',unknown),
[] ).
cnf(198,plain,
strictorderedP(sk1),
inference(rew,[status(thm),theory(equality)],[6,10]),
[iquote('0:Rew:6.0,10.0')] ).
cnf(201,plain,
equal(app(sk1,sk5),sk2),
inference(rew,[status(thm),theory(equality)],[6,9,5]),
[iquote('0:Rew:6.0,9.0,5.0,9.0')] ).
cnf(205,plain,
( ~ ssList(u)
| ~ ssList(v)
| ~ ssList(w)
| ~ equal(app(w,u),sk1)
| ~ equal(app(w,app(v,u)),sk2) ),
inference(rew,[status(thm),theory(equality)],[161,7]),
[iquote('0:Rew:161.3,7.3')] ).
cnf(6375,plain,
( ~ ssList(u)
| ~ ssList(nil)
| ~ ssList(u)
| ~ ssList(v)
| ~ equal(app(v,nil),sk1)
| ~ equal(app(v,u),sk2) ),
inference(spl,[status(thm),theory(equality)],[85,205]),
[iquote('0:SpL:85.1,205.4')] ).
cnf(6401,plain,
( ~ ssList(nil)
| ~ ssList(u)
| ~ ssList(v)
| ~ equal(app(v,nil),sk1)
| ~ equal(app(v,u),sk2) ),
inference(obv,[status(thm),theory(equality)],[6375]),
[iquote('0:Obv:6375.0')] ).
cnf(6402,plain,
( ~ ssList(nil)
| ~ ssList(u)
| ~ ssList(v)
| ~ equal(v,sk1)
| ~ equal(app(v,u),sk2) ),
inference(rew,[status(thm),theory(equality)],[85,6401]),
[iquote('0:Rew:85.1,6401.3')] ).
cnf(6403,plain,
( ~ ssList(u)
| ~ ssList(v)
| ~ equal(v,sk1)
| ~ equal(app(v,u),sk2) ),
inference(ssi,[status(thm)],[6402,20,19,18,17,16,15,14,13]),
[iquote('0:SSi:6402.0,20.0,19.0,18.0,17.0,16.0,15.0,14.0,13.0')] ).
cnf(20502,plain,
( ~ ssList(sk5)
| ~ ssList(sk1)
| ~ equal(sk1,sk1)
| ~ equal(sk2,sk2) ),
inference(spl,[status(thm),theory(equality)],[201,6403]),
[iquote('0:SpL:201.0,6403.3')] ).
cnf(22420,plain,
( ~ ssList(sk5)
| ~ ssList(sk1) ),
inference(obv,[status(thm),theory(equality)],[20502]),
[iquote('0:Obv:20502.3')] ).
cnf(22421,plain,
$false,
inference(ssi,[status(thm)],[22420,198,1,8]),
[iquote('0:SSi:22420.1,22420.0,198.0,1.0,8.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC009-1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n012.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jun 12 01:37:11 EDT 2022
% 0.12/0.33 % CPUTime :
% 18.90/19.16
% 18.90/19.16 SPASS V 3.9
% 18.90/19.16 SPASS beiseite: Proof found.
% 18.90/19.16 % SZS status Theorem
% 18.90/19.16 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 18.90/19.16 SPASS derived 12545 clauses, backtracked 6398 clauses, performed 78 splits and kept 9986 clauses.
% 18.90/19.16 SPASS allocated 94660 KBytes.
% 18.90/19.16 SPASS spent 0:0:16.98 on the problem.
% 18.90/19.16 0:00:00.04 for the input.
% 18.90/19.16 0:00:00.00 for the FLOTTER CNF translation.
% 18.90/19.16 0:00:00.18 for inferences.
% 18.90/19.16 0:00:00.87 for the backtracking.
% 18.90/19.16 0:0:15.56 for the reduction.
% 18.90/19.16
% 18.90/19.16
% 18.90/19.16 Here is a proof with depth 2, length 27 :
% 18.90/19.16 % SZS output start Refutation
% See solution above
% 18.90/19.16 Formulae used in the proof : co1_1 co1_5 co1_6 co1_7 co1_8 co1_9 co1_10 clause1 clause2 clause3 clause4 clause5 clause6 clause7 clause8 clause73 clause149
% 18.90/19.16
%------------------------------------------------------------------------------