%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : NUM293+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 : n026.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.17s 5.52s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% 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 : 11 ( 6 ~; 3 |; 1 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 15 ( 6 sgn 4 !; 2 ?)
% 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_n13,conjecture,
? [X] : less(X,n13),
file('theBenchmark.p',something_less_n13) ).
fof(something_less_n13_neg,negated_conjecture,
~ ? [X] : less(X,n13),
inference(assume_negation,[status(cth)],[something_less_n13]) ).
fof(rdnn128,axiom,
rdn_translate(nn128,rdn_neg(rdn(rdnn(n8),rdn(rdnn(n2),rdnn(n1))))),
file('theBenchmark.p',rdnn128) ).
cnf(c_273,plain,
rdn_translate(nn128,rdn_neg(rdn(rdnn(n8),rdn(rdnn(n2),rdnn(n1))))),
inference(clausify,[status(thm)],[rdnn128]) ).
fof(rdn13,axiom,
rdn_translate(n13,rdn_pos(rdn(rdnn(n3),rdnn(n1)))),
file('theBenchmark.p',rdn13) ).
cnf(c_290,plain,
rdn_translate(n13,rdn_pos(rdn(rdnn(n3),rdnn(n1)))),
inference(clausify,[status(thm)],[rdn13]) ).
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,n13),
inference(clausify,[status(thm)],[something_less_n13_neg]) ).
cnf(c_623,plain,
( less(A,n13)
| ~ rdn_translate(A,rdn_neg(B)) ),
inference(resolve,[status(thm)],[c_316,c_290]) ).
cnf(c_621,negated_conjecture,
~ rdn_translate(A,rdn_neg(B)),
inference(resolve,[status(thm)],[c_435,c_623]) ).
cnf(c_622,plain,
$false,
inference(resolve,[status(thm)],[c_621,c_273]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM293+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/5.40 % Computer : n026.cluster.edu
% 0.15/5.40 % Model : x86_64 x86_64
% 0.15/5.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/5.40 % Memory : 8046.5625MB
% 0.15/5.40 % OS : Linux 6.8.0-71-generic
% 0.15/5.40 % CPULimit : 300
% 0.15/5.40 % WCLimit : 300
% 0.15/5.40 % DateTime : Sat Sep 26 02:27:15 UTC 2026
% 0.15/5.40 % CPUTime :
% 0.15/5.41 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.15/5.41 % Process 4097677 was started by sandbox on n026,
% 0.15/5.41 % Sat Sep 26 02:27:15 2026
% 0.15/5.41 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.15/5.43
% 0.15/5.43 % From the command line: assign(max_seconds, 300).
% 0.15/5.43
% 0.15/5.43 % SInE: 153 to sos, 248 to usable, of 401 axioms (tolerance 2.00, depth 0 fixpoint).
% 0.17/5.52
% 0.17/5.52 % SZS status Theorem for theBenchmark
% 0.17/5.52
% 0.17/5.52 % Proof 1 at 0.05 (+ 0.02) seconds.
% 0.17/5.52 % Length of proof is 8.
% 0.17/5.52 % Level of proof is 3.
% 0.17/5.52 % Maximum clause weight is 11.000.
% 0.17/5.52 % Given clauses 16.
% 0.17/5.52
% 0.17/5.52 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------