%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : HEN005-3 : 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 : 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 07:31:58 AM UTC 2026
% Result : Unsatisfiable 0.10s 5.39s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of formulae : 29 ( 21 unt; 0 def)
% Number of atoms : 39 ( 13 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 26 ( 16 ~; 10 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 25 ( 2 sgn 10 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(quotient_less_equal1,axiom,
! [VAR_0,VAR_1] :
( divide(VAR_0,VAR_1) = zero
| ~ less_equal(VAR_0,VAR_1) ),
file('theBenchmark.p',quotient_less_equal1) ).
cnf(c_1,plain,
( divide(A,B) = zero
| ~ less_equal(A,B) ),
inference(clausify,[status(thm)],[quotient_less_equal1]) ).
fof(quotient_less_equal2,axiom,
! [VAR_0,VAR_1] :
( less_equal(VAR_0,VAR_1)
| divide(VAR_0,VAR_1) != zero ),
file('theBenchmark.p',quotient_less_equal2) ).
cnf(c_2,plain,
( less_equal(A,B)
| divide(A,B) != zero ),
inference(clausify,[status(thm)],[quotient_less_equal2]) ).
fof(quotient_property,axiom,
! [VAR_0,VAR_1,VAR_2] : less_equal(divide(divide(VAR_0,VAR_1),divide(VAR_2,VAR_1)),divide(divide(VAR_0,VAR_2),VAR_1)),
file('theBenchmark.p',quotient_property) ).
cnf(c_4,plain,
less_equal(divide(divide(A,B),divide(C,B)),divide(divide(A,C),B)),
inference(clausify,[status(thm)],[quotient_property]) ).
fof(zero_is_smallest,axiom,
! [VAR_0] : less_equal(zero,VAR_0),
file('theBenchmark.p',zero_is_smallest) ).
cnf(c_5,plain,
less_equal(zero,A),
inference(clausify,[status(thm)],[zero_is_smallest]) ).
fof(less_equal_and_equal,axiom,
! [VAR_0,VAR_1] :
( VAR_0 = VAR_1
| ~ less_equal(VAR_1,VAR_0)
| ~ less_equal(VAR_0,VAR_1) ),
file('theBenchmark.p',less_equal_and_equal) ).
cnf(c_6,plain,
( A = B
| ~ less_equal(B,A)
| ~ less_equal(A,B) ),
inference(clausify,[status(thm)],[less_equal_and_equal]) ).
fof(a_LE_b,axiom,
less_equal(a,b),
file('theBenchmark.p',a_LE_b) ).
cnf(c_8,plain,
less_equal(a,b),
inference(clausify,[status(thm)],[a_LE_b]) ).
fof(b_LE_c,axiom,
less_equal(b,c),
file('theBenchmark.p',b_LE_c) ).
cnf(c_9,plain,
less_equal(b,c),
inference(clausify,[status(thm)],[b_LE_c]) ).
fof(prove_a_LE_c,axiom,
~ less_equal(a,c),
file('theBenchmark.p',prove_a_LE_c) ).
cnf(c_10,plain,
~ less_equal(a,c),
inference(clausify,[status(thm)],[prove_a_LE_c]) ).
cnf(c_13,plain,
divide(zero,A) = zero,
inference(resolve,[status(thm)],[c_1,c_5]) ).
cnf(c_15,plain,
divide(a,b) = zero,
inference(resolve,[status(thm)],[c_1,c_8]) ).
cnf(c_16,plain,
divide(b,c) = zero,
inference(resolve,[status(thm)],[c_1,c_9]) ).
cnf(c_17,plain,
divide(a,c) != zero,
inference(resolve,[status(thm)],[c_2,c_10]) ).
cnf(c_74,plain,
( A = zero
| ~ less_equal(A,zero) ),
inference(resolve,[status(thm)],[c_6,c_5]) ).
cnf(c_21,plain,
~ less_equal(divide(a,c),zero),
inference(resolve,[status(thm)],[c_74,c_17]) ).
cnf(c_22,plain,
divide(divide(a,c),zero) != zero,
inference(resolve,[status(thm)],[c_2,c_21]) ).
cnf(c_75,plain,
( A = zero
| ~ less_equal(A,zero) ),
inference(resolve,[status(thm)],[c_6,c_5]) ).
cnf(c_23,plain,
~ less_equal(divide(divide(a,c),zero),zero),
inference(resolve,[status(thm)],[c_75,c_22]) ).
cnf(c_76,plain,
less_equal(divide(divide(a,A),divide(b,A)),divide(zero,A)),
inference(paramod,[status(thm)],[c_15,c_4]) ).
cnf(c_28,plain,
less_equal(divide(divide(a,A),divide(b,A)),zero),
inference(paramod,[status(thm)],[c_13,c_76]) ).
cnf(c_72,plain,
less_equal(divide(divide(a,c),zero),zero),
inference(paramod,[status(thm)],[c_16,c_28]) ).
cnf(c_73,plain,
$false,
inference(resolve,[status(thm)],[c_72,c_23]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : HEN005-3 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/5.37 % Computer : n007.cluster.edu
% 0.10/5.37 % Model : x86_64 x86_64
% 0.10/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.37 % Memory : 8046.5625MB
% 0.10/5.37 % OS : Linux 6.8.0-71-generic
% 0.10/5.37 % CPULimit : 300
% 0.10/5.37 % WCLimit : 300
% 0.10/5.37 % DateTime : Fri Sep 25 15:54:28 UTC 2026
% 0.10/5.37 % CPUTime :
% 0.10/5.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/5.37 % Process 1410296 was started by sandbox on n007,
% 0.10/5.37 % Fri Sep 25 15:54:28 2026
% 0.10/5.37 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.10/5.38
% 0.10/5.38 % From the command line: assign(max_seconds, 300).
% 0.10/5.39
% 0.10/5.39 % SZS status Unsatisfiable for theBenchmark
% 0.10/5.39
% 0.10/5.39 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.10/5.39 % Length of proof is 18.
% 0.10/5.39 % Level of proof is 5.
% 0.10/5.39 % Maximum clause weight is 13.000.
% 0.10/5.39 % Given clauses 37.
% 0.10/5.39
% 0.10/5.39 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------