%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC358+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n016.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:03:33 EDT 2022
% Result : Theorem 0.70s 0.92s
% Output : Refutation 0.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 28 ( 18 unt; 6 nHn; 28 RR)
% Number of literals : 58 ( 0 equ; 29 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
ssList(skc5),
file('SWC358+1.p',unknown),
[] ).
cnf(2,axiom,
ssList(skc4),
file('SWC358+1.p',unknown),
[] ).
cnf(52,axiom,
~ segmentP(skc5,skc4),
file('SWC358+1.p',unknown),
[] ).
cnf(61,axiom,
( skP0(u,v)
| equal(nil,u) ),
file('SWC358+1.p',unknown),
[] ).
cnf(68,axiom,
( ~ ssList(u)
| segmentP(u,nil) ),
file('SWC358+1.p',unknown),
[] ).
cnf(71,axiom,
( ~ skP0(skc4,skc5)
| segmentP(skc5,skc4) ),
file('SWC358+1.p',unknown),
[] ).
cnf(97,axiom,
( ~ ssList(u)
| ~ equal(nil,u)
| segmentP(nil,u) ),
file('SWC358+1.p',unknown),
[] ).
cnf(186,axiom,
( ~ ssList(u)
| ~ ssList(v)
| ~ equal(tl(u),tl(v))
| ~ equal(hd(u),hd(v))
| equal(u,v)
| equal(nil,v)
| equal(nil,u) ),
file('SWC358+1.p',unknown),
[] ).
cnf(195,plain,
~ skP0(skc4,skc5),
inference(mrr,[status(thm)],[71,52]),
[iquote('0:MRR:71.1,52.0')] ).
cnf(273,plain,
( ~ equal(skc4,nil)
| segmentP(nil,skc4) ),
inference(res,[status(thm),theory(equality)],[2,97]),
[iquote('0:Res:2.0,97.0')] ).
cnf(284,plain,
( ~ ssList(u)
| ~ equal(tl(skc4),tl(u))
| ~ equal(hd(skc4),hd(u))
| equal(nil,u)
| equal(skc4,u)
| equal(skc4,nil) ),
inference(res,[status(thm),theory(equality)],[2,186]),
[iquote('0:Res:2.0,186.1')] ).
cnf(454,plain,
segmentP(skc5,nil),
inference(res,[status(thm),theory(equality)],[1,68]),
[iquote('0:Res:1.0,68.0')] ).
cnf(455,plain,
( ~ ssList(u)
| ~ equal(tl(skc5),tl(u))
| ~ equal(hd(skc5),hd(u))
| equal(nil,u)
| equal(skc5,u)
| equal(skc5,nil) ),
inference(res,[status(thm),theory(equality)],[1,186]),
[iquote('0:Res:1.0,186.1')] ).
cnf(551,plain,
equal(skc5,nil),
inference(spt,[spt(split,[position(s1)])],[455]),
[iquote('1:Spt:455.5')] ).
cnf(662,plain,
~ segmentP(nil,skc4),
inference(rew,[status(thm),theory(equality)],[551,52]),
[iquote('1:Rew:551.0,52.0')] ).
cnf(663,plain,
~ skP0(skc4,nil),
inference(rew,[status(thm),theory(equality)],[551,195]),
[iquote('1:Rew:551.0,195.0')] ).
cnf(705,plain,
~ equal(skc4,nil),
inference(mrr,[status(thm)],[273,662]),
[iquote('1:MRR:273.1,662.0')] ).
cnf(838,plain,
equal(skc4,nil),
inference(res,[status(thm),theory(equality)],[61,663]),
[iquote('1:Res:61.0,663.0')] ).
cnf(839,plain,
$false,
inference(mrr,[status(thm)],[838,705]),
[iquote('1:MRR:838.0,705.0')] ).
cnf(840,plain,
~ equal(skc5,nil),
inference(spt,[spt(split,[position(sa)])],[839,551]),
[iquote('1:Spt:839.0,455.5,551.0')] ).
cnf(841,plain,
( ~ ssList(u)
| ~ equal(tl(skc5),tl(u))
| ~ equal(hd(skc5),hd(u))
| equal(nil,u)
| equal(skc5,u) ),
inference(spt,[spt(split,[position(s2)])],[455]),
[iquote('1:Spt:839.0,455.0,455.1,455.2,455.3,455.4')] ).
cnf(856,plain,
equal(skc4,nil),
inference(spt,[spt(split,[position(s2s1)])],[284]),
[iquote('2:Spt:284.5')] ).
cnf(992,plain,
~ segmentP(skc5,nil),
inference(rew,[status(thm),theory(equality)],[856,52]),
[iquote('2:Rew:856.0,52.0')] ).
cnf(1009,plain,
$false,
inference(mrr,[status(thm)],[992,454]),
[iquote('2:MRR:992.0,454.0')] ).
cnf(1105,plain,
~ equal(skc4,nil),
inference(spt,[spt(split,[position(s2sa)])],[1009,856]),
[iquote('2:Spt:1009.0,284.5,856.0')] ).
cnf(1106,plain,
( ~ ssList(u)
| ~ equal(tl(skc4),tl(u))
| ~ equal(hd(skc4),hd(u))
| equal(nil,u)
| equal(skc4,u) ),
inference(spt,[spt(split,[position(s2s2)])],[284]),
[iquote('2:Spt:1009.0,284.0,284.1,284.2,284.3,284.4')] ).
cnf(1143,plain,
equal(skc4,nil),
inference(res,[status(thm),theory(equality)],[61,195]),
[iquote('0:Res:61.0,195.0')] ).
cnf(1144,plain,
$false,
inference(mrr,[status(thm)],[1143,1105]),
[iquote('2:MRR:1143.0,1105.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SWC358+1 : TPTP v8.1.0. Released v2.4.0.
% 0.04/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n016.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 09:13:42 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.70/0.92
% 0.70/0.92 SPASS V 3.9
% 0.70/0.92 SPASS beiseite: Proof found.
% 0.70/0.92 % SZS status Theorem
% 0.70/0.92 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.70/0.92 SPASS derived 713 clauses, backtracked 378 clauses, performed 21 splits and kept 1110 clauses.
% 0.70/0.92 SPASS allocated 98927 KBytes.
% 0.70/0.92 SPASS spent 0:00:00.57 on the problem.
% 0.70/0.92 0:00:00.04 for the input.
% 0.70/0.92 0:00:00.07 for the FLOTTER CNF translation.
% 0.70/0.92 0:00:00.00 for inferences.
% 0.70/0.92 0:00:00.01 for the backtracking.
% 0.70/0.92 0:00:00.30 for the reduction.
% 0.70/0.92
% 0.70/0.92
% 0.70/0.92 Here is a proof with depth 2, length 28 :
% 0.70/0.92 % SZS output start Refutation
% See solution above
% 0.70/0.92 Formulae used in the proof : co1 ax57 ax58 ax77
% 0.70/0.92
%------------------------------------------------------------------------------