%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SEU927^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 : 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:29:36 AM UTC 2026
% Result : Theorem 3.67s 2.29s
% Output : Refutation 3.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 17 ( 8 unt; 0 typ; 2 def)
% Number of atoms : 33 ( 6 equ; 0 cnn)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 124 ( 17 ~; 8 |; 7 &; 82 @)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 25 ( 25 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 2 usr; 2 con; 0-2 aty)
% Number of variables : 49 ( 29 ^; 18 !; 0 ?; 49 :)
% ( 0 !>; 0 ?*; 0 @-; 2 @+)
% Comments :
%------------------------------------------------------------------------------
thf(a_type,type,
a: $tType ).
thf(sk1_decl,type,
sk1: a > a ).
thf(sk2_decl,type,
sk2: ( a > a ) > $o ).
thf(sk1_def,definition,
( sk1
= ( @+[A: a > a] :
~ ! [B: ( a > a ) > $o] :
( ( ( B
@ ^ [C: a] : C )
& ! [C: a > a] :
( ( B @ C )
=> ( B
@ ^ [D: a] : ( A @ ( C @ D ) ) ) ) )
=> ( B
@ ^ [C: a] : ( A @ ( A @ C ) ) ) ) ) ) ).
thf(sk2_def,definition,
( sk2
= ( @+[A: ( a > a ) > $o] :
~ ( ( ( A
@ ^ [B: a] : B )
& ! [B: a > a] :
( ( A @ B )
=> ( A
@ ^ [C: a] : ( sk1 @ ( B @ C ) ) ) ) )
=> ( A
@ ^ [B: a] : ( sk1 @ ( sk1 @ B ) ) ) ) ) ) ).
thf(1,conjecture,
! [A: a > a,B: ( a > a ) > $o] :
( ( ( B
@ ^ [C: a] : C )
& ! [C: a > a] :
( ( B @ C )
=> ( B
@ ^ [D: a] : ( A @ ( C @ D ) ) ) ) )
=> ( B
@ ^ [C: a] : ( A @ ( A @ C ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM92_pme) ).
thf(2,negated_conjecture,
~ ! [A: a > a,B: ( a > a ) > $o] :
( ( ( B
@ ^ [C: a] : C )
& ! [C: a > a] :
( ( B @ C )
=> ( B
@ ^ [D: a] : ( A @ ( C @ D ) ) ) ) )
=> ( B
@ ^ [C: a] : ( A @ ( A @ C ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ! [A: a > a,B: ( a > a ) > $o] :
( ( ( B
@ ^ [C: a] : C )
& ! [C: a > a] :
( ( B @ C )
=> ( B
@ ^ [D: a] : ( A @ ( C @ D ) ) ) ) )
=> ( B
@ ^ [C: a] : ( A @ ( A @ C ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
! [A: a > a] :
( ( sk2
@ ^ [B: a] : B )
& ( ~ ( sk2 @ A )
| ( sk2
@ ^ [B: a] : ( sk1 @ ( A @ B ) ) ) )
& ~ ( sk2
@ ^ [B: a] : ( sk1 @ ( sk1 @ B ) ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(5,plain,
( sk2
@ ^ [A: a] : A ),
inference(cnfConj,[status(thm)],[4]) ).
thf(6,plain,
! [A: a > a] :
( ~ ( sk2 @ A )
| ( sk2
@ ^ [B: a] : ( sk1 @ ( A @ B ) ) ) ),
inference(cnfConj,[status(thm)],[4]) ).
thf(12,plain,
! [A: a > a] :
( ~ $true
| ( sk2
@ ^ [B: a] : ( sk1 @ ( A @ B ) ) )
| ( ( sk2
@ ^ [B: a] : B )
!= ( sk2 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[5,6]) ).
thf(13,plain,
! [A: a > a] :
( ( sk2
@ ^ [B: a] : ( sk1 @ ( A @ B ) ) )
| ( ( sk2
@ ^ [B: a] : B )
!= ( sk2 @ A ) ) ),
inference(simp,[status(thm)],[12]) ).
thf(14,plain,
sk2 @ sk1,
inference(pattern_uni,[status(thm)],[13:[bind(A,$thf( ^ [B: a] : B ))]]) ).
thf(7,plain,
~ ( sk2
@ ^ [A: a] : ( sk1 @ ( sk1 @ A ) ) ),
inference(cnfConj,[status(thm)],[4]) ).
thf(18,plain,
! [A: a > a] :
( ~ ( sk2 @ A )
| ~ $true
| ( ( sk2
@ ^ [B: a] : ( sk1 @ ( A @ B ) ) )
!= ( sk2
@ ^ [B: a] : ( sk1 @ ( sk1 @ B ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[6,7]) ).
thf(19,plain,
! [A: a > a] :
( ~ ( sk2 @ A )
| ( ( sk2
@ ^ [B: a] : ( sk1 @ ( A @ B ) ) )
!= ( sk2
@ ^ [B: a] : ( sk1 @ ( sk1 @ B ) ) ) ) ),
inference(simp,[status(thm)],[18]) ).
thf(20,plain,
~ ( sk2 @ sk1 ),
inference(pattern_uni,[status(thm)],[19:[bind(A,$thf( sk1 ))]]) ).
thf(28,plain,
$false,
inference(rewrite,[status(thm)],[14,20]) ).
thf(29,plain,
$false,
inference(simp,[status(thm)],[28]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU927^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07 % 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.21 % Computer : n014.cluster.edu
% 0.11/0.21 % Model : x86_64 x86_64
% 0.11/0.21 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.21 % Memory : 8046.5625MB
% 0.11/0.21 % OS : Linux 6.8.0-71-generic
% 0.11/0.21 % CPULimit : 300
% 0.11/0.21 % WCLimit : 300
% 0.11/0.21 % DateTime : Tue Sep 29 14:46:00 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
% 0.99/0.80 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.16/0.97 % [INFO] Parsing done (172ms).
% 1.16/0.99 % [INFO] Running in sequential loop mode.
% 1.71/1.38 % [INFO] eprover registered as external prover.
% 1.71/1.39 % [INFO] Scanning for conjecture ...
% 1.89/1.47 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 2.05/1.51 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.05/1.51 % [INFO] Problem is higher-order (TPTP THF).
% 2.05/1.52 % [INFO] Type checking passed.
% 2.05/1.52 % [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.67/2.28 % [INFO] Killing All external provers ...
% 3.67/2.28 % Time passed: 1917ms (effective reasoning time: 1287ms)
% 3.67/2.28 % 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.67/2.28 % Axioms used in derivation (0):
% 3.67/2.28 % No. of inferences in proof: 15
% 3.67/2.29 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1917 ms resp. 1287 ms w/o parsing
% 3.92/2.34 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.92/2.34 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------