TSTP Solution File: SWC275+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC275+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:02:59 EDT 2022
% Result : Theorem 0.77s 0.97s
% Output : Refutation 0.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 16
% Syntax : Number of clauses : 31 ( 19 unt; 5 nHn; 31 RR)
% Number of literals : 59 ( 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 : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
ssItem(skc7),
file('SWC275+1.p',unknown),
[] ).
cnf(2,axiom,
ssList(skc6),
file('SWC275+1.p',unknown),
[] ).
cnf(6,axiom,
ssList(nil),
file('SWC275+1.p',unknown),
[] ).
cnf(7,axiom,
cyclefreeP(nil),
file('SWC275+1.p',unknown),
[] ).
cnf(8,axiom,
totalorderP(nil),
file('SWC275+1.p',unknown),
[] ).
cnf(9,axiom,
strictorderP(nil),
file('SWC275+1.p',unknown),
[] ).
cnf(10,axiom,
totalorderedP(nil),
file('SWC275+1.p',unknown),
[] ).
cnf(11,axiom,
strictorderedP(nil),
file('SWC275+1.p',unknown),
[] ).
cnf(12,axiom,
duplicatefreeP(nil),
file('SWC275+1.p',unknown),
[] ).
cnf(13,axiom,
equalelemsP(nil),
file('SWC275+1.p',unknown),
[] ).
cnf(14,axiom,
~ totalorderedP(skc5),
file('SWC275+1.p',unknown),
[] ).
cnf(68,axiom,
( ~ equal(skc6,nil)
| equal(skc5,nil) ),
file('SWC275+1.p',unknown),
[] ).
cnf(74,axiom,
( ~ ssItem(u)
| totalorderedP(cons(u,nil)) ),
file('SWC275+1.p',unknown),
[] ).
cnf(81,axiom,
( ~ neq(skc6,nil)
| equal(cons(skc7,nil),skc5) ),
file('SWC275+1.p',unknown),
[] ).
cnf(106,axiom,
( ~ ssList(u)
| ~ ssList(v)
| neq(v,u)
| equal(v,u) ),
file('SWC275+1.p',unknown),
[] ).
cnf(185,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('SWC275+1.p',unknown),
[] ).
cnf(420,plain,
( ~ ssList(u)
| neq(skc6,u)
| equal(skc6,u) ),
inference(res,[status(thm),theory(equality)],[2,106]),
[iquote('0:Res:2.0,106.0')] ).
cnf(453,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,185]),
[iquote('0:Res:2.0,185.1')] ).
cnf(552,plain,
equal(skc6,nil),
inference(spt,[spt(split,[position(s1)])],[453]),
[iquote('1:Spt:453.5')] ).
cnf(561,plain,
( ~ equal(nil,nil)
| equal(skc5,nil) ),
inference(rew,[status(thm),theory(equality)],[552,68]),
[iquote('1:Rew:552.0,68.0')] ).
cnf(707,plain,
equal(skc5,nil),
inference(obv,[status(thm),theory(equality)],[561]),
[iquote('1:Obv:561.0')] ).
cnf(710,plain,
~ totalorderedP(nil),
inference(rew,[status(thm),theory(equality)],[707,14]),
[iquote('1:Rew:707.0,14.0')] ).
cnf(859,plain,
$false,
inference(mrr,[status(thm)],[710,10]),
[iquote('1:MRR:710.0,10.0')] ).
cnf(1053,plain,
~ equal(skc6,nil),
inference(spt,[spt(split,[position(sa)])],[859,552]),
[iquote('1:Spt:859.0,453.5,552.0')] ).
cnf(1054,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)])],[453]),
[iquote('1:Spt:859.0,453.0,453.1,453.2,453.3,453.4')] ).
cnf(1389,plain,
( ~ ssItem(skc7)
| ~ neq(skc6,nil)
| totalorderedP(skc5) ),
inference(spr,[status(thm),theory(equality)],[81,74]),
[iquote('0:SpR:81.1,74.1')] ).
cnf(1393,plain,
( ~ neq(skc6,nil)
| totalorderedP(skc5) ),
inference(ssi,[status(thm)],[1389,1]),
[iquote('0:SSi:1389.0,1.0')] ).
cnf(1394,plain,
~ neq(skc6,nil),
inference(mrr,[status(thm)],[1393,14]),
[iquote('0:MRR:1393.1,14.0')] ).
cnf(1418,plain,
( ~ ssList(nil)
| equal(skc6,nil) ),
inference(res,[status(thm),theory(equality)],[420,1394]),
[iquote('0:Res:420.1,1394.0')] ).
cnf(1419,plain,
equal(skc6,nil),
inference(ssi,[status(thm)],[1418,13,12,9,8,7,10,11,6]),
[iquote('0:SSi:1418.0,13.0,12.0,9.0,8.0,7.0,10.0,11.0,6.0')] ).
cnf(1420,plain,
$false,
inference(mrr,[status(thm)],[1419,1053]),
[iquote('1:MRR:1419.0,1053.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SWC275+1 : TPTP v8.1.0. Released v2.4.0.
% 0.08/0.15 % Command : run_spass %d %s
% 0.15/0.36 % Computer : n008.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Sun Jun 12 01:06:37 EDT 2022
% 0.15/0.37 % CPUTime :
% 0.77/0.97
% 0.77/0.97 SPASS V 3.9
% 0.77/0.97 SPASS beiseite: Proof found.
% 0.77/0.97 % SZS status Theorem
% 0.77/0.97 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.77/0.97 SPASS derived 880 clauses, backtracked 498 clauses, performed 17 splits and kept 1220 clauses.
% 0.77/0.97 SPASS allocated 99078 KBytes.
% 0.77/0.97 SPASS spent 0:00:00.58 on the problem.
% 0.77/0.97 0:00:00.04 for the input.
% 0.77/0.97 0:00:00.07 for the FLOTTER CNF translation.
% 0.77/0.97 0:00:00.00 for inferences.
% 0.77/0.97 0:00:00.00 for the backtracking.
% 0.77/0.97 0:00:00.31 for the reduction.
% 0.77/0.97
% 0.77/0.97
% 0.77/0.97 Here is a proof with depth 2, length 31 :
% 0.77/0.97 % SZS output start Refutation
% See solution above
% 0.77/0.97 Formulae used in the proof : co1 ax2 ax17 ax60 ax62 ax64 ax66 ax69 ax72 ax74 ax65 ax15 ax77
% 0.77/0.97
%------------------------------------------------------------------------------