%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SYN992^1 : TPTP v9.3.1. Bugfixed 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 : n014.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:41:35 AM UTC 2026
% Result : Theorem 2.79s 1.88s
% Output : Refutation 3.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 9 ( 7 unt; 0 typ; 2 def)
% Number of atoms : 12 ( 8 equ; 4 cnn)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 26 ( 6 ~; 0 |; 0 &; 20 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 12 ( 12 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 2 usr; 2 con; 0-2 aty)
% Number of variables : 9 ( 2 ^; 3 !; 3 ?; 9 :)
% ( 0 !>; 0 ?*; 0 @-; 1 @+)
% Comments :
%------------------------------------------------------------------------------
thf(refl_decl,type,
refl: ( $i > $i > $o ) > $o ).
thf(sk1_decl,type,
sk1: ( $i > $i > $o ) > $i ).
thf(refl_def,definition,
( refl
= ( ^ [A: $i > $i > $o] :
! [B: $i] : ( A @ B @ B ) ) ) ).
thf(sk1_def,definition,
( sk1
= ( ^ [A: $i > $i > $o] :
@+[B: $i] :
~ ( A @ B @ B ) ) ) ).
thf(1,conjecture,
? [A: $i > $i > $o] : ( refl @ A ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax) ).
thf(2,negated_conjecture,
~ ? [A: $i > $i > $o] : ( refl @ A ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ? [A: $i > $i > $o] :
! [B: $i] : ( A @ B @ B ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
! [A: $i > $i > $o] :
~ ( A @ ( sk1 @ A ) @ ( sk1 @ A ) ),
inference(cnf,[status(esa)],[3]) ).
thf(5,plain,
( ( sk1 @ ( (=) @ $i ) )
!= ( sk1 @ ( (=) @ $i ) ) ),
inference(replace_andrewseq,[status(thm)],[4:[bind(A,$thf( (=) @ $i ))]]) ).
thf(6,plain,
( ( sk1 @ ( (=) @ $i ) )
!= ( sk1 @ ( (=) @ $i ) ) ),
inference(lifteq,[status(thm)],[5]) ).
thf(7,plain,
$false,
inference(simp,[status(thm)],[6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN992^1 : TPTP v9.3.1. Bugfixed v4.0.0.
% 0.00/0.06 % 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.22 % Computer : n014.cluster.edu
% 0.11/0.22 % Model : x86_64 x86_64
% 0.11/0.22 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.22 % Memory : 8046.5625MB
% 0.11/0.22 % OS : Linux 6.8.0-71-generic
% 0.11/0.22 % CPULimit : 300
% 0.11/0.22 % WCLimit : 300
% 0.11/0.22 % DateTime : Tue Sep 29 16:19:59 UTC 2026
% 0.11/0.22 % CPUTime :
% 0.11/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.17/0.94 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.62/1.18 % [INFO] Parsing done (233ms).
% 1.73/1.20 % [INFO] Running in sequential loop mode.
% 2.33/1.67 % [INFO] eprover registered as external prover.
% 2.33/1.68 % [INFO] Scanning for conjecture ...
% 2.57/1.73 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 2.57/1.75 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.57/1.75 % [INFO] Problem is higher-order (TPTP THF).
% 2.57/1.75 % [INFO] Type checking passed.
% 2.57/1.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 ...
% 2.79/1.87 % [INFO] Killing All external provers ...
% 2.79/1.88 % Time passed: 1464ms (effective reasoning time: 667ms)
% 2.79/1.88 % 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.79/1.88 % Axioms used in derivation (0):
% 2.79/1.88 % No. of inferences in proof: 7
% 2.79/1.88 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1464 ms resp. 667 ms w/o parsing
% 3.10/1.91 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.10/1.91 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------