TSTP Solution File: SWC026+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC026+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n024.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:11 EDT 2022
% Result : Theorem 0.67s 0.86s
% Output : Refutation 0.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 7
% Syntax : Number of clauses : 25 ( 11 unt; 4 nHn; 25 RR)
% Number of literals : 51 ( 0 equ; 28 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
ssList(skc4),
file('SWC026+1.p',unknown),
[] ).
cnf(58,axiom,
( skP0(u,v)
| equal(nil,v) ),
file('SWC026+1.p',unknown),
[] ).
cnf(67,axiom,
( ~ equal(nil,skc4)
| equal(nil,skc5) ),
file('SWC026+1.p',unknown),
[] ).
cnf(68,axiom,
( ~ equal(nil,skc5)
| equal(nil,skc4) ),
file('SWC026+1.p',unknown),
[] ).
cnf(69,axiom,
( ~ equal(nil,u)
| skP0(u,v) ),
file('SWC026+1.p',unknown),
[] ).
cnf(79,axiom,
( ~ skP0(skc5,skc4)
| ~ skP0(skc4,skc5) ),
file('SWC026+1.p',unknown),
[] ).
cnf(185,axiom,
( ~ ssList(u)
| ~ ssList(v)
| ~ equal(tl(u),tl(v))
| ~ equal(hd(u),hd(v))
| equal(u,v)
| equal(nil,v)
| equal(nil,u) ),
file('SWC026+1.p',unknown),
[] ).
cnf(282,plain,
( ~ ssList(u)
| ~ equal(tl(skc4),tl(u))
| ~ equal(hd(skc4),hd(u))
| equal(nil,u)
| equal(skc4,u)
| equal(nil,skc4) ),
inference(res,[status(thm),theory(equality)],[2,185]),
[iquote('0:Res:2.0,185.1')] ).
cnf(563,plain,
equal(nil,skc4),
inference(spt,[spt(split,[position(s1)])],[282]),
[iquote('1:Spt:282.5')] ).
cnf(588,plain,
( ~ equal(skc4,u)
| skP0(u,v) ),
inference(rew,[status(thm),theory(equality)],[563,69]),
[iquote('1:Rew:563.0,69.0')] ).
cnf(613,plain,
( ~ equal(nil,skc4)
| equal(skc5,skc4) ),
inference(rew,[status(thm),theory(equality)],[563,67]),
[iquote('1:Rew:563.0,67.1')] ).
cnf(691,plain,
( ~ equal(skc4,skc4)
| equal(skc5,skc4) ),
inference(rew,[status(thm),theory(equality)],[563,613]),
[iquote('1:Rew:563.0,613.0')] ).
cnf(692,plain,
equal(skc5,skc4),
inference(obv,[status(thm),theory(equality)],[691]),
[iquote('1:Obv:691.0')] ).
cnf(787,plain,
( ~ skP0(skc4,skc4)
| ~ skP0(skc4,skc5) ),
inference(rew,[status(thm),theory(equality)],[692,79]),
[iquote('1:Rew:692.0,79.0')] ).
cnf(878,plain,
( ~ skP0(skc4,skc4)
| ~ skP0(skc4,skc4) ),
inference(rew,[status(thm),theory(equality)],[692,787]),
[iquote('1:Rew:692.0,787.1')] ).
cnf(879,plain,
~ skP0(skc4,skc4),
inference(obv,[status(thm),theory(equality)],[878]),
[iquote('1:Obv:878.0')] ).
cnf(990,plain,
~ equal(skc4,skc4),
inference(res,[status(thm),theory(equality)],[588,879]),
[iquote('1:Res:588.1,879.0')] ).
cnf(991,plain,
$false,
inference(obv,[status(thm),theory(equality)],[990]),
[iquote('1:Obv:990.0')] ).
cnf(992,plain,
~ equal(nil,skc4),
inference(spt,[spt(split,[position(sa)])],[991,563]),
[iquote('1:Spt:991.0,282.5,563.0')] ).
cnf(993,plain,
( ~ ssList(u)
| ~ equal(tl(skc4),tl(u))
| ~ equal(hd(skc4),hd(u))
| equal(nil,u)
| equal(skc4,u) ),
inference(spt,[spt(split,[position(s2)])],[282]),
[iquote('1:Spt:991.0,282.0,282.1,282.2,282.3,282.4')] ).
cnf(999,plain,
~ equal(nil,skc5),
inference(mrr,[status(thm)],[68,992]),
[iquote('1:MRR:68.1,992.0')] ).
cnf(1061,plain,
( ~ skP0(skc4,skc5)
| equal(nil,skc4) ),
inference(res,[status(thm),theory(equality)],[58,79]),
[iquote('0:Res:58.0,79.0')] ).
cnf(1062,plain,
~ skP0(skc4,skc5),
inference(mrr,[status(thm)],[1061,992]),
[iquote('1:MRR:1061.1,992.0')] ).
cnf(1064,plain,
equal(nil,skc5),
inference(res,[status(thm),theory(equality)],[58,1062]),
[iquote('1:Res:58.0,1062.0')] ).
cnf(1065,plain,
$false,
inference(mrr,[status(thm)],[1064,999]),
[iquote('1:MRR:1064.0,999.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC026+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n024.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sat Jun 11 23:44:04 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.67/0.86
% 0.67/0.86 SPASS V 3.9
% 0.67/0.86 SPASS beiseite: Proof found.
% 0.67/0.86 % SZS status Theorem
% 0.67/0.86 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.67/0.86 SPASS derived 695 clauses, backtracked 332 clauses, performed 17 splits and kept 964 clauses.
% 0.67/0.86 SPASS allocated 98821 KBytes.
% 0.67/0.86 SPASS spent 0:00:00.50 on the problem.
% 0.67/0.86 0:00:00.04 for the input.
% 0.67/0.86 0:00:00.07 for the FLOTTER CNF translation.
% 0.67/0.86 0:00:00.00 for inferences.
% 0.67/0.86 0:00:00.00 for the backtracking.
% 0.67/0.86 0:00:00.20 for the reduction.
% 0.67/0.86
% 0.67/0.86
% 0.67/0.86 Here is a proof with depth 2, length 25 :
% 0.67/0.86 % SZS output start Refutation
% See solution above
% 0.67/0.86 Formulae used in the proof : co1 ax77
% 0.67/0.86
%------------------------------------------------------------------------------