%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SEU917^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 : n020.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:35 AM UTC 2026
% Result : Theorem 2.69s 1.48s
% Output : Refutation 3.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 13 ( 8 unt; 0 typ; 2 def)
% Number of atoms : 22 ( 21 equ; 0 cnn)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 55 ( 10 ~; 1 |; 1 &; 38 @)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 12 ( 12 >; 0 *; 0 +; 0 <<)
% Number of symbols : 4 ( 2 usr; 1 con; 0-2 aty)
% Number of variables : 23 ( 4 ^; 14 !; 3 ?; 23 :)
% ( 0 !>; 0 ?*; 0 @-; 2 @+)
% Comments :
%------------------------------------------------------------------------------
thf(sk1_decl,type,
sk1: ( $i > $i ) > $i ).
thf(sk2_decl,type,
sk2: ( $i > $i ) > $i ).
thf(sk1_def,definition,
( sk1
= ( ^ [A: $i > $i] :
@+[B: $i] :
~ ! [C: $i] :
( ( ( A @ B )
= ( A @ C ) )
=> ( B = C ) ) ) ) ).
thf(sk2_def,definition,
( sk2
= ( ^ [A: $i > $i] :
@+[B: $i] :
~ ( ( ( A @ ( sk1 @ A ) )
= ( A @ B ) )
=> ( ( sk1 @ A )
= B ) ) ) ) ).
thf(1,conjecture,
? [A: $i > $i] :
! [B: $i,C: $i] :
( ( ( A @ B )
= ( A @ C ) )
=> ( B = C ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM8_pme) ).
thf(2,negated_conjecture,
~ ? [A: $i > $i] :
! [B: $i,C: $i] :
( ( ( A @ B )
= ( A @ C ) )
=> ( B = C ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ? [A: $i > $i] :
! [B: $i,C: $i] :
( ( ( A @ B )
= ( A @ C ) )
=> ( B = C ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
! [A: $i > $i] :
( ( ( A @ ( sk1 @ A ) )
= ( A @ ( sk2 @ A ) ) )
& ( ( sk1 @ A )
!= ( sk2 @ A ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(5,plain,
! [A: $i > $i] :
( ( A @ ( sk1 @ A ) )
= ( A @ ( sk2 @ A ) ) ),
inference(cnfConj,[status(thm)],[4]) ).
thf(7,plain,
! [A: $i > $i] :
( ( A @ ( sk2 @ A ) )
= ( A @ ( sk1 @ A ) ) ),
inference(lifteq,[status(thm)],[5]) ).
thf(6,plain,
! [A: $i > $i] :
( ( sk1 @ A )
!= ( sk2 @ A ) ),
inference(cnfConj,[status(thm)],[4]) ).
thf(8,plain,
! [A: $i > $i] :
( ( sk2 @ A )
!= ( sk1 @ A ) ),
inference(lifteq,[status(thm)],[6]) ).
thf(10,plain,
! [B: $i > $i,A: $i > $i] :
( ( ( A @ ( sk1 @ A ) )
!= ( sk1 @ B ) )
| ( ( A @ ( sk2 @ A ) )
!= ( sk2 @ B ) ) ),
inference(paramod_ordered,[status(thm)],[7,8]) ).
thf(14,plain,
( ( sk1
@ ^ [A: $i] : A )
!= ( sk1
@ ^ [A: $i] : A ) ),
inference(pre_uni,[status(thm)],[10:[bind(A,$thf( ^ [C: $i] : C )),bind(B,$thf( ^ [C: $i] : C ))]]) ).
thf(15,plain,
$false,
inference(pattern_uni,[status(thm)],[14:[]]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU917^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08 % 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.09/0.22 % Computer : n020.cluster.edu
% 0.09/0.22 % Model : x86_64 x86_64
% 0.09/0.22 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.22 % Memory : 8046.5625MB
% 0.09/0.22 % OS : Linux 6.8.0-71-generic
% 0.09/0.22 % CPULimit : 300
% 0.09/0.22 % WCLimit : 300
% 0.09/0.22 % DateTime : Tue Sep 29 14:46:19 UTC 2026
% 0.09/0.22 % CPUTime :
% 0.09/0.22 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.89/0.75 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.10/0.84 % [INFO] Parsing done (91ms).
% 1.10/0.84 % [INFO] Running in sequential loop mode.
% 1.53/1.04 % [INFO] eprover registered as external prover.
% 1.53/1.04 % [INFO] Scanning for conjecture ...
% 1.53/1.08 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.53/1.10 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.53/1.10 % [INFO] Problem is higher-order (TPTP THF).
% 1.53/1.10 % [INFO] Type checking passed.
% 1.53/1.10 % [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.69/1.47 % [INFO] Killing All external provers ...
% 2.69/1.48 % Time passed: 1120ms (effective reasoning time: 627ms)
% 2.69/1.48 % 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.69/1.48 % Axioms used in derivation (0):
% 2.69/1.48 % No. of inferences in proof: 11
% 2.69/1.48 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1120 ms resp. 627 ms w/o parsing
% 3.03/1.51 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.03/1.51 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------