TSTP Solution File: SWC041+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC041+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n011.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:18 EDT 2022
% Result : Theorem 0.66s 0.83s
% Output : Refutation 0.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 12 ( 8 unt; 0 nHn; 12 RR)
% Number of literals : 19 ( 0 equ; 11 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 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(skc7),
file('SWC041+1.p',unknown),
[] ).
cnf(3,axiom,
ssList(skc5),
file('SWC041+1.p',unknown),
[] ).
cnf(15,axiom,
equal(skc6,nil),
file('SWC041+1.p',unknown),
[] ).
cnf(54,axiom,
~ equal(skc5,nil),
file('SWC041+1.p',unknown),
[] ).
cnf(62,axiom,
equal(app(skc5,skc7),skc6),
file('SWC041+1.p',unknown),
[] ).
cnf(128,axiom,
( ~ ssList(u)
| ~ ssList(v)
| ~ equal(app(v,u),nil)
| equal(nil,v) ),
file('SWC041+1.p',unknown),
[] ).
cnf(196,plain,
equal(app(skc5,skc7),nil),
inference(rew,[status(thm),theory(equality)],[15,62]),
[iquote('0:Rew:15.0,62.0')] ).
cnf(249,plain,
( ~ ssList(u)
| ~ equal(app(skc5,u),nil)
| equal(skc5,nil) ),
inference(res,[status(thm),theory(equality)],[3,128]),
[iquote('0:Res:3.0,128.0')] ).
cnf(557,plain,
( ~ ssList(u)
| ~ equal(app(skc5,u),nil) ),
inference(mrr,[status(thm)],[249,54]),
[iquote('0:MRR:249.2,54.0')] ).
cnf(902,plain,
( ~ ssList(skc7)
| ~ equal(nil,nil) ),
inference(spl,[status(thm),theory(equality)],[196,557]),
[iquote('0:SpL:196.0,557.1')] ).
cnf(959,plain,
~ ssList(skc7),
inference(obv,[status(thm),theory(equality)],[902]),
[iquote('0:Obv:902.1')] ).
cnf(960,plain,
$false,
inference(ssi,[status(thm)],[959,1]),
[iquote('0:SSi:959.0,1.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWC041+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.14/0.35 % Computer : n011.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sun Jun 12 12:52:48 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.66/0.83
% 0.66/0.83 SPASS V 3.9
% 0.66/0.83 SPASS beiseite: Proof found.
% 0.66/0.83 % SZS status Theorem
% 0.66/0.83 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.66/0.83 SPASS derived 565 clauses, backtracked 258 clauses, performed 15 splits and kept 877 clauses.
% 0.66/0.83 SPASS allocated 98714 KBytes.
% 0.66/0.83 SPASS spent 0:00:00.46 on the problem.
% 0.66/0.83 0:00:00.04 for the input.
% 0.66/0.83 0:00:00.07 for the FLOTTER CNF translation.
% 0.66/0.83 0:00:00.00 for inferences.
% 0.66/0.83 0:00:00.00 for the backtracking.
% 0.66/0.83 0:00:00.19 for the reduction.
% 0.66/0.83
% 0.66/0.83
% 0.66/0.83 Here is a proof with depth 2, length 12 :
% 0.66/0.83 % SZS output start Refutation
% See solution above
% 0.66/0.83 Formulae used in the proof : co1 ax83
% 0.66/0.83
%------------------------------------------------------------------------------