%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC008-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n007.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:02 EDT 2022
% Result : Unsatisfiable 119.49s 119.73s
% Output : Refutation 119.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 19
% Syntax : Number of clauses : 35 ( 21 unt; 0 nHn; 35 RR)
% Number of literals : 73 ( 0 equ; 49 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 11 ( 10 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
ssList(sk1),
file('SWC008-1.p',unknown),
[] ).
cnf(2,axiom,
ssList(sk2),
file('SWC008-1.p',unknown),
[] ).
cnf(5,axiom,
equal(sk4,sk2),
file('SWC008-1.p',unknown),
[] ).
cnf(6,axiom,
equal(sk3,sk1),
file('SWC008-1.p',unknown),
[] ).
cnf(7,axiom,
frontsegP(sk4,sk3),
file('SWC008-1.p',unknown),
[] ).
cnf(8,axiom,
equalelemsP(sk3),
file('SWC008-1.p',unknown),
[] ).
cnf(9,axiom,
( ~ ssList(u)
| ~ ssList(v)
| ~ ssList(w)
| ~ equal(app(app(u,v),w),sk2)
| ~ equal(app(u,w),sk1) ),
file('SWC008-1.p',unknown),
[] ).
cnf(11,axiom,
equalelemsP(nil),
file('SWC008-1.p',unknown),
[] ).
cnf(12,axiom,
duplicatefreeP(nil),
file('SWC008-1.p',unknown),
[] ).
cnf(13,axiom,
strictorderedP(nil),
file('SWC008-1.p',unknown),
[] ).
cnf(14,axiom,
totalorderedP(nil),
file('SWC008-1.p',unknown),
[] ).
cnf(15,axiom,
strictorderP(nil),
file('SWC008-1.p',unknown),
[] ).
cnf(16,axiom,
totalorderP(nil),
file('SWC008-1.p',unknown),
[] ).
cnf(17,axiom,
cyclefreeP(nil),
file('SWC008-1.p',unknown),
[] ).
cnf(18,axiom,
ssList(nil),
file('SWC008-1.p',unknown),
[] ).
cnf(61,axiom,
ssList(skaf45(u,v)),
file('SWC008-1.p',unknown),
[] ).
cnf(83,axiom,
( ~ ssList(u)
| equal(app(u,nil),u) ),
file('SWC008-1.p',unknown),
[] ).
cnf(142,axiom,
( ~ ssList(u)
| ~ ssList(v)
| ~ frontsegP(u,v)
| equal(app(v,skaf45(u,v)),u) ),
file('SWC008-1.p',unknown),
[] ).
cnf(159,axiom,
( ~ ssList(u)
| ~ ssList(v)
| ~ ssList(w)
| equal(app(app(u,v),w),app(u,app(v,w))) ),
file('SWC008-1.p',unknown),
[] ).
cnf(196,plain,
equalelemsP(sk1),
inference(rew,[status(thm),theory(equality)],[6,8]),
[iquote('0:Rew:6.0,8.0')] ).
cnf(198,plain,
frontsegP(sk4,sk1),
inference(rew,[status(thm),theory(equality)],[6,7]),
[iquote('0:Rew:6.0,7.0')] ).
cnf(200,plain,
frontsegP(sk2,sk1),
inference(rew,[status(thm),theory(equality)],[5,198]),
[iquote('0:Rew:5.0,198.0')] ).
cnf(204,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)],[159,9]),
[iquote('0:Rew:159.3,9.3')] ).
cnf(334,plain,
( ~ ssList(u)
| ~ frontsegP(sk2,u)
| equal(app(u,skaf45(sk2,u)),sk2) ),
inference(res,[status(thm),theory(equality)],[2,142]),
[iquote('0:Res:2.0,142.1')] ).
cnf(396,plain,
( ~ ssList(u)
| ~ ssList(v)
| ~ equal(app(sk1,u),sk1)
| ~ equal(app(sk1,app(v,u)),sk2) ),
inference(res,[status(thm),theory(equality)],[1,204]),
[iquote('0:Res:1.0,204.0')] ).
cnf(463,plain,
equal(app(sk1,nil),sk1),
inference(res,[status(thm),theory(equality)],[1,83]),
[iquote('0:Res:1.0,83.0')] ).
cnf(46287,plain,
( ~ ssList(u)
| ~ ssList(nil)
| ~ ssList(u)
| ~ equal(app(sk1,nil),sk1)
| ~ equal(app(sk1,u),sk2) ),
inference(spl,[status(thm),theory(equality)],[83,396]),
[iquote('0:SpL:83.1,396.3')] ).
cnf(46342,plain,
( ~ ssList(nil)
| ~ ssList(u)
| ~ equal(app(sk1,nil),sk1)
| ~ equal(app(sk1,u),sk2) ),
inference(obv,[status(thm),theory(equality)],[46287]),
[iquote('0:Obv:46287.0')] ).
cnf(46343,plain,
( ~ ssList(nil)
| ~ ssList(u)
| ~ equal(sk1,sk1)
| ~ equal(app(sk1,u),sk2) ),
inference(rew,[status(thm),theory(equality)],[463,46342]),
[iquote('0:Rew:463.0,46342.2')] ).
cnf(46344,plain,
( ~ ssList(nil)
| ~ ssList(u)
| ~ equal(app(sk1,u),sk2) ),
inference(obv,[status(thm),theory(equality)],[46343]),
[iquote('0:Obv:46343.2')] ).
cnf(46345,plain,
( ~ ssList(u)
| ~ equal(app(sk1,u),sk2) ),
inference(ssi,[status(thm)],[46344,18,17,16,15,14,13,12,11]),
[iquote('0:SSi:46344.0,18.0,17.0,16.0,15.0,14.0,13.0,12.0,11.0')] ).
cnf(46569,plain,
( ~ ssList(sk1)
| ~ ssList(skaf45(sk2,sk1))
| ~ frontsegP(sk2,sk1)
| ~ equal(sk2,sk2) ),
inference(spl,[status(thm),theory(equality)],[334,46345]),
[iquote('0:SpL:334.2,46345.1')] ).
cnf(54156,plain,
( ~ ssList(sk1)
| ~ ssList(skaf45(sk2,sk1))
| ~ frontsegP(sk2,sk1) ),
inference(obv,[status(thm),theory(equality)],[46569]),
[iquote('0:Obv:46569.3')] ).
cnf(54157,plain,
~ frontsegP(sk2,sk1),
inference(ssi,[status(thm)],[54156,61,2,196,1]),
[iquote('0:SSi:54156.1,54156.0,61.0,2.0,196.0,1.0,196.0,1.0')] ).
cnf(54158,plain,
$false,
inference(mrr,[status(thm)],[54157,200]),
[iquote('0:MRR:54157.0,200.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWC008-1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n007.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 20:12:23 EDT 2022
% 0.12/0.33 % CPUTime :
% 119.49/119.73
% 119.49/119.73 SPASS V 3.9
% 119.49/119.73 SPASS beiseite: Proof found.
% 119.49/119.73 % SZS status Theorem
% 119.49/119.73 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 119.49/119.73 SPASS derived 28019 clauses, backtracked 18858 clauses, performed 44 splits and kept 22963 clauses.
% 119.49/119.73 SPASS allocated 122629 KBytes.
% 119.49/119.73 SPASS spent 0:1:45.55 on the problem.
% 119.49/119.73 0:00:00.04 for the input.
% 119.49/119.73 0:00:00.00 for the FLOTTER CNF translation.
% 119.49/119.73 0:00:00.47 for inferences.
% 119.49/119.73 0:00:05.56 for the backtracking.
% 119.49/119.73 0:1:38.98 for the reduction.
% 119.49/119.73
% 119.49/119.73
% 119.49/119.73 Here is a proof with depth 3, length 35 :
% 119.49/119.73 % SZS output start Refutation
% See solution above
% 119.49/119.73 Formulae used in the proof : co1_1 co1_2 co1_5 co1_6 co1_7 co1_8 co1_9 clause1 clause2 clause3 clause4 clause5 clause6 clause7 clause8 clause51 clause73 clause132 clause149
% 119.49/119.73
%------------------------------------------------------------------------------