%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SYO301^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 : n004.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:33 AM UTC 2026
% Result : Theorem 4.13s 2.01s
% Output : Refutation 4.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 2
% Syntax : Number of formulae : 12 ( 5 unt; 0 typ; 1 def)
% Number of atoms : 21 ( 9 equ; 3 cnn)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 95 ( 11 ~; 6 |; 5 &; 66 @)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 7 ( 7 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 21 ( 2 ^; 12 !; 6 ?; 21 :)
% ( 0 !>; 0 ?*; 0 @-; 1 @+)
% Comments :
%------------------------------------------------------------------------------
thf(f_decl,type,
f: $i > $i ).
thf(cP_decl,type,
cP: $i > $o ).
thf(b_decl,type,
b: $i ).
thf(sk1_decl,type,
sk1: ( $i > $o ) > $i > $i ).
thf(sk1_def,definition,
( sk1
= ( ^ [A: $i > $o,B: $i] :
@+[C: $i] :
~ ( ( A @ C )
=> ( cP @ C ) ) ) ) ).
thf(1,conjecture,
( ( cP @ ( f @ b ) )
=> ? [A: $i,B: $i > $o] :
( ! [C: $i] :
( ( B @ C )
=> ( cP @ C ) )
& ( B @ ( f @ A ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cBLEDSOE5) ).
thf(2,negated_conjecture,
~ ( ( cP @ ( f @ b ) )
=> ? [A: $i,B: $i > $o] :
( ! [C: $i] :
( ( B @ C )
=> ( cP @ C ) )
& ( B @ ( f @ A ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ( ( cP @ ( f @ b ) )
=> ? [A: $i,B: $i > $o] :
( ! [C: $i] :
( ( B @ C )
=> ( cP @ C ) )
& ( B @ ( f @ A ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
! [B: $i > $o,A: $i] :
( ( cP @ ( f @ b ) )
& ( ( B @ ( sk1 @ B @ A ) )
| ~ ( B @ ( f @ A ) ) )
& ( ~ ( cP @ ( sk1 @ B @ A ) )
| ~ ( B @ ( f @ A ) ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(5,plain,
cP @ ( f @ b ),
inference(cnfConj,[status(thm)],[4]) ).
thf(7,plain,
! [B: $i > $o,A: $i] :
( ~ ( cP @ ( sk1 @ B @ A ) )
| ~ ( B @ ( f @ A ) ) ),
inference(cnfConj,[status(thm)],[4]) ).
thf(6,plain,
! [B: $i > $o,A: $i] :
( ( B @ ( sk1 @ B @ A ) )
| ~ ( B @ ( f @ A ) ) ),
inference(cnfConj,[status(thm)],[4]) ).
thf(8,plain,
! [A: $i] :
( ( ( f @ A )
= ( sk1 @ ( (=) @ $i @ ( f @ A ) ) @ A ) )
| ( ( f @ A )
!= ( f @ A ) ) ),
inference(replace_leibeq,[status(thm)],[6:[bind(A,$thf( A )),bind(B,$thf( (=) @ $i @ ( f @ A ) ))]]) ).
thf(9,plain,
! [A: $i] :
( ( ( sk1 @ ( (=) @ $i @ ( f @ A ) ) @ A )
= ( f @ A ) )
| ( ( f @ A )
!= ( f @ A ) ) ),
inference(lifteq,[status(thm)],[8]) ).
thf(10,plain,
! [A: $i] :
( ( sk1 @ ( (=) @ $i @ ( f @ A ) ) @ A )
= ( f @ A ) ),
inference(simp,[status(thm)],[9]) ).
thf(52,plain,
$false,
inference(e,[status(thm)],[3,5,7,10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO301^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.09 % 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.11/0.25 % Computer : n004.cluster.edu
% 0.11/0.25 % Model : x86_64 x86_64
% 0.11/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.25 % Memory : 8046.5625MB
% 0.11/0.25 % OS : Linux 6.8.0-71-generic
% 0.11/0.25 % CPULimit : 300
% 0.11/0.25 % WCLimit : 300
% 0.11/0.25 % DateTime : Tue Sep 29 16:44:22 UTC 2026
% 0.11/0.25 % CPUTime :
% 0.11/0.25 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.00/0.72 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.28/0.83 % [INFO] Parsing done (106ms).
% 1.28/0.84 % [INFO] Running in sequential loop mode.
% 1.81/1.08 % [INFO] eprover registered as external prover.
% 1.81/1.09 % [INFO] Scanning for conjecture ...
% 2.06/1.16 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 2.06/1.18 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.06/1.18 % [INFO] Problem is higher-order (TPTP THF).
% 2.06/1.19 % [INFO] Type checking passed.
% 2.06/1.19 % [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 ...
% 4.13/2.00 % External prover 'e' found a proof!
% 4.13/2.01 % [INFO] Killing All external provers ...
% 4.13/2.01 % Time passed: 1594ms (effective reasoning time: 1167ms)
% 4.13/2.01 % 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)>
% 4.13/2.01 % Axioms used in derivation (0):
% 4.13/2.01 % No. of inferences in proof: 11
% 4.13/2.01 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1594 ms resp. 1167 ms w/o parsing
% 4.58/2.07 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.58/2.07 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------