TSTP Solution File: SWC009+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC009+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n032.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:03 EDT 2022
% Result : Theorem 16.36s 16.55s
% Output : Refutation 16.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 15
% Syntax : Number of clauses : 23 ( 13 unt; 0 nHn; 23 RR)
% Number of literals : 55 ( 0 equ; 40 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 9 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('SWC009+1.p',unknown),
[] ).
cnf(3,axiom,
ssList(skc5),
file('SWC009+1.p',unknown),
[] ).
cnf(4,axiom,
strictorderedP(skc5),
file('SWC009+1.p',unknown),
[] ).
cnf(7,axiom,
ssList(nil),
file('SWC009+1.p',unknown),
[] ).
cnf(8,axiom,
cyclefreeP(nil),
file('SWC009+1.p',unknown),
[] ).
cnf(9,axiom,
totalorderP(nil),
file('SWC009+1.p',unknown),
[] ).
cnf(10,axiom,
strictorderP(nil),
file('SWC009+1.p',unknown),
[] ).
cnf(11,axiom,
totalorderedP(nil),
file('SWC009+1.p',unknown),
[] ).
cnf(12,axiom,
strictorderedP(nil),
file('SWC009+1.p',unknown),
[] ).
cnf(13,axiom,
duplicatefreeP(nil),
file('SWC009+1.p',unknown),
[] ).
cnf(14,axiom,
equalelemsP(nil),
file('SWC009+1.p',unknown),
[] ).
cnf(60,axiom,
equal(app(skc5,skc7),skc6),
file('SWC009+1.p',unknown),
[] ).
cnf(80,axiom,
( ~ ssList(u)
| equal(app(u,nil),u) ),
file('SWC009+1.p',unknown),
[] ).
cnf(156,axiom,
( ~ ssList(u)
| ~ ssList(v)
| ~ ssList(w)
| equal(app(app(w,v),u),app(w,app(v,u))) ),
file('SWC009+1.p',unknown),
[] ).
cnf(184,axiom,
( ~ ssList(u)
| ~ ssList(v)
| ~ ssList(w)
| ~ equal(app(app(u,v),w),skc6)
| ~ equal(app(u,w),skc5) ),
file('SWC009+1.p',unknown),
[] ).
cnf(200,plain,
( ~ ssList(u)
| ~ ssList(v)
| ~ ssList(w)
| ~ equal(app(w,u),skc5)
| ~ equal(app(w,app(v,u)),skc6) ),
inference(rew,[status(thm),theory(equality)],[156,184]),
[iquote('0:Rew:156.3,184.3')] ).
cnf(6448,plain,
( ~ ssList(u)
| ~ ssList(nil)
| ~ ssList(u)
| ~ ssList(v)
| ~ equal(app(v,nil),skc5)
| ~ equal(app(v,u),skc6) ),
inference(spl,[status(thm),theory(equality)],[80,200]),
[iquote('0:SpL:80.1,200.4')] ).
cnf(6486,plain,
( ~ ssList(nil)
| ~ ssList(u)
| ~ ssList(v)
| ~ equal(app(v,nil),skc5)
| ~ equal(app(v,u),skc6) ),
inference(obv,[status(thm),theory(equality)],[6448]),
[iquote('0:Obv:6448.0')] ).
cnf(6487,plain,
( ~ ssList(nil)
| ~ ssList(u)
| ~ ssList(v)
| ~ equal(v,skc5)
| ~ equal(app(v,u),skc6) ),
inference(rew,[status(thm),theory(equality)],[80,6486]),
[iquote('0:Rew:80.1,6486.3')] ).
cnf(6488,plain,
( ~ ssList(u)
| ~ ssList(v)
| ~ equal(v,skc5)
| ~ equal(app(v,u),skc6) ),
inference(ssi,[status(thm)],[6487,14,13,10,9,8,12,11,7]),
[iquote('0:SSi:6487.0,14.0,13.0,10.0,9.0,8.0,12.0,11.0,7.0')] ).
cnf(19241,plain,
( ~ ssList(skc7)
| ~ ssList(skc5)
| ~ equal(skc5,skc5)
| ~ equal(skc6,skc6) ),
inference(spl,[status(thm),theory(equality)],[60,6488]),
[iquote('0:SpL:60.0,6488.3')] ).
cnf(20613,plain,
( ~ ssList(skc7)
| ~ ssList(skc5) ),
inference(obv,[status(thm),theory(equality)],[19241]),
[iquote('0:Obv:19241.3')] ).
cnf(20614,plain,
$false,
inference(ssi,[status(thm)],[20613,3,4,1]),
[iquote('0:SSi:20613.1,20613.0,3.0,4.0,1.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : SWC009+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.10 % Command : run_spass %d %s
% 0.10/0.30 % Computer : n032.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 600
% 0.10/0.30 % DateTime : Sun Jun 12 07:47:55 EDT 2022
% 0.10/0.30 % CPUTime :
% 16.36/16.55
% 16.36/16.55 SPASS V 3.9
% 16.36/16.55 SPASS beiseite: Proof found.
% 16.36/16.55 % SZS status Theorem
% 16.36/16.55 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 16.36/16.55 SPASS derived 12814 clauses, backtracked 4287 clauses, performed 25 splits and kept 7313 clauses.
% 16.36/16.55 SPASS allocated 116256 KBytes.
% 16.36/16.55 SPASS spent 0:0:14.70 on the problem.
% 16.36/16.55 0:00:00.03 for the input.
% 16.36/16.55 0:00:00.05 for the FLOTTER CNF translation.
% 16.36/16.55 0:00:00.19 for inferences.
% 16.36/16.55 0:00:00.39 for the backtracking.
% 16.36/16.55 0:0:13.79 for the reduction.
% 16.36/16.55
% 16.36/16.55
% 16.36/16.55 Here is a proof with depth 2, length 23 :
% 16.36/16.55 % SZS output start Refutation
% See solution above
% 16.36/16.55 Formulae used in the proof : co1 ax17 ax60 ax62 ax64 ax66 ax69 ax72 ax74 ax84 ax82
% 16.36/16.55
%------------------------------------------------------------------------------