TSTP Solution File: NUN060+2 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : NUN060+2 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n020.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:43 EDT 2022
% Result : Theorem 0.46s 0.66s
% Output : Refutation 0.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of clauses : 26 ( 11 unt; 3 nHn; 26 RR)
% Number of literals : 54 ( 0 equ; 35 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-4 aty)
% Number of functors : 13 ( 13 usr; 8 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
r1(skf22(u)),
file('NUN060+2.p',unknown),
[] ).
cnf(6,axiom,
r2(u,skf20(v,u)),
file('NUN060+2.p',unknown),
[] ).
cnf(8,axiom,
( equal(u,skc1)
| skP0(skc1,u) ),
file('NUN060+2.p',unknown),
[] ).
cnf(9,axiom,
r3(u,v,skf18(v,u)),
file('NUN060+2.p',unknown),
[] ).
cnf(13,axiom,
( ~ r1(u)
| ~ skP0(v,u) ),
file('NUN060+2.p',unknown),
[] ).
cnf(21,axiom,
( equal(u,skf13(v))
| skP1(skf13(v),u,v) ),
file('NUN060+2.p',unknown),
[] ).
cnf(22,axiom,
( ~ r2(u,v)
| ~ skP1(w,v,u) ),
file('NUN060+2.p',unknown),
[] ).
cnf(27,axiom,
( ~ r3(u,v,w)
| ~ skP2(x,w,v,u) ),
file('NUN060+2.p',unknown),
[] ).
cnf(31,axiom,
( equal(u,skf14(v,w))
| skP2(skf14(v,w),u,w,v) ),
file('NUN060+2.p',unknown),
[] ).
cnf(33,axiom,
( ~ r1(u)
| ~ r2(v,w)
| ~ r2(x,v)
| ~ r2(y,x)
| ~ r3(z,w,x1)
| ~ r2(u,y) ),
file('NUN060+2.p',unknown),
[] ).
cnf(40,plain,
( ~ r1(u)
| ~ r2(u,v)
| ~ r2(v,w)
| ~ r2(skf20(x,w),y)
| ~ r3(z,y,x1) ),
inference(res,[status(thm),theory(equality)],[6,33]),
[iquote('0:Res:6.0,33.2')] ).
cnf(53,plain,
( ~ r1(u)
| equal(u,skc1) ),
inference(res,[status(thm),theory(equality)],[8,13]),
[iquote('0:Res:8.1,13.1')] ).
cnf(55,plain,
equal(skf22(u),skc1),
inference(ems,[status(thm)],[53,1]),
[iquote('0:EmS:53.0,1.0')] ).
cnf(58,plain,
r1(skc1),
inference(rew,[status(thm),theory(equality)],[55,1]),
[iquote('0:Rew:55.0,1.0')] ).
cnf(87,plain,
( ~ r2(u,v)
| equal(v,skf13(u)) ),
inference(res,[status(thm),theory(equality)],[21,22]),
[iquote('0:Res:21.1,22.1')] ).
cnf(88,plain,
equal(skf20(u,v),skf13(v)),
inference(res,[status(thm),theory(equality)],[6,87]),
[iquote('0:Res:6.0,87.0')] ).
cnf(95,plain,
r2(u,skf13(u)),
inference(rew,[status(thm),theory(equality)],[88,6]),
[iquote('0:Rew:88.0,6.0')] ).
cnf(98,plain,
( ~ r1(u)
| ~ r2(u,v)
| ~ r2(v,w)
| ~ r2(skf13(w),x)
| ~ r3(y,x,z) ),
inference(rew,[status(thm),theory(equality)],[88,40]),
[iquote('0:Rew:88.0,40.3')] ).
cnf(381,plain,
( ~ r3(u,v,w)
| equal(w,skf14(u,v)) ),
inference(res,[status(thm),theory(equality)],[31,27]),
[iquote('0:Res:31.1,27.1')] ).
cnf(406,plain,
equal(skf18(u,v),skf14(v,u)),
inference(res,[status(thm),theory(equality)],[9,381]),
[iquote('0:Res:9.0,381.0')] ).
cnf(418,plain,
r3(u,v,skf14(u,v)),
inference(rew,[status(thm),theory(equality)],[406,9]),
[iquote('0:Rew:406.0,9.0')] ).
cnf(718,plain,
( ~ r1(u)
| ~ r2(u,v)
| ~ r2(v,w)
| ~ r3(x,skf13(skf13(w)),y) ),
inference(res,[status(thm),theory(equality)],[95,98]),
[iquote('0:Res:95.0,98.3')] ).
cnf(1270,plain,
( ~ r1(u)
| ~ r2(u,v)
| ~ r2(v,w) ),
inference(res,[status(thm),theory(equality)],[418,718]),
[iquote('0:Res:418.0,718.3')] ).
cnf(1794,plain,
( ~ r1(u)
| ~ r2(skf13(u),v) ),
inference(res,[status(thm),theory(equality)],[95,1270]),
[iquote('0:Res:95.0,1270.1')] ).
cnf(1818,plain,
~ r1(u),
inference(res,[status(thm),theory(equality)],[95,1794]),
[iquote('0:Res:95.0,1794.1')] ).
cnf(1821,plain,
$false,
inference(unc,[status(thm)],[1818,58]),
[iquote('0:UnC:1818.0,58.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.11 % Problem : NUN060+2 : TPTP v8.1.0. Released v7.3.0.
% 0.04/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n020.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jun 2 10:02:23 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.46/0.66
% 0.46/0.66 SPASS V 3.9
% 0.46/0.66 SPASS beiseite: Proof found.
% 0.46/0.66 % SZS status Theorem
% 0.46/0.66 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.46/0.66 SPASS derived 1367 clauses, backtracked 0 clauses, performed 0 splits and kept 647 clauses.
% 0.46/0.66 SPASS allocated 99300 KBytes.
% 0.46/0.66 SPASS spent 0:00:00.31 on the problem.
% 0.46/0.66 0:00:00.04 for the input.
% 0.46/0.66 0:00:00.03 for the FLOTTER CNF translation.
% 0.46/0.66 0:00:00.02 for inferences.
% 0.46/0.66 0:00:00.00 for the backtracking.
% 0.46/0.66 0:00:00.20 for the reduction.
% 0.46/0.66
% 0.46/0.66
% 0.46/0.66 Here is a proof with depth 5, length 26 :
% 0.46/0.66 % SZS output start Refutation
% See solution above
% 0.46/0.66 Formulae used in the proof : axiom_4a axiom_2a axiom_1 axiom_1a axiom_2 axiom_3 greq4
% 0.46/0.66
%------------------------------------------------------------------------------