TSTP Solution File: SWC097+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC097+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:42 EDT 2022
% Result : Theorem 1.81s 2.04s
% Output : Refutation 1.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 13 ( 5 unt; 5 nHn; 13 RR)
% Number of literals : 25 ( 0 equ; 9 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(51,axiom,
ssItem(skf44(u,v)),
file('SWC097+1.p',unknown),
[] ).
cnf(59,axiom,
( skP0(u,v)
| neq(v,nil) ),
file('SWC097+1.p',unknown),
[] ).
cnf(68,axiom,
( ~ skP0(skc4,skc5)
| neq(skc5,nil) ),
file('SWC097+1.p',unknown),
[] ).
cnf(78,axiom,
( ~ neq(skc5,nil)
| ~ skP0(skc4,skc5) ),
file('SWC097+1.p',unknown),
[] ).
cnf(103,axiom,
( skP0(u,v)
| equal(app(u,cons(skf44(v,u),nil)),v) ),
file('SWC097+1.p',unknown),
[] ).
cnf(118,axiom,
( ~ ssItem(u)
| ~ equal(app(v,cons(u,nil)),w)
| skP0(v,w) ),
file('SWC097+1.p',unknown),
[] ).
cnf(195,plain,
neq(skc5,nil),
inference(mrr,[status(thm)],[68,59]),
[iquote('0:MRR:68.0,59.1')] ).
cnf(196,plain,
~ skP0(skc4,skc5),
inference(mrr,[status(thm)],[78,195]),
[iquote('0:MRR:78.0,195.0')] ).
cnf(5760,plain,
( ~ ssItem(skf44(u,v))
| ~ equal(u,w)
| skP0(v,u)
| skP0(v,w) ),
inference(spl,[status(thm),theory(equality)],[103,118]),
[iquote('0:SpL:103.1,118.1')] ).
cnf(5761,plain,
( ~ equal(u,v)
| skP0(w,u)
| skP0(w,v) ),
inference(ssi,[status(thm)],[5760,51]),
[iquote('0:SSi:5760.0,51.0')] ).
cnf(6438,plain,
( skP0(u,v)
| skP0(u,v) ),
inference(eqr,[status(thm),theory(equality)],[5761]),
[iquote('0:EqR:5761.0')] ).
cnf(6439,plain,
skP0(u,v),
inference(obv,[status(thm),theory(equality)],[6438]),
[iquote('0:Obv:6438.0')] ).
cnf(6440,plain,
$false,
inference(unc,[status(thm)],[6439,196]),
[iquote('0:UnC:6439.0,196.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SWC097+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.11 % Command : run_spass %d %s
% 0.11/0.31 % Computer : n032.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 600
% 0.11/0.31 % DateTime : Sun Jun 12 23:47:41 EDT 2022
% 0.11/0.32 % CPUTime :
% 1.81/2.04
% 1.81/2.04 SPASS V 3.9
% 1.81/2.04 SPASS beiseite: Proof found.
% 1.81/2.04 % SZS status Theorem
% 1.81/2.04 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.81/2.04 SPASS derived 4929 clauses, backtracked 1550 clauses, performed 44 splits and kept 4310 clauses.
% 1.81/2.04 SPASS allocated 101910 KBytes.
% 1.81/2.04 SPASS spent 0:00:01.65 on the problem.
% 1.81/2.04 0:00:00.02 for the input.
% 1.81/2.04 0:00:00.05 for the FLOTTER CNF translation.
% 1.81/2.04 0:00:00.04 for inferences.
% 1.81/2.04 0:00:00.03 for the backtracking.
% 1.81/2.04 0:00:01.35 for the reduction.
% 1.81/2.04
% 1.81/2.04
% 1.81/2.04 Here is a proof with depth 2, length 13 :
% 1.81/2.04 % SZS output start Refutation
% See solution above
% 1.81/2.04 Formulae used in the proof : co1 ax2
% 1.81/2.04
%------------------------------------------------------------------------------