%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SET045^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 : n012.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:22:52 AM UTC 2026
% Result : Theorem 1.39s 1.00s
% Output : Refutation 1.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 2
% Syntax : Number of formulae : 7 ( 7 unt; 0 typ; 1 def)
% Number of atoms : 8 ( 7 equ; 0 cnn)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 13 ( 5 ~; 0 |; 0 &; 8 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Number of types : 2 ( 2 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 4 ( 2 usr; 2 con; 0-2 aty)
% Number of variables : 10 ( 1 ^; 5 !; 3 ?; 10 :)
% ( 0 !>; 0 ?*; 0 @-; 1 @+)
% Comments :
%------------------------------------------------------------------------------
thf(b_type,type,
b: $tType ).
thf(a_type,type,
a: $tType ).
thf(cA_decl,type,
cA: b ).
thf(sk1_decl,type,
sk1: ( a > b ) > a ).
thf(sk1_def,definition,
( sk1
= ( ^ [A: a > b] :
@+[B: a] :
( ( A @ B )
!= cA ) ) ) ).
thf(1,conjecture,
? [A: a > b] :
! [B: a] :
( ( A @ B )
= cA ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTTTP5243) ).
thf(2,negated_conjecture,
~ ? [A: a > b] :
! [B: a] :
( ( A @ B )
= cA ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ? [A: a > b] :
! [B: a] :
( ( A @ B )
= cA ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
! [A: a > b] :
( ( A @ ( sk1 @ A ) )
!= cA ),
inference(cnf,[status(esa)],[3]) ).
thf(5,plain,
! [A: a > b] :
( ( A @ ( sk1 @ A ) )
!= cA ),
inference(lifteq,[status(thm)],[4]) ).
thf(6,plain,
$false,
inference(pre_uni,[status(thm)],[5:[bind(A,$thf( ^ [B: a] : cA ))]]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SET045^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % 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.00/0.11 % Computer : n012.cluster.edu
% 0.00/0.11 % Model : x86_64 x86_64
% 0.00/0.11 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.00/0.11 % Memory : 8046.5625MB
% 0.00/0.11 % OS : Linux 6.8.0-71-generic
% 0.00/0.11 % CPULimit : 300
% 0.00/0.11 % WCLimit : 300
% 0.00/0.11 % DateTime : Tue Sep 29 13:35:48 UTC 2026
% 0.07/0.12 % CPUTime :
% 0.07/0.12 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.39/0.40 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.56/0.49 % [INFO] Parsing done (89ms).
% 0.56/0.50 % [INFO] Running in sequential loop mode.
% 0.84/0.69 % [INFO] eprover registered as external prover.
% 0.84/0.69 % [INFO] Scanning for conjecture ...
% 0.99/0.74 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 0.99/0.75 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 0.99/0.75 % [INFO] Problem is higher-order (TPTP THF).
% 0.99/0.75 % [INFO] Type checking passed.
% 0.99/0.76 % [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 ...
% 1.39/1.00 % [INFO] Killing All external provers ...
% 1.39/1.00 % Time passed: 809ms (effective reasoning time: 495ms)
% 1.39/1.00 % 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)>
% 1.39/1.00 % Axioms used in derivation (0):
% 1.39/1.00 % No. of inferences in proof: 6
% 1.39/1.00 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 809 ms resp. 495 ms w/o parsing
% 1.70/1.02 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 1.70/1.02 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------