%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : NUM295+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n008.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 14:25:13 EDT 2022
% Result : Theorem 0.41s 0.62s
% Output : Refutation 0.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 7 ( 5 unt; 0 nHn; 7 RR)
% Number of literals : 10 ( 0 equ; 6 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 8 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(10,axiom,
~ less(u,v),
file('NUM295+1.p',unknown),
[] ).
cnf(20,axiom,
rdn_translate(n9,rdn_pos(rdnn(n9))),
file('NUM295+1.p',unknown),
[] ).
cnf(358,axiom,
rdn_translate(nn100,rdn_neg(rdn(rdnn(n0),rdn(rdnn(n0),rdnn(n1))))),
file('NUM295+1.p',unknown),
[] ).
cnf(389,axiom,
( ~ rdn_translate(u,rdn_pos(v))
| ~ rdn_translate(w,rdn_neg(x))
| less(w,u) ),
file('NUM295+1.p',unknown),
[] ).
cnf(409,plain,
( ~ rdn_translate(u,rdn_neg(v))
| ~ rdn_translate(w,rdn_pos(x)) ),
inference(mrr,[status(thm)],[389,10]),
[iquote('0:MRR:389.2,10.0')] ).
cnf(414,plain,
~ rdn_translate(u,rdn_neg(v)),
inference(res,[status(thm),theory(equality)],[20,409]),
[iquote('0:Res:20.0,409.0')] ).
cnf(935,plain,
$false,
inference(unc,[status(thm)],[414,358]),
[iquote('0:UnC:414.0,358.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM295+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.12/0.34 % Computer : n008.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jul 7 06:11:23 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.41/0.62
% 0.41/0.62 SPASS V 3.9
% 0.41/0.62 SPASS beiseite: Proof found.
% 0.41/0.62 % SZS status Theorem
% 0.41/0.62 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.41/0.62 SPASS derived 514 clauses, backtracked 0 clauses, performed 0 splits and kept 397 clauses.
% 0.41/0.62 SPASS allocated 98719 KBytes.
% 0.41/0.62 SPASS spent 0:00:00.26 on the problem.
% 0.41/0.62 0:00:00.04 for the input.
% 0.41/0.62 0:00:00.10 for the FLOTTER CNF translation.
% 0.41/0.62 0:00:00.00 for inferences.
% 0.41/0.62 0:00:00.00 for the backtracking.
% 0.41/0.62 0:00:00.04 for the reduction.
% 0.41/0.62
% 0.41/0.62
% 0.41/0.62 Here is a proof with depth 1, length 7 :
% 0.41/0.62 % SZS output start Refutation
% See solution above
% 0.41/0.62 Formulae used in the proof : something_less_something rdn9 rdnn100 less_entry_point_neg_pos
% 0.41/0.62
%------------------------------------------------------------------------------