%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SEV122^5 : TPTP v9.3.1. Released v4.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 : n015.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:36:53 AM UTC 2026
% Result : Theorem 2.07s 1.57s
% Output : Refutation 2.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 1
% Syntax : Number of formulae : 4 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 4 ( 2 equ; 0 cnn)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 42 ( 2 ~; 0 |; 4 &; 28 @)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 28 ( 28 >; 0 *; 0 +; 0 <<)
% Number of symbols : 3 ( 0 usr; 2 con; 0-2 aty)
% Number of variables : 28 ( 8 ^; 16 !; 4 ?; 28 :)
% Comments :
%------------------------------------------------------------------------------
thf(a_type,type,
a: $tType ).
thf(1,conjecture,
! [A: ( a > a > $o ) > $o,B: ( a > a > $o ) > $o] :
( ( ^ [C: a,D: a] :
! [E: a > a > $o] :
( ( ! [F: a,G: a] :
( ? [H: a > a > $o] : ( H @ F @ G )
=> ( E @ F @ G ) )
& ( A @ E ) )
=> ( E @ C @ D ) ) )
= ( ^ [C: a,D: a] :
! [E: a > a > $o] :
( ( ! [F: a,G: a] :
( ? [H: a > a > $o] : ( H @ F @ G )
=> ( E @ F @ G ) )
& ( A @ E ) )
=> ( E @ C @ D ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM530_pme) ).
thf(2,negated_conjecture,
~ ! [A: ( a > a > $o ) > $o,B: ( a > a > $o ) > $o] :
( ( ^ [C: a,D: a] :
! [E: a > a > $o] :
( ( ! [F: a,G: a] :
( ? [H: a > a > $o] : ( H @ F @ G )
=> ( E @ F @ G ) )
& ( A @ E ) )
=> ( E @ C @ D ) ) )
= ( ^ [C: a,D: a] :
! [E: a > a > $o] :
( ( ! [F: a,G: a] :
( ? [H: a > a > $o] : ( H @ F @ G )
=> ( E @ F @ G ) )
& ( A @ E ) )
=> ( E @ C @ D ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ $true,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
$false,
inference(simp,[status(thm)],[3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEV122^5 : TPTP v9.3.1. Released v4.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.10/0.22 % Computer : n015.cluster.edu
% 0.10/0.22 % Model : x86_64 x86_64
% 0.10/0.22 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.22 % Memory : 8046.5625MB
% 0.10/0.22 % OS : Linux 6.8.0-71-generic
% 0.10/0.22 % CPULimit : 300
% 0.10/0.22 % WCLimit : 300
% 0.10/0.22 % DateTime : Tue Sep 29 15:15:18 UTC 2026
% 0.10/0.22 % CPUTime :
% 0.10/0.22 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.84/0.80 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.15/0.97 % [INFO] Parsing done (172ms).
% 1.15/0.98 % [INFO] Running in sequential loop mode.
% 1.70/1.39 % [INFO] eprover registered as external prover.
% 1.70/1.39 % [INFO] Scanning for conjecture ...
% 1.89/1.46 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.89/1.48 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.89/1.49 % [INFO] Problem is higher-order (TPTP THF).
% 1.89/1.49 % [INFO] Type checking passed.
% 1.89/1.49 % [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 ...
% 2.07/1.57 % [INFO] Killing All external provers ...
% 2.07/1.57 % Time passed: 1203ms (effective reasoning time: 580ms)
% 2.07/1.57 % 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)>
% 2.07/1.57 % Axioms used in derivation (0):
% 2.07/1.57 % No. of inferences in proof: 4
% 2.07/1.57 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1203 ms resp. 580 ms w/o parsing
% 2.35/1.60 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.35/1.60 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------