%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : HEN005-2 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% Computer : n004.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:36 AM UTC 2026
% Result : Unsatisfiable 3.56s 2.39s
% Output : Refutation 3.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 16
% Syntax : Number of formulae : 33 ( 21 unt; 0 typ; 0 def)
% Number of atoms : 57 ( 4 equ; 0 cnn)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 188 ( 26 ~; 24 |; 0 &; 138 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 8 usr; 6 con; 0-3 aty)
% Number of variables : 58 ( 0 ^; 58 !; 0 ?; 58 :)
% Comments :
%------------------------------------------------------------------------------
thf(less_equal_decl,type,
less_equal: $i > $i > $o ).
thf(x_decl,type,
x: $i ).
thf(z_decl,type,
z: $i ).
thf(quotient_decl,type,
quotient: $i > $i > $i > $o ).
thf(zero_decl,type,
zero: $i ).
thf(divide_decl,type,
divide: $i > $i > $i ).
thf(identity_decl,type,
identity: $i ).
thf(y_decl,type,
y: $i ).
thf(16,axiom,
! [B: $i,A: $i] :
( ( A = B )
| ~ ( A @ ( B @ less_equal ) )
| ~ ( B @ ( A @ less_equal ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_equal_and_equal) ).
thf(39,plain,
! [B: $i,A: $i] :
( ( A = B )
| ~ ( A @ ( B @ less_equal ) )
| ~ ( B @ ( A @ less_equal ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[16]) ).
thf(13,axiom,
! [C: $i,B: $i,A: $i] :
( ( A @ ( C @ less_equal ) )
| ~ ( C @ ( B @ ( A @ quotient ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',divisor_existence) ).
thf(35,plain,
! [C: $i,B: $i,A: $i] :
( ( A @ ( C @ less_equal ) )
| ~ ( C @ ( B @ ( A @ quotient ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[13]) ).
thf(7,axiom,
! [A: $i] : ( zero @ ( A @ ( A @ quotient ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',x_divide_x_is_zero) ).
thf(26,plain,
! [A: $i] : ( zero @ ( A @ ( A @ quotient ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).
thf(14,axiom,
! [A: $i] : ( identity @ ( A @ less_equal ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',identity_is_largest) ).
thf(37,plain,
! [A: $i] : ( identity @ ( A @ less_equal ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[14]) ).
thf(6,axiom,
! [A: $i] : ( zero @ ( A @ ( zero @ quotient ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',zero_divide_anything_is_zero) ).
thf(25,plain,
! [A: $i] : ( zero @ ( A @ ( zero @ quotient ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).
thf(3,axiom,
! [B: $i,A: $i] : ( B @ ( A @ divide ) @ ( B @ ( A @ quotient ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',closure) ).
thf(20,plain,
! [B: $i,A: $i] : ( B @ ( A @ divide ) @ ( B @ ( A @ quotient ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(9,axiom,
! [A: $i] : ( A @ ( zero @ less_equal ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',zero_is_smallest) ).
thf(29,plain,
! [A: $i] : ( A @ ( zero @ less_equal ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[9]) ).
thf(15,axiom,
z @ ( y @ less_equal ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',yLEz) ).
thf(38,plain,
z @ ( y @ less_equal ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[15]) ).
thf(4,axiom,
! [A: $i] : ( zero @ ( identity @ ( A @ quotient ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',everything_divide_identity_is_zero) ).
thf(21,plain,
! [A: $i] : ( zero @ ( identity @ ( A @ quotient ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(12,axiom,
! [H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( H @ ( G @ less_equal ) )
| ~ ( H @ ( D @ ( C @ quotient ) ) )
| ~ ( G @ ( E @ ( F @ quotient ) ) )
| ~ ( F @ ( D @ ( A @ quotient ) ) )
| ~ ( E @ ( D @ ( B @ quotient ) ) )
| ~ ( C @ ( B @ ( A @ quotient ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quotient_property) ).
thf(33,plain,
! [H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( H @ ( G @ less_equal ) )
| ~ ( H @ ( D @ ( C @ quotient ) ) )
| ~ ( G @ ( E @ ( F @ quotient ) ) )
| ~ ( F @ ( D @ ( A @ quotient ) ) )
| ~ ( E @ ( D @ ( B @ quotient ) ) )
| ~ ( C @ ( B @ ( A @ quotient ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[12]) ).
thf(11,axiom,
y @ ( x @ less_equal ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',xLEy) ).
thf(32,plain,
y @ ( x @ less_equal ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[11]) ).
thf(1,negated_conjecture,
~ ( z @ ( x @ less_equal ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_transitivity_of_less_equal) ).
thf(17,plain,
~ ( z @ ( x @ less_equal ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).
thf(5,axiom,
! [D: $i,C: $i,B: $i,A: $i] :
( ( C = D )
| ~ ( D @ ( B @ ( A @ quotient ) ) )
| ~ ( C @ ( B @ ( A @ quotient ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',well_defined) ).
thf(22,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( C = D )
| ~ ( D @ ( B @ ( A @ quotient ) ) )
| ~ ( C @ ( B @ ( A @ quotient ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(8,axiom,
! [B: $i,A: $i] :
( ( B @ ( A @ less_equal ) )
| ~ ( zero @ ( B @ ( A @ quotient ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_equal_quotient) ).
thf(27,plain,
! [B: $i,A: $i] :
( ( B @ ( A @ less_equal ) )
| ~ ( zero @ ( B @ ( A @ quotient ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).
thf(10,axiom,
! [B: $i,A: $i] :
( ( zero @ ( B @ ( A @ quotient ) ) )
| ~ ( B @ ( A @ less_equal ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quotient_less_equal) ).
thf(30,plain,
! [B: $i,A: $i] :
( ( zero @ ( B @ ( A @ quotient ) ) )
| ~ ( B @ ( A @ less_equal ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[10]) ).
thf(2,axiom,
! [A: $i] : ( A @ ( zero @ ( A @ quotient ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',x_divde_zero_is_x) ).
thf(19,plain,
! [A: $i] : ( A @ ( zero @ ( A @ quotient ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(46,plain,
$false,
inference(e,[status(thm)],[39,35,26,37,25,20,29,38,21,33,32,17,22,27,30,19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : HEN005-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.08 % Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% 0.13/0.40 % Computer : n004.cluster.edu
% 0.13/0.40 % Model : x86_64 x86_64
% 0.13/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.40 % Memory : 8046.5625MB
% 0.13/0.40 % OS : Linux 6.8.0-71-generic
% 0.13/0.40 % CPULimit : 300
% 0.13/0.40 % WCLimit : 300
% 0.13/0.40 % DateTime : Fri Sep 25 15:56:20 UTC 2026
% 0.13/0.40 % CPUTime :
% 0.13/0.40 Running java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% 0.88/0.99 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.27/1.18 % [INFO] Parsing done (195ms).
% 1.43/1.20 % [INFO] Running in sequential loop mode.
% 2.07/1.61 % [INFO] eprover registered as external prover.
% 2.07/1.62 % [INFO] Scanning for conjecture ...
% 2.25/1.71 % [INFO] Found a conjecture (or negated_conjecture) and 15 axioms. Running axiom selection ...
% 2.25/1.76 % [INFO] Axiom selection finished. Selected 15 axioms (removed 0 axioms).
% 2.25/1.79 % [INFO] Problem is propositional (TPTP CNF).
% 2.25/1.80 % [INFO] Type checking passed.
% 2.44/1.80 % [CONFIG] Using configuration: timeout(300) with strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>. Searching for refutation ...
% 3.56/2.38 % External prover 'e' found a proof!
% 3.56/2.38 % [INFO] Killing All external provers ...
% 3.56/2.38 % Time passed: 1834ms (effective reasoning time: 1178ms)
% 3.56/2.39 % Axioms used in derivation (15): quotient_property, closure, everything_divide_identity_is_zero, zero_divide_anything_is_zero, yLEz, zero_is_smallest, xLEy, less_equal_quotient, identity_is_largest, x_divide_x_is_zero, quotient_less_equal, divisor_existence, well_defined, x_divde_zero_is_x, less_equal_and_equal
% 3.56/2.39 % No. of inferences in proof: 33
% 3.56/2.39 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p : 1834 ms resp. 1178 ms w/o parsing
% 3.86/2.43 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.86/2.43 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------