%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : NUM295+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n020.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun Sep 27 08:16:24 AM UTC 2026
% Result : Theorem 0.02s 0.49s
% Output : CNFRefutation 0.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 12 ( 9 unt; 0 def)
% Number of atoms : 17 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 12 ( 7 ~; 3 |; 1 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 20 ( 10 sgn 4 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(less_entry_point_neg_pos,axiom,
! [X,Y,RDN_X,RDN_Y] :
( ( rdn_translate(Y,rdn_pos(RDN_Y))
& rdn_translate(X,rdn_neg(RDN_X)) )
=> less(X,Y) ),
file('theBenchmark.p',less_entry_point_neg_pos) ).
fof(something_less_something,conjecture,
? [X,Y] : less(X,Y),
file('theBenchmark.p',something_less_something) ).
fof(something_less_something_neg,negated_conjecture,
~ ? [X,Y] : less(X,Y),
inference(assume_negation,[status(cth)],[something_less_something]) ).
fof(rdnn128,axiom,
rdn_translate(nn128,rdn_neg(rdn(rdnn(n8),rdn(rdnn(n2),rdnn(n1))))),
file('theBenchmark.p',rdnn128) ).
cnf(c_274,plain,
rdn_translate(nn128,rdn_neg(rdn(rdnn(n8),rdn(rdnn(n2),rdnn(n1))))),
inference(clausify,[status(thm)],[rdnn128]) ).
fof(rdn9,axiom,
rdn_translate(n9,rdn_pos(rdnn(n9))),
file('theBenchmark.p',rdn9) ).
cnf(c_290,plain,
rdn_translate(n9,rdn_pos(rdnn(n9))),
inference(clausify,[status(thm)],[rdn9]) ).
cnf(c_316,plain,
( less(A,C)
| ~ rdn_translate(C,rdn_pos(D))
| ~ rdn_translate(A,rdn_neg(B)) ),
inference(clausify,[status(thm)],[less_entry_point_neg_pos]) ).
cnf(c_435,negated_conjecture,
~ less(A,B),
inference(clausify,[status(thm)],[something_less_something_neg]) ).
cnf(c_462,negated_conjecture,
( ~ rdn_translate(C,rdn_pos(D))
| ~ rdn_translate(A,rdn_neg(B)) ),
inference(resolve,[status(thm)],[c_435,c_316]) ).
cnf(c_490,plain,
~ rdn_translate(A,rdn_pos(B)),
inference(resolve,[status(thm)],[c_462,c_274]) ).
cnf(c_491,plain,
$false,
inference(resolve,[status(thm)],[c_490,c_290]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM295+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.03 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.36 % Computer : n020.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Sat Sep 26 02:25:49 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.37 % Process 403738 was started by sandbox on n020,
% 0.09/0.37 % Sat Sep 26 02:25:49 2026
% 0.09/0.37 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.02/0.38
% 0.02/0.38 % From the command line: assign(max_seconds, 300).
% 0.02/0.38
% 0.02/0.38 % SInE: 152 to sos, 249 to usable, of 401 axioms (tolerance 2.00, depth 0 fixpoint).
% 0.02/0.49
% 0.02/0.49 % SZS status Theorem for theBenchmark
% 0.02/0.49
% 0.02/0.49 % Proof 1 at 0.02 (+ 0.01) seconds.
% 0.02/0.49 % Length of proof is 9.
% 0.02/0.49 % Level of proof is 4.
% 0.02/0.49 % Maximum clause weight is 120.000.
% 0.02/0.49 % Given clauses 7.
% 0.02/0.49
% 0.02/0.49 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------