%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : HEN007-6 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n010.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 07:32:00 AM UTC 2026
% Result : Unsatisfiable 0.15s 10.71s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of formulae : 30 ( 17 unt; 0 def)
% Number of atoms : 59 ( 0 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 61 ( 32 ~; 29 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 55 ( 4 sgn 19 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(quotient_less_equal,axiom,
! [VAR_0,VAR_1] :
( quotient(VAR_0,VAR_1,zero)
| ~ less_equal(VAR_0,VAR_1) ),
file('theBenchmark.p',quotient_less_equal) ).
cnf(c_1,plain,
( quotient(A,B,zero)
| ~ less_equal(A,B) ),
inference(clausify,[status(thm)],[quotient_less_equal]) ).
fof(divisor_existence,axiom,
! [VAR_0,VAR_1,VAR_2] :
( less_equal(VAR_2,VAR_0)
| ~ quotient(VAR_0,VAR_1,VAR_2) ),
file('theBenchmark.p',divisor_existence) ).
cnf(c_3,plain,
( less_equal(C,A)
| ~ quotient(A,B,C) ),
inference(clausify,[status(thm)],[divisor_existence]) ).
fof(quotient_property,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3,VAR_4,VAR_5,VAR_6,VAR_7] :
( less_equal(VAR_6,VAR_7)
| ~ quotient(VAR_2,VAR_3,VAR_7)
| ~ quotient(VAR_5,VAR_4,VAR_6)
| ~ quotient(VAR_0,VAR_3,VAR_5)
| ~ quotient(VAR_1,VAR_3,VAR_4)
| ~ quotient(VAR_0,VAR_1,VAR_2) ),
file('theBenchmark.p',quotient_property) ).
cnf(c_4,plain,
( less_equal(V6,V7)
| ~ quotient(C,D,V7)
| ~ quotient(F,E,V6)
| ~ quotient(A,D,F)
| ~ quotient(B,D,E)
| ~ quotient(A,B,C) ),
inference(clausify,[status(thm)],[quotient_property]) ).
fof(closure,axiom,
! [VAR_0,VAR_1] : quotient(VAR_0,VAR_1,divide(VAR_0,VAR_1)),
file('theBenchmark.p',closure) ).
cnf(c_8,plain,
quotient(A,B,divide(A,B)),
inference(clausify,[status(thm)],[closure]) ).
fof(x_divde_zero_is_x,axiom,
! [VAR_0] : quotient(VAR_0,zero,VAR_0),
file('theBenchmark.p',x_divde_zero_is_x) ).
cnf(c_13,plain,
quotient(A,zero,A),
inference(clausify,[status(thm)],[x_divde_zero_is_x]) ).
fof(transitivity_of_less_equal,axiom,
! [VAR_0,VAR_1,VAR_2] :
( less_equal(VAR_0,VAR_2)
| ~ less_equal(VAR_1,VAR_2)
| ~ less_equal(VAR_0,VAR_1) ),
file('theBenchmark.p',transitivity_of_less_equal) ).
cnf(c_14,plain,
( less_equal(A,C)
| ~ less_equal(B,C)
| ~ less_equal(A,B) ),
inference(clausify,[status(thm)],[transitivity_of_less_equal]) ).
fof(xLEy,axiom,
less_equal(x,y),
file('theBenchmark.p',xLEy) ).
cnf(c_15,plain,
less_equal(x,y),
inference(clausify,[status(thm)],[xLEy]) ).
fof(zQy,axiom,
quotient(z,y,zQy),
file('theBenchmark.p',zQy) ).
cnf(c_16,plain,
quotient(z,y,zQy),
inference(clausify,[status(thm)],[zQy]) ).
fof(zQx,axiom,
quotient(z,x,zQx),
file('theBenchmark.p',zQx) ).
cnf(c_17,plain,
quotient(z,x,zQx),
inference(clausify,[status(thm)],[zQx]) ).
fof(prove_zQyLEzQx,axiom,
~ less_equal(zQy,zQx),
file('theBenchmark.p',prove_zQyLEzQx) ).
cnf(c_18,plain,
~ less_equal(zQy,zQx),
inference(clausify,[status(thm)],[prove_zQyLEzQx]) ).
cnf(c_20,plain,
less_equal(divide(A,B),A),
inference(resolve,[status(thm)],[c_3,c_8]) ).
cnf(c_33,plain,
quotient(x,y,zero),
inference(resolve,[status(thm)],[c_1,c_15]) ).
cnf(c_117,plain,
( less_equal(A,B)
| ~ less_equal(A,divide(B,C)) ),
inference(resolve,[status(thm)],[c_14,c_20]) ).
cnf(c_69,plain,
~ less_equal(zQy,divide(zQx,A)),
inference(resolve,[status(thm)],[c_117,c_18]) ).
cnf(c_118,plain,
( less_equal(D,E)
| ~ quotient(zQx,A,E)
| ~ quotient(C,B,D)
| ~ quotient(z,A,C)
| ~ quotient(x,A,B) ),
inference(resolve,[status(thm)],[c_4,c_17]) ).
cnf(c_119,plain,
( less_equal(B,C)
| ~ quotient(zQx,y,C)
| ~ quotient(A,zero,B)
| ~ quotient(z,y,A) ),
inference(resolve,[status(thm)],[c_118,c_33]) ).
cnf(c_120,plain,
( less_equal(A,B)
| ~ quotient(zQx,y,B)
| ~ quotient(zQy,zero,A) ),
inference(resolve,[status(thm)],[c_119,c_16]) ).
cnf(c_121,plain,
( less_equal(zQy,A)
| ~ quotient(zQx,y,A) ),
inference(resolve,[status(thm)],[c_120,c_13]) ).
cnf(c_115,plain,
less_equal(zQy,divide(zQx,y)),
inference(resolve,[status(thm)],[c_121,c_8]) ).
cnf(c_116,plain,
$false,
inference(resolve,[status(thm)],[c_115,c_69]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : HEN007-6 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/10.59 % Computer : n010.cluster.edu
% 0.09/10.59 % Model : x86_64 x86_64
% 0.09/10.59 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/10.59 % Memory : 8046.5625MB
% 0.09/10.59 % OS : Linux 6.8.0-71-generic
% 0.09/10.59 % CPULimit : 300
% 0.09/10.59 % WCLimit : 300
% 0.09/10.59 % DateTime : Fri Sep 25 15:57:43 UTC 2026
% 0.09/10.59 % CPUTime :
% 0.09/10.59 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/10.59 % Process 1160952 was started by sandbox on n010,
% 0.09/10.59 % Fri Sep 25 15:57:43 2026
% 0.09/10.59 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.09/10.60
% 0.09/10.60 % From the command line: assign(max_seconds, 300).
% 0.15/10.71
% 0.15/10.71 % SZS status Unsatisfiable for theBenchmark
% 0.15/10.71
% 0.15/10.71 % Proof 1 at 0.07 (+ 0.04) seconds.
% 0.15/10.71 % Length of proof is 15.
% 0.15/10.71 % Level of proof is 3.
% 0.15/10.71 % Maximum clause weight is 28.000.
% 0.15/10.71 % Given clauses 29.
% 0.15/10.71
% 0.15/10.71 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------