TSTP Solution File: SWC369+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC369+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n022.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:37 EDT 2022
% Result : Theorem 0.83s 1.00s
% Output : Refutation 0.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 16
% Syntax : Number of clauses : 31 ( 20 unt; 5 nHn; 31 RR)
% Number of literals : 58 ( 0 equ; 25 neg)
% Maximal clause size : 7 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 12 ( 11 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('SWC369+1.p',unknown),
[] ).
cnf(2,axiom,
ssList(skc4),
file('SWC369+1.p',unknown),
[] ).
cnf(5,axiom,
ssList(nil),
file('SWC369+1.p',unknown),
[] ).
cnf(6,axiom,
cyclefreeP(nil),
file('SWC369+1.p',unknown),
[] ).
cnf(7,axiom,
totalorderP(nil),
file('SWC369+1.p',unknown),
[] ).
cnf(8,axiom,
strictorderP(nil),
file('SWC369+1.p',unknown),
[] ).
cnf(9,axiom,
totalorderedP(nil),
file('SWC369+1.p',unknown),
[] ).
cnf(10,axiom,
strictorderedP(nil),
file('SWC369+1.p',unknown),
[] ).
cnf(11,axiom,
duplicatefreeP(nil),
file('SWC369+1.p',unknown),
[] ).
cnf(12,axiom,
equalelemsP(nil),
file('SWC369+1.p',unknown),
[] ).
cnf(51,axiom,
~ segmentP(skc5,skc4),
file('SWC369+1.p',unknown),
[] ).
cnf(67,axiom,
( ~ equal(skc5,nil)
| equal(nil,skc4) ),
file('SWC369+1.p',unknown),
[] ).
cnf(69,axiom,
( ~ neq(skc5,nil)
| segmentP(skc5,skc4) ),
file('SWC369+1.p',unknown),
[] ).
cnf(95,axiom,
( ~ ssList(u)
| ~ equal(nil,u)
| segmentP(nil,u) ),
file('SWC369+1.p',unknown),
[] ).
cnf(105,axiom,
( ~ ssList(u)
| ~ ssList(v)
| neq(v,u)
| equal(v,u) ),
file('SWC369+1.p',unknown),
[] ).
cnf(184,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('SWC369+1.p',unknown),
[] ).
cnf(193,plain,
~ neq(skc5,nil),
inference(mrr,[status(thm)],[69,51]),
[iquote('0:MRR:69.1,51.0')] ).
cnf(271,plain,
( ~ equal(nil,skc4)
| segmentP(nil,skc4) ),
inference(res,[status(thm),theory(equality)],[2,95]),
[iquote('0:Res:2.0,95.0')] ).
cnf(420,plain,
( ~ ssList(u)
| neq(skc5,u)
| equal(skc5,u) ),
inference(res,[status(thm),theory(equality)],[1,105]),
[iquote('0:Res:1.0,105.0')] ).
cnf(453,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,184]),
[iquote('0:Res:1.0,184.1')] ).
cnf(556,plain,
equal(skc5,nil),
inference(spt,[spt(split,[position(s1)])],[453]),
[iquote('1:Spt:453.5')] ).
cnf(563,plain,
( ~ equal(nil,nil)
| equal(nil,skc4) ),
inference(rew,[status(thm),theory(equality)],[556,67]),
[iquote('1:Rew:556.0,67.0')] ).
cnf(667,plain,
~ segmentP(nil,skc4),
inference(rew,[status(thm),theory(equality)],[556,51]),
[iquote('1:Rew:556.0,51.0')] ).
cnf(710,plain,
~ equal(nil,skc4),
inference(mrr,[status(thm)],[271,667]),
[iquote('1:MRR:271.1,667.0')] ).
cnf(724,plain,
equal(nil,skc4),
inference(obv,[status(thm),theory(equality)],[563]),
[iquote('1:Obv:563.0')] ).
cnf(725,plain,
$false,
inference(mrr,[status(thm)],[724,710]),
[iquote('1:MRR:724.0,710.0')] ).
cnf(829,plain,
~ equal(skc5,nil),
inference(spt,[spt(split,[position(sa)])],[725,556]),
[iquote('1:Spt:725.0,453.5,556.0')] ).
cnf(830,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)])],[453]),
[iquote('1:Spt:725.0,453.0,453.1,453.2,453.3,453.4')] ).
cnf(1110,plain,
( ~ ssList(nil)
| equal(skc5,nil) ),
inference(res,[status(thm),theory(equality)],[420,193]),
[iquote('0:Res:420.1,193.0')] ).
cnf(1111,plain,
equal(skc5,nil),
inference(ssi,[status(thm)],[1110,5,6,7,8,9,10,11,12]),
[iquote('0:SSi:1110.0,5.0,6.0,7.0,8.0,9.0,10.0,11.0,12.0')] ).
cnf(1112,plain,
$false,
inference(mrr,[status(thm)],[1111,829]),
[iquote('1:MRR:1111.0,829.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SWC369+1 : TPTP v8.1.0. Released v2.4.0.
% 0.08/0.14 % Command : run_spass %d %s
% 0.14/0.35 % Computer : n022.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sun Jun 12 20:20:48 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.83/1.00
% 0.83/1.00 SPASS V 3.9
% 0.83/1.00 SPASS beiseite: Proof found.
% 0.83/1.00 % SZS status Theorem
% 0.83/1.00 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.83/1.00 SPASS derived 732 clauses, backtracked 373 clauses, performed 18 splits and kept 1111 clauses.
% 0.83/1.00 SPASS allocated 98825 KBytes.
% 0.83/1.00 SPASS spent 0:00:00.63 on the problem.
% 0.83/1.00 0:00:00.04 for the input.
% 0.83/1.00 0:00:00.07 for the FLOTTER CNF translation.
% 0.83/1.00 0:00:00.00 for inferences.
% 0.83/1.00 0:00:00.01 for the backtracking.
% 0.83/1.00 0:00:00.31 for the reduction.
% 0.83/1.00
% 0.83/1.00
% 0.83/1.00 Here is a proof with depth 2, length 31 :
% 0.83/1.00 % SZS output start Refutation
% See solution above
% 0.83/1.00 Formulae used in the proof : co1 ax17 ax60 ax62 ax64 ax66 ax69 ax72 ax74 ax58 ax15 ax77
% 0.83/1.00
%------------------------------------------------------------------------------