%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : NUN070+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:45 EDT 2022
% Result : Theorem 0.26s 0.64s
% Output : Refutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 14 ( 7 unt; 1 nHn; 14 RR)
% Number of literals : 29 ( 0 equ; 20 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
r1(skf22(u)),
file('NUN070+2.p',unknown),
[] ).
cnf(6,axiom,
r2(u,skf20(v,u)),
file('NUN070+2.p',unknown),
[] ).
cnf(7,axiom,
r3(u,skf22(u),u),
file('NUN070+2.p',unknown),
[] ).
cnf(8,axiom,
( equal(u,skc1)
| skP0(skc1,u) ),
file('NUN070+2.p',unknown),
[] ).
cnf(13,axiom,
( ~ r1(u)
| ~ skP0(v,u) ),
file('NUN070+2.p',unknown),
[] ).
cnf(33,axiom,
( ~ r1(u)
| ~ r1(v)
| ~ r1(w)
| ~ r2(v,x)
| ~ r3(x,u,y)
| ~ r2(w,y) ),
file('NUN070+2.p',unknown),
[] ).
cnf(46,plain,
( ~ r1(skf22(u))
| ~ r1(v)
| ~ r1(w)
| ~ r2(v,u)
| ~ r2(w,u) ),
inference(res,[status(thm),theory(equality)],[7,33]),
[iquote('0:Res:7.0,33.4')] ).
cnf(53,plain,
( ~ r1(skf22(u))
| ~ r1(v)
| ~ r2(v,u) ),
inference(con,[status(thm)],[46]),
[iquote('0:Con:46.2')] ).
cnf(54,plain,
( ~ r1(u)
| ~ r2(u,v) ),
inference(mrr,[status(thm)],[53,1]),
[iquote('0:MRR:53.0,1.0')] ).
cnf(55,plain,
( ~ r1(u)
| equal(u,skc1) ),
inference(res,[status(thm),theory(equality)],[8,13]),
[iquote('0:Res:8.1,13.1')] ).
cnf(57,plain,
equal(skf22(u),skc1),
inference(ems,[status(thm)],[55,1]),
[iquote('0:EmS:55.0,1.0')] ).
cnf(60,plain,
r1(skc1),
inference(rew,[status(thm),theory(equality)],[57,1]),
[iquote('0:Rew:57.0,1.0')] ).
cnf(73,plain,
~ r1(u),
inference(res,[status(thm),theory(equality)],[6,54]),
[iquote('0:Res:6.0,54.1')] ).
cnf(76,plain,
$false,
inference(unc,[status(thm)],[73,60]),
[iquote('0:UnC:73.0,60.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.32 % Problem : NUN070+2 : TPTP v8.1.0. Released v7.3.0.
% 0.11/0.32 % Command : run_spass %d %s
% 0.12/0.53 % Computer : n020.cluster.edu
% 0.12/0.53 % Model : x86_64 x86_64
% 0.12/0.53 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.53 % Memory : 8042.1875MB
% 0.12/0.53 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.53 % CPULimit : 300
% 0.12/0.53 % WCLimit : 600
% 0.12/0.53 % DateTime : Thu Jun 2 09:53:53 EDT 2022
% 0.12/0.53 % CPUTime :
% 0.26/0.64
% 0.26/0.64 SPASS V 3.9
% 0.26/0.64 SPASS beiseite: Proof found.
% 0.26/0.64 % SZS status Theorem
% 0.26/0.64 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.26/0.64 SPASS derived 39 clauses, backtracked 0 clauses, performed 0 splits and kept 46 clauses.
% 0.26/0.64 SPASS allocated 97734 KBytes.
% 0.26/0.64 SPASS spent 0:00:00.09 on the problem.
% 0.26/0.64 0:00:00.03 for the input.
% 0.26/0.64 0:00:00.03 for the FLOTTER CNF translation.
% 0.26/0.64 0:00:00.00 for inferences.
% 0.26/0.64 0:00:00.00 for the backtracking.
% 0.26/0.64 0:00:00.00 for the reduction.
% 0.26/0.64
% 0.26/0.64
% 0.26/0.64 Here is a proof with depth 2, length 14 :
% 0.26/0.64 % SZS output start Refutation
% See solution above
% 0.26/0.64 Formulae used in the proof : axiom_4a axiom_2a axiom_1 onepluszeroeqone
% 0.26/0.64
%------------------------------------------------------------------------------