TSTP Solution File: SWC010+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC010+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:04 EDT 2022
% Result : Theorem 7.42s 7.62s
% Output : Refutation 7.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of clauses : 18 ( 7 unt; 8 nHn; 18 RR)
% Number of literals : 46 ( 0 equ; 22 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 8 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(51,axiom,
ssList(skf48(u,v)),
file('SWC010+1.p',unknown),
[] ).
cnf(52,axiom,
ssList(skf47(u,v)),
file('SWC010+1.p',unknown),
[] ).
cnf(53,axiom,
ssItem(skf46(u,v)),
file('SWC010+1.p',unknown),
[] ).
cnf(61,axiom,
( skP0(u,v)
| neq(v,nil) ),
file('SWC010+1.p',unknown),
[] ).
cnf(70,axiom,
( ~ skP0(skc4,skc5)
| neq(skc5,nil) ),
file('SWC010+1.p',unknown),
[] ).
cnf(80,axiom,
( ~ neq(skc5,nil)
| ~ skP0(skc4,skc5) ),
file('SWC010+1.p',unknown),
[] ).
cnf(105,axiom,
( skP0(u,v)
| equal(app(skf47(v,u),skf48(u,v)),u) ),
file('SWC010+1.p',unknown),
[] ).
cnf(143,axiom,
( skP0(u,v)
| equal(app(app(skf47(v,u),cons(skf46(u,v),nil)),skf48(u,v)),v) ),
file('SWC010+1.p',unknown),
[] ).
cnf(191,axiom,
( ~ ssList(u)
| ~ ssList(v)
| ~ ssItem(w)
| ~ equal(app(v,u),x)
| ~ equal(app(app(v,cons(w,nil)),u),y)
| skP0(x,y) ),
file('SWC010+1.p',unknown),
[] ).
cnf(199,plain,
neq(skc5,nil),
inference(mrr,[status(thm)],[70,61]),
[iquote('0:MRR:70.0,61.1')] ).
cnf(200,plain,
~ skP0(skc4,skc5),
inference(mrr,[status(thm)],[80,199]),
[iquote('0:MRR:80.0,199.0')] ).
cnf(11395,plain,
( ~ ssList(skf48(u,v))
| ~ ssList(skf47(v,u))
| ~ ssItem(skf46(u,v))
| ~ equal(app(skf47(v,u),skf48(u,v)),w)
| ~ equal(v,x)
| skP0(u,v)
| skP0(w,x) ),
inference(spl,[status(thm),theory(equality)],[143,191]),
[iquote('0:SpL:143.1,191.4')] ).
cnf(11411,plain,
( ~ ssList(skf48(u,v))
| ~ ssList(skf47(v,u))
| ~ ssItem(skf46(u,v))
| ~ equal(u,w)
| ~ equal(v,x)
| skP0(u,v)
| skP0(w,x) ),
inference(rew,[status(thm),theory(equality)],[105,11395]),
[iquote('0:Rew:105.1,11395.3')] ).
cnf(11412,plain,
( ~ equal(u,v)
| ~ equal(w,x)
| skP0(u,w)
| skP0(v,x) ),
inference(ssi,[status(thm)],[11411,53,52,51]),
[iquote('0:SSi:11411.2,11411.1,11411.0,53.0,52.0,51.0')] ).
cnf(15416,plain,
( ~ equal(u,v)
| skP0(w,u)
| skP0(w,v) ),
inference(eqr,[status(thm),theory(equality)],[11412]),
[iquote('0:EqR:11412.0')] ).
cnf(15417,plain,
( skP0(u,v)
| skP0(u,v) ),
inference(eqr,[status(thm),theory(equality)],[15416]),
[iquote('0:EqR:15416.0')] ).
cnf(15418,plain,
skP0(u,v),
inference(obv,[status(thm),theory(equality)],[15417]),
[iquote('0:Obv:15417.0')] ).
cnf(15419,plain,
$false,
inference(unc,[status(thm)],[15418,200]),
[iquote('0:UnC:15418.0,200.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.10 % Problem : SWC010+1 : TPTP v8.1.0. Released v2.4.0.
% 0.10/0.11 % Command : run_spass %d %s
% 0.11/0.30 % Computer : n032.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30 % CPULimit : 300
% 0.11/0.30 % WCLimit : 600
% 0.11/0.30 % DateTime : Sun Jun 12 17:41:11 EDT 2022
% 0.11/0.31 % CPUTime :
% 7.42/7.62
% 7.42/7.62 SPASS V 3.9
% 7.42/7.62 SPASS beiseite: Proof found.
% 7.42/7.62 % SZS status Theorem
% 7.42/7.62 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.42/7.62 SPASS derived 10629 clauses, backtracked 1696 clauses, performed 49 splits and kept 6357 clauses.
% 7.42/7.62 SPASS allocated 110813 KBytes.
% 7.42/7.62 SPASS spent 0:00:06.64 on the problem.
% 7.42/7.62 0:00:00.03 for the input.
% 7.42/7.62 0:00:00.04 for the FLOTTER CNF translation.
% 7.42/7.62 0:00:00.13 for inferences.
% 7.42/7.62 0:00:00.16 for the backtracking.
% 7.42/7.62 0:00:06.04 for the reduction.
% 7.42/7.62
% 7.42/7.62
% 7.42/7.62 Here is a proof with depth 3, length 18 :
% 7.42/7.62 % SZS output start Refutation
% See solution above
% 7.42/7.62 Formulae used in the proof : co1 ax2 ax17
% 7.42/7.62
%------------------------------------------------------------------------------