TSTP Solution File: SWC131+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC131+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n025.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:56 EDT 2022
% Result : Theorem 0.69s 0.85s
% Output : Refutation 0.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 13
% Syntax : Number of clauses : 23 ( 17 unt; 4 nHn; 23 RR)
% Number of literals : 38 ( 0 equ; 15 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 : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
ssList(skc5),
file('SWC131+1.p',unknown),
[] ).
cnf(5,axiom,
ssList(nil),
file('SWC131+1.p',unknown),
[] ).
cnf(6,axiom,
cyclefreeP(nil),
file('SWC131+1.p',unknown),
[] ).
cnf(7,axiom,
totalorderP(nil),
file('SWC131+1.p',unknown),
[] ).
cnf(8,axiom,
strictorderP(nil),
file('SWC131+1.p',unknown),
[] ).
cnf(9,axiom,
totalorderedP(nil),
file('SWC131+1.p',unknown),
[] ).
cnf(10,axiom,
strictorderedP(nil),
file('SWC131+1.p',unknown),
[] ).
cnf(11,axiom,
duplicatefreeP(nil),
file('SWC131+1.p',unknown),
[] ).
cnf(12,axiom,
equalelemsP(nil),
file('SWC131+1.p',unknown),
[] ).
cnf(13,axiom,
~ cyclefreeP(skc5),
file('SWC131+1.p',unknown),
[] ).
cnf(52,axiom,
~ neq(skc5,nil),
file('SWC131+1.p',unknown),
[] ).
cnf(103,axiom,
( ~ ssList(u)
| ~ ssList(v)
| neq(v,u)
| equal(v,u) ),
file('SWC131+1.p',unknown),
[] ).
cnf(148,axiom,
( ~ ssList(u)
| ~ ssItem(v)
| ~ strictorderedP(cons(v,u))
| lt(v,hd(u))
| equal(nil,u) ),
file('SWC131+1.p',unknown),
[] ).
cnf(417,plain,
( ~ ssList(u)
| neq(skc5,u)
| equal(skc5,u) ),
inference(res,[status(thm),theory(equality)],[1,103]),
[iquote('0:Res:1.0,103.0')] ).
cnf(473,plain,
( ~ ssItem(u)
| ~ strictorderedP(cons(u,skc5))
| lt(u,hd(skc5))
| equal(skc5,nil) ),
inference(res,[status(thm),theory(equality)],[1,148]),
[iquote('0:Res:1.0,148.1')] ).
cnf(549,plain,
equal(skc5,nil),
inference(spt,[spt(split,[position(s1)])],[473]),
[iquote('1:Spt:473.3')] ).
cnf(552,plain,
~ cyclefreeP(nil),
inference(rew,[status(thm),theory(equality)],[549,13]),
[iquote('1:Rew:549.0,13.0')] ).
cnf(702,plain,
$false,
inference(mrr,[status(thm)],[552,6]),
[iquote('1:MRR:552.0,6.0')] ).
cnf(804,plain,
~ equal(skc5,nil),
inference(spt,[spt(split,[position(sa)])],[702,549]),
[iquote('1:Spt:702.0,473.3,549.0')] ).
cnf(805,plain,
( ~ ssItem(u)
| ~ strictorderedP(cons(u,skc5))
| lt(u,hd(skc5)) ),
inference(spt,[spt(split,[position(s2)])],[473]),
[iquote('1:Spt:702.0,473.0,473.1,473.2')] ).
cnf(1127,plain,
( ~ ssList(nil)
| equal(skc5,nil) ),
inference(res,[status(thm),theory(equality)],[417,52]),
[iquote('0:Res:417.1,52.0')] ).
cnf(1128,plain,
equal(skc5,nil),
inference(ssi,[status(thm)],[1127,12,11,6,8,7,10,9,5]),
[iquote('0:SSi:1127.0,12.0,11.0,6.0,8.0,7.0,10.0,9.0,5.0')] ).
cnf(1129,plain,
$false,
inference(mrr,[status(thm)],[1128,804]),
[iquote('1:MRR:1128.0,804.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWC131+1 : TPTP v8.1.0. Released v2.4.0.
% 0.13/0.13 % Command : run_spass %d %s
% 0.13/0.35 % Computer : n025.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sun Jun 12 19:52:08 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.69/0.85
% 0.69/0.85 SPASS V 3.9
% 0.69/0.85 SPASS beiseite: Proof found.
% 0.69/0.85 % SZS status Theorem
% 0.69/0.85 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.69/0.85 SPASS derived 706 clauses, backtracked 167 clauses, performed 11 splits and kept 873 clauses.
% 0.69/0.85 SPASS allocated 98899 KBytes.
% 0.69/0.85 SPASS spent 0:00:00.49 on the problem.
% 0.69/0.85 0:00:00.04 for the input.
% 0.69/0.85 0:00:00.06 for the FLOTTER CNF translation.
% 0.69/0.85 0:00:00.00 for inferences.
% 0.69/0.85 0:00:00.01 for the backtracking.
% 0.69/0.85 0:00:00.22 for the reduction.
% 0.69/0.85
% 0.69/0.85
% 0.69/0.85 Here is a proof with depth 2, length 23 :
% 0.69/0.85 % SZS output start Refutation
% See solution above
% 0.69/0.85 Formulae used in the proof : co1 ax17 ax60 ax62 ax64 ax66 ax69 ax72 ax74 ax15 ax70
% 0.69/0.85
%------------------------------------------------------------------------------