TSTP Solution File: SWC370+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC370+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n005.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 31.05s 31.22s
% Output : Refutation 31.05s
% 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('SWC370+1.p',unknown),
[] ).
cnf(2,axiom,
ssList(skc6),
file('SWC370+1.p',unknown),
[] ).
cnf(3,axiom,
ssList(skc5),
file('SWC370+1.p',unknown),
[] ).
cnf(4,axiom,
equalelemsP(skc5),
file('SWC370+1.p',unknown),
[] ).
cnf(7,axiom,
ssList(nil),
file('SWC370+1.p',unknown),
[] ).
cnf(8,axiom,
cyclefreeP(nil),
file('SWC370+1.p',unknown),
[] ).
cnf(9,axiom,
totalorderP(nil),
file('SWC370+1.p',unknown),
[] ).
cnf(10,axiom,
strictorderP(nil),
file('SWC370+1.p',unknown),
[] ).
cnf(11,axiom,
totalorderedP(nil),
file('SWC370+1.p',unknown),
[] ).
cnf(12,axiom,
strictorderedP(nil),
file('SWC370+1.p',unknown),
[] ).
cnf(13,axiom,
duplicatefreeP(nil),
file('SWC370+1.p',unknown),
[] ).
cnf(14,axiom,
equalelemsP(nil),
file('SWC370+1.p',unknown),
[] ).
cnf(53,axiom,
~ segmentP(skc6,skc5),
file('SWC370+1.p',unknown),
[] ).
cnf(61,axiom,
equal(app(skc5,skc7),skc6),
file('SWC370+1.p',unknown),
[] ).
cnf(67,axiom,
( ~ ssList(u)
| segmentP(u,u) ),
file('SWC370+1.p',unknown),
[] ).
cnf(80,axiom,
( ~ ssList(u)
| equal(app(nil,u),u) ),
file('SWC370+1.p',unknown),
[] ).
cnf(157,axiom,
( ~ ssList(u)
| ~ ssList(v)
| ~ ssList(w)
| equal(app(app(w,v),u),app(w,app(v,u))) ),
file('SWC370+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('SWC370+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(283,plain,
segmentP(skc5,skc5),
inference(res,[status(thm),theory(equality)],[3,67]),
[iquote('0:Res:3.0,67.0')] ).
cnf(450,plain,
equal(app(nil,skc6),skc6),
inference(res,[status(thm),theory(equality)],[2,80]),
[iquote('0:Res:2.0,80.0')] ).
cnf(32629,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(33647,plain,
( ~ ssList(u)
| ~ ssList(v)
| ~ segmentP(skc5,v)
| segmentP(app(u,skc6),v) ),
inference(ssi,[status(thm)],[32629,3,4,1]),
[iquote('0:SSi:32629.3,32629.0,3.0,4.0,1.0')] ).
cnf(36498,plain,
( ~ ssList(nil)
| ~ ssList(u)
| ~ segmentP(skc5,u)
| segmentP(skc6,u) ),
inference(spr,[status(thm),theory(equality)],[450,33647]),
[iquote('0:SpR:450.0,33647.3')] ).
cnf(36514,plain,
( ~ ssList(u)
| ~ segmentP(skc5,u)
| segmentP(skc6,u) ),
inference(ssi,[status(thm)],[36498,14,13,10,9,8,12,11,7]),
[iquote('0:SSi:36498.0,14.0,13.0,10.0,9.0,8.0,12.0,11.0,7.0')] ).
cnf(36543,plain,
( ~ ssList(skc5)
| ~ segmentP(skc5,skc5) ),
inference(res,[status(thm),theory(equality)],[36514,53]),
[iquote('0:Res:36514.2,53.0')] ).
cnf(36878,plain,
~ segmentP(skc5,skc5),
inference(ssi,[status(thm)],[36543,3,4]),
[iquote('0:SSi:36543.0,3.0,4.0')] ).
cnf(36879,plain,
$false,
inference(mrr,[status(thm)],[36878,283]),
[iquote('0:MRR:36878.0,283.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SWC370+1 : TPTP v8.1.0. Released v2.4.0.
% 0.10/0.13 % Command : run_spass %d %s
% 0.12/0.34 % Computer : n005.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jun 13 00:04:54 EDT 2022
% 0.12/0.34 % CPUTime :
% 31.05/31.22
% 31.05/31.22 SPASS V 3.9
% 31.05/31.22 SPASS beiseite: Proof found.
% 31.05/31.22 % SZS status Theorem
% 31.05/31.22 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 31.05/31.22 SPASS derived 23816 clauses, backtracked 8390 clauses, performed 87 splits and kept 12140 clauses.
% 31.05/31.22 SPASS allocated 126671 KBytes.
% 31.05/31.22 SPASS spent 0:0:25.51 on the problem.
% 31.05/31.22 0:00:00.04 for the input.
% 31.05/31.22 0:00:00.07 for the FLOTTER CNF translation.
% 31.05/31.22 0:00:00.34 for inferences.
% 31.05/31.22 0:00:00.61 for the backtracking.
% 31.05/31.22 0:0:24.05 for the reduction.
% 31.05/31.22
% 31.05/31.22
% 31.05/31.22 Here is a proof with depth 3, length 28 :
% 31.05/31.22 % SZS output start Refutation
% See solution above
% 31.05/31.22 Formulae used in the proof : co1 ax17 ax60 ax62 ax64 ax66 ax69 ax72 ax74 ax55 ax28 ax82 ax56
% 31.05/31.22
%------------------------------------------------------------------------------