TSTP Solution File: SWC104+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC104+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n008.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:45 EDT 2022
% Result : Theorem 6.15s 6.31s
% Output : Refutation 6.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 23
% Syntax : Number of clauses : 50 ( 27 unt; 3 nHn; 50 RR)
% Number of literals : 95 ( 0 equ; 55 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 14 ( 13 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
ssList(skc7),
file('SWC104+1.p',unknown),
[] ).
cnf(2,axiom,
ssList(skc6),
file('SWC104+1.p',unknown),
[] ).
cnf(3,axiom,
ssList(skc5),
file('SWC104+1.p',unknown),
[] ).
cnf(4,axiom,
totalorderedP(skc5),
file('SWC104+1.p',unknown),
[] ).
cnf(7,axiom,
ssList(nil),
file('SWC104+1.p',unknown),
[] ).
cnf(8,axiom,
cyclefreeP(nil),
file('SWC104+1.p',unknown),
[] ).
cnf(9,axiom,
totalorderP(nil),
file('SWC104+1.p',unknown),
[] ).
cnf(10,axiom,
strictorderP(nil),
file('SWC104+1.p',unknown),
[] ).
cnf(11,axiom,
totalorderedP(nil),
file('SWC104+1.p',unknown),
[] ).
cnf(12,axiom,
strictorderedP(nil),
file('SWC104+1.p',unknown),
[] ).
cnf(13,axiom,
duplicatefreeP(nil),
file('SWC104+1.p',unknown),
[] ).
cnf(14,axiom,
equalelemsP(nil),
file('SWC104+1.p',unknown),
[] ).
cnf(15,axiom,
neq(skc6,nil),
file('SWC104+1.p',unknown),
[] ).
cnf(61,axiom,
equal(app(skc5,skc7),skc6),
file('SWC104+1.p',unknown),
[] ).
cnf(63,axiom,
( ~ ssList(u)
| frontsegP(u,u) ),
file('SWC104+1.p',unknown),
[] ).
cnf(70,axiom,
( ~ equal(skc5,nil)
| equal(skc6,nil) ),
file('SWC104+1.p',unknown),
[] ).
cnf(80,axiom,
( ~ frontsegP(skc6,skc5)
| ~ neq(skc5,nil) ),
file('SWC104+1.p',unknown),
[] ).
cnf(92,axiom,
( ~ ssList(u)
| ~ frontsegP(nil,u)
| equal(nil,u) ),
file('SWC104+1.p',unknown),
[] ).
cnf(93,axiom,
( ~ ssList(u)
| ~ equal(nil,u)
| frontsegP(nil,u) ),
file('SWC104+1.p',unknown),
[] ).
cnf(107,axiom,
( ~ ssList(u)
| ~ ssList(v)
| neq(v,u)
| equal(v,u) ),
file('SWC104+1.p',unknown),
[] ).
cnf(129,axiom,
( ~ ssList(u)
| ~ ssList(v)
| ~ equal(app(v,u),nil)
| equal(nil,v) ),
file('SWC104+1.p',unknown),
[] ).
cnf(149,axiom,
( ~ ssList(u)
| ~ ssList(v)
| ~ ssList(w)
| ~ frontsegP(w,v)
| frontsegP(app(w,u),v) ),
file('SWC104+1.p',unknown),
[] ).
cnf(152,axiom,
( ~ ssList(u)
| ~ ssItem(v)
| ~ strictorderedP(cons(v,u))
| lt(v,hd(u))
| equal(nil,u) ),
file('SWC104+1.p',unknown),
[] ).
cnf(249,plain,
( ~ ssList(u)
| ~ equal(app(skc5,u),nil)
| equal(skc5,nil) ),
inference(res,[status(thm),theory(equality)],[3,129]),
[iquote('0:Res:3.0,129.0')] ).
cnf(271,plain,
( ~ frontsegP(nil,skc5)
| equal(skc5,nil) ),
inference(res,[status(thm),theory(equality)],[3,92]),
[iquote('0:Res:3.0,92.0')] ).
cnf(272,plain,
( ~ equal(skc5,nil)
| frontsegP(nil,skc5) ),
inference(res,[status(thm),theory(equality)],[3,93]),
[iquote('0:Res:3.0,93.0')] ).
cnf(281,plain,
frontsegP(skc5,skc5),
inference(res,[status(thm),theory(equality)],[3,63]),
[iquote('0:Res:3.0,63.0')] ).
cnf(484,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(561,plain,
equal(skc6,nil),
inference(spt,[spt(split,[position(s1)])],[484]),
[iquote('1:Spt:484.3')] ).
cnf(672,plain,
neq(nil,nil),
inference(rew,[status(thm),theory(equality)],[561,15]),
[iquote('1:Rew:561.0,15.0')] ).
cnf(675,plain,
equal(app(skc5,skc7),nil),
inference(rew,[status(thm),theory(equality)],[561,61]),
[iquote('1:Rew:561.0,61.0')] ).
cnf(676,plain,
( ~ frontsegP(nil,skc5)
| ~ neq(skc5,nil) ),
inference(rew,[status(thm),theory(equality)],[561,80]),
[iquote('1:Rew:561.0,80.0')] ).
cnf(734,plain,
( ~ frontsegP(nil,skc5)
| ~ neq(nil,nil) ),
inference(rew,[status(thm),theory(equality)],[271,676]),
[iquote('1:Rew:271.1,676.1')] ).
cnf(735,plain,
~ frontsegP(nil,skc5),
inference(mrr,[status(thm)],[734,672]),
[iquote('1:MRR:734.1,672.0')] ).
cnf(736,plain,
~ equal(skc5,nil),
inference(mrr,[status(thm)],[272,735]),
[iquote('1:MRR:272.1,735.0')] ).
cnf(744,plain,
( ~ ssList(u)
| ~ equal(app(skc5,u),nil) ),
inference(mrr,[status(thm)],[249,736]),
[iquote('1:MRR:249.2,736.0')] ).
cnf(899,plain,
( ~ ssList(skc7)
| ~ equal(nil,nil) ),
inference(spl,[status(thm),theory(equality)],[675,744]),
[iquote('1:SpL:675.0,744.1')] ).
cnf(902,plain,
~ ssList(skc7),
inference(obv,[status(thm),theory(equality)],[899]),
[iquote('1:Obv:899.1')] ).
cnf(903,plain,
$false,
inference(ssi,[status(thm)],[902,1]),
[iquote('1:SSi:902.0,1.0')] ).
cnf(904,plain,
~ equal(skc6,nil),
inference(spt,[spt(split,[position(sa)])],[903,561]),
[iquote('1:Spt:903.0,484.3,561.0')] ).
cnf(905,plain,
( ~ ssItem(u)
| ~ strictorderedP(cons(u,skc6))
| lt(u,hd(skc6)) ),
inference(spt,[spt(split,[position(s2)])],[484]),
[iquote('1:Spt:903.0,484.0,484.1,484.2')] ).
cnf(911,plain,
~ equal(skc5,nil),
inference(mrr,[status(thm)],[70,904]),
[iquote('1:MRR:70.1,904.0')] ).
cnf(3106,plain,
( ~ ssList(skc7)
| ~ ssList(u)
| ~ ssList(skc5)
| ~ frontsegP(skc5,u)
| frontsegP(skc6,u) ),
inference(spr,[status(thm),theory(equality)],[61,149]),
[iquote('0:SpR:61.0,149.4')] ).
cnf(9354,plain,
( ~ ssList(u)
| ~ frontsegP(skc5,u)
| frontsegP(skc6,u) ),
inference(ssi,[status(thm)],[3106,4,3,1]),
[iquote('0:SSi:3106.2,3106.0,4.0,3.0,1.0')] ).
cnf(10183,plain,
( ~ ssList(skc5)
| ~ frontsegP(skc5,skc5)
| ~ neq(skc5,nil) ),
inference(res,[status(thm),theory(equality)],[9354,80]),
[iquote('0:Res:9354.2,80.0')] ).
cnf(10438,plain,
( ~ frontsegP(skc5,skc5)
| ~ neq(skc5,nil) ),
inference(ssi,[status(thm)],[10183,4,3]),
[iquote('0:SSi:10183.0,4.0,3.0')] ).
cnf(10439,plain,
~ neq(skc5,nil),
inference(mrr,[status(thm)],[10438,281]),
[iquote('0:MRR:10438.0,281.0')] ).
cnf(10483,plain,
( ~ ssList(nil)
| ~ ssList(skc5)
| equal(skc5,nil) ),
inference(res,[status(thm),theory(equality)],[107,10439]),
[iquote('0:Res:107.2,10439.0')] ).
cnf(10487,plain,
equal(skc5,nil),
inference(ssi,[status(thm)],[10483,4,3,14,13,9,10,8,11,12,7]),
[iquote('0:SSi:10483.1,10483.0,4.0,3.0,14.0,13.0,9.0,10.0,8.0,11.0,12.0,7.0')] ).
cnf(10488,plain,
$false,
inference(mrr,[status(thm)],[10487,911]),
[iquote('1:MRR:10487.0,911.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC104+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n008.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jun 12 22:25:37 EDT 2022
% 0.13/0.34 % CPUTime :
% 6.15/6.31
% 6.15/6.31 SPASS V 3.9
% 6.15/6.31 SPASS beiseite: Proof found.
% 6.15/6.31 % SZS status Theorem
% 6.15/6.31 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.15/6.31 SPASS derived 6424 clauses, backtracked 2187 clauses, performed 51 splits and kept 4332 clauses.
% 6.15/6.31 SPASS allocated 107040 KBytes.
% 6.15/6.31 SPASS spent 0:00:05.68 on the problem.
% 6.15/6.31 0:00:00.04 for the input.
% 6.15/6.31 0:00:00.07 for the FLOTTER CNF translation.
% 6.15/6.31 0:00:00.08 for inferences.
% 6.15/6.31 0:00:00.08 for the backtracking.
% 6.15/6.31 0:00:05.22 for the reduction.
% 6.15/6.31
% 6.15/6.31
% 6.15/6.31 Here is a proof with depth 3, length 50 :
% 6.15/6.31 % SZS output start Refutation
% See solution above
% 6.15/6.31 Formulae used in the proof : co1 ax17 ax60 ax62 ax64 ax66 ax69 ax72 ax74 ax42 ax46 ax15 ax83 ax43 ax70
% 6.15/6.31
%------------------------------------------------------------------------------