TSTP Solution File: NUN068+2 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : NUN068+2 : TPTP v8.1.0. Released v7.3.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 : Mon Jul 18 16:38:45 EDT 2022
% Result : Theorem 0.18s 0.48s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of clauses : 30 ( 15 unt; 6 nHn; 30 RR)
% Number of literals : 46 ( 0 equ; 20 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
r1(skf14(u)),
file('NUN068+2.p',unknown),
[] ).
cnf(7,axiom,
r2(u,skf22(v,u)),
file('NUN068+2.p',unknown),
[] ).
cnf(9,axiom,
( r1(u)
| r2(skf14(u),u) ),
file('NUN068+2.p',unknown),
[] ).
cnf(10,axiom,
( equal(u,skc1)
| skP0(skc1,u) ),
file('NUN068+2.p',unknown),
[] ).
cnf(15,axiom,
( ~ r1(u)
| ~ skP0(v,u) ),
file('NUN068+2.p',unknown),
[] ).
cnf(17,axiom,
( ~ r1(u)
| ~ r2(v,u) ),
file('NUN068+2.p',unknown),
[] ).
cnf(19,axiom,
( r2(u,v)
| skP1(skf15(u),v,u) ),
file('NUN068+2.p',unknown),
[] ).
cnf(23,axiom,
( equal(u,skf15(v))
| skP1(skf15(v),u,v) ),
file('NUN068+2.p',unknown),
[] ).
cnf(24,axiom,
( ~ r2(u,v)
| ~ skP1(w,v,u) ),
file('NUN068+2.p',unknown),
[] ).
cnf(25,axiom,
( ~ equal(u,v)
| ~ skP1(v,u,w) ),
file('NUN068+2.p',unknown),
[] ).
cnf(32,axiom,
( ~ r2(u,v)
| ~ r2(w,v)
| equal(w,u) ),
file('NUN068+2.p',unknown),
[] ).
cnf(35,plain,
~ skP0(u,skf14(v)),
inference(res,[status(thm),theory(equality)],[1,15]),
[iquote('0:Res:1.0,15.0')] ).
cnf(36,plain,
~ r2(u,skf14(v)),
inference(res,[status(thm),theory(equality)],[1,17]),
[iquote('0:Res:1.0,17.0')] ).
cnf(39,plain,
equal(skf14(u),skc1),
inference(res,[status(thm),theory(equality)],[10,35]),
[iquote('0:Res:10.1,35.0')] ).
cnf(41,plain,
~ r2(u,skc1),
inference(rew,[status(thm),theory(equality)],[39,36]),
[iquote('0:Rew:39.0,36.0')] ).
cnf(43,plain,
( r1(u)
| r2(skc1,u) ),
inference(rew,[status(thm),theory(equality)],[39,9]),
[iquote('0:Rew:39.0,9.1')] ).
cnf(75,plain,
( ~ equal(u,skf15(v))
| r2(v,u) ),
inference(res,[status(thm),theory(equality)],[19,25]),
[iquote('0:Res:19.1,25.1')] ).
cnf(77,plain,
~ equal(skf15(u),skc1),
inference(res,[status(thm),theory(equality)],[75,41]),
[iquote('0:Res:75.1,41.0')] ).
cnf(78,plain,
( ~ r1(u)
| ~ equal(u,skf15(v)) ),
inference(res,[status(thm),theory(equality)],[75,17]),
[iquote('0:Res:75.1,17.1')] ).
cnf(80,plain,
( ~ r2(u,v)
| equal(v,skf15(u)) ),
inference(res,[status(thm),theory(equality)],[23,24]),
[iquote('0:Res:23.1,24.1')] ).
cnf(81,plain,
~ r1(skf15(u)),
inference(eqr,[status(thm),theory(equality)],[78]),
[iquote('0:EqR:78.1')] ).
cnf(83,plain,
equal(skf22(u,v),skf15(v)),
inference(res,[status(thm),theory(equality)],[7,80]),
[iquote('0:Res:7.0,80.0')] ).
cnf(85,plain,
( r1(u)
| equal(u,skf15(skc1)) ),
inference(res,[status(thm),theory(equality)],[43,80]),
[iquote('0:Res:43.1,80.0')] ).
cnf(91,plain,
r2(u,skf15(u)),
inference(rew,[status(thm),theory(equality)],[83,7]),
[iquote('0:Rew:83.0,7.0')] ).
cnf(101,plain,
equal(skf15(u),skf15(skc1)),
inference(sor,[status(thm)],[81,85]),
[iquote('0:SoR:81.0,85.0')] ).
cnf(126,plain,
equal(skf15(u),skf15(v)),
inference(spr,[status(thm),theory(equality)],[101]),
[iquote('0:SpR:101.0,101.0')] ).
cnf(136,plain,
r2(u,skf15(v)),
inference(spr,[status(thm),theory(equality)],[126,91]),
[iquote('0:SpR:126.0,91.0')] ).
cnf(468,plain,
( ~ r2(u,skf15(v))
| equal(u,w) ),
inference(res,[status(thm),theory(equality)],[136,32]),
[iquote('0:Res:136.0,32.0')] ).
cnf(472,plain,
equal(u,v),
inference(mrr,[status(thm)],[468,136]),
[iquote('0:MRR:468.0,136.0')] ).
cnf(473,plain,
$false,
inference(unc,[status(thm)],[472,77]),
[iquote('0:UnC:472.0,77.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUN068+2 : TPTP v8.1.0. Released v7.3.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.13/0.33 % Computer : n028.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 08:23:08 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.18/0.48
% 0.18/0.48 SPASS V 3.9
% 0.18/0.48 SPASS beiseite: Proof found.
% 0.18/0.48 % SZS status Theorem
% 0.18/0.48 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.48 SPASS derived 408 clauses, backtracked 0 clauses, performed 0 splits and kept 159 clauses.
% 0.18/0.48 SPASS allocated 97862 KBytes.
% 0.18/0.48 SPASS spent 0:00:00.13 on the problem.
% 0.18/0.48 0:00:00.04 for the input.
% 0.18/0.48 0:00:00.03 for the FLOTTER CNF translation.
% 0.18/0.48 0:00:00.01 for inferences.
% 0.18/0.48 0:00:00.00 for the backtracking.
% 0.18/0.48 0:00:00.03 for the reduction.
% 0.18/0.48
% 0.18/0.48
% 0.18/0.48 Here is a proof with depth 7, length 30 :
% 0.18/0.48 % SZS output start Refutation
% See solution above
% 0.18/0.48 Formulae used in the proof : nonzerosnononesexist axiom_1 axiom_5a axiom_2a axiom_7a axiom_2 axiom_3a
% 0.18/0.48
%------------------------------------------------------------------------------