TSTP Solution File: SWC047+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC047+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n028.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:21 EDT 2022
% Result : Theorem 0.49s 0.73s
% Output : Refutation 0.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of clauses : 19 ( 10 unt; 3 nHn; 19 RR)
% Number of literals : 34 ( 0 equ; 18 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
ssList(skc3),
file('SWC047+1.p',unknown),
[] ).
cnf(57,axiom,
( skP0(u)
| equal(nil,u) ),
file('SWC047+1.p',unknown),
[] ).
cnf(58,axiom,
( ~ skP0(skc3)
| neq(skc3,nil) ),
file('SWC047+1.p',unknown),
[] ).
cnf(59,axiom,
( ~ equal(nil,u)
| skP0(u) ),
file('SWC047+1.p',unknown),
[] ).
cnf(63,axiom,
( ~ ssList(u)
| rearsegP(u,u) ),
file('SWC047+1.p',unknown),
[] ).
cnf(115,axiom,
( ~ ssList(u)
| ~ neq(u,nil)
| ~ rearsegP(skc3,u)
| ~ skP0(skc3) ),
file('SWC047+1.p',unknown),
[] ).
cnf(129,axiom,
( ~ ssList(u)
| ~ ssList(v)
| equal(nil,v)
| equal(hd(app(v,u)),hd(v)) ),
file('SWC047+1.p',unknown),
[] ).
cnf(239,plain,
( ~ ssList(u)
| equal(skc3,nil)
| equal(hd(app(skc3,u)),hd(skc3)) ),
inference(res,[status(thm),theory(equality)],[1,129]),
[iquote('0:Res:1.0,129.0')] ).
cnf(243,plain,
( ~ neq(skc3,nil)
| ~ rearsegP(skc3,skc3)
| ~ skP0(skc3) ),
inference(res,[status(thm),theory(equality)],[1,115]),
[iquote('0:Res:1.0,115.0')] ).
cnf(277,plain,
rearsegP(skc3,skc3),
inference(res,[status(thm),theory(equality)],[1,63]),
[iquote('0:Res:1.0,63.0')] ).
cnf(398,plain,
~ skP0(skc3),
inference(mrr,[status(thm)],[243,58,277]),
[iquote('0:MRR:243.0,243.1,58.1,277.0')] ).
cnf(399,plain,
equal(skc3,nil),
inference(spt,[spt(split,[position(s1)])],[239]),
[iquote('1:Spt:239.1')] ).
cnf(501,plain,
~ skP0(nil),
inference(rew,[status(thm),theory(equality)],[399,398]),
[iquote('1:Rew:399.0,398.0')] ).
cnf(653,plain,
~ equal(nil,nil),
inference(res,[status(thm),theory(equality)],[59,501]),
[iquote('1:Res:59.1,501.0')] ).
cnf(654,plain,
$false,
inference(obv,[status(thm),theory(equality)],[653]),
[iquote('1:Obv:653.0')] ).
cnf(655,plain,
~ equal(skc3,nil),
inference(spt,[spt(split,[position(sa)])],[654,399]),
[iquote('1:Spt:654.0,239.1,399.0')] ).
cnf(656,plain,
( ~ ssList(u)
| equal(hd(app(skc3,u)),hd(skc3)) ),
inference(spt,[spt(split,[position(s2)])],[239]),
[iquote('1:Spt:654.0,239.0,239.2')] ).
cnf(685,plain,
equal(skc3,nil),
inference(res,[status(thm),theory(equality)],[57,398]),
[iquote('0:Res:57.0,398.0')] ).
cnf(686,plain,
$false,
inference(mrr,[status(thm)],[685,655]),
[iquote('1:MRR:685.0,655.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC047+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n028.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 : Sun Jun 12 22:59:07 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.49/0.73
% 0.49/0.73 SPASS V 3.9
% 0.49/0.73 SPASS beiseite: Proof found.
% 0.49/0.73 % SZS status Theorem
% 0.49/0.73 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.49/0.73 SPASS derived 369 clauses, backtracked 166 clauses, performed 6 splits and kept 609 clauses.
% 0.49/0.73 SPASS allocated 98469 KBytes.
% 0.49/0.73 SPASS spent 0:00:00.37 on the problem.
% 0.49/0.73 0:00:00.04 for the input.
% 0.49/0.73 0:00:00.07 for the FLOTTER CNF translation.
% 0.49/0.73 0:00:00.00 for inferences.
% 0.49/0.73 0:00:00.00 for the backtracking.
% 0.49/0.73 0:00:00.15 for the reduction.
% 0.49/0.73
% 0.49/0.73
% 0.49/0.73 Here is a proof with depth 2, length 19 :
% 0.49/0.73 % SZS output start Refutation
% See solution above
% 0.49/0.73 Formulae used in the proof : co1 ax49 ax85
% 0.49/0.73
%------------------------------------------------------------------------------