%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : HEN005-3 : 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 : n006.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.18s 7.27s
% Output : Refutation 3.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 10
% Syntax : Number of formulae : 21 ( 15 unt; 0 typ; 0 def)
% Number of atoms : 29 ( 6 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 94 ( 10 ~; 8 |; 0 &; 76 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 26 ( 0 ^; 26 !; 0 ?; 26 :)
% Comments :
%------------------------------------------------------------------------------
thf(less_equal_decl,type,
less_equal: $i > $i > $o ).
thf(a_decl,type,
a: $i ).
thf(c_decl,type,
c: $i ).
thf(divide_decl,type,
divide: $i > $i > $i ).
thf(zero_decl,type,
zero: $i ).
thf(identity_decl,type,
identity: $i ).
thf(b_decl,type,
b: $i ).
thf(8,axiom,
! [A: $i] : ( identity @ ( A @ less_equal ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',identity_is_largest) ).
thf(25,plain,
! [A: $i] : ( identity @ ( A @ less_equal ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).
thf(5,axiom,
! [C: $i,B: $i,A: $i] : ( B @ ( C @ ( A @ divide ) @ divide ) @ ( B @ ( C @ divide ) @ ( B @ ( A @ divide ) @ divide ) @ less_equal ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quotient_property) ).
thf(20,plain,
! [C: $i,B: $i,A: $i] : ( B @ ( C @ ( A @ divide ) @ divide ) @ ( B @ ( C @ divide ) @ ( B @ ( A @ divide ) @ divide ) @ less_equal ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(6,axiom,
! [A: $i] : ( A @ ( zero @ less_equal ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',zero_is_smallest) ).
thf(21,plain,
! [A: $i] : ( A @ ( zero @ less_equal ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).
thf(2,axiom,
! [B: $i,A: $i] :
( ( ( B @ ( A @ divide ) )
= zero )
| ~ ( B @ ( A @ less_equal ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quotient_less_equal1) ).
thf(13,plain,
! [B: $i,A: $i] :
( ( ( B @ ( A @ divide ) )
= zero )
| ~ ( B @ ( A @ less_equal ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(3,axiom,
! [B: $i,A: $i] :
( ( B @ ( A @ less_equal ) )
| ( ( B @ ( A @ divide ) )
!= zero ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quotient_less_equal2) ).
thf(16,plain,
! [B: $i,A: $i] :
( ( B @ ( A @ less_equal ) )
| ( ( B @ ( A @ divide ) )
!= zero ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(1,negated_conjecture,
~ ( c @ ( a @ less_equal ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_a_LE_c) ).
thf(11,plain,
~ ( c @ ( a @ less_equal ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).
thf(9,axiom,
b @ ( a @ less_equal ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_LE_b) ).
thf(26,plain,
b @ ( a @ less_equal ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[9]) ).
thf(4,axiom,
! [B: $i,A: $i] : ( A @ ( B @ ( A @ divide ) @ less_equal ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quotient_smaller_than_numerator) ).
thf(19,plain,
! [B: $i,A: $i] : ( A @ ( B @ ( A @ divide ) @ less_equal ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(7,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(22,plain,
! [B: $i,A: $i] :
( ( A = B )
| ~ ( A @ ( B @ less_equal ) )
| ~ ( B @ ( A @ less_equal ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).
thf(10,axiom,
c @ ( b @ less_equal ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_LE_c) ).
thf(27,plain,
c @ ( b @ less_equal ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[10]) ).
thf(36,plain,
$false,
inference(e,[status(thm)],[25,20,21,13,16,11,26,19,22,27]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : HEN005-3 : 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.14/5.41 % Computer : n006.cluster.edu
% 0.14/5.41 % Model : x86_64 x86_64
% 0.14/5.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/5.41 % Memory : 8046.5625MB
% 0.14/5.41 % OS : Linux 6.8.0-71-generic
% 0.14/5.41 % CPULimit : 300
% 0.14/5.41 % WCLimit : 300
% 0.14/5.41 % DateTime : Fri Sep 25 15:56:15 UTC 2026
% 0.14/5.41 % CPUTime :
% 0.14/5.41 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.17/5.98 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.22/6.17 % [INFO] Parsing done (187ms).
% 1.22/6.19 % [INFO] Running in sequential loop mode.
% 1.83/6.58 % [INFO] eprover registered as external prover.
% 1.83/6.58 % [INFO] Scanning for conjecture ...
% 2.02/6.67 % [INFO] Found a conjecture (or negated_conjecture) and 9 axioms. Running axiom selection ...
% 2.17/6.70 % [INFO] Axiom selection finished. Selected 9 axioms (removed 0 axioms).
% 2.17/6.71 % [INFO] Problem is propositional (TPTP CNF).
% 2.17/6.72 % [INFO] Type checking passed.
% 2.17/6.72 % [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.18/7.26 % External prover 'e' found a proof!
% 3.18/7.26 % [INFO] Killing All external provers ...
% 3.18/7.26 % Time passed: 1713ms (effective reasoning time: 1071ms)
% 3.18/7.27 % Axioms used in derivation (9): identity_is_largest, a_LE_b, quotient_less_equal2, less_equal_and_equal, zero_is_smallest, b_LE_c, quotient_less_equal1, quotient_smaller_than_numerator, quotient_property
% 3.18/7.27 % No. of inferences in proof: 21
% 3.18/7.27 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p : 1713 ms resp. 1071 ms w/o parsing
% 3.52/7.31 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.52/7.31 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------