TSTP Solution File: SWC127+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC127+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n026.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:54 EDT 2022
% Result : Theorem 0.81s 1.00s
% Output : Refutation 0.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 16
% Syntax : Number of clauses : 28 ( 20 unt; 5 nHn; 28 RR)
% Number of literals : 51 ( 0 equ; 20 neg)
% Maximal clause size : 7 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 13 ( 12 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(2,axiom,
ssList(skc4),
file('SWC127+1.p',unknown),
[] ).
cnf(5,axiom,
ssList(nil),
file('SWC127+1.p',unknown),
[] ).
cnf(6,axiom,
cyclefreeP(nil),
file('SWC127+1.p',unknown),
[] ).
cnf(7,axiom,
totalorderP(nil),
file('SWC127+1.p',unknown),
[] ).
cnf(8,axiom,
strictorderP(nil),
file('SWC127+1.p',unknown),
[] ).
cnf(9,axiom,
totalorderedP(nil),
file('SWC127+1.p',unknown),
[] ).
cnf(10,axiom,
strictorderedP(nil),
file('SWC127+1.p',unknown),
[] ).
cnf(11,axiom,
duplicatefreeP(nil),
file('SWC127+1.p',unknown),
[] ).
cnf(12,axiom,
equalelemsP(nil),
file('SWC127+1.p',unknown),
[] ).
cnf(13,axiom,
neq(skc5,nil),
file('SWC127+1.p',unknown),
[] ).
cnf(14,axiom,
segmentP(skc5,skc4),
file('SWC127+1.p',unknown),
[] ).
cnf(52,axiom,
~ singletonP(nil),
file('SWC127+1.p',unknown),
[] ).
cnf(60,axiom,
( ~ neq(skc5,nil)
| singletonP(skc4) ),
file('SWC127+1.p',unknown),
[] ).
cnf(78,axiom,
( ~ neq(skc4,nil)
| ~ segmentP(skc5,skc4) ),
file('SWC127+1.p',unknown),
[] ).
cnf(105,axiom,
( ~ ssList(u)
| ~ ssList(v)
| neq(v,u)
| equal(v,u) ),
file('SWC127+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('SWC127+1.p',unknown),
[] ).
cnf(193,plain,
singletonP(skc4),
inference(mrr,[status(thm)],[60,13]),
[iquote('0:MRR:60.0,13.0')] ).
cnf(194,plain,
~ neq(skc4,nil),
inference(mrr,[status(thm)],[78,14]),
[iquote('0:MRR:78.1,14.0')] ).
cnf(250,plain,
( ~ ssList(u)
| neq(skc4,u)
| equal(skc4,u) ),
inference(res,[status(thm),theory(equality)],[2,105]),
[iquote('0:Res:2.0,105.0')] ).
cnf(283,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,184]),
[iquote('0:Res:2.0,184.1')] ).
cnf(551,plain,
equal(skc4,nil),
inference(spt,[spt(split,[position(s1)])],[283]),
[iquote('1:Spt:283.5')] ).
cnf(654,plain,
singletonP(nil),
inference(rew,[status(thm),theory(equality)],[551,193]),
[iquote('1:Rew:551.0,193.0')] ).
cnf(704,plain,
$false,
inference(mrr,[status(thm)],[654,52]),
[iquote('1:MRR:654.0,52.0')] ).
cnf(807,plain,
~ equal(skc4,nil),
inference(spt,[spt(split,[position(sa)])],[704,551]),
[iquote('1:Spt:704.0,283.5,551.0')] ).
cnf(808,plain,
( ~ ssList(u)
| ~ equal(tl(skc4),tl(u))
| ~ equal(hd(skc4),hd(u))
| equal(nil,u)
| equal(skc4,u) ),
inference(spt,[spt(split,[position(s2)])],[283]),
[iquote('1:Spt:704.0,283.0,283.1,283.2,283.3,283.4')] ).
cnf(1187,plain,
( ~ ssList(nil)
| equal(skc4,nil) ),
inference(res,[status(thm),theory(equality)],[250,194]),
[iquote('0:Res:250.1,194.0')] ).
cnf(1188,plain,
equal(skc4,nil),
inference(ssi,[status(thm)],[1187,12,11,8,7,6,10,9,5]),
[iquote('0:SSi:1187.0,12.0,11.0,8.0,7.0,6.0,10.0,9.0,5.0')] ).
cnf(1189,plain,
$false,
inference(mrr,[status(thm)],[1188,807]),
[iquote('1:MRR:1188.0,807.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.08 % Problem : SWC127+1 : TPTP v8.1.0. Released v2.4.0.
% 0.05/0.09 % Command : run_spass %d %s
% 0.09/0.29 % Computer : n026.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 600
% 0.09/0.29 % DateTime : Sun Jun 12 15:47:05 EDT 2022
% 0.09/0.29 % CPUTime :
% 0.81/1.00
% 0.81/1.00 SPASS V 3.9
% 0.81/1.00 SPASS beiseite: Proof found.
% 0.81/1.00 % SZS status Theorem
% 0.81/1.00 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.81/1.00 SPASS derived 735 clauses, backtracked 334 clauses, performed 18 splits and kept 1047 clauses.
% 0.81/1.00 SPASS allocated 98911 KBytes.
% 0.81/1.00 SPASS spent 0:00:00.70 on the problem.
% 0.81/1.00 0:00:00.03 for the input.
% 0.81/1.00 0:00:00.06 for the FLOTTER CNF translation.
% 0.81/1.00 0:00:00.00 for inferences.
% 0.81/1.00 0:00:00.01 for the backtracking.
% 0.81/1.00 0:00:00.39 for the reduction.
% 0.81/1.00
% 0.81/1.00
% 0.81/1.00 Here is a proof with depth 2, length 28 :
% 0.81/1.00 % SZS output start Refutation
% See solution above
% 0.81/1.00 Formulae used in the proof : co1 ax17 ax60 ax62 ax64 ax66 ax69 ax72 ax74 ax39 ax15 ax77
% 0.81/1.00
%------------------------------------------------------------------------------