TSTP Solution File: SWC331+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC331+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n022.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:03:22 EDT 2022
% Result : Theorem 34.08s 34.26s
% Output : Refutation 34.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 18
% Syntax : Number of clauses : 29 ( 18 unt; 0 nHn; 29 RR)
% Number of literals : 59 ( 0 equ; 34 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 11 ( 10 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
ssList(skc7),
file('SWC331+1.p',unknown),
[] ).
cnf(2,axiom,
ssList(skc6),
file('SWC331+1.p',unknown),
[] ).
cnf(3,axiom,
ssList(skc5),
file('SWC331+1.p',unknown),
[] ).
cnf(4,axiom,
equalelemsP(skc5),
file('SWC331+1.p',unknown),
[] ).
cnf(7,axiom,
ssList(nil),
file('SWC331+1.p',unknown),
[] ).
cnf(8,axiom,
cyclefreeP(nil),
file('SWC331+1.p',unknown),
[] ).
cnf(9,axiom,
totalorderP(nil),
file('SWC331+1.p',unknown),
[] ).
cnf(10,axiom,
strictorderP(nil),
file('SWC331+1.p',unknown),
[] ).
cnf(11,axiom,
totalorderedP(nil),
file('SWC331+1.p',unknown),
[] ).
cnf(12,axiom,
strictorderedP(nil),
file('SWC331+1.p',unknown),
[] ).
cnf(13,axiom,
duplicatefreeP(nil),
file('SWC331+1.p',unknown),
[] ).
cnf(14,axiom,
equalelemsP(nil),
file('SWC331+1.p',unknown),
[] ).
cnf(60,axiom,
equal(app(skc5,skc7),skc6),
file('SWC331+1.p',unknown),
[] ).
cnf(66,axiom,
( ~ ssList(u)
| segmentP(u,u) ),
file('SWC331+1.p',unknown),
[] ).
cnf(70,axiom,
( ~ segmentP(skc6,skc5)
| ~ equalelemsP(skc5) ),
file('SWC331+1.p',unknown),
[] ).
cnf(80,axiom,
( ~ ssList(u)
| equal(app(nil,u),u) ),
file('SWC331+1.p',unknown),
[] ).
cnf(157,axiom,
( ~ ssList(u)
| ~ ssList(v)
| ~ ssList(w)
| equal(app(app(w,v),u),app(w,app(v,u))) ),
file('SWC331+1.p',unknown),
[] ).
cnf(178,axiom,
( ~ ssList(u)
| ~ ssList(v)
| ~ ssList(w)
| ~ ssList(x)
| ~ segmentP(u,v)
| segmentP(app(app(w,u),x),v) ),
file('SWC331+1.p',unknown),
[] ).
cnf(195,plain,
~ segmentP(skc6,skc5),
inference(mrr,[status(thm)],[70,4]),
[iquote('0:MRR:70.1,4.0')] ).
cnf(199,plain,
( ~ ssList(u)
| ~ ssList(v)
| ~ ssList(w)
| ~ ssList(x)
| ~ segmentP(x,w)
| segmentP(app(v,app(x,u)),w) ),
inference(rew,[status(thm),theory(equality)],[157,178]),
[iquote('0:Rew:157.3,178.5')] ).
cnf(284,plain,
segmentP(skc5,skc5),
inference(res,[status(thm),theory(equality)],[3,66]),
[iquote('0:Res:3.0,66.0')] ).
cnf(451,plain,
equal(app(nil,skc6),skc6),
inference(res,[status(thm),theory(equality)],[2,80]),
[iquote('0:Res:2.0,80.0')] ).
cnf(32630,plain,
( ~ ssList(skc7)
| ~ ssList(u)
| ~ ssList(v)
| ~ ssList(skc5)
| ~ segmentP(skc5,v)
| segmentP(app(u,skc6),v) ),
inference(spr,[status(thm),theory(equality)],[60,199]),
[iquote('0:SpR:60.0,199.5')] ).
cnf(33648,plain,
( ~ ssList(u)
| ~ ssList(v)
| ~ segmentP(skc5,v)
| segmentP(app(u,skc6),v) ),
inference(ssi,[status(thm)],[32630,3,4,1]),
[iquote('0:SSi:32630.3,32630.0,3.0,4.0,1.0')] ).
cnf(36499,plain,
( ~ ssList(nil)
| ~ ssList(u)
| ~ segmentP(skc5,u)
| segmentP(skc6,u) ),
inference(spr,[status(thm),theory(equality)],[451,33648]),
[iquote('0:SpR:451.0,33648.3')] ).
cnf(36515,plain,
( ~ ssList(u)
| ~ segmentP(skc5,u)
| segmentP(skc6,u) ),
inference(ssi,[status(thm)],[36499,14,13,10,9,8,12,11,7]),
[iquote('0:SSi:36499.0,14.0,13.0,10.0,9.0,8.0,12.0,11.0,7.0')] ).
cnf(36544,plain,
( ~ ssList(skc5)
| ~ segmentP(skc5,skc5) ),
inference(res,[status(thm),theory(equality)],[36515,195]),
[iquote('0:Res:36515.2,195.0')] ).
cnf(36879,plain,
~ segmentP(skc5,skc5),
inference(ssi,[status(thm)],[36544,3,4]),
[iquote('0:SSi:36544.0,3.0,4.0')] ).
cnf(36880,plain,
$false,
inference(mrr,[status(thm)],[36879,284]),
[iquote('0:MRR:36879.0,284.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SWC331+1 : TPTP v8.1.0. Released v2.4.0.
% 0.04/0.14 % Command : run_spass %d %s
% 0.14/0.35 % Computer : n022.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sun Jun 12 04:27:18 EDT 2022
% 0.14/0.35 % CPUTime :
% 34.08/34.26
% 34.08/34.26 SPASS V 3.9
% 34.08/34.26 SPASS beiseite: Proof found.
% 34.08/34.26 % SZS status Theorem
% 34.08/34.26 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 34.08/34.26 SPASS derived 23816 clauses, backtracked 8390 clauses, performed 87 splits and kept 12140 clauses.
% 34.08/34.26 SPASS allocated 126672 KBytes.
% 34.08/34.26 SPASS spent 0:0:28.30 on the problem.
% 34.08/34.26 0:00:00.04 for the input.
% 34.08/34.26 0:00:00.07 for the FLOTTER CNF translation.
% 34.08/34.26 0:00:00.40 for inferences.
% 34.08/34.26 0:00:00.66 for the backtracking.
% 34.08/34.26 0:0:26.77 for the reduction.
% 34.08/34.26
% 34.08/34.26
% 34.08/34.26 Here is a proof with depth 3, length 29 :
% 34.08/34.26 % SZS output start Refutation
% See solution above
% 34.08/34.26 Formulae used in the proof : co1 ax17 ax60 ax62 ax64 ax66 ax69 ax72 ax74 ax55 ax28 ax82 ax56
% 34.08/34.26
%------------------------------------------------------------------------------