%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : NUM025-1 : TPTP v9.3.1. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39
% Computer : n020.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:08:07 AM UTC 2026
% Result : Unsatisfiable 4.70s 2.32s
% Output : Refutation 4.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 16
% Syntax : Number of formulae : 33 ( 19 unt; 0 typ; 0 def)
% Number of atoms : 51 ( 0 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 200 ( 22 ~; 18 |; 0 &; 160 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 7 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 52 ( 0 ^; 52 !; 0 ?; 52 :)
% Comments :
%------------------------------------------------------------------------------
thf(less_decl,type,
less: $i > $i > $o ).
thf(b_decl,type,
b: $i ).
thf(a_decl,type,
a: $i ).
thf(equalish_decl,type,
equalish: $i > $i > $o ).
thf(multiply_decl,type,
multiply: $i > $i > $i ).
thf(successor_decl,type,
successor: $i > $i ).
thf(add_decl,type,
add: $i > $i > $i ).
thf(n0_decl,type,
n0: $i ).
thf(predecessor_of_1st_minus_2nd_decl,type,
predecessor_of_1st_minus_2nd: $i > $i > $i ).
thf(9,axiom,
! [B: $i,A: $i] :
( ( B @ ( A @ equalish ) )
| ~ ( B @ successor @ ( A @ successor @ equalish ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_equality1) ).
thf(29,plain,
! [B: $i,A: $i] :
( ( B @ ( A @ equalish ) )
| ~ ( B @ successor @ ( A @ successor @ equalish ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[9]) ).
thf(16,axiom,
b @ ( a @ less ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_less_than_b) ).
thf(41,plain,
b @ ( a @ less ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[16]) ).
thf(15,axiom,
! [C: $i,B: $i,A: $i] :
( ( C @ ( B @ less ) )
| ~ ( C @ ( B @ ( A @ successor @ add ) @ equalish ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',smaller_number) ).
thf(39,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( B @ less ) )
| ~ ( C @ ( B @ ( A @ successor @ add ) @ equalish ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[15]) ).
thf(13,axiom,
! [C: $i,B: $i,A: $i] :
( ( B @ ( C @ less ) )
| ~ ( A @ ( C @ less ) )
| ~ ( B @ ( A @ less ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity_of_less) ).
thf(35,plain,
! [C: $i,B: $i,A: $i] :
( ( B @ ( C @ less ) )
| ~ ( A @ ( C @ less ) )
| ~ ( B @ ( A @ less ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[13]) ).
thf(2,axiom,
! [B: $i,A: $i] : ( A @ ( B @ ( A @ multiply ) @ add ) @ ( B @ successor @ ( A @ multiply ) @ equalish ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',times) ).
thf(18,plain,
! [B: $i,A: $i] : ( A @ ( B @ ( A @ multiply ) @ add ) @ ( B @ successor @ ( A @ multiply ) @ equalish ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(10,axiom,
! [A: $i] : ( A @ ( n0 @ ( A @ add ) @ equalish ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',adding_zero) ).
thf(31,plain,
! [A: $i] : ( A @ ( n0 @ ( A @ add ) @ equalish ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[10]) ).
thf(3,axiom,
! [A: $i] :
~ ( n0 @ ( A @ successor @ equalish ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',zero_is_the_first_number) ).
thf(19,plain,
! [A: $i] :
~ ( n0 @ ( A @ successor @ equalish ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(6,axiom,
! [B: $i,A: $i] :
( ( B @ successor @ ( A @ successor @ equalish ) )
| ~ ( B @ ( A @ equalish ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_substitution) ).
thf(24,plain,
! [B: $i,A: $i] :
( ( B @ successor @ ( A @ successor @ equalish ) )
| ~ ( B @ ( A @ equalish ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).
thf(14,axiom,
! [B: $i,A: $i] :
( ( B @ ( A @ ( A @ ( B @ predecessor_of_1st_minus_2nd ) @ successor @ add ) @ equalish ) )
| ~ ( B @ ( A @ less ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_lemma) ).
thf(37,plain,
! [B: $i,A: $i] :
( ( B @ ( A @ ( A @ ( B @ predecessor_of_1st_minus_2nd ) @ successor @ add ) @ equalish ) )
| ~ ( B @ ( A @ less ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[14]) ).
thf(8,axiom,
! [A: $i] : ( A @ ( A @ equalish ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity) ).
thf(28,plain,
! [A: $i] : ( A @ ( A @ equalish ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).
thf(4,axiom,
! [C: $i,B: $i,A: $i] :
( ( C @ ( A @ equalish ) )
| ~ ( C @ ( B @ equalish ) )
| ~ ( B @ ( A @ equalish ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity) ).
thf(21,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( A @ equalish ) )
| ~ ( C @ ( B @ equalish ) )
| ~ ( B @ ( A @ equalish ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(12,axiom,
! [A: $i] :
~ ( A @ ( A @ less ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',no_number_less_than_itself) ).
thf(33,plain,
! [A: $i] :
~ ( A @ ( A @ less ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[12]) ).
thf(11,axiom,
! [B: $i,A: $i] : ( B @ ( A @ add ) @ successor @ ( B @ successor @ ( A @ add ) @ equalish ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',addition) ).
thf(32,plain,
! [B: $i,A: $i] : ( B @ ( A @ add ) @ successor @ ( B @ successor @ ( A @ add ) @ equalish ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[11]) ).
thf(1,negated_conjecture,
a @ ( b @ less ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_b_not_less_than_a) ).
thf(17,plain,
a @ ( b @ less ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).
thf(7,axiom,
! [B: $i,A: $i] :
( ( A @ ( B @ equalish ) )
| ~ ( B @ ( A @ equalish ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetry) ).
thf(26,plain,
! [B: $i,A: $i] :
( ( A @ ( B @ equalish ) )
| ~ ( B @ ( A @ equalish ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).
thf(5,axiom,
! [A: $i] : ( n0 @ ( n0 @ ( A @ multiply ) @ equalish ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',times_zero) ).
thf(23,plain,
! [A: $i] : ( n0 @ ( n0 @ ( A @ multiply ) @ equalish ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(46,plain,
$false,
inference(e,[status(thm)],[29,41,39,35,18,31,19,24,37,28,21,33,32,17,26,23]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : NUM025-1 : TPTP v9.3.1. Bugfixed v4.0.0.
% 0.00/0.12 % Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39
% 0.23/0.48 % Computer : n020.cluster.edu
% 0.23/0.48 % Model : x86_64 x86_64
% 0.23/0.48 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.23/0.48 % Memory : 8046.5625MB
% 0.23/0.48 % OS : Linux 6.8.0-71-generic
% 0.23/0.48 % CPULimit : 300
% 0.23/0.48 % WCLimit : 300
% 0.23/0.49 % DateTime : Sat Sep 26 01:55:03 UTC 2026
% 0.23/0.49 % CPUTime :
% 0.23/0.49 Running java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39
% 0.98/1.03 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.60/1.21 % [INFO] Parsing done (182ms).
% 1.60/1.22 % [INFO] Running in sequential loop mode.
% 2.21/1.58 % [INFO] eprover registered as external prover.
% 2.21/1.59 % [INFO] Scanning for conjecture ...
% 2.49/1.67 % [INFO] Found a conjecture (or negated_conjecture) and 15 axioms. Running axiom selection ...
% 2.72/1.72 % [INFO] Axiom selection finished. Selected 15 axioms (removed 0 axioms).
% 2.72/1.74 % [INFO] Problem is propositional (TPTP CNF).
% 2.72/1.74 % [INFO] Type checking passed.
% 2.72/1.75 % [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 ...
% 4.70/2.31 % External prover 'e' found a proof!
% 4.70/2.31 % [INFO] Killing All external provers ...
% 4.70/2.31 % Time passed: 1663ms (effective reasoning time: 1084ms)
% 4.70/2.32 % Axioms used in derivation (15): successor_equality1, smaller_number, less_lemma, reflexivity, addition, times_zero, times, adding_zero, transitivity, no_number_less_than_itself, symmetry, a_less_than_b, successor_substitution, transitivity_of_less, zero_is_the_first_number
% 4.70/2.32 % No. of inferences in proof: 33
% 4.70/2.32 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1663 ms resp. 1084 ms w/o parsing
% 4.70/2.36 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.70/2.36 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------