%------------------------------------------------------------------------------
% File : hopCoP---0.1
% Problem : NUM299+1 : TPTP v9.0.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n019.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 : 300s
% DateTime : Fri Jul 25 12:27:53 PM UTC 2025
% Result : Theorem 0.12s 0.37s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 8
% Syntax : Number of formulae : 26 ( 17 unt; 0 def)
% Number of atoms : 45 ( 1 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 38 ( 19 ~; 12 |; 4 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-1 aty)
% Number of variables : 18 ( 0 sgn 9 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(nn2_not_less_nn4,plain,
~ less(nn2,nn4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',nn2_not_less_nn4) ).
fof(nn2_not_less_nn4_negated,plain,
~ ~ less(nn2,nn4),
inference(negate_conjecture,[status(cth)],[nn2_not_less_nn4]) ).
cnf(406,plain,
less(nn2,nn4),
inference(cnf,[status(esa)],[nn2_not_less_nn4_negated]) ).
cnf(l0,plain,
less(nn2,nn4),
inference(instantiation,[status(thm)],[406]) ).
fof(less_property,plain,
! [X,Y] :
( less(X,Y)
<=> ( ~ less(Y,X)
& Y != X ) ),
file('Axioms/NUM005+1.ax',less_property) ).
cnf(283,plain,
( ~ less(X0,X1)
| ~ less(X1,X0) ),
inference(cnf,[status(esa)],[less_property]) ).
cnf(l1,plain,
( ~ less(nn2,nn4)
| ~ less(nn4,nn2) ),
inference(instantiation,[status(thm)],[283]) ).
fof(less_entry_point_neg_neg,plain,
! [X,Y,RDN_X,RDN_Y] :
( ( rdn_translate(X,rdn_neg(RDN_X))
& rdn_translate(Y,rdn_neg(RDN_Y))
& rdn_positive_less(RDN_Y,RDN_X) )
=> less(X,Y) ),
file('Axioms/NUM005+1.ax',less_entry_point_neg_neg) ).
cnf(282,plain,
( ~ rdn_translate(X0,rdn_neg(X1))
| ~ rdn_translate(X2,rdn_neg(X3))
| ~ rdn_positive_less(X3,X1)
| less(X0,X2) ),
inference(cnf,[status(esa)],[less_entry_point_neg_neg]) ).
cnf(l2,plain,
( ~ rdn_translate(nn4,rdn_neg(rdnn(n4)))
| ~ rdn_translate(nn2,rdn_neg(rdnn(n2)))
| ~ rdn_positive_less(rdnn(n2),rdnn(n4))
| less(nn4,nn2) ),
inference(instantiation,[status(thm)],[282]) ).
fof(rdnn2,plain,
rdn_translate(nn2,rdn_neg(rdnn(n2))),
file('Axioms/NUM005+0.ax',rdnn2) ).
cnf(129,plain,
rdn_translate(nn2,rdn_neg(rdnn(n2))),
inference(cnf,[status(esa)],[rdnn2]) ).
cnf(l6,plain,
rdn_translate(nn2,rdn_neg(rdnn(n2))),
inference(instantiation,[status(thm)],[129]) ).
fof(rdnn4,plain,
rdn_translate(nn4,rdn_neg(rdnn(n4))),
file('Axioms/NUM005+0.ax',rdnn4) ).
cnf(131,plain,
rdn_translate(nn4,rdn_neg(rdnn(n4))),
inference(cnf,[status(esa)],[rdnn4]) ).
cnf(l3,plain,
rdn_translate(nn4,rdn_neg(rdnn(n4))),
inference(instantiation,[status(thm)],[131]) ).
fof(rdn_positive_less_transitivity,plain,
! [X,Y,Z] :
( ( rdn_positive_less(rdnn(X),rdnn(Y))
& rdn_positive_less(rdnn(Y),rdnn(Z)) )
=> rdn_positive_less(rdnn(X),rdnn(Z)) ),
file('Axioms/NUM005+1.ax',rdn_positive_less_transitivity) ).
cnf(274,plain,
( ~ rdn_positive_less(rdnn(X0),rdnn(X1))
| ~ rdn_positive_less(rdnn(X1),rdnn(X2))
| rdn_positive_less(rdnn(X0),rdnn(X2)) ),
inference(cnf,[status(esa)],[rdn_positive_less_transitivity]) ).
cnf(l5,plain,
( ~ rdn_positive_less(rdnn(n2),rdnn(n3))
| ~ rdn_positive_less(rdnn(n3),rdnn(n4))
| rdn_positive_less(rdnn(n2),rdnn(n4)) ),
inference(instantiation,[status(thm)],[274]) ).
fof(rdn_positive_less34,plain,
rdn_positive_less(rdnn(n3),rdnn(n4)),
file('Axioms/NUM005+1.ax',rdn_positive_less34) ).
cnf(268,plain,
rdn_positive_less(rdnn(n3),rdnn(n4)),
inference(cnf,[status(esa)],[rdn_positive_less34]) ).
cnf(l12,plain,
rdn_positive_less(rdnn(n3),rdnn(n4)),
inference(instantiation,[status(thm)],[268]) ).
fof(rdn_positive_less23,plain,
rdn_positive_less(rdnn(n2),rdnn(n3)),
file('Axioms/NUM005+1.ax',rdn_positive_less23) ).
cnf(267,plain,
rdn_positive_less(rdnn(n2),rdnn(n3)),
inference(cnf,[status(esa)],[rdn_positive_less23]) ).
cnf(l13,plain,
rdn_positive_less(rdnn(n2),rdnn(n3)),
inference(instantiation,[status(thm)],[267]) ).
cnf(final,plain,
$false,
inference(ground_refutation,[status(thm)],[l0,l1,l2,l6,l3,l5,l12,l13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM299+1 : TPTP v9.0.0. Released v3.1.0.
% 0.07/0.13 % Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.34 % Computer : n019.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 : 300
% 0.12/0.34 % DateTime : Mon Jul 21 11:33:19 EDT 2025
% 0.12/0.34 % CPUTime :
% 0.12/0.35 % launching worker at depth: 3
% 0.12/0.35 % launching worker at depth: 2
% 0.12/0.35 % launching worker at depth: 1
% 0.12/0.35 % launching worker at depth: 4
% 0.12/0.35 % launching worker at depth: 5
% 0.12/0.35 % launching worker at depth: 6
% 0.12/0.35 % launching worker at depth: 7
% 0.12/0.35 % launching worker at depth: 8
% 0.12/0.35 % launching worker at depth: 9
% 0.12/0.35 % launching worker at depth: 10
% 0.12/0.37 % SZS status Theorem for theBenchmark
% 0.12/0.37 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------