%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SYO236^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 : n001.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:45:27 AM UTC 2026
% Result : Theorem 3.61s 2.16s
% Output : Refutation 3.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 1
% Syntax : Number of formulae : 14 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 23 ( 22 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 62 ( 11 ~; 12 |; 1 &; 32 @)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 10 ( 10 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 3 usr; 3 con; 0-2 aty)
% Number of variables : 14 ( 0 ^; 14 !; 0 ?; 14 :)
% Comments :
%------------------------------------------------------------------------------
thf(b_type,type,
b: $tType ).
thf(a_type,type,
a: $tType ).
thf(g_decl,type,
g: b > a ).
thf(f_decl,type,
f: b > a ).
thf(sk1_decl,type,
sk1: b ).
thf(1,conjecture,
( ( ! [A: ( b > a ) > $o] :
( ( A @ f )
=> ( A @ g ) )
| ! [A: b] :
( ( f @ A )
= ( g @ A ) ) )
=> ( f = g ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM504) ).
thf(2,negated_conjecture,
~ ( ( ! [A: ( b > a ) > $o] :
( ( A @ f )
=> ( A @ g ) )
| ! [A: b] :
( ( f @ A )
= ( g @ A ) ) )
=> ( f = g ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ( ( ! [A: ( b > a ) > $o] :
( ( A @ f )
=> ( A @ g ) )
| ! [A: b] :
( ( f @ A )
= ( g @ A ) ) )
=> ( f = g ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
! [B: b,A: ( b > a ) > $o] :
( ( ~ ( A @ f )
| ( A @ g )
| ( ( f @ B )
= ( g @ B ) ) )
& ( f != g ) ),
inference(cnf,[status(esa)],[3]) ).
thf(6,plain,
f != g,
inference(cnfConj,[status(thm)],[4]) ).
thf(9,plain,
f != g,
inference(lifteq,[status(thm)],[6]) ).
thf(12,plain,
( ( f @ sk1 )
!= ( g @ sk1 ) ),
inference(func_ext,[status(esa)],[9]) ).
thf(5,plain,
! [B: b,A: ( b > a ) > $o] :
( ~ ( A @ f )
| ( A @ g )
| ( ( f @ B )
= ( g @ B ) ) ),
inference(cnfConj,[status(thm)],[4]) ).
thf(7,plain,
! [A: b] :
( ( f != f )
| ( f = g )
| ( ( f @ A )
= ( g @ A ) ) ),
inference(replace_leibeq,[status(thm)],[5:[bind(A,$thf( (=) @ ( b > a ) @ f ))]]) ).
thf(10,plain,
! [A: b] :
( ( f != f )
| ( f = g )
| ( ( f @ A )
= ( g @ A ) ) ),
inference(lifteq,[status(thm)],[7]) ).
thf(11,plain,
! [A: b] :
( ( f = g )
| ( ( f @ A )
= ( g @ A ) ) ),
inference(simp,[status(thm)],[10]) ).
thf(13,plain,
! [A: b] :
( ( f @ A )
= ( g @ A ) ),
inference(simplifyReflect,[status(thm)],[11,9]) ).
thf(16,plain,
( ( g @ sk1 )
!= ( g @ sk1 ) ),
inference(rewrite,[status(thm)],[12,13]) ).
thf(17,plain,
$false,
inference(simp,[status(thm)],[16]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO236^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08 % 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.22 % Computer : n001.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 16:46:21 UTC 2026
% 0.10/0.22 % CPUTime :
% 0.10/0.22 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
% 1.05/0.80 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.24/0.99 % [INFO] Parsing done (183ms).
% 1.24/1.00 % [INFO] Running in sequential loop mode.
% 2.04/1.40 % [INFO] eprover registered as external prover.
% 2.04/1.41 % [INFO] Scanning for conjecture ...
% 2.22/1.50 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 2.22/1.54 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.22/1.54 % [INFO] Problem is higher-order (TPTP THF).
% 2.22/1.54 % [INFO] Type checking passed.
% 2.22/1.55 % [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.37/2.15 % [INFO] Killing All external provers ...
% 3.61/2.15 % Time passed: 1793ms (effective reasoning time: 1140ms)
% 3.61/2.15 % 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.61/2.15 % Axioms used in derivation (0):
% 3.61/2.15 % No. of inferences in proof: 14
% 3.61/2.16 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1793 ms resp. 1140 ms w/o parsing
% 3.78/2.20 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.78/2.20 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------