%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : RNG125+4 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n007.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:26:43 AM UTC 2026
% Result : Theorem 0.10s 0.42s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of formulae : 8 ( 4 unt; 0 def)
% Number of atoms : 20 ( 4 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 20 ( 8 ~; 5 |; 7 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 4 ( 0 sgn 0 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__2383,axiom,
~ ( ( aDivisorOf0(xu,xb)
| doDivides0(xu,xb)
| ? [W0] :
( sdtasdt0(xu,W0) = xb
& aElement0(W0) ) )
& ( aDivisorOf0(xu,xa)
| doDivides0(xu,xa)
| ? [W0] :
( sdtasdt0(xu,W0) = xa
& aElement0(W0) ) ) ),
file('theBenchmark.p',m__2383) ).
fof(m__2479,axiom,
~ ~ ( doDivides0(xu,xa)
& ? [W0] :
( sdtasdt0(xu,W0) = xa
& aElement0(W0) ) ),
file('theBenchmark.p',m__2479) ).
fof(m__2612,axiom,
~ ~ ( doDivides0(xu,xb)
& ? [W0] :
( sdtasdt0(xu,W0) = xb
& aElement0(W0) ) ),
file('theBenchmark.p',m__2612) ).
cnf(c_241,plain,
( ~ doDivides0(xu,xb)
| ~ doDivides0(xu,xa) ),
inference(clausify,[status(thm)],[m__2383]) ).
cnf(c_251,plain,
doDivides0(xu,xa),
inference(clausify,[status(thm)],[m__2479]) ).
cnf(c_254,plain,
doDivides0(xu,xb),
inference(clausify,[status(thm)],[m__2612]) ).
cnf(c_357,plain,
~ doDivides0(xu,xb),
inference(resolve,[status(thm)],[c_251,c_241]) ).
cnf(c_356,plain,
$false,
inference(resolve,[status(thm)],[c_254,c_357]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : RNG125+4 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.37 % Computer : n007.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sat Sep 26 06:09:23 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.38 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/0.38 % Process 2967365 was started by sandbox2 on n007,
% 0.10/0.38 % Sat Sep 26 06:09:23 2026
% 0.10/0.38 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.10/0.39
% 0.10/0.39 % From the command line: assign(max_seconds, 300).
% 0.10/0.42
% 0.10/0.42 % SZS status Theorem for theBenchmark
% 0.10/0.42
% 0.10/0.42 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.10/0.42 % Length of proof is 7.
% 0.10/0.42 % Level of proof is 2.
% 0.10/0.42 % Maximum clause weight is 11.000.
% 0.10/0.42 % Given clauses 0.
% 0.10/0.42
% 0.10/0.42 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------