%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC024+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n025.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:10 EDT 2022
% Result : Theorem 1.30s 1.47s
% Output : Refutation 1.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 21
% Syntax : Number of clauses : 44 ( 26 unt; 4 nHn; 44 RR)
% Number of literals : 83 ( 0 equ; 44 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 14 ( 13 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
ssList(skc7),
file('SWC024+1.p',unknown),
[] ).
cnf(2,axiom,
ssList(skc6),
file('SWC024+1.p',unknown),
[] ).
cnf(3,axiom,
ssList(skc5),
file('SWC024+1.p',unknown),
[] ).
cnf(4,axiom,
equalelemsP(skc5),
file('SWC024+1.p',unknown),
[] ).
cnf(7,axiom,
ssList(nil),
file('SWC024+1.p',unknown),
[] ).
cnf(8,axiom,
cyclefreeP(nil),
file('SWC024+1.p',unknown),
[] ).
cnf(9,axiom,
totalorderP(nil),
file('SWC024+1.p',unknown),
[] ).
cnf(10,axiom,
strictorderP(nil),
file('SWC024+1.p',unknown),
[] ).
cnf(11,axiom,
totalorderedP(nil),
file('SWC024+1.p',unknown),
[] ).
cnf(12,axiom,
strictorderedP(nil),
file('SWC024+1.p',unknown),
[] ).
cnf(13,axiom,
duplicatefreeP(nil),
file('SWC024+1.p',unknown),
[] ).
cnf(14,axiom,
equalelemsP(nil),
file('SWC024+1.p',unknown),
[] ).
cnf(15,axiom,
neq(skc6,nil),
file('SWC024+1.p',unknown),
[] ).
cnf(61,axiom,
equal(app(skc5,skc7),skc6),
file('SWC024+1.p',unknown),
[] ).
cnf(63,axiom,
( ~ ssList(u)
| frontsegP(u,u) ),
file('SWC024+1.p',unknown),
[] ).
cnf(70,axiom,
( ~ equal(skc5,nil)
| equal(skc6,nil) ),
file('SWC024+1.p',unknown),
[] ).
cnf(92,axiom,
( ~ ssList(u)
| ~ equal(nil,u)
| frontsegP(nil,u) ),
file('SWC024+1.p',unknown),
[] ).
cnf(106,axiom,
( ~ ssList(u)
| ~ ssList(v)
| neq(v,u)
| equal(v,u) ),
file('SWC024+1.p',unknown),
[] ).
cnf(126,axiom,
( ~ ssList(u)
| ~ neq(u,nil)
| ~ frontsegP(skc5,u)
| ~ frontsegP(skc6,u) ),
file('SWC024+1.p',unknown),
[] ).
cnf(149,axiom,
( ~ ssList(u)
| ~ ssList(v)
| ~ ssList(w)
| ~ frontsegP(w,v)
| frontsegP(app(w,u),v) ),
file('SWC024+1.p',unknown),
[] ).
cnf(152,axiom,
( ~ ssList(u)
| ~ ssItem(v)
| ~ strictorderedP(cons(v,u))
| lt(v,hd(u))
| equal(nil,u) ),
file('SWC024+1.p',unknown),
[] ).
cnf(254,plain,
( ~ ssList(u)
| neq(skc5,u)
| equal(skc5,u) ),
inference(res,[status(thm),theory(equality)],[3,106]),
[iquote('0:Res:3.0,106.0')] ).
cnf(281,plain,
frontsegP(skc5,skc5),
inference(res,[status(thm),theory(equality)],[3,63]),
[iquote('0:Res:3.0,63.0')] ).
cnf(311,plain,
( ~ ssItem(u)
| ~ strictorderedP(cons(u,skc5))
| lt(u,hd(skc5))
| equal(skc5,nil) ),
inference(res,[status(thm),theory(equality)],[3,152]),
[iquote('0:Res:3.0,152.1')] ).
cnf(420,plain,
( ~ neq(skc6,nil)
| ~ frontsegP(skc6,skc6)
| ~ frontsegP(skc5,skc6) ),
inference(res,[status(thm),theory(equality)],[2,126]),
[iquote('0:Res:2.0,126.0')] ).
cnf(446,plain,
( ~ equal(skc6,nil)
| frontsegP(nil,skc6) ),
inference(res,[status(thm),theory(equality)],[2,92]),
[iquote('0:Res:2.0,92.0')] ).
cnf(455,plain,
frontsegP(skc6,skc6),
inference(res,[status(thm),theory(equality)],[2,63]),
[iquote('0:Res:2.0,63.0')] ).
cnf(552,plain,
~ frontsegP(skc5,skc6),
inference(mrr,[status(thm)],[420,15,455]),
[iquote('0:MRR:420.0,420.1,15.0,455.0')] ).
cnf(562,plain,
equal(skc5,nil),
inference(spt,[spt(split,[position(s1)])],[311]),
[iquote('1:Spt:311.3')] ).
cnf(569,plain,
( ~ equal(nil,nil)
| equal(skc6,nil) ),
inference(rew,[status(thm),theory(equality)],[562,70]),
[iquote('1:Rew:562.0,70.0')] ).
cnf(674,plain,
~ frontsegP(nil,skc6),
inference(rew,[status(thm),theory(equality)],[562,552]),
[iquote('1:Rew:562.0,552.0')] ).
cnf(722,plain,
~ equal(skc6,nil),
inference(mrr,[status(thm)],[446,674]),
[iquote('1:MRR:446.1,674.0')] ).
cnf(736,plain,
equal(skc6,nil),
inference(obv,[status(thm),theory(equality)],[569]),
[iquote('1:Obv:569.0')] ).
cnf(737,plain,
$false,
inference(mrr,[status(thm)],[736,722]),
[iquote('1:MRR:736.0,722.0')] ).
cnf(843,plain,
~ equal(skc5,nil),
inference(spt,[spt(split,[position(sa)])],[737,562]),
[iquote('1:Spt:737.0,311.3,562.0')] ).
cnf(844,plain,
( ~ ssItem(u)
| ~ strictorderedP(cons(u,skc5))
| lt(u,hd(skc5)) ),
inference(spt,[spt(split,[position(s2)])],[311]),
[iquote('1:Spt:737.0,311.0,311.1,311.2')] ).
cnf(3301,plain,
( ~ ssList(skc7)
| ~ ssList(u)
| ~ ssList(skc5)
| ~ frontsegP(skc5,u)
| frontsegP(skc6,u) ),
inference(spr,[status(thm),theory(equality)],[61,149]),
[iquote('0:SpR:61.0,149.4')] ).
cnf(3907,plain,
( ~ ssList(u)
| ~ frontsegP(skc5,u)
| frontsegP(skc6,u) ),
inference(ssi,[status(thm)],[3301,3,4,1]),
[iquote('0:SSi:3301.2,3301.0,3.0,4.0,1.0')] ).
cnf(3908,plain,
( ~ ssList(u)
| ~ neq(u,nil)
| ~ frontsegP(skc5,u) ),
inference(mrr,[status(thm)],[126,3907]),
[iquote('0:MRR:126.3,3907.2')] ).
cnf(3944,plain,
( ~ ssList(skc5)
| ~ neq(skc5,nil) ),
inference(res,[status(thm),theory(equality)],[281,3908]),
[iquote('0:Res:281.0,3908.2')] ).
cnf(3948,plain,
~ neq(skc5,nil),
inference(ssi,[status(thm)],[3944,3,4]),
[iquote('0:SSi:3944.0,3.0,4.0')] ).
cnf(3962,plain,
( ~ ssList(nil)
| equal(skc5,nil) ),
inference(res,[status(thm),theory(equality)],[254,3948]),
[iquote('0:Res:254.1,3948.0')] ).
cnf(3965,plain,
equal(skc5,nil),
inference(ssi,[status(thm)],[3962,14,13,10,9,8,12,11,7]),
[iquote('0:SSi:3962.0,14.0,13.0,10.0,9.0,8.0,12.0,11.0,7.0')] ).
cnf(3966,plain,
$false,
inference(mrr,[status(thm)],[3965,843]),
[iquote('1:MRR:3965.0,843.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SWC024+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n025.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 04:22:52 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.30/1.47
% 1.30/1.47 SPASS V 3.9
% 1.30/1.47 SPASS beiseite: Proof found.
% 1.30/1.47 % SZS status Theorem
% 1.30/1.47 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.30/1.47 SPASS derived 2610 clauses, backtracked 1140 clauses, performed 46 splits and kept 2351 clauses.
% 1.30/1.47 SPASS allocated 100959 KBytes.
% 1.30/1.47 SPASS spent 0:00:01.11 on the problem.
% 1.30/1.47 0:00:00.04 for the input.
% 1.30/1.47 0:00:00.07 for the FLOTTER CNF translation.
% 1.30/1.47 0:00:00.02 for inferences.
% 1.30/1.47 0:00:00.02 for the backtracking.
% 1.30/1.47 0:00:00.79 for the reduction.
% 1.30/1.47
% 1.30/1.47
% 1.30/1.47 Here is a proof with depth 3, length 44 :
% 1.30/1.47 % SZS output start Refutation
% See solution above
% 1.30/1.47 Formulae used in the proof : co1 ax17 ax60 ax62 ax64 ax66 ax69 ax72 ax74 ax42 ax46 ax15 ax43 ax70
% 1.30/1.47
%------------------------------------------------------------------------------