%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SEU874^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 : n013.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:30 AM UTC 2026
% Result : Theorem 10.64s 3.02s
% Output : Refutation 11.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 28
% Number of leaves : 6
% Syntax : Number of formulae : 58 ( 17 unt; 0 typ; 5 def)
% Number of atoms : 277 ( 85 equ; 11 cnn)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 737 ( 137 ~; 168 |; 34 &; 359 @)
% ( 0 <=>; 39 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 7 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 79 ( 79 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 180 ( 69 ^; 99 !; 7 ?; 180 :)
% ( 0 !>; 0 ?*; 0 @-; 5 @+)
% Comments :
%------------------------------------------------------------------------------
thf(a_type,type,
a: $tType ).
thf(cX_decl,type,
cX: a > $o ).
thf(sk1_decl,type,
sk1: a ).
thf(sk2_decl,type,
sk2: ( a > $o ) > $o ).
thf(sk3_decl,type,
sk3: ( a > $o ) > ( a > $o ) > $o ).
thf(sk4_decl,type,
sk4: ( a > $o ) > a ).
thf(sk5_decl,type,
sk5: a > $o ).
thf(sk6_decl,type,
sk6: ( ( a > $o ) > $o ) > a > $o ).
thf(sk7_decl,type,
sk7: ( ( a > $o ) > $o ) > a ).
thf(sk3_def,definition,
( sk3
= ( ^ [A: a > $o] :
@+[B: ( a > $o ) > $o] :
~ ( ( ( B
@ ^ [C: a] : $false )
& ! [C: a > $o] :
( ( B @ C )
=> ! [D: a] :
( ( A @ D )
=> ( B
@ ^ [E: a] :
( ( C @ E )
| ( D = E ) ) ) ) ) )
=> ( B @ A ) ) ) ) ).
thf(sk4_def,definition,
( sk4
= ( ^ [A: a > $o] :
@+[B: a] :
~ ( ( A @ B )
=> ( cX @ B ) ) ) ) ).
thf(sk5_def,definition,
( sk5
= ( @+[A: a > $o] :
( ! [B: ( a > $o ) > $o] :
( ( ( B
@ ^ [C: a] : $false )
& ! [C: a > $o] :
( ( B @ C )
=> ! [D: a] :
( ( A @ D )
=> ( B
@ ^ [E: a] :
( ( C @ E )
| ( D = E ) ) ) ) ) )
=> ( B @ A ) )
& ! [B: a] :
( ( A @ B )
=> ( cX @ B ) )
& ( A @ sk1 ) ) ) ) ).
thf(sk6_def,definition,
( sk6
= ( ^ [A: ( a > $o ) > $o] :
@+[B: a > $o] :
~ ( ( A @ B )
=> ! [C: a] :
( ( sk5 @ C )
=> ( A
@ ^ [D: a] :
( ( B @ D )
| ( C = D ) ) ) ) ) ) ) ).
thf(sk7_def,definition,
( sk7
= ( ^ [A: ( a > $o ) > $o] :
@+[B: a] :
~ ( ( sk5 @ B )
=> ( A
@ ^ [C: a] :
( ( sk6 @ A @ C )
| ( B = C ) ) ) ) ) ) ).
thf(1,conjecture,
( cX
= ( ^ [A: a] :
? [B: a > $o] :
( ! [C: ( a > $o ) > $o] :
( ( ( C
@ ^ [D: a] : $false )
& ! [D: a > $o] :
( ( C @ D )
=> ! [E: a] :
( ( B @ E )
=> ( C
@ ^ [F: a] :
( ( D @ F )
| ( E = F ) ) ) ) ) )
=> ( C @ B ) )
& ! [C: a] :
( ( B @ C )
=> ( cX @ C ) )
& ( B @ A ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cDOMLEMMA3_pme) ).
thf(2,negated_conjecture,
( cX
!= ( ^ [A: a] :
? [B: a > $o] :
( ! [C: ( a > $o ) > $o] :
( ( ( C
@ ^ [D: a] : $false )
& ! [D: a > $o] :
( ( C @ D )
=> ! [E: a] :
( ( B @ E )
=> ( C
@ ^ [F: a] :
( ( D @ F )
| ( E = F ) ) ) ) ) )
=> ( C @ B ) )
& ! [C: a] :
( ( B @ C )
=> ( cX @ C ) )
& ( B @ A ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( cX
!= ( ^ [A: a] :
? [B: a > $o] :
( ! [C: ( a > $o ) > $o] :
( ( ( C
@ ^ [D: a] : $false )
& ! [D: a > $o] :
( ( C @ D )
=> ! [E: a] :
( ( B @ E )
=> ( C
@ ^ [F: a] :
( ( D @ F )
| ( E = F ) ) ) ) ) )
=> ( C @ B ) )
& ! [C: a] :
( ( B @ C )
=> ( cX @ C ) )
& ( B @ A ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
( cX
!= ( ^ [A: a] :
? [B: a > $o] :
( ! [C: ( a > $o ) > $o] :
( ( ( C
@ ^ [D: a] : $false )
& ! [D: a > $o] :
( ( C @ D )
=> ! [E: a] :
( ( B @ E )
=> ( C
@ ^ [F: a] :
( ( D @ F )
| ( E = F ) ) ) ) ) )
=> ( C @ B ) )
& ! [C: a] :
( ( B @ C )
=> ( cX @ C ) )
& ( B @ A ) ) ) ),
inference(lifteq,[status(thm)],[3]) ).
thf(5,plain,
( ( cX @ sk1 )
!= ( ? [A: a > $o] :
( ! [B: ( a > $o ) > $o] :
( ( ( B
@ ^ [C: a] : $false )
& ! [C: a > $o] :
( ( B @ C )
=> ! [D: a] :
( ( A @ D )
=> ( B
@ ^ [E: a] :
( ( C @ E )
| ( D = E ) ) ) ) ) )
=> ( B @ A ) )
& ! [B: a] :
( ( A @ B )
=> ( cX @ B ) )
& ( A @ sk1 ) ) ) ),
inference(func_ext,[status(esa)],[4]) ).
thf(6,plain,
( ~ ( cX @ sk1 )
| ~ ? [A: a > $o] :
( ! [B: ( a > $o ) > $o] :
( ( ( B
@ ^ [C: a] : $false )
& ! [C: a > $o] :
( ( B @ C )
=> ! [D: a] :
( ( A @ D )
=> ( B
@ ^ [E: a] :
( ( C @ E )
| ( D = E ) ) ) ) ) )
=> ( B @ A ) )
& ! [B: a] :
( ( A @ B )
=> ( cX @ B ) )
& ( A @ sk1 ) ) ),
inference(bool_ext,[status(thm)],[5]) ).
thf(8,plain,
! [C: a,B: a > $o,A: a > $o] :
( ( ~ ( cX @ sk1 )
| ( sk3 @ A
@ ^ [D: a] : $false )
| ~ ( sk2 @ A ) )
& ( ~ ( cX @ sk1 )
| ~ ( sk3 @ A @ B )
| ~ ( A @ C )
| ( sk3 @ A
@ ^ [D: a] :
( ( B @ D )
| ( C = D ) ) )
| ~ ( sk2 @ A ) )
& ( ~ ( cX @ sk1 )
| ~ ( sk3 @ A @ A )
| ~ ( sk2 @ A ) )
& ( ~ ( cX @ sk1 )
| ( sk2 @ A )
| ( A @ ( sk4 @ A ) )
| ~ ( A @ sk1 ) )
& ( ~ ( cX @ sk1 )
| ( sk2 @ A )
| ~ ( cX @ ( sk4 @ A ) )
| ~ ( A @ sk1 ) ) ),
inference(cnf,[status(esa)],[6]) ).
thf(11,plain,
! [A: a > $o] :
( ~ ( cX @ sk1 )
| ( sk2 @ A )
| ~ ( cX @ ( sk4 @ A ) )
| ~ ( A @ sk1 ) ),
inference(cnfConj,[status(thm)],[8]) ).
thf(7,plain,
( ( cX @ sk1 )
| ? [A: a > $o] :
( ! [B: ( a > $o ) > $o] :
( ( ( B
@ ^ [C: a] : $false )
& ! [C: a > $o] :
( ( B @ C )
=> ! [D: a] :
( ( A @ D )
=> ( B
@ ^ [E: a] :
( ( C @ E )
| ( D = E ) ) ) ) ) )
=> ( B @ A ) )
& ! [B: a] :
( ( A @ B )
=> ( cX @ B ) )
& ( A @ sk1 ) ) ),
inference(bool_ext,[status(thm)],[5]) ).
thf(14,plain,
! [B: a,A: ( a > $o ) > $o] :
( ( ( cX @ sk1 )
| ~ ( A
@ ^ [C: a] : $false )
| ( A @ ( sk6 @ A ) )
| ( A @ sk5 ) )
& ( ( cX @ sk1 )
| ~ ( A
@ ^ [C: a] : $false )
| ( sk5 @ ( sk7 @ A ) )
| ( A @ sk5 ) )
& ( ( cX @ sk1 )
| ~ ( A
@ ^ [C: a] : $false )
| ~ ( A
@ ^ [C: a] :
( ( sk6 @ A @ C )
| ( ( sk7 @ A )
= C ) ) )
| ( A @ sk5 ) )
& ( ( cX @ sk1 )
| ~ ( sk5 @ B )
| ( cX @ B ) )
& ( ( cX @ sk1 )
| ( sk5 @ sk1 ) ) ),
inference(cnf,[status(esa)],[7]) ).
thf(18,plain,
( ( cX @ sk1 )
| ( sk5 @ sk1 ) ),
inference(cnfConj,[status(thm)],[14]) ).
thf(19,plain,
! [A: a] :
( ( cX @ sk1 )
| ~ ( sk5 @ A )
| ( cX @ A ) ),
inference(cnfConj,[status(thm)],[14]) ).
thf(20,plain,
! [A: a] :
( ( cX @ sk1 )
| ~ ( sk5 @ A )
| ( cX @ A ) ),
inference(simp,[status(thm)],[19]) ).
thf(21,plain,
! [A: a] :
( ( cX @ sk1 )
| ( cX @ sk1 )
| ~ $true
| ( cX @ A )
| ( ( sk5 @ sk1 )
!= ( sk5 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[18,20]) ).
thf(22,plain,
! [A: a] :
( ( cX @ sk1 )
| ( cX @ A )
| ( ( sk5 @ sk1 )
!= ( sk5 @ A ) ) ),
inference(simp,[status(thm)],[21]) ).
thf(23,plain,
( ( cX @ sk1 )
| ( cX @ sk1 ) ),
inference(pattern_uni,[status(thm)],[22:[bind(A,$thf( sk1 ))]]) ).
thf(24,plain,
cX @ sk1,
inference(simp,[status(thm)],[23]) ).
thf(144,plain,
! [A: a > $o] :
( ~ $true
| ( sk2 @ A )
| ~ ( cX @ ( sk4 @ A ) )
| ~ ( A @ sk1 ) ),
inference(rewrite,[status(thm)],[11,24]) ).
thf(145,plain,
! [A: a > $o] :
( ( sk2 @ A )
| ~ ( cX @ ( sk4 @ A ) )
| ~ ( A @ sk1 ) ),
inference(simp,[status(thm)],[144]) ).
thf(10,plain,
! [A: a > $o] :
( ~ ( cX @ sk1 )
| ( sk3 @ A
@ ^ [B: a] : $false )
| ~ ( sk2 @ A ) ),
inference(cnfConj,[status(thm)],[8]) ).
thf(81,plain,
! [A: a > $o] :
( ~ $true
| ( sk3 @ A
@ ^ [B: a] : $false )
| ~ ( sk2 @ A ) ),
inference(rewrite,[status(thm)],[10,24]) ).
thf(82,plain,
! [A: a > $o] :
( ( sk3 @ A
@ ^ [B: a] : $false )
| ~ ( sk2 @ A ) ),
inference(simp,[status(thm)],[81]) ).
thf(12,plain,
! [C: a,B: a > $o,A: a > $o] :
( ~ ( cX @ sk1 )
| ~ ( sk3 @ A @ B )
| ~ ( A @ C )
| ( sk3 @ A
@ ^ [D: a] :
( ( B @ D )
| ( C = D ) ) )
| ~ ( sk2 @ A ) ),
inference(cnfConj,[status(thm)],[8]) ).
thf(9,plain,
! [A: a > $o] :
( ~ ( cX @ sk1 )
| ~ ( sk3 @ A @ A )
| ~ ( sk2 @ A ) ),
inference(cnfConj,[status(thm)],[8]) ).
thf(25,plain,
! [D: a > $o,C: a,B: a > $o,A: a > $o] :
( ~ ( cX @ sk1 )
| ~ ( sk3 @ A @ B )
| ~ ( A @ C )
| ~ ( sk2 @ A )
| ~ ( cX @ sk1 )
| ~ $true
| ~ ( sk2 @ D )
| ( ( sk3 @ A
@ ^ [E: a] :
( ( B @ E )
| ( C = E ) ) )
!= ( sk3 @ D @ D ) ) ),
inference(paramod_ordered,[status(thm)],[12,9]) ).
thf(26,plain,
! [D: a > $o,C: a,B: a > $o,A: a > $o] :
( ~ ( cX @ sk1 )
| ~ ( sk3 @ A @ B )
| ~ ( A @ C )
| ~ ( sk2 @ A )
| ~ ( sk2 @ D )
| ( ( sk3 @ A
@ ^ [E: a] :
( ( B @ E )
| ( C = E ) ) )
!= ( sk3 @ D @ D ) ) ),
inference(simp,[status(thm)],[25]) ).
thf(27,plain,
! [B: a > $o,A: a] :
( ~ ( cX @ sk1 )
| ~ ( sk3
@ ^ [C: a] :
( ( B @ C )
| ( A = C ) )
@ B )
| ~ ( ( B @ A )
| ( A = A ) )
| ~ ( sk2
@ ^ [C: a] :
( ( B @ C )
| ( A = C ) ) )
| ~ ( sk2
@ ^ [C: a] :
( ( B @ C )
| ( A = C ) ) ) ),
inference(pattern_uni,[status(thm)],[26:[bind(A,$thf( ^ [F: a] : ( ( E @ F ) | ( C = F ) ) )),bind(B,$thf( E )),bind(C,$thf( C )),bind(D,$thf( ^ [F: a] : ( ( E @ F ) | ( C = F ) ) ))]]) ).
thf(65,plain,
! [B: a > $o,A: a] :
( ( ~ ( cX @ sk1 )
| ~ ( sk3
@ ^ [C: a] :
( ( B @ C )
| ( A = C ) )
@ B )
| ~ ( B @ A )
| ~ ( sk2
@ ^ [C: a] :
( ( B @ C )
| ( A = C ) ) )
| ~ ( sk2
@ ^ [C: a] :
( ( B @ C )
| ( A = C ) ) ) )
& ( ~ ( cX @ sk1 )
| ~ ( sk3
@ ^ [C: a] :
( ( B @ C )
| ( A = C ) )
@ B )
| ( A != A )
| ~ ( sk2
@ ^ [C: a] :
( ( B @ C )
| ( A = C ) ) )
| ~ ( sk2
@ ^ [C: a] :
( ( B @ C )
| ( A = C ) ) ) ) ),
inference(cnf,[status(esa)],[27]) ).
thf(67,plain,
! [B: a > $o,A: a] :
( ~ ( cX @ sk1 )
| ~ ( sk3
@ ^ [C: a] :
( ( B @ C )
| ( A = C ) )
@ B )
| ( A != A )
| ~ ( sk2
@ ^ [C: a] :
( ( B @ C )
| ( A = C ) ) )
| ~ ( sk2
@ ^ [C: a] :
( ( B @ C )
| ( A = C ) ) ) ),
inference(cnfConj,[status(thm)],[65]) ).
thf(69,plain,
! [B: a > $o,A: a] :
( ( A != A )
| ~ ( cX @ sk1 )
| ~ ( sk3
@ ^ [C: a] :
( ( B @ C )
| ( A = C ) )
@ B )
| ~ ( sk2
@ ^ [C: a] :
( ( B @ C )
| ( A = C ) ) )
| ~ ( sk2
@ ^ [C: a] :
( ( B @ C )
| ( A = C ) ) ) ),
inference(lifteq,[status(thm)],[67]) ).
thf(70,plain,
! [B: a > $o,A: a] :
( ~ ( cX @ sk1 )
| ~ ( sk3
@ ^ [C: a] :
( ( B @ C )
| ( A = C ) )
@ B )
| ~ ( sk2
@ ^ [C: a] :
( ( B @ C )
| ( A = C ) ) ) ),
inference(simp,[status(thm)],[69]) ).
thf(91,plain,
! [B: a > $o,A: a] :
( ~ $true
| ~ ( sk3
@ ^ [C: a] :
( ( B @ C )
| ( A = C ) )
@ B )
| ~ ( sk2
@ ^ [C: a] :
( ( B @ C )
| ( A = C ) ) ) ),
inference(rewrite,[status(thm)],[70,24]) ).
thf(92,plain,
! [B: a > $o,A: a] :
( ~ ( sk3
@ ^ [C: a] :
( ( B @ C )
| ( A = C ) )
@ B )
| ~ ( sk2
@ ^ [C: a] :
( ( B @ C )
| ( A = C ) ) ) ),
inference(simp,[status(thm)],[91]) ).
thf(93,plain,
! [C: a > $o,B: a,A: a > $o] :
( ~ ( sk2 @ A )
| ~ $true
| ~ ( sk2
@ ^ [D: a] :
( ( C @ D )
| ( B = D ) ) )
| ( ( sk3 @ A
@ ^ [D: a] : $false )
!= ( sk3
@ ^ [D: a] :
( ( C @ D )
| ( B = D ) )
@ C ) ) ),
inference(paramod_ordered,[status(thm)],[82,92]) ).
thf(94,plain,
! [C: a > $o,B: a,A: a > $o] :
( ~ ( sk2 @ A )
| ~ ( sk2
@ ^ [D: a] :
( ( C @ D )
| ( B = D ) ) )
| ( ( sk3 @ A
@ ^ [D: a] : $false )
!= ( sk3
@ ^ [D: a] :
( ( C @ D )
| ( B = D ) )
@ C ) ) ),
inference(simp,[status(thm)],[93]) ).
thf(95,plain,
! [A: a] :
( ~ ( sk2
@ ^ [B: a] :
( $false
| ( A = B ) ) )
| ~ ( sk2
@ ^ [B: a] :
( $false
| ( A = B ) ) ) ),
inference(pattern_uni,[status(thm)],[94:[bind(A,$thf( ^ [D: a] : ( $false | ( B = D ) ) )),bind(B,$thf( B )),bind(C,$thf( ^ [D: a] : $false ))]]) ).
thf(96,plain,
! [A: a] :
~ ( sk2 @ ( (=) @ a @ A ) ),
inference(simp,[status(thm)],[95]) ).
thf(158,plain,
! [B: a,A: a > $o] :
( ~ ( cX @ ( sk4 @ A ) )
| ~ ( A @ sk1 )
| ~ $true
| ( ( sk2 @ A )
!= ( sk2 @ ( (=) @ a @ B ) ) ) ),
inference(paramod_ordered,[status(thm)],[145,96]) ).
thf(159,plain,
! [B: a,A: a > $o] :
( ~ ( cX @ ( sk4 @ A ) )
| ~ ( A @ sk1 )
| ( ( sk2 @ A )
!= ( sk2 @ ( (=) @ a @ B ) ) ) ),
inference(simp,[status(thm)],[158]) ).
thf(160,plain,
! [A: a] :
( ~ ( cX @ ( sk4 @ ( (=) @ a @ A ) ) )
| ( A != sk1 ) ),
inference(pattern_uni,[status(thm)],[159:[bind(A,$thf( (=) @ a @ B )),bind(B,$thf( B ))]]) ).
thf(196,plain,
! [A: a] :
( ( A != sk1 )
| ~ ( cX @ ( sk4 @ ( (=) @ a @ A ) ) ) ),
inference(lifteq,[status(thm)],[160]) ).
thf(208,plain,
~ ( cX @ ( sk4 @ ( (=) @ a @ sk1 ) ) ),
inference(simp,[status(thm)],[196]) ).
thf(13,plain,
! [A: a > $o] :
( ~ ( cX @ sk1 )
| ( sk2 @ A )
| ( A @ ( sk4 @ A ) )
| ~ ( A @ sk1 ) ),
inference(cnfConj,[status(thm)],[8]) ).
thf(238,plain,
! [A: a > $o] :
( ~ $true
| ( sk2 @ A )
| ( A @ ( sk4 @ A ) )
| ~ ( A @ sk1 ) ),
inference(rewrite,[status(thm)],[13,24]) ).
thf(239,plain,
! [A: a > $o] :
( ( sk2 @ A )
| ( A @ ( sk4 @ A ) )
| ~ ( A @ sk1 ) ),
inference(simp,[status(thm)],[238]) ).
thf(256,plain,
! [B: a,A: a > $o] :
( ( A @ ( sk4 @ A ) )
| ~ ( A @ sk1 )
| ~ $true
| ( ( sk2 @ A )
!= ( sk2 @ ( (=) @ a @ B ) ) ) ),
inference(paramod_ordered,[status(thm)],[239,96]) ).
thf(257,plain,
! [B: a,A: a > $o] :
( ( A @ ( sk4 @ A ) )
| ~ ( A @ sk1 )
| ( ( sk2 @ A )
!= ( sk2 @ ( (=) @ a @ B ) ) ) ),
inference(simp,[status(thm)],[256]) ).
thf(258,plain,
! [A: a] :
( ( A
= ( sk4 @ ( (=) @ a @ A ) ) )
| ( A != sk1 ) ),
inference(pattern_uni,[status(thm)],[257:[bind(A,$thf( (=) @ a @ B )),bind(B,$thf( B ))]]) ).
thf(350,plain,
! [A: a] :
( ( A
= ( sk4 @ ( (=) @ a @ A ) ) )
| ( A != sk1 ) ),
inference(lifteq,[status(thm)],[258]) ).
thf(447,plain,
( ( sk4 @ ( (=) @ a @ sk1 ) )
= sk1 ),
inference(simp,[status(thm)],[350]) ).
thf(464,plain,
~ ( cX @ sk1 ),
inference(rewrite,[status(thm)],[208,447]) ).
thf(472,plain,
~ $true,
inference(rewrite,[status(thm)],[464,24]) ).
thf(473,plain,
$false,
inference(simp,[status(thm)],[472]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU874^5 : TPTP v9.3.1. Released 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.10/0.19 % Computer : n013.cluster.edu
% 0.10/0.19 % Model : x86_64 x86_64
% 0.10/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.19 % Memory : 8046.5625MB
% 0.10/0.19 % OS : Linux 6.8.0-71-generic
% 0.10/0.19 % CPULimit : 300
% 0.10/0.19 % WCLimit : 300
% 0.10/0.19 % DateTime : Tue Sep 29 14:41:32 UTC 2026
% 0.10/0.19 % CPUTime :
% 0.10/0.20 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.73/0.52 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.99/0.62 % [INFO] Parsing done (103ms).
% 0.99/0.63 % [INFO] Running in sequential loop mode.
% 1.36/0.84 % [INFO] eprover registered as external prover.
% 1.36/0.85 % [INFO] Scanning for conjecture ...
% 1.36/0.90 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.62/0.91 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.62/0.92 % [INFO] Problem is higher-order (TPTP THF).
% 1.62/0.92 % [INFO] Type checking passed.
% 1.62/0.92 % [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 ...
% 10.64/3.01 % [INFO] Killing All external provers ...
% 10.64/3.01 % Time passed: 2728ms (effective reasoning time: 2380ms)
% 10.64/3.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)>
% 10.64/3.02 % Axioms used in derivation (0):
% 10.64/3.02 % No. of inferences in proof: 53
% 10.64/3.02 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 2728 ms resp. 2380 ms w/o parsing
% 11.35/3.11 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 11.35/3.11 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------