TSTP Solution File: SWC217+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC217+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n005.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:33 EDT 2022
% Result : Theorem 0.76s 0.95s
% Output : Refutation 0.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 18
% Syntax : Number of clauses : 42 ( 27 unt; 5 nHn; 42 RR)
% Number of literals : 70 ( 0 equ; 32 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 13 ( 12 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
ssItem(skc7),
file('SWC217+1.p',unknown),
[] ).
cnf(2,axiom,
ssList(skc6),
file('SWC217+1.p',unknown),
[] ).
cnf(3,axiom,
ssList(skc5),
file('SWC217+1.p',unknown),
[] ).
cnf(6,axiom,
ssList(nil),
file('SWC217+1.p',unknown),
[] ).
cnf(7,axiom,
cyclefreeP(nil),
file('SWC217+1.p',unknown),
[] ).
cnf(8,axiom,
totalorderP(nil),
file('SWC217+1.p',unknown),
[] ).
cnf(9,axiom,
strictorderP(nil),
file('SWC217+1.p',unknown),
[] ).
cnf(10,axiom,
totalorderedP(nil),
file('SWC217+1.p',unknown),
[] ).
cnf(11,axiom,
strictorderedP(nil),
file('SWC217+1.p',unknown),
[] ).
cnf(12,axiom,
duplicatefreeP(nil),
file('SWC217+1.p',unknown),
[] ).
cnf(13,axiom,
equalelemsP(nil),
file('SWC217+1.p',unknown),
[] ).
cnf(14,axiom,
neq(skc6,nil),
file('SWC217+1.p',unknown),
[] ).
cnf(53,axiom,
~ neq(skc5,nil),
file('SWC217+1.p',unknown),
[] ).
cnf(69,axiom,
( ~ equal(skc6,nil)
| equal(skc5,nil) ),
file('SWC217+1.p',unknown),
[] ).
cnf(82,axiom,
( ~ neq(skc6,nil)
| equal(cons(skc7,nil),skc5) ),
file('SWC217+1.p',unknown),
[] ).
cnf(107,axiom,
( ~ ssList(u)
| ~ ssList(v)
| neq(v,u)
| equal(v,u) ),
file('SWC217+1.p',unknown),
[] ).
cnf(109,axiom,
( ~ ssItem(u)
| ~ ssList(v)
| ~ equal(cons(u,v),nil) ),
file('SWC217+1.p',unknown),
[] ).
cnf(152,axiom,
( ~ ssList(u)
| ~ ssItem(v)
| ~ strictorderedP(cons(v,u))
| lt(v,hd(u))
| equal(nil,u) ),
file('SWC217+1.p',unknown),
[] ).
cnf(196,plain,
equal(cons(skc7,nil),skc5),
inference(mrr,[status(thm)],[82,14]),
[iquote('0:MRR:82.0,14.0')] ).
cnf(252,plain,
( ~ ssList(u)
| neq(skc5,u)
| equal(skc5,u) ),
inference(res,[status(thm),theory(equality)],[3,107]),
[iquote('0:Res:3.0,107.0')] ).
cnf(254,plain,
( ~ ssItem(u)
| ~ equal(cons(u,skc5),nil) ),
inference(res,[status(thm),theory(equality)],[3,109]),
[iquote('0:Res:3.0,109.0')] ).
cnf(308,plain,
( ~ ssItem(u)
| ~ strictorderedP(cons(u,skc5))
| lt(u,hd(skc5))
| equal(skc5,nil) ),
inference(res,[status(thm),theory(equality)],[3,152]),
[iquote('0:Res:3.0,152.1')] ).
cnf(479,plain,
( ~ ssItem(u)
| ~ strictorderedP(cons(u,skc6))
| lt(u,hd(skc6))
| equal(skc6,nil) ),
inference(res,[status(thm),theory(equality)],[2,152]),
[iquote('0:Res:2.0,152.1')] ).
cnf(552,plain,
equal(skc6,nil),
inference(spt,[spt(split,[position(s1)])],[479]),
[iquote('1:Spt:479.3')] ).
cnf(559,plain,
( ~ equal(nil,nil)
| equal(skc5,nil) ),
inference(rew,[status(thm),theory(equality)],[552,69]),
[iquote('1:Rew:552.0,69.0')] ).
cnf(663,plain,
neq(nil,nil),
inference(rew,[status(thm),theory(equality)],[552,14]),
[iquote('1:Rew:552.0,14.0')] ).
cnf(706,plain,
equal(skc5,nil),
inference(obv,[status(thm),theory(equality)],[559]),
[iquote('1:Obv:559.0')] ).
cnf(816,plain,
~ neq(nil,nil),
inference(rew,[status(thm),theory(equality)],[706,53]),
[iquote('1:Rew:706.0,53.0')] ).
cnf(859,plain,
$false,
inference(mrr,[status(thm)],[816,663]),
[iquote('1:MRR:816.0,663.0')] ).
cnf(1054,plain,
~ equal(skc6,nil),
inference(spt,[spt(split,[position(sa)])],[859,552]),
[iquote('1:Spt:859.0,479.3,552.0')] ).
cnf(1055,plain,
( ~ ssItem(u)
| ~ strictorderedP(cons(u,skc6))
| lt(u,hd(skc6)) ),
inference(spt,[spt(split,[position(s2)])],[479]),
[iquote('1:Spt:859.0,479.0,479.1,479.2')] ).
cnf(1069,plain,
equal(skc5,nil),
inference(spt,[spt(split,[position(s2s1)])],[308]),
[iquote('2:Spt:308.3')] ).
cnf(1078,plain,
equal(cons(skc7,nil),nil),
inference(rew,[status(thm),theory(equality)],[1069,196]),
[iquote('2:Rew:1069.0,196.0')] ).
cnf(1110,plain,
( ~ ssItem(u)
| ~ equal(cons(u,nil),nil) ),
inference(rew,[status(thm),theory(equality)],[1069,254]),
[iquote('2:Rew:1069.0,254.1')] ).
cnf(1384,plain,
( ~ ssItem(skc7)
| ~ equal(nil,nil) ),
inference(spl,[status(thm),theory(equality)],[1078,1110]),
[iquote('2:SpL:1078.0,1110.1')] ).
cnf(1385,plain,
~ ssItem(skc7),
inference(obv,[status(thm),theory(equality)],[1384]),
[iquote('2:Obv:1384.1')] ).
cnf(1386,plain,
$false,
inference(ssi,[status(thm)],[1385,1]),
[iquote('2:SSi:1385.0,1.0')] ).
cnf(1387,plain,
~ equal(skc5,nil),
inference(spt,[spt(split,[position(s2sa)])],[1386,1069]),
[iquote('2:Spt:1386.0,308.3,1069.0')] ).
cnf(1388,plain,
( ~ ssItem(u)
| ~ strictorderedP(cons(u,skc5))
| lt(u,hd(skc5)) ),
inference(spt,[spt(split,[position(s2s2)])],[308]),
[iquote('2:Spt:1386.0,308.0,308.1,308.2')] ).
cnf(1463,plain,
( ~ ssList(nil)
| equal(skc5,nil) ),
inference(res,[status(thm),theory(equality)],[252,53]),
[iquote('0:Res:252.1,53.0')] ).
cnf(1464,plain,
equal(skc5,nil),
inference(ssi,[status(thm)],[1463,13,12,9,8,7,11,10,6]),
[iquote('0:SSi:1463.0,13.0,12.0,9.0,8.0,7.0,11.0,10.0,6.0')] ).
cnf(1465,plain,
$false,
inference(mrr,[status(thm)],[1464,1387]),
[iquote('2:MRR:1464.0,1387.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC217+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.12 % Command : run_spass %d %s
% 0.13/0.33 % Computer : n005.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sat Jun 11 23:24:24 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.76/0.95
% 0.76/0.95 SPASS V 3.9
% 0.76/0.95 SPASS beiseite: Proof found.
% 0.76/0.95 % SZS status Theorem
% 0.76/0.95 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.76/0.95 SPASS derived 928 clauses, backtracked 527 clauses, performed 23 splits and kept 1268 clauses.
% 0.76/0.95 SPASS allocated 99101 KBytes.
% 0.76/0.95 SPASS spent 0:00:00.60 on the problem.
% 0.76/0.95 0:00:00.04 for the input.
% 0.76/0.95 0:00:00.07 for the FLOTTER CNF translation.
% 0.76/0.95 0:00:00.00 for inferences.
% 0.76/0.95 0:00:00.00 for the backtracking.
% 0.76/0.95 0:00:00.34 for the reduction.
% 0.76/0.95
% 0.76/0.95
% 0.76/0.95 Here is a proof with depth 2, length 42 :
% 0.76/0.95 % SZS output start Refutation
% See solution above
% 0.76/0.95 Formulae used in the proof : co1 ax2 ax17 ax60 ax62 ax64 ax66 ax69 ax72 ax74 ax15 ax21 ax70
% 0.76/0.95
%------------------------------------------------------------------------------