TSTP Solution File: SWC206+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC206+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n017.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:28 EDT 2022
% Result : Theorem 0.80s 0.98s
% Output : Refutation 0.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 19
% Syntax : Number of clauses : 47 ( 31 unt; 7 nHn; 47 RR)
% Number of literals : 88 ( 0 equ; 36 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 : 8 ( 8 usr; 6 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
ssList(skc7),
file('SWC206+1.p',unknown),
[] ).
cnf(2,axiom,
ssList(skc6),
file('SWC206+1.p',unknown),
[] ).
cnf(3,axiom,
ssList(skc5),
file('SWC206+1.p',unknown),
[] ).
cnf(6,axiom,
ssList(nil),
file('SWC206+1.p',unknown),
[] ).
cnf(7,axiom,
cyclefreeP(nil),
file('SWC206+1.p',unknown),
[] ).
cnf(8,axiom,
totalorderP(nil),
file('SWC206+1.p',unknown),
[] ).
cnf(9,axiom,
strictorderP(nil),
file('SWC206+1.p',unknown),
[] ).
cnf(10,axiom,
totalorderedP(nil),
file('SWC206+1.p',unknown),
[] ).
cnf(11,axiom,
strictorderedP(nil),
file('SWC206+1.p',unknown),
[] ).
cnf(12,axiom,
duplicatefreeP(nil),
file('SWC206+1.p',unknown),
[] ).
cnf(13,axiom,
equalelemsP(nil),
file('SWC206+1.p',unknown),
[] ).
cnf(14,axiom,
neq(skc6,nil),
file('SWC206+1.p',unknown),
[] ).
cnf(53,axiom,
~ neq(skc5,nil),
file('SWC206+1.p',unknown),
[] ).
cnf(69,axiom,
( ~ equal(skc6,nil)
| equal(nil,skc5) ),
file('SWC206+1.p',unknown),
[] ).
cnf(70,axiom,
( ~ neq(skc6,nil)
| neq(skc7,nil) ),
file('SWC206+1.p',unknown),
[] ).
cnf(72,axiom,
( ~ neq(skc6,nil)
| segmentP(skc5,skc7) ),
file('SWC206+1.p',unknown),
[] ).
cnf(97,axiom,
( ~ ssList(u)
| ~ segmentP(nil,u)
| equal(nil,u) ),
file('SWC206+1.p',unknown),
[] ).
cnf(108,axiom,
( ~ ssList(u)
| ~ ssList(v)
| neq(v,u)
| equal(v,u) ),
file('SWC206+1.p',unknown),
[] ).
cnf(187,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('SWC206+1.p',unknown),
[] ).
cnf(196,plain,
segmentP(skc5,skc7),
inference(mrr,[status(thm)],[72,14]),
[iquote('0:MRR:72.0,14.0')] ).
cnf(198,plain,
neq(skc7,nil),
inference(mrr,[status(thm)],[70,14]),
[iquote('0:MRR:70.0,14.0')] ).
cnf(254,plain,
( ~ ssList(u)
| neq(skc5,u)
| equal(skc5,u) ),
inference(res,[status(thm),theory(equality)],[3,108]),
[iquote('0:Res:3.0,108.0')] ).
cnf(287,plain,
( ~ ssList(u)
| ~ equal(tl(skc5),tl(u))
| ~ equal(hd(skc5),hd(u))
| equal(nil,u)
| equal(skc5,u)
| equal(nil,skc5) ),
inference(res,[status(thm),theory(equality)],[3,187]),
[iquote('0:Res:3.0,187.1')] ).
cnf(458,plain,
( ~ ssList(u)
| ~ equal(tl(skc6),tl(u))
| ~ equal(hd(skc6),hd(u))
| equal(nil,u)
| equal(skc6,u)
| equal(skc6,nil) ),
inference(res,[status(thm),theory(equality)],[2,187]),
[iquote('0:Res:2.0,187.1')] ).
cnf(561,plain,
equal(skc6,nil),
inference(spt,[spt(split,[position(s1)])],[458]),
[iquote('1:Spt:458.5')] ).
cnf(568,plain,
( ~ equal(nil,nil)
| equal(nil,skc5) ),
inference(rew,[status(thm),theory(equality)],[561,69]),
[iquote('1:Rew:561.0,69.0')] ).
cnf(672,plain,
neq(nil,nil),
inference(rew,[status(thm),theory(equality)],[561,14]),
[iquote('1:Rew:561.0,14.0')] ).
cnf(715,plain,
equal(nil,skc5),
inference(obv,[status(thm),theory(equality)],[568]),
[iquote('1:Obv:568.0')] ).
cnf(773,plain,
~ neq(skc5,skc5),
inference(rew,[status(thm),theory(equality)],[715,53]),
[iquote('1:Rew:715.0,53.0')] ).
cnf(790,plain,
neq(skc5,skc5),
inference(rew,[status(thm),theory(equality)],[715,672]),
[iquote('1:Rew:715.0,672.0')] ).
cnf(802,plain,
$false,
inference(mrr,[status(thm)],[773,790]),
[iquote('1:MRR:773.0,790.0')] ).
cnf(1026,plain,
~ equal(skc6,nil),
inference(spt,[spt(split,[position(sa)])],[802,561]),
[iquote('1:Spt:802.0,458.5,561.0')] ).
cnf(1027,plain,
( ~ ssList(u)
| ~ equal(tl(skc6),tl(u))
| ~ equal(hd(skc6),hd(u))
| equal(nil,u)
| equal(skc6,u) ),
inference(spt,[spt(split,[position(s2)])],[458]),
[iquote('1:Spt:802.0,458.0,458.1,458.2,458.3,458.4')] ).
cnf(1042,plain,
equal(nil,skc5),
inference(spt,[spt(split,[position(s2s1)])],[287]),
[iquote('2:Spt:287.5')] ).
cnf(1056,plain,
neq(skc7,skc5),
inference(rew,[status(thm),theory(equality)],[1042,198]),
[iquote('2:Rew:1042.0,198.0')] ).
cnf(1061,plain,
~ neq(skc5,skc5),
inference(rew,[status(thm),theory(equality)],[1042,53]),
[iquote('2:Rew:1042.0,53.0')] ).
cnf(1118,plain,
( ~ ssList(u)
| ~ segmentP(nil,u)
| equal(skc5,u) ),
inference(rew,[status(thm),theory(equality)],[1042,97]),
[iquote('2:Rew:1042.0,97.2')] ).
cnf(1192,plain,
( ~ ssList(u)
| ~ segmentP(skc5,u)
| equal(skc5,u) ),
inference(rew,[status(thm),theory(equality)],[1042,1118]),
[iquote('2:Rew:1042.0,1118.1')] ).
cnf(1386,plain,
( ~ ssList(skc7)
| equal(skc7,skc5) ),
inference(res,[status(thm),theory(equality)],[196,1192]),
[iquote('2:Res:196.0,1192.1')] ).
cnf(1390,plain,
equal(skc7,skc5),
inference(ssi,[status(thm)],[1386,1]),
[iquote('2:SSi:1386.0,1.0')] ).
cnf(1394,plain,
neq(skc5,skc5),
inference(rew,[status(thm),theory(equality)],[1390,1056]),
[iquote('2:Rew:1390.0,1056.0')] ).
cnf(1395,plain,
$false,
inference(mrr,[status(thm)],[1394,1061]),
[iquote('2:MRR:1394.0,1061.0')] ).
cnf(1396,plain,
~ equal(nil,skc5),
inference(spt,[spt(split,[position(s2sa)])],[1395,1042]),
[iquote('2:Spt:1395.0,287.5,1042.0')] ).
cnf(1397,plain,
( ~ ssList(u)
| ~ equal(tl(skc5),tl(u))
| ~ equal(hd(skc5),hd(u))
| equal(nil,u)
| equal(skc5,u) ),
inference(spt,[spt(split,[position(s2s2)])],[287]),
[iquote('2:Spt:1395.0,287.0,287.1,287.2,287.3,287.4')] ).
cnf(1479,plain,
( ~ ssList(nil)
| equal(nil,skc5) ),
inference(res,[status(thm),theory(equality)],[254,53]),
[iquote('0:Res:254.1,53.0')] ).
cnf(1480,plain,
equal(nil,skc5),
inference(ssi,[status(thm)],[1479,13,12,11,10,9,8,7,6]),
[iquote('0:SSi:1479.0,13.0,12.0,11.0,10.0,9.0,8.0,7.0,6.0')] ).
cnf(1481,plain,
$false,
inference(mrr,[status(thm)],[1480,1396]),
[iquote('2:MRR:1480.0,1396.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWC206+1 : TPTP v8.1.0. Released v2.4.0.
% 0.13/0.13 % Command : run_spass %d %s
% 0.15/0.35 % Computer : n017.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 600
% 0.15/0.35 % DateTime : Sat Jun 11 23:29:51 EDT 2022
% 0.15/0.35 % CPUTime :
% 0.80/0.98
% 0.80/0.98 SPASS V 3.9
% 0.80/0.98 SPASS beiseite: Proof found.
% 0.80/0.98 % SZS status Theorem
% 0.80/0.98 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.80/0.98 SPASS derived 1011 clauses, backtracked 564 clauses, performed 24 splits and kept 1388 clauses.
% 0.80/0.98 SPASS allocated 99130 KBytes.
% 0.80/0.98 SPASS spent 0:00:00.61 on the problem.
% 0.80/0.98 0:00:00.04 for the input.
% 0.80/0.98 0:00:00.07 for the FLOTTER CNF translation.
% 0.80/0.98 0:00:00.00 for inferences.
% 0.80/0.98 0:00:00.01 for the backtracking.
% 0.80/0.98 0:00:00.33 for the reduction.
% 0.80/0.98
% 0.80/0.98
% 0.80/0.98 Here is a proof with depth 2, length 47 :
% 0.80/0.98 % SZS output start Refutation
% See solution above
% 0.80/0.98 Formulae used in the proof : co1 ax17 ax60 ax62 ax64 ax66 ax69 ax72 ax74 ax58 ax15 ax77
% 0.80/0.98
%------------------------------------------------------------------------------