TSTP Solution File: NUN066+2 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : NUN066+2 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n017.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 : Mon Jul 18 16:38:44 EDT 2022
% Result : Theorem 0.19s 0.43s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of clauses : 19 ( 11 unt; 3 nHn; 19 RR)
% Number of literals : 28 ( 0 equ; 12 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
r1(skf16(u)),
file('NUN066+2.p',unknown),
[] ).
cnf(5,axiom,
r2(skf16(u),skf15(u)),
file('NUN066+2.p',unknown),
[] ).
cnf(10,axiom,
( r1(u)
| r2(skf15(u),u) ),
file('NUN066+2.p',unknown),
[] ).
cnf(11,axiom,
( equal(u,skc1)
| skP0(skc1,u) ),
file('NUN066+2.p',unknown),
[] ).
cnf(16,axiom,
( ~ r1(u)
| ~ skP0(v,u) ),
file('NUN066+2.p',unknown),
[] ).
cnf(18,axiom,
( ~ r1(u)
| ~ r2(v,u) ),
file('NUN066+2.p',unknown),
[] ).
cnf(33,axiom,
( ~ r2(u,v)
| ~ r2(w,v)
| equal(w,u) ),
file('NUN066+2.p',unknown),
[] ).
cnf(36,plain,
~ skP0(u,skf16(v)),
inference(res,[status(thm),theory(equality)],[1,16]),
[iquote('0:Res:1.0,16.0')] ).
cnf(37,plain,
~ r2(u,skf16(v)),
inference(res,[status(thm),theory(equality)],[1,18]),
[iquote('0:Res:1.0,18.0')] ).
cnf(38,plain,
( ~ r2(u,skf15(v))
| equal(skf16(v),u) ),
inference(res,[status(thm),theory(equality)],[5,33]),
[iquote('0:Res:5.0,33.0')] ).
cnf(40,plain,
~ r1(skf15(u)),
inference(res,[status(thm),theory(equality)],[5,18]),
[iquote('0:Res:5.0,18.1')] ).
cnf(46,plain,
equal(skf16(u),skc1),
inference(res,[status(thm),theory(equality)],[11,36]),
[iquote('0:Res:11.1,36.0')] ).
cnf(48,plain,
~ r2(u,skc1),
inference(rew,[status(thm),theory(equality)],[46,37]),
[iquote('0:Rew:46.0,37.0')] ).
cnf(50,plain,
r2(skc1,skf15(u)),
inference(rew,[status(thm),theory(equality)],[46,5]),
[iquote('0:Rew:46.0,5.0')] ).
cnf(52,plain,
( ~ r2(u,skf15(v))
| equal(skc1,u) ),
inference(rew,[status(thm),theory(equality)],[46,38]),
[iquote('0:Rew:46.0,38.1')] ).
cnf(81,plain,
( r1(skf15(u))
| equal(skf15(skf15(u)),skc1) ),
inference(res,[status(thm),theory(equality)],[10,52]),
[iquote('0:Res:10.1,52.0')] ).
cnf(83,plain,
equal(skf15(skf15(u)),skc1),
inference(mrr,[status(thm)],[81,40]),
[iquote('0:MRR:81.0,40.0')] ).
cnf(86,plain,
r2(skc1,skc1),
inference(spr,[status(thm),theory(equality)],[83,50]),
[iquote('0:SpR:83.0,50.0')] ).
cnf(93,plain,
$false,
inference(mrr,[status(thm)],[86,48]),
[iquote('0:MRR:86.0,48.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : NUN066+2 : TPTP v8.1.0. Released v7.3.0.
% 0.06/0.12 % Command : run_spass %d %s
% 0.13/0.33 % Computer : n017.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Thu Jun 2 10:06:12 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.43
% 0.19/0.43 SPASS V 3.9
% 0.19/0.43 SPASS beiseite: Proof found.
% 0.19/0.43 % SZS status Theorem
% 0.19/0.43 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.43 SPASS derived 53 clauses, backtracked 0 clauses, performed 0 splits and kept 62 clauses.
% 0.19/0.43 SPASS allocated 97691 KBytes.
% 0.19/0.43 SPASS spent 0:00:00.09 on the problem.
% 0.19/0.43 0:00:00.03 for the input.
% 0.19/0.43 0:00:00.03 for the FLOTTER CNF translation.
% 0.19/0.43 0:00:00.00 for inferences.
% 0.19/0.43 0:00:00.00 for the backtracking.
% 0.19/0.43 0:00:00.00 for the reduction.
% 0.19/0.43
% 0.19/0.43
% 0.19/0.43 Here is a proof with depth 3, length 19 :
% 0.19/0.43 % SZS output start Refutation
% See solution above
% 0.19/0.43 Formulae used in the proof : nonzerononetwoexist axiom_1 axiom_5a axiom_1a axiom_7a axiom_3a
% 0.19/0.43
%------------------------------------------------------------------------------