%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SEU930^5 : TPTP v9.3.1. Released 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 : n007.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:29:36 AM UTC 2026
% Result : Theorem 2.36s 1.18s
% Output : Refutation 2.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 1
% Syntax : Number of formulae : 4 ( 1 unt; 0 typ; 0 def)
% Number of atoms : 16 ( 15 equ; 0 cnn)
% Maximal formula atoms : 5 ( 4 avg)
% Number of connectives : 35 ( 2 ~; 0 |; 3 &; 21 @)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 6 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 4 ( 2 usr; 1 con; 0-2 aty)
% Number of variables : 12 ( 6 ^; 6 !; 0 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
thf(f_decl,type,
f: $i > $i ).
thf(g_decl,type,
g: $i > $i ).
thf(1,conjecture,
( ( ( ^ [A: $i] : ( f @ ( g @ A ) ) )
= ( ^ [A: $i] : ( g @ ( f @ A ) ) ) )
=> ! [A: $i] :
( ( ( ( g @ A )
= A )
& ! [B: $i] :
( ( ( g @ B )
= B )
=> ( B = A ) ) )
=> ( ( f @ A )
= A ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM171A_pme) ).
thf(2,negated_conjecture,
~ ( ( ( ^ [A: $i] : ( f @ ( g @ A ) ) )
= ( ^ [A: $i] : ( g @ ( f @ A ) ) ) )
=> ! [A: $i] :
( ( ( ( g @ A )
= A )
& ! [B: $i] :
( ( ( g @ B )
= B )
=> ( B = A ) ) )
=> ( ( f @ A )
= A ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ( ( ( ^ [A: $i] : ( f @ ( g @ A ) ) )
= ( ^ [A: $i] : ( g @ ( f @ A ) ) ) )
=> ! [A: $i] :
( ( ( ( g @ A )
= A )
& ! [B: $i] :
( ( ( g @ B )
= B )
=> ( B = A ) ) )
=> ( ( f @ A )
= A ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(20,plain,
$false,
inference(e,[status(thm)],[3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU930^5 : TPTP v9.3.1. Released v4.0.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.20 % Computer : n007.cluster.edu
% 0.10/0.20 % Model : x86_64 x86_64
% 0.10/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.20 % Memory : 8046.5625MB
% 0.10/0.20 % OS : Linux 6.8.0-71-generic
% 0.10/0.20 % CPULimit : 300
% 0.10/0.20 % WCLimit : 300
% 0.10/0.20 % DateTime : Tue Sep 29 14:44:55 UTC 2026
% 0.10/0.20 % CPUTime :
% 0.10/0.20 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.65/0.50 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.88/0.59 % [INFO] Parsing done (90ms).
% 0.88/0.60 % [INFO] Running in sequential loop mode.
% 1.14/0.78 % [INFO] eprover registered as external prover.
% 1.14/0.79 % [INFO] Scanning for conjecture ...
% 1.36/0.83 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.36/0.84 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.36/0.84 % [INFO] Problem is higher-order (TPTP THF).
% 1.36/0.85 % [INFO] Type checking passed.
% 1.36/0.85 % [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.36/1.17 % External prover 'e' found a proof!
% 2.36/1.18 % [INFO] Killing All external provers ...
% 2.36/1.18 % Time passed: 888ms (effective reasoning time: 576ms)
% 2.36/1.18 % 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.36/1.18 % Axioms used in derivation (0):
% 2.36/1.18 % No. of inferences in proof: 4
% 2.36/1.18 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 888 ms resp. 576 ms w/o parsing
% 2.36/1.19 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.36/1.19 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------