%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC043-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n027.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:19 EDT 2022
% Result : Unsatisfiable 0.51s 0.72s
% Output : Refutation 0.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 11
% Syntax : Number of clauses : 30 ( 18 unt; 3 nHn; 30 RR)
% Number of literals : 52 ( 0 equ; 25 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 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('SWC043-1.p',unknown),
[] ).
cnf(5,axiom,
equal(nil,sk2),
file('SWC043-1.p',unknown),
[] ).
cnf(6,axiom,
equal(sk4,sk2),
file('SWC043-1.p',unknown),
[] ).
cnf(7,axiom,
equal(sk3,sk1),
file('SWC043-1.p',unknown),
[] ).
cnf(8,axiom,
~ equal(nil,sk1),
file('SWC043-1.p',unknown),
[] ).
cnf(9,axiom,
ssList(sk5),
file('SWC043-1.p',unknown),
[] ).
cnf(10,axiom,
equal(app(sk3,sk5),sk4),
file('SWC043-1.p',unknown),
[] ).
cnf(11,axiom,
strictorderedP(sk3),
file('SWC043-1.p',unknown),
[] ).
cnf(86,axiom,
( ~ ssList(u)
| equal(app(u,nil),u) ),
file('SWC043-1.p',unknown),
[] ).
cnf(132,axiom,
( ~ ssList(u)
| ~ ssList(v)
| ~ equal(app(v,u),nil)
| equal(nil,u) ),
file('SWC043-1.p',unknown),
[] ).
cnf(136,axiom,
( ~ ssList(u)
| ~ ssList(v)
| equal(nil,v)
| equal(hd(app(v,u)),hd(v)) ),
file('SWC043-1.p',unknown),
[] ).
cnf(199,plain,
strictorderedP(sk1),
inference(rew,[status(thm),theory(equality)],[7,11]),
[iquote('0:Rew:7.0,11.0')] ).
cnf(211,plain,
~ equal(sk2,sk1),
inference(rew,[status(thm),theory(equality)],[5,8]),
[iquote('0:Rew:5.0,8.0')] ).
cnf(212,plain,
equal(app(sk1,sk5),sk2),
inference(rew,[status(thm),theory(equality)],[7,10,6]),
[iquote('0:Rew:7.0,10.0,6.0,10.0')] ).
cnf(226,plain,
( ~ ssList(u)
| equal(app(u,sk2),u) ),
inference(rew,[status(thm),theory(equality)],[5,86]),
[iquote('0:Rew:5.0,86.1')] ).
cnf(245,plain,
( ~ ssList(u)
| ~ ssList(v)
| ~ equal(app(u,v),sk2)
| equal(sk2,v) ),
inference(rew,[status(thm),theory(equality)],[5,132]),
[iquote('0:Rew:5.0,132.3,5.0,132.2')] ).
cnf(249,plain,
( ~ ssList(u)
| ~ ssList(v)
| equal(sk2,u)
| equal(hd(app(u,v)),hd(u)) ),
inference(rew,[status(thm),theory(equality)],[5,136]),
[iquote('0:Rew:5.0,136.2')] ).
cnf(315,plain,
( ~ ssList(u)
| ~ equal(app(u,sk5),sk2)
| equal(sk5,sk2) ),
inference(res,[status(thm),theory(equality)],[9,245]),
[iquote('0:Res:9.0,245.0')] ).
cnf(388,plain,
( ~ ssList(u)
| equal(sk5,sk2)
| equal(hd(app(sk5,u)),hd(sk5)) ),
inference(res,[status(thm),theory(equality)],[9,249]),
[iquote('0:Res:9.0,249.1')] ).
cnf(843,plain,
equal(sk5,sk2),
inference(spt,[spt(split,[position(s1)])],[388]),
[iquote('1:Spt:388.1')] ).
cnf(936,plain,
equal(app(sk1,sk2),sk2),
inference(rew,[status(thm),theory(equality)],[843,212]),
[iquote('1:Rew:843.0,212.0')] ).
cnf(1089,plain,
( ~ ssList(sk1)
| equal(sk2,sk1) ),
inference(spr,[status(thm),theory(equality)],[226,936]),
[iquote('1:SpR:226.1,936.0')] ).
cnf(1092,plain,
equal(sk2,sk1),
inference(ssi,[status(thm)],[1089,199,1]),
[iquote('1:SSi:1089.0,199.0,1.0')] ).
cnf(1093,plain,
$false,
inference(mrr,[status(thm)],[1092,211]),
[iquote('1:MRR:1092.0,211.0')] ).
cnf(1094,plain,
~ equal(sk5,sk2),
inference(spt,[spt(split,[position(sa)])],[1093,843]),
[iquote('1:Spt:1093.0,388.1,843.0')] ).
cnf(1095,plain,
( ~ ssList(u)
| equal(hd(app(sk5,u)),hd(sk5)) ),
inference(spt,[spt(split,[position(s2)])],[388]),
[iquote('1:Spt:1093.0,388.0,388.2')] ).
cnf(1105,plain,
( ~ ssList(u)
| ~ equal(app(u,sk5),sk2) ),
inference(mrr,[status(thm)],[315,1094]),
[iquote('1:MRR:315.2,1094.0')] ).
cnf(1152,plain,
( ~ ssList(sk1)
| ~ equal(sk2,sk2) ),
inference(spl,[status(thm),theory(equality)],[212,1105]),
[iquote('1:SpL:212.0,1105.1')] ).
cnf(1155,plain,
~ ssList(sk1),
inference(obv,[status(thm),theory(equality)],[1152]),
[iquote('1:Obv:1152.1')] ).
cnf(1156,plain,
$false,
inference(ssi,[status(thm)],[1155,199,1]),
[iquote('1:SSi:1155.0,199.0,1.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SWC043-1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n027.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 06:18:15 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.51/0.72
% 0.51/0.72 SPASS V 3.9
% 0.51/0.72 SPASS beiseite: Proof found.
% 0.51/0.72 % SZS status Theorem
% 0.51/0.72 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.51/0.72 SPASS derived 749 clauses, backtracked 164 clauses, performed 7 splits and kept 804 clauses.
% 0.51/0.72 SPASS allocated 76953 KBytes.
% 0.51/0.72 SPASS spent 0:00:00.37 on the problem.
% 0.51/0.72 0:00:00.04 for the input.
% 0.51/0.72 0:00:00.00 for the FLOTTER CNF translation.
% 0.51/0.72 0:00:00.00 for inferences.
% 0.51/0.72 0:00:00.01 for the backtracking.
% 0.51/0.72 0:00:00.17 for the reduction.
% 0.51/0.72
% 0.51/0.72
% 0.51/0.72 Here is a proof with depth 2, length 30 :
% 0.51/0.72 % SZS output start Refutation
% See solution above
% 0.51/0.72 Formulae used in the proof : co1_1 co1_5 co1_6 co1_7 co1_8 co1_9 co1_10 co1_11 clause73 clause119 clause123
% 0.51/0.72
%------------------------------------------------------------------------------