%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : NUM692^1 : TPTP v9.3.1. Released v3.7.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 : n005.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 : Wed Sep 30 08:17:59 AM UTC 2026
% Result : Theorem 3.01s 1.99s
% Output : Refutation 3.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 6
% Syntax : Number of formulae : 14 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 22 ( 0 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 72 ( 2 ~; 0 |; 0 &; 62 @)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 16 ( 0 ^; 16 !; 0 ?; 16 :)
% Comments :
%------------------------------------------------------------------------------
thf(nat_type,type,
nat: $tType ).
thf(x_decl,type,
x: nat ).
thf(y_decl,type,
y: nat ).
thf(z_decl,type,
z: nat ).
thf(u_decl,type,
u: nat ).
thf(lessis_decl,type,
lessis: nat > nat > $o ).
thf(ts_decl,type,
ts: nat > nat > nat ).
thf(moreis_decl,type,
moreis: nat > nat > $o ).
thf(4,axiom,
lessis @ z @ u,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',k) ).
thf(10,plain,
lessis @ z @ u,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(3,axiom,
lessis @ x @ y,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l) ).
thf(9,plain,
lessis @ x @ y,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(6,axiom,
! [A: nat,B: nat,C: nat,D: nat] :
( ( moreis @ A @ B )
=> ( ( moreis @ C @ D )
=> ( moreis @ ( ts @ A @ C ) @ ( ts @ B @ D ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz23) ).
thf(13,plain,
! [A: nat,B: nat,C: nat,D: nat] :
( ( moreis @ A @ B )
=> ( ( moreis @ C @ D )
=> ( moreis @ ( ts @ A @ C ) @ ( ts @ B @ D ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).
thf(7,axiom,
! [A: nat,B: nat] :
( ( lessis @ A @ B )
=> ( moreis @ B @ A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz14) ).
thf(16,plain,
! [A: nat,B: nat] :
( ( lessis @ A @ B )
=> ( moreis @ B @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).
thf(5,axiom,
! [A: nat,B: nat] :
( ( moreis @ A @ B )
=> ( lessis @ B @ A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz13) ).
thf(11,plain,
! [A: nat,B: nat] :
( ( moreis @ A @ B )
=> ( lessis @ B @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(1,conjecture,
lessis @ ( ts @ x @ z ) @ ( ts @ y @ u ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz23a) ).
thf(2,negated_conjecture,
~ ( lessis @ ( ts @ x @ z ) @ ( ts @ y @ u ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(8,plain,
~ ( lessis @ ( ts @ x @ z ) @ ( ts @ y @ u ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(18,plain,
$false,
inference(e,[status(thm)],[10,9,13,16,11,8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM692^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.07 % 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.09/0.18 % Computer : n005.cluster.edu
% 0.09/0.18 % Model : x86_64 x86_64
% 0.09/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18 % Memory : 8046.5625MB
% 0.09/0.18 % OS : Linux 6.8.0-71-generic
% 0.09/0.18 % CPULimit : 300
% 0.09/0.18 % WCLimit : 300
% 0.09/0.18 % DateTime : Tue Sep 29 12:39:31 UTC 2026
% 0.09/0.18 % CPUTime :
% 0.09/0.18 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.89/0.76 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.24/0.94 % [INFO] Parsing done (181ms).
% 1.24/0.96 % [INFO] Running in sequential loop mode.
% 1.83/1.36 % [INFO] eprover registered as external prover.
% 1.83/1.37 % [INFO] Scanning for conjecture ...
% 2.02/1.45 % [INFO] Found a conjecture (or negated_conjecture) and 5 axioms. Running axiom selection ...
% 2.02/1.48 % [INFO] Axiom selection finished. Selected 5 axioms (removed 0 axioms).
% 2.16/1.50 % [INFO] Problem is higher-order (TPTP THF).
% 2.16/1.51 % [INFO] Type checking passed.
% 2.16/1.51 % [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.01/1.98 % External prover 'e' found a proof!
% 3.01/1.99 % [INFO] Killing All external provers ...
% 3.01/1.99 % Time passed: 1669ms (effective reasoning time: 1023ms)
% 3.01/1.99 % Solved by 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)>
% 3.01/1.99 % Axioms used in derivation (5): satz14, l, satz23, k, satz13
% 3.01/1.99 % No. of inferences in proof: 14
% 3.01/1.99 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1669 ms resp. 1023 ms w/o parsing
% 3.01/2.02 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.01/2.02 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------