TSTP Solution File: SWC007+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC007+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n014.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:02 EDT 2022
% Result : Theorem 11.64s 11.86s
% Output : Refutation 11.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 14
% Syntax : Number of clauses : 32 ( 19 unt; 0 nHn; 32 RR)
% Number of literals : 61 ( 0 equ; 35 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
ssList(skc5),
file('SWC007+1.p',unknown),
[] ).
cnf(2,axiom,
ssList(skc4),
file('SWC007+1.p',unknown),
[] ).
cnf(6,axiom,
cyclefreeP(nil),
file('SWC007+1.p',unknown),
[] ).
cnf(7,axiom,
totalorderP(nil),
file('SWC007+1.p',unknown),
[] ).
cnf(8,axiom,
strictorderP(nil),
file('SWC007+1.p',unknown),
[] ).
cnf(9,axiom,
totalorderedP(nil),
file('SWC007+1.p',unknown),
[] ).
cnf(10,axiom,
strictorderedP(nil),
file('SWC007+1.p',unknown),
[] ).
cnf(11,axiom,
duplicatefreeP(nil),
file('SWC007+1.p',unknown),
[] ).
cnf(12,axiom,
equalelemsP(nil),
file('SWC007+1.p',unknown),
[] ).
cnf(13,axiom,
equal(nil,skc4),
file('SWC007+1.p',unknown),
[] ).
cnf(76,axiom,
( ~ ssList(u)
| equal(app(nil,u),u) ),
file('SWC007+1.p',unknown),
[] ).
cnf(77,axiom,
( ~ ssList(u)
| equal(app(u,nil),u) ),
file('SWC007+1.p',unknown),
[] ).
cnf(153,axiom,
( ~ ssList(u)
| ~ ssList(v)
| ~ ssList(w)
| equal(app(app(w,v),u),app(w,app(v,u))) ),
file('SWC007+1.p',unknown),
[] ).
cnf(181,axiom,
( ~ ssList(u)
| ~ ssList(v)
| ~ ssList(w)
| ~ equal(app(app(u,v),w),skc5)
| ~ equal(app(u,w),skc4) ),
file('SWC007+1.p',unknown),
[] ).
cnf(191,plain,
equalelemsP(skc4),
inference(rew,[status(thm),theory(equality)],[13,12]),
[iquote('0:Rew:13.0,12.0')] ).
cnf(192,plain,
duplicatefreeP(skc4),
inference(rew,[status(thm),theory(equality)],[13,11]),
[iquote('0:Rew:13.0,11.0')] ).
cnf(193,plain,
strictorderedP(skc4),
inference(rew,[status(thm),theory(equality)],[13,10]),
[iquote('0:Rew:13.0,10.0')] ).
cnf(194,plain,
totalorderedP(skc4),
inference(rew,[status(thm),theory(equality)],[13,9]),
[iquote('0:Rew:13.0,9.0')] ).
cnf(195,plain,
strictorderP(skc4),
inference(rew,[status(thm),theory(equality)],[13,8]),
[iquote('0:Rew:13.0,8.0')] ).
cnf(196,plain,
totalorderP(skc4),
inference(rew,[status(thm),theory(equality)],[13,7]),
[iquote('0:Rew:13.0,7.0')] ).
cnf(197,plain,
cyclefreeP(skc4),
inference(rew,[status(thm),theory(equality)],[13,6]),
[iquote('0:Rew:13.0,6.0')] ).
cnf(211,plain,
( ~ ssList(u)
| equal(app(u,skc4),u) ),
inference(rew,[status(thm),theory(equality)],[13,77]),
[iquote('0:Rew:13.0,77.1')] ).
cnf(212,plain,
( ~ ssList(u)
| equal(app(skc4,u),u) ),
inference(rew,[status(thm),theory(equality)],[13,76]),
[iquote('0:Rew:13.0,76.1')] ).
cnf(247,plain,
( ~ ssList(u)
| ~ ssList(v)
| ~ ssList(w)
| ~ equal(app(w,u),skc4)
| ~ equal(app(w,app(v,u)),skc5) ),
inference(rew,[status(thm),theory(equality)],[153,181]),
[iquote('0:Rew:153.3,181.3')] ).
cnf(257,plain,
( ~ ssList(u)
| ~ ssList(v)
| ~ equal(app(skc4,app(u,v)),skc5)
| ~ equal(app(skc4,v),skc4) ),
inference(res,[status(thm),theory(equality)],[2,247]),
[iquote('0:Res:2.0,247.0')] ).
cnf(279,plain,
( ~ ssList(u)
| ~ ssList(v)
| equal(app(app(skc4,u),v),app(skc4,app(u,v))) ),
inference(res,[status(thm),theory(equality)],[2,153]),
[iquote('0:Res:2.0,153.0')] ).
cnf(500,plain,
equal(app(skc5,skc4),skc5),
inference(res,[status(thm),theory(equality)],[1,211]),
[iquote('0:Res:1.0,211.0')] ).
cnf(627,plain,
( ~ ssList(u)
| ~ ssList(v)
| equal(app(skc4,app(v,u)),app(v,u)) ),
inference(rew,[status(thm),theory(equality)],[212,279]),
[iquote('0:Rew:212.1,279.2')] ).
cnf(651,plain,
( ~ ssList(u)
| ~ ssList(v)
| ~ equal(u,skc4)
| ~ equal(app(v,u),skc5) ),
inference(rew,[status(thm),theory(equality)],[212,257,627]),
[iquote('0:Rew:212.1,257.3,627.2,257.2')] ).
cnf(15297,plain,
( ~ ssList(skc4)
| ~ ssList(skc5)
| ~ equal(skc4,skc4)
| ~ equal(skc5,skc5) ),
inference(spl,[status(thm),theory(equality)],[500,651]),
[iquote('0:SpL:500.0,651.3')] ).
cnf(16449,plain,
( ~ ssList(skc4)
| ~ ssList(skc5) ),
inference(obv,[status(thm),theory(equality)],[15297]),
[iquote('0:Obv:15297.3')] ).
cnf(16450,plain,
$false,
inference(ssi,[status(thm)],[16449,1,191,192,195,196,197,193,194,2]),
[iquote('0:SSi:16449.1,16449.0,1.0,191.0,192.0,195.0,196.0,197.0,193.0,194.0,2.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SWC007+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.11 % Command : run_spass %d %s
% 0.11/0.32 % Computer : n014.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Sat Jun 11 23:10:08 EDT 2022
% 0.11/0.32 % CPUTime :
% 11.64/11.86
% 11.64/11.86 SPASS V 3.9
% 11.64/11.86 SPASS beiseite: Proof found.
% 11.64/11.86 % SZS status Theorem
% 11.64/11.86 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 11.64/11.86 SPASS derived 9789 clauses, backtracked 1982 clauses, performed 8 splits and kept 4060 clauses.
% 11.64/11.86 SPASS allocated 113085 KBytes.
% 11.64/11.86 SPASS spent 0:0:10.27 on the problem.
% 11.64/11.86 0:00:00.04 for the input.
% 11.64/11.86 0:00:00.06 for the FLOTTER CNF translation.
% 11.64/11.86 0:00:00.17 for inferences.
% 11.64/11.86 0:00:00.20 for the backtracking.
% 11.64/11.86 0:00:09.58 for the reduction.
% 11.64/11.86
% 11.64/11.86
% 11.64/11.86 Here is a proof with depth 2, length 32 :
% 11.64/11.86 % SZS output start Refutation
% See solution above
% 11.64/11.86 Formulae used in the proof : co1 ax60 ax62 ax64 ax66 ax69 ax72 ax74 ax28 ax84 ax82
% 11.64/11.86
%------------------------------------------------------------------------------