%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SEV427^1 : TPTP v9.3.1. Released v5.2.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 : n003.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:37:16 AM UTC 2026
% Result : Theorem 2.27s 1.20s
% Output : Refutation 2.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of formulae : 8 ( 1 unt; 0 typ; 0 def)
% Number of atoms : 17 ( 0 equ; 0 cnn)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 31 ( 2 ~; 5 |; 0 &; 22 @)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% Number of symbols : 4 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 6 ( 0 ^; 4 !; 2 ?; 6 :)
% Comments :
%------------------------------------------------------------------------------
thf(eps_decl,type,
eps: ( $i > $o ) > $i ).
thf(p_decl,type,
p: $i > $o ).
thf(q_decl,type,
q: $i > $o ).
thf(1,conjecture,
( ( p @ ( eps @ p ) )
| ( q @ ( eps @ q ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
thf(2,negated_conjecture,
~ ( ( p @ ( eps @ p ) )
| ( q @ ( eps @ q ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(5,plain,
~ ( ( p @ ( eps @ p ) )
| ( q @ ( eps @ q ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(3,axiom,
! [A: $i > $o] :
( ? [B: $i] : ( A @ B )
=> ( A @ ( eps @ A ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',choiceax) ).
thf(9,plain,
! [A: $i > $o] :
( ? [B: $i] : ( A @ B )
=> ( A @ ( eps @ A ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(4,axiom,
! [A: $i] :
( ( p @ A )
| ( q @ A ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pq) ).
thf(11,plain,
! [A: $i] :
( ( p @ A )
| ( q @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(16,plain,
$false,
inference(e,[status(thm)],[5,9,11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEV427^1 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.07 % 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.10/0.21 % Computer : n003.cluster.edu
% 0.10/0.21 % Model : x86_64 x86_64
% 0.10/0.21 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.21 % Memory : 8046.5625MB
% 0.10/0.21 % OS : Linux 6.8.0-71-generic
% 0.10/0.21 % CPULimit : 300
% 0.10/0.21 % WCLimit : 300
% 0.10/0.21 % DateTime : Tue Sep 29 15:48:38 UTC 2026
% 0.10/0.21 % CPUTime :
% 0.10/0.21 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.64/0.51 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.87/0.60 % [INFO] Parsing done (91ms).
% 0.87/0.61 % [INFO] Running in sequential loop mode.
% 1.11/0.79 % [INFO] eprover registered as external prover.
% 1.34/0.80 % [INFO] Scanning for conjecture ...
% 1.34/0.84 % [INFO] Found a conjecture (or negated_conjecture) and 2 axioms. Running axiom selection ...
% 1.34/0.85 % [INFO] Axiom selection finished. Selected 2 axioms (removed 0 axioms).
% 1.34/0.86 % [INFO] Problem is higher-order (TPTP THF).
% 1.34/0.86 % [INFO] Type checking passed.
% 1.34/0.86 % [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.27/1.19 % External prover 'e' found a proof!
% 2.27/1.19 % [INFO] Killing All external provers ...
% 2.27/1.19 % Time passed: 895ms (effective reasoning time: 584ms)
% 2.27/1.19 % 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.27/1.20 % Axioms used in derivation (2): choiceax, pq
% 2.27/1.20 % No. of inferences in proof: 8
% 2.27/1.20 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 895 ms resp. 584 ms w/o parsing
% 2.46/1.23 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.46/1.23 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------