TSTP Solution File: SWC371+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC371+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n029.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:38 EDT 2022
% Result : Theorem 72.87s 73.05s
% Output : Refutation 72.87s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 18
% Syntax : Number of clauses : 28 ( 18 unt; 0 nHn; 28 RR)
% Number of literals : 57 ( 0 equ; 32 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('SWC371+1.p',unknown),
[] ).
cnf(2,axiom,
ssList(skc6),
file('SWC371+1.p',unknown),
[] ).
cnf(3,axiom,
ssList(skc5),
file('SWC371+1.p',unknown),
[] ).
cnf(4,axiom,
totalorderedP(skc5),
file('SWC371+1.p',unknown),
[] ).
cnf(7,axiom,
ssList(nil),
file('SWC371+1.p',unknown),
[] ).
cnf(8,axiom,
cyclefreeP(nil),
file('SWC371+1.p',unknown),
[] ).
cnf(9,axiom,
totalorderP(nil),
file('SWC371+1.p',unknown),
[] ).
cnf(10,axiom,
strictorderP(nil),
file('SWC371+1.p',unknown),
[] ).
cnf(11,axiom,
totalorderedP(nil),
file('SWC371+1.p',unknown),
[] ).
cnf(12,axiom,
strictorderedP(nil),
file('SWC371+1.p',unknown),
[] ).
cnf(13,axiom,
duplicatefreeP(nil),
file('SWC371+1.p',unknown),
[] ).
cnf(14,axiom,
equalelemsP(nil),
file('SWC371+1.p',unknown),
[] ).
cnf(53,axiom,
~ segmentP(skc6,skc5),
file('SWC371+1.p',unknown),
[] ).
cnf(61,axiom,
equal(app(skc5,skc7),skc6),
file('SWC371+1.p',unknown),
[] ).
cnf(67,axiom,
( ~ ssList(u)
| segmentP(u,u) ),
file('SWC371+1.p',unknown),
[] ).
cnf(80,axiom,
( ~ ssList(u)
| equal(app(nil,u),u) ),
file('SWC371+1.p',unknown),
[] ).
cnf(157,axiom,
( ~ ssList(u)
| ~ ssList(v)
| ~ ssList(w)
| equal(app(app(w,v),u),app(w,app(v,u))) ),
file('SWC371+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('SWC371+1.p',unknown),
[] ).
cnf(198,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,67]),
[iquote('0:Res:3.0,67.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(57572,plain,
( ~ ssList(skc7)
| ~ ssList(u)
| ~ ssList(v)
| ~ ssList(skc5)
| ~ segmentP(skc5,v)
| segmentP(app(u,skc6),v) ),
inference(spr,[status(thm),theory(equality)],[61,198]),
[iquote('0:SpR:61.0,198.5')] ).
cnf(58143,plain,
( ~ ssList(u)
| ~ ssList(v)
| ~ segmentP(skc5,v)
| segmentP(app(u,skc6),v) ),
inference(ssi,[status(thm)],[57572,4,3,1]),
[iquote('0:SSi:57572.3,57572.0,4.0,3.0,1.0')] ).
cnf(62391,plain,
( ~ ssList(nil)
| ~ ssList(u)
| ~ segmentP(skc5,u)
| segmentP(skc6,u) ),
inference(spr,[status(thm),theory(equality)],[451,58143]),
[iquote('0:SpR:451.0,58143.3')] ).
cnf(62401,plain,
( ~ ssList(u)
| ~ segmentP(skc5,u)
| segmentP(skc6,u) ),
inference(ssi,[status(thm)],[62391,14,13,9,10,8,11,12,7]),
[iquote('0:SSi:62391.0,14.0,13.0,9.0,10.0,8.0,11.0,12.0,7.0')] ).
cnf(62419,plain,
( ~ ssList(skc5)
| ~ segmentP(skc5,skc5) ),
inference(res,[status(thm),theory(equality)],[62401,53]),
[iquote('0:Res:62401.2,53.0')] ).
cnf(62728,plain,
~ segmentP(skc5,skc5),
inference(ssi,[status(thm)],[62419,4,3]),
[iquote('0:SSi:62419.0,4.0,3.0')] ).
cnf(62729,plain,
$false,
inference(mrr,[status(thm)],[62728,284]),
[iquote('0:MRR:62728.0,284.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SWC371+1 : TPTP v8.1.0. Released v2.4.0.
% 0.04/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n029.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 : Sat Jun 11 22:22:09 EDT 2022
% 0.13/0.35 % CPUTime :
% 72.87/73.05
% 72.87/73.05 SPASS V 3.9
% 72.87/73.05 SPASS beiseite: Proof found.
% 72.87/73.05 % SZS status Theorem
% 72.87/73.05 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 72.87/73.05 SPASS derived 42742 clauses, backtracked 21211 clauses, performed 150 splits and kept 24291 clauses.
% 72.87/73.05 SPASS allocated 144187 KBytes.
% 72.87/73.05 SPASS spent 0:0:55.02 on the problem.
% 72.87/73.05 0:00:00.04 for the input.
% 72.87/73.05 0:00:00.06 for the FLOTTER CNF translation.
% 72.87/73.05 0:00:00.66 for inferences.
% 72.87/73.05 0:00:01.11 for the backtracking.
% 72.87/73.05 0:0:52.58 for the reduction.
% 72.87/73.05
% 72.87/73.05
% 72.87/73.05 Here is a proof with depth 3, length 28 :
% 72.87/73.05 % SZS output start Refutation
% See solution above
% 72.87/73.05 Formulae used in the proof : co1 ax17 ax60 ax62 ax64 ax66 ax69 ax72 ax74 ax55 ax28 ax82 ax56
% 72.87/73.05
%------------------------------------------------------------------------------