TSTP Solution File: SWC347+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC347+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n023.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:28 EDT 2022
% Result : Theorem 48.53s 48.70s
% Output : Refutation 48.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 18
% Syntax : Number of clauses : 28 ( 17 unt; 0 nHn; 28 RR)
% Number of literals : 57 ( 0 equ; 31 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('SWC347+1.p',unknown),
[] ).
cnf(2,axiom,
ssList(skc6),
file('SWC347+1.p',unknown),
[] ).
cnf(3,axiom,
ssList(skc5),
file('SWC347+1.p',unknown),
[] ).
cnf(4,axiom,
strictorderedP(skc5),
file('SWC347+1.p',unknown),
[] ).
cnf(7,axiom,
ssList(nil),
file('SWC347+1.p',unknown),
[] ).
cnf(8,axiom,
cyclefreeP(nil),
file('SWC347+1.p',unknown),
[] ).
cnf(9,axiom,
totalorderP(nil),
file('SWC347+1.p',unknown),
[] ).
cnf(10,axiom,
strictorderP(nil),
file('SWC347+1.p',unknown),
[] ).
cnf(11,axiom,
totalorderedP(nil),
file('SWC347+1.p',unknown),
[] ).
cnf(12,axiom,
strictorderedP(nil),
file('SWC347+1.p',unknown),
[] ).
cnf(13,axiom,
duplicatefreeP(nil),
file('SWC347+1.p',unknown),
[] ).
cnf(14,axiom,
equalelemsP(nil),
file('SWC347+1.p',unknown),
[] ).
cnf(60,axiom,
equal(app(skc5,skc7),skc6),
file('SWC347+1.p',unknown),
[] ).
cnf(70,axiom,
( ~ segmentP(skc6,skc5)
| ~ strictorderedP(skc5) ),
file('SWC347+1.p',unknown),
[] ).
cnf(80,axiom,
( ~ ssList(u)
| equal(app(nil,u),u) ),
file('SWC347+1.p',unknown),
[] ).
cnf(90,axiom,
( ~ ssList(u)
| ~ ssList(v)
| ssList(app(v,u)) ),
file('SWC347+1.p',unknown),
[] ).
cnf(157,axiom,
( ~ ssList(u)
| ~ ssList(v)
| ~ ssList(w)
| equal(app(app(w,v),u),app(w,app(v,u))) ),
file('SWC347+1.p',unknown),
[] ).
cnf(183,axiom,
( ~ ssList(u)
| ~ ssList(v)
| ~ ssList(w)
| ~ ssList(x)
| ~ equal(app(app(u,x),v),w)
| segmentP(w,x) ),
file('SWC347+1.p',unknown),
[] ).
cnf(195,plain,
~ segmentP(skc6,skc5),
inference(mrr,[status(thm)],[70,4]),
[iquote('0:MRR:70.1,4.0')] ).
cnf(200,plain,
( ~ ssList(u)
| ~ ssList(v)
| ~ ssList(w)
| ~ ssList(x)
| ~ equal(app(x,app(u,w)),v)
| segmentP(v,u) ),
inference(rew,[status(thm),theory(equality)],[157,183]),
[iquote('0:Rew:157.3,183.4')] ).
cnf(452,plain,
equal(app(nil,skc6),skc6),
inference(res,[status(thm),theory(equality)],[2,80]),
[iquote('0:Res:2.0,80.0')] ).
cnf(28164,plain,
( ~ ssList(skc5)
| ~ ssList(u)
| ~ ssList(skc7)
| ~ ssList(v)
| ~ equal(app(v,skc6),u)
| segmentP(u,skc5) ),
inference(spl,[status(thm),theory(equality)],[60,200]),
[iquote('0:SpL:60.0,200.4')] ).
cnf(45217,plain,
( ~ ssList(u)
| ~ ssList(v)
| ~ equal(app(v,skc6),u)
| segmentP(u,skc5) ),
inference(ssi,[status(thm)],[28164,1,4,3]),
[iquote('0:SSi:28164.2,28164.0,1.0,4.0,3.0')] ).
cnf(46810,plain,
( ~ ssList(app(u,skc6))
| ~ ssList(u)
| segmentP(app(u,skc6),skc5) ),
inference(eqr,[status(thm),theory(equality)],[45217]),
[iquote('0:EqR:45217.2')] ).
cnf(48968,plain,
( ~ ssList(u)
| segmentP(app(u,skc6),skc5) ),
inference(ssi,[status(thm)],[46810,90,2]),
[iquote('0:SSi:46810.0,90.0,2.2')] ).
cnf(49142,plain,
( ~ ssList(nil)
| segmentP(skc6,skc5) ),
inference(spr,[status(thm),theory(equality)],[452,48968]),
[iquote('0:SpR:452.0,48968.1')] ).
cnf(49151,plain,
segmentP(skc6,skc5),
inference(ssi,[status(thm)],[49142,14,13,10,9,8,12,11,7]),
[iquote('0:SSi:49142.0,14.0,13.0,10.0,9.0,8.0,12.0,11.0,7.0')] ).
cnf(49152,plain,
$false,
inference(mrr,[status(thm)],[49151,195]),
[iquote('0:MRR:49151.0,195.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWC347+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n023.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 03:34:36 EDT 2022
% 0.13/0.34 % CPUTime :
% 48.53/48.70
% 48.53/48.70 SPASS V 3.9
% 48.53/48.70 SPASS beiseite: Proof found.
% 48.53/48.70 % SZS status Theorem
% 48.53/48.70 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 48.53/48.70 SPASS derived 32786 clauses, backtracked 15128 clauses, performed 173 splits and kept 19179 clauses.
% 48.53/48.70 SPASS allocated 134864 KBytes.
% 48.53/48.70 SPASS spent 0:0:39.36 on the problem.
% 48.53/48.70 0:00:00.04 for the input.
% 48.53/48.70 0:00:00.07 for the FLOTTER CNF translation.
% 48.53/48.70 0:00:00.48 for inferences.
% 48.53/48.70 0:00:00.89 for the backtracking.
% 48.53/48.70 0:0:37.39 for the reduction.
% 48.53/48.70
% 48.53/48.70
% 48.53/48.70 Here is a proof with depth 3, length 28 :
% 48.53/48.70 % SZS output start Refutation
% See solution above
% 48.53/48.70 Formulae used in the proof : co1 ax17 ax60 ax62 ax64 ax66 ax69 ax72 ax74 ax28 ax26 ax82 ax7
% 48.53/48.70
%------------------------------------------------------------------------------