%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC181-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n023.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:02:17 EDT 2022
% Result : Unsatisfiable 12.53s 12.75s
% Output : Refutation 12.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of clauses : 25 ( 13 unt; 4 nHn; 25 RR)
% Number of literals : 68 ( 0 equ; 44 neg)
% Maximal clause size : 9 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 8 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
ssList(sk1),
file('SWC181-1.p',unknown),
[] ).
cnf(6,axiom,
equal(sk3,sk1),
file('SWC181-1.p',unknown),
[] ).
cnf(10,axiom,
strictorderedP(sk3),
file('SWC181-1.p',unknown),
[] ).
cnf(13,axiom,
~ duplicatefreeP(sk1),
file('SWC181-1.p',unknown),
[] ).
cnf(32,axiom,
ssList(skaf77(u)),
file('SWC181-1.p',unknown),
[] ).
cnf(33,axiom,
ssList(skaf76(u)),
file('SWC181-1.p',unknown),
[] ).
cnf(34,axiom,
ssList(skaf75(u)),
file('SWC181-1.p',unknown),
[] ).
cnf(77,axiom,
( ~ ssItem(u)
| ~ lt(u,u) ),
file('SWC181-1.p',unknown),
[] ).
cnf(86,axiom,
( ~ ssList(u)
| ssItem(v)
| duplicatefreeP(u) ),
file('SWC181-1.p',unknown),
[] ).
cnf(176,axiom,
( ~ ssList(u)
| duplicatefreeP(u)
| equal(app(app(skaf75(u),cons(skaf74(u),skaf76(u))),cons(skaf74(u),skaf77(u))),u) ),
file('SWC181-1.p',unknown),
[] ).
cnf(195,axiom,
( ~ ssList(u)
| ~ strictorderedP(u)
| ~ ssItem(v)
| ~ ssItem(w)
| ~ ssList(x)
| ~ ssList(y)
| ~ ssList(z)
| ~ equal(app(app(x,cons(v,y)),cons(w,z)),u)
| lt(v,w) ),
file('SWC181-1.p',unknown),
[] ).
cnf(200,plain,
strictorderedP(sk1),
inference(rew,[status(thm),theory(equality)],[6,10]),
[iquote('0:Rew:6.0,10.0')] ).
cnf(565,plain,
ssItem(u),
inference(spt,[spt(split,[position(s1)])],[86]),
[iquote('1:Spt:86.1')] ).
cnf(578,plain,
~ lt(u,u),
inference(mrr,[status(thm)],[77,565]),
[iquote('1:MRR:77.0,565.0')] ).
cnf(757,plain,
( ~ ssList(u)
| ~ strictorderedP(u)
| ~ ssList(v)
| ~ ssList(w)
| ~ ssList(x)
| ~ equal(app(app(v,cons(y,w)),cons(z,x)),u)
| lt(y,z) ),
inference(mrr,[status(thm)],[195,565]),
[iquote('1:MRR:195.3,195.2,565.0')] ).
cnf(7150,plain,
( ~ ssList(u)
| ~ ssList(v)
| ~ strictorderedP(v)
| ~ ssList(skaf75(u))
| ~ ssList(skaf76(u))
| ~ ssList(skaf77(u))
| ~ equal(u,v)
| duplicatefreeP(u)
| lt(skaf74(u),skaf74(u)) ),
inference(spl,[status(thm),theory(equality)],[176,757]),
[iquote('1:SpL:176.2,757.5')] ).
cnf(7170,plain,
( ~ ssList(u)
| ~ ssList(v)
| ~ strictorderedP(v)
| ~ equal(u,v)
| duplicatefreeP(u)
| lt(skaf74(u),skaf74(u)) ),
inference(ssi,[status(thm)],[7150,32,33,34]),
[iquote('1:SSi:7150.5,7150.4,7150.3,32.0,33.0,34.0')] ).
cnf(7171,plain,
( ~ ssList(u)
| ~ ssList(v)
| ~ strictorderedP(v)
| ~ equal(u,v)
| duplicatefreeP(u) ),
inference(mrr,[status(thm)],[7170,578]),
[iquote('1:MRR:7170.5,578.0')] ).
cnf(20125,plain,
( ~ ssList(u)
| ~ ssList(u)
| ~ strictorderedP(u)
| duplicatefreeP(u) ),
inference(eqr,[status(thm),theory(equality)],[7171]),
[iquote('1:EqR:7171.3')] ).
cnf(20126,plain,
( ~ ssList(u)
| ~ strictorderedP(u)
| duplicatefreeP(u) ),
inference(obv,[status(thm),theory(equality)],[20125]),
[iquote('1:Obv:20125.0')] ).
cnf(20127,plain,
( ~ ssList(sk1)
| ~ strictorderedP(sk1) ),
inference(res,[status(thm),theory(equality)],[20126,13]),
[iquote('1:Res:20126.2,13.0')] ).
cnf(20128,plain,
$false,
inference(ssi,[status(thm)],[20127,200,1]),
[iquote('1:SSi:20127.1,20127.0,200.0,1.0,200.0,1.0')] ).
cnf(20129,plain,
( ~ ssList(u)
| duplicatefreeP(u) ),
inference(spt,[spt(split,[position(s2)])],[86]),
[iquote('1:Spt:20128.0,86.0,86.2')] ).
cnf(20421,plain,
~ ssList(sk1),
inference(res,[status(thm),theory(equality)],[20129,13]),
[iquote('1:Res:20129.1,13.0')] ).
cnf(20422,plain,
$false,
inference(ssi,[status(thm)],[20421,200,1]),
[iquote('1:SSi:20421.0,200.0,1.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.06 % Problem : SWC181-1 : TPTP v8.1.0. Released v2.4.0.
% 0.04/0.07 % Command : run_spass %d %s
% 0.06/0.25 % Computer : n023.cluster.edu
% 0.06/0.25 % Model : x86_64 x86_64
% 0.06/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.25 % Memory : 8042.1875MB
% 0.06/0.25 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.25 % CPULimit : 300
% 0.06/0.25 % WCLimit : 600
% 0.06/0.25 % DateTime : Sun Jun 12 07:39:36 EDT 2022
% 0.09/0.25 % CPUTime :
% 12.53/12.75
% 12.53/12.75 SPASS V 3.9
% 12.53/12.75 SPASS beiseite: Proof found.
% 12.53/12.75 % SZS status Theorem
% 12.53/12.75 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 12.53/12.75 SPASS derived 13550 clauses, backtracked 2854 clauses, performed 47 splits and kept 8413 clauses.
% 12.53/12.75 SPASS allocated 93655 KBytes.
% 12.53/12.75 SPASS spent 0:0:11.15 on the problem.
% 12.53/12.75 0:00:00.02 for the input.
% 12.53/12.75 0:00:00.00 for the FLOTTER CNF translation.
% 12.53/12.75 0:00:00.19 for inferences.
% 12.53/12.75 0:00:00.50 for the backtracking.
% 12.53/12.75 0:0:10.15 for the reduction.
% 12.53/12.75
% 12.53/12.75
% 12.53/12.75 Here is a proof with depth 3, length 25 :
% 12.53/12.75 % SZS output start Refutation
% See solution above
% 12.53/12.75 Formulae used in the proof : co1_1 co1_6 co1_10 co1_13 clause18 clause19 clause20 clause63 clause72 clause162 clause181
% 12.53/12.75
%------------------------------------------------------------------------------