TSTP Solution File: SWC213+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC213+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n010.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:31 EDT 2022
% Result : Theorem 0.68s 0.91s
% Output : Refutation 0.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 14
% Syntax : Number of clauses : 27 ( 19 unt; 4 nHn; 27 RR)
% Number of literals : 44 ( 0 equ; 16 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 : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(4,axiom,
ssList(skc6),
file('SWC213+1.p',unknown),
[] ).
cnf(8,axiom,
ssList(nil),
file('SWC213+1.p',unknown),
[] ).
cnf(9,axiom,
cyclefreeP(nil),
file('SWC213+1.p',unknown),
[] ).
cnf(10,axiom,
totalorderP(nil),
file('SWC213+1.p',unknown),
[] ).
cnf(11,axiom,
strictorderP(nil),
file('SWC213+1.p',unknown),
[] ).
cnf(12,axiom,
totalorderedP(nil),
file('SWC213+1.p',unknown),
[] ).
cnf(13,axiom,
strictorderedP(nil),
file('SWC213+1.p',unknown),
[] ).
cnf(14,axiom,
duplicatefreeP(nil),
file('SWC213+1.p',unknown),
[] ).
cnf(15,axiom,
equalelemsP(nil),
file('SWC213+1.p',unknown),
[] ).
cnf(16,axiom,
neq(skc7,nil),
file('SWC213+1.p',unknown),
[] ).
cnf(55,axiom,
~ neq(skc6,nil),
file('SWC213+1.p',unknown),
[] ).
cnf(72,axiom,
( ~ equal(skc6,nil)
| equal(skc7,nil) ),
file('SWC213+1.p',unknown),
[] ).
cnf(108,axiom,
( ~ ssList(u)
| ~ ssList(v)
| neq(v,u)
| equal(v,u) ),
file('SWC213+1.p',unknown),
[] ).
cnf(153,axiom,
( ~ ssList(u)
| ~ ssItem(v)
| ~ strictorderedP(cons(v,u))
| lt(v,hd(u))
| equal(nil,u) ),
file('SWC213+1.p',unknown),
[] ).
cnf(256,plain,
( ~ ssList(u)
| neq(skc6,u)
| equal(skc6,u) ),
inference(res,[status(thm),theory(equality)],[4,108]),
[iquote('0:Res:4.0,108.0')] ).
cnf(314,plain,
( ~ ssItem(u)
| ~ strictorderedP(cons(u,skc6))
| lt(u,hd(skc6))
| equal(skc6,nil) ),
inference(res,[status(thm),theory(equality)],[4,153]),
[iquote('0:Res:4.0,153.1')] ).
cnf(565,plain,
equal(skc6,nil),
inference(spt,[spt(split,[position(s1)])],[314]),
[iquote('1:Spt:314.3')] ).
cnf(572,plain,
( ~ equal(nil,nil)
| equal(skc7,nil) ),
inference(rew,[status(thm),theory(equality)],[565,72]),
[iquote('1:Rew:565.0,72.0')] ).
cnf(676,plain,
~ neq(nil,nil),
inference(rew,[status(thm),theory(equality)],[565,55]),
[iquote('1:Rew:565.0,55.0')] ).
cnf(727,plain,
equal(skc7,nil),
inference(obv,[status(thm),theory(equality)],[572]),
[iquote('1:Obv:572.0')] ).
cnf(837,plain,
neq(nil,nil),
inference(rew,[status(thm),theory(equality)],[727,16]),
[iquote('1:Rew:727.0,16.0')] ).
cnf(879,plain,
$false,
inference(mrr,[status(thm)],[837,676]),
[iquote('1:MRR:837.0,676.0')] ).
cnf(1078,plain,
~ equal(skc6,nil),
inference(spt,[spt(split,[position(sa)])],[879,565]),
[iquote('1:Spt:879.0,314.3,565.0')] ).
cnf(1079,plain,
( ~ ssItem(u)
| ~ strictorderedP(cons(u,skc6))
| lt(u,hd(skc6)) ),
inference(spt,[spt(split,[position(s2)])],[314]),
[iquote('1:Spt:879.0,314.0,314.1,314.2')] ).
cnf(1407,plain,
( ~ ssList(nil)
| equal(skc6,nil) ),
inference(res,[status(thm),theory(equality)],[256,55]),
[iquote('0:Res:256.1,55.0')] ).
cnf(1408,plain,
equal(skc6,nil),
inference(ssi,[status(thm)],[1407,15,14,11,10,9,13,12,8]),
[iquote('0:SSi:1407.0,15.0,14.0,11.0,10.0,9.0,13.0,12.0,8.0')] ).
cnf(1409,plain,
$false,
inference(mrr,[status(thm)],[1408,1078]),
[iquote('1:MRR:1408.0,1078.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWC213+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n010.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 09:55:40 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.68/0.91
% 0.68/0.91 SPASS V 3.9
% 0.68/0.91 SPASS beiseite: Proof found.
% 0.68/0.91 % SZS status Theorem
% 0.68/0.91 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.68/0.91 SPASS derived 883 clauses, backtracked 341 clauses, performed 12 splits and kept 1075 clauses.
% 0.68/0.91 SPASS allocated 99095 KBytes.
% 0.68/0.91 SPASS spent 0:00:00.55 on the problem.
% 0.68/0.91 0:00:00.04 for the input.
% 0.68/0.91 0:00:00.07 for the FLOTTER CNF translation.
% 0.68/0.91 0:00:00.00 for inferences.
% 0.68/0.91 0:00:00.01 for the backtracking.
% 0.68/0.91 0:00:00.27 for the reduction.
% 0.68/0.91
% 0.68/0.91
% 0.68/0.91 Here is a proof with depth 2, length 27 :
% 0.68/0.91 % SZS output start Refutation
% See solution above
% 0.68/0.91 Formulae used in the proof : co1 ax17 ax60 ax62 ax64 ax66 ax69 ax72 ax74 ax15 ax70
% 0.68/0.91
%------------------------------------------------------------------------------