TSTP Solution File: SWC101+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC101+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:01:44 EDT 2022
% Result : Theorem 9.00s 9.25s
% Output : Refutation 9.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 18
% Syntax : Number of clauses : 30 ( 17 unt; 2 nHn; 30 RR)
% Number of literals : 54 ( 0 equ; 29 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 12 ( 11 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
ssList(skc7),
file('SWC101+1.p',unknown),
[] ).
cnf(3,axiom,
ssList(skc5),
file('SWC101+1.p',unknown),
[] ).
cnf(4,axiom,
equalelemsP(skc5),
file('SWC101+1.p',unknown),
[] ).
cnf(7,axiom,
ssList(nil),
file('SWC101+1.p',unknown),
[] ).
cnf(8,axiom,
cyclefreeP(nil),
file('SWC101+1.p',unknown),
[] ).
cnf(9,axiom,
totalorderP(nil),
file('SWC101+1.p',unknown),
[] ).
cnf(10,axiom,
strictorderP(nil),
file('SWC101+1.p',unknown),
[] ).
cnf(11,axiom,
totalorderedP(nil),
file('SWC101+1.p',unknown),
[] ).
cnf(12,axiom,
strictorderedP(nil),
file('SWC101+1.p',unknown),
[] ).
cnf(13,axiom,
duplicatefreeP(nil),
file('SWC101+1.p',unknown),
[] ).
cnf(14,axiom,
equalelemsP(nil),
file('SWC101+1.p',unknown),
[] ).
cnf(60,axiom,
equal(app(skc5,skc7),skc6),
file('SWC101+1.p',unknown),
[] ).
cnf(62,axiom,
( ~ ssList(u)
| frontsegP(u,u) ),
file('SWC101+1.p',unknown),
[] ).
cnf(69,axiom,
( ~ equal(skc5,nil)
| equal(skc6,nil) ),
file('SWC101+1.p',unknown),
[] ).
cnf(79,axiom,
( ~ equal(skc6,nil)
| ~ equal(skc5,nil) ),
file('SWC101+1.p',unknown),
[] ).
cnf(80,axiom,
( ~ frontsegP(skc6,skc5)
| ~ neq(skc5,nil) ),
file('SWC101+1.p',unknown),
[] ).
cnf(107,axiom,
( ~ ssList(u)
| ~ ssList(v)
| neq(v,u)
| equal(v,u) ),
file('SWC101+1.p',unknown),
[] ).
cnf(149,axiom,
( ~ ssList(u)
| ~ ssList(v)
| ~ ssList(w)
| ~ frontsegP(w,v)
| frontsegP(app(w,u),v) ),
file('SWC101+1.p',unknown),
[] ).
cnf(196,plain,
( ~ equal(nil,nil)
| ~ equal(skc5,nil) ),
inference(rew,[status(thm),theory(equality)],[69,79]),
[iquote('0:Rew:69.1,79.0')] ).
cnf(197,plain,
~ equal(skc5,nil),
inference(obv,[status(thm),theory(equality)],[196]),
[iquote('0:Obv:196.0')] ).
cnf(255,plain,
( ~ ssList(u)
| neq(skc5,u)
| equal(skc5,u) ),
inference(res,[status(thm),theory(equality)],[3,107]),
[iquote('0:Res:3.0,107.0')] ).
cnf(282,plain,
frontsegP(skc5,skc5),
inference(res,[status(thm),theory(equality)],[3,62]),
[iquote('0:Res:3.0,62.0')] ).
cnf(3019,plain,
( ~ ssList(skc7)
| ~ ssList(u)
| ~ ssList(skc5)
| ~ frontsegP(skc5,u)
| frontsegP(skc6,u) ),
inference(spr,[status(thm),theory(equality)],[60,149]),
[iquote('0:SpR:60.0,149.4')] ).
cnf(12209,plain,
( ~ ssList(u)
| ~ frontsegP(skc5,u)
| frontsegP(skc6,u) ),
inference(ssi,[status(thm)],[3019,4,3,1]),
[iquote('0:SSi:3019.2,3019.0,4.0,3.0,1.0')] ).
cnf(12936,plain,
( ~ ssList(skc5)
| ~ frontsegP(skc5,skc5)
| ~ neq(skc5,nil) ),
inference(res,[status(thm),theory(equality)],[12209,80]),
[iquote('0:Res:12209.2,80.0')] ).
cnf(13345,plain,
( ~ frontsegP(skc5,skc5)
| ~ neq(skc5,nil) ),
inference(ssi,[status(thm)],[12936,4,3]),
[iquote('0:SSi:12936.0,4.0,3.0')] ).
cnf(13346,plain,
~ neq(skc5,nil),
inference(mrr,[status(thm)],[13345,282]),
[iquote('0:MRR:13345.0,282.0')] ).
cnf(13448,plain,
( ~ ssList(nil)
| equal(skc5,nil) ),
inference(res,[status(thm),theory(equality)],[255,13346]),
[iquote('0:Res:255.1,13346.0')] ).
cnf(13451,plain,
equal(skc5,nil),
inference(ssi,[status(thm)],[13448,14,13,10,9,8,12,11,7]),
[iquote('0:SSi:13448.0,14.0,13.0,10.0,9.0,8.0,12.0,11.0,7.0')] ).
cnf(13452,plain,
$false,
inference(mrr,[status(thm)],[13451,197]),
[iquote('0:MRR:13451.0,197.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWC101+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.12 % Command : run_spass %d %s
% 0.11/0.33 % Computer : n022.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Sun Jun 12 12:24:33 EDT 2022
% 0.11/0.33 % CPUTime :
% 9.00/9.25
% 9.00/9.25 SPASS V 3.9
% 9.00/9.25 SPASS beiseite: Proof found.
% 9.00/9.25 % SZS status Theorem
% 9.00/9.25 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 9.00/9.25 SPASS derived 8240 clauses, backtracked 3241 clauses, performed 81 splits and kept 5386 clauses.
% 9.00/9.25 SPASS allocated 109306 KBytes.
% 9.00/9.25 SPASS spent 0:00:08.35 on the problem.
% 9.00/9.25 0:00:00.04 for the input.
% 9.00/9.25 0:00:00.07 for the FLOTTER CNF translation.
% 9.00/9.25 0:00:00.11 for inferences.
% 9.00/9.25 0:00:00.11 for the backtracking.
% 9.00/9.25 0:00:07.81 for the reduction.
% 9.00/9.25
% 9.00/9.25
% 9.00/9.25 Here is a proof with depth 3, length 30 :
% 9.00/9.25 % SZS output start Refutation
% See solution above
% 9.00/9.25 Formulae used in the proof : co1 ax17 ax60 ax62 ax64 ax66 ax69 ax72 ax74 ax42 ax15 ax43
% 9.00/9.25
%------------------------------------------------------------------------------