%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SEU811^2 : TPTP v9.3.1. Released v3.7.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:29:23 AM UTC 2026
% Result : Theorem 5.71s 2.15s
% Output : Refutation 5.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 8
% Syntax : Number of formulae : 87 ( 42 unt; 0 typ; 7 def)
% Number of atoms : 277 ( 103 equ; 0 cnn)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 695 ( 124 ~; 83 |; 10 &; 436 @)
% ( 0 <=>; 42 =>; 0 <=; 0 <~>)
% Maximal formula depth : 30 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 13 ( 10 usr; 9 con; 0-2 aty)
% Number of variables : 163 ( 1 ^; 160 !; 0 ?; 163 :)
% ( 0 !>; 0 ?*; 0 @-; 2 @+)
% Comments :
%------------------------------------------------------------------------------
thf(in_decl,type,
in: $i > $i > $o ).
thf(setadjoin_decl,type,
setadjoin: $i > $i > $i ).
thf(omega_decl,type,
omega: $i ).
thf(setadjoinIL_decl,type,
setadjoinIL: $o ).
thf(setadjoinE_decl,type,
setadjoinE: $o ).
thf(in__Cong_decl,type,
in__Cong: $o ).
thf(notinself2_decl,type,
notinself2: $o ).
thf(omegaS_decl,type,
omegaS: $i > $i ).
thf(sk1_decl,type,
sk1: $i ).
thf(sk2_decl,type,
sk2: $i ).
thf(setadjoinIL_def,definition,
( setadjoinIL
= ( ! [A: $i,B: $i] : ( in @ A @ ( setadjoin @ A @ B ) ) ) ) ).
thf(setadjoinE_def,definition,
( setadjoinE
= ( ! [A: $i,B: $i,C: $i] :
( ( in @ C @ ( setadjoin @ A @ B ) )
=> ! [D: $o] :
( ( ( C = A )
=> D )
=> ( ( ( in @ C @ B )
=> D )
=> D ) ) ) ) ) ).
thf(in__Cong_def,definition,
( in__Cong
= ( ! [A: $i,B: $i] :
( ( A = B )
=> ! [C: $i,D: $i] :
( ( C = D )
=> ( ( in @ C @ A )
= ( in @ D @ B ) ) ) ) ) ) ).
thf(notinself2_def,definition,
( notinself2
= ( ! [A: $i,B: $i] :
( ( in @ A @ B )
=> ~ ( in @ B @ A ) ) ) ) ).
thf(omegaS_def,definition,
( omegaS
= ( ^ [A: $i] : ( setadjoin @ A @ A ) ) ) ).
thf(sk1_def,definition,
( sk1
= ( @+[A: $i] :
~ ( ( in @ A @ omega )
=> ! [B: $i] :
( ( in @ B @ omega )
=> ( ( ( setadjoin @ A @ A )
= ( setadjoin @ B @ B ) )
=> ( A = B ) ) ) ) ) ) ).
thf(sk2_def,definition,
( sk2
= ( @+[A: $i] :
~ ( ( in @ A @ omega )
=> ( ( ( setadjoin @ sk1 @ sk1 )
= ( setadjoin @ A @ A ) )
=> ( sk1 = A ) ) ) ) ) ).
thf(1,conjecture,
( setadjoinIL
=> ( setadjoinE
=> ( in__Cong
=> ( notinself2
=> ! [A: $i] :
( ( in @ A @ omega )
=> ! [B: $i] :
( ( in @ B @ omega )
=> ( ( ( omegaS @ A )
= ( omegaS @ B ) )
=> ( A = B ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',peanoSinj) ).
thf(2,negated_conjecture,
~ ( setadjoinIL
=> ( setadjoinE
=> ( in__Cong
=> ( notinself2
=> ! [A: $i] :
( ( in @ A @ omega )
=> ! [B: $i] :
( ( in @ B @ omega )
=> ( ( ( omegaS @ A )
= ( omegaS @ B ) )
=> ( A = B ) ) ) ) ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ( ! [A: $i,B: $i] : ( in @ A @ ( setadjoin @ A @ B ) )
=> ( ! [A: $i,B: $i,C: $i] :
( ( in @ C @ ( setadjoin @ A @ B ) )
=> ! [D: $o] :
( ( ( C = A )
=> D )
=> ( ( ( in @ C @ B )
=> D )
=> D ) ) )
=> ( ! [A: $i,B: $i] :
( ( A = B )
=> ! [C: $i,D: $i] :
( ( C = D )
=> ( ( in @ C @ A )
= ( in @ D @ B ) ) ) )
=> ( ! [A: $i,B: $i] :
( ( in @ A @ B )
=> ~ ( in @ B @ A ) )
=> ! [A: $i] :
( ( in @ A @ omega )
=> ! [B: $i] :
( ( in @ B @ omega )
=> ( ( ( setadjoin @ A @ A )
= ( setadjoin @ B @ B ) )
=> ( A = B ) ) ) ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
! [L: $i,K: $i,J: $i,I: $i,H: $i,G: $i,F: $o,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( in @ A @ ( setadjoin @ A @ B ) )
& ( ~ ( in @ E @ ( setadjoin @ C @ D ) )
| ( E = C )
| ( in @ E @ D )
| F )
& ( ~ ( in @ E @ ( setadjoin @ C @ D ) )
| ( E = C )
| ~ F
| F )
& ( ~ ( in @ E @ ( setadjoin @ C @ D ) )
| ~ F
| ( in @ E @ D )
| F )
& ( ~ ( in @ E @ ( setadjoin @ C @ D ) )
| ~ F
| ~ F
| F )
& ( ( G != H )
| ( I != J )
| ( ( in @ I @ G )
= ( in @ J @ H ) ) )
& ( ~ ( in @ K @ L )
| ~ ( in @ L @ K ) )
& ( in @ sk1 @ omega )
& ( in @ sk2 @ omega )
& ( ( setadjoin @ sk1 @ sk1 )
= ( setadjoin @ sk2 @ sk2 ) )
& ( sk1 != sk2 ) ),
inference(cnf,[status(esa)],[3]) ).
thf(8,plain,
! [B: $i,A: $i] : ( in @ A @ ( setadjoin @ A @ B ) ),
inference(cnfConj,[status(thm)],[4]) ).
thf(12,plain,
( ( setadjoin @ sk1 @ sk1 )
= ( setadjoin @ sk2 @ sk2 ) ),
inference(cnfConj,[status(thm)],[4]) ).
thf(21,plain,
( ( setadjoin @ sk2 @ sk2 )
= ( setadjoin @ sk1 @ sk1 ) ),
inference(lifteq,[status(thm)],[12]) ).
thf(51,plain,
! [B: $i,A: $i] :
( ( in @ A @ ( setadjoin @ sk1 @ sk1 ) )
| ( ( setadjoin @ sk2 @ sk2 )
!= ( setadjoin @ A @ B ) ) ),
inference(paramod_ordered,[status(thm)],[21,8]) ).
thf(52,plain,
in @ sk2 @ ( setadjoin @ sk1 @ sk1 ),
inference(pattern_uni,[status(thm)],[51:[bind(A,$thf( sk2 )),bind(B,$thf( sk2 ))]]) ).
thf(15,plain,
! [B: $i,A: $i] :
( ~ ( in @ A @ B )
| ~ ( in @ B @ A ) ),
inference(cnfConj,[status(thm)],[4]) ).
thf(26,plain,
! [B: $i,A: $i] :
( ~ ( in @ A @ B )
| ~ ( in @ B @ A ) ),
inference(simp,[status(thm)],[15]) ).
thf(245,plain,
! [B: $i,A: $i] :
( ~ $true
| ~ ( in @ B @ A )
| ( ( in @ sk2 @ ( setadjoin @ sk1 @ sk1 ) )
!= ( in @ A @ B ) ) ),
inference(paramod_ordered,[status(thm)],[52,26]) ).
thf(246,plain,
! [B: $i,A: $i] :
( ~ ( in @ B @ A )
| ( ( in @ sk2 @ ( setadjoin @ sk1 @ sk1 ) )
!= ( in @ A @ B ) ) ),
inference(simp,[status(thm)],[245]) ).
thf(247,plain,
~ ( in @ ( setadjoin @ sk1 @ sk1 ) @ sk2 ),
inference(pattern_uni,[status(thm)],[246:[bind(A,$thf( sk2 )),bind(B,$thf( setadjoin @ sk1 @ sk1 ))]]) ).
thf(455,plain,
! [B: $i,A: $i] :
( ~ $true
| ( ( in @ A @ ( setadjoin @ A @ B ) )
!= ( in @ ( setadjoin @ sk1 @ sk1 ) @ sk2 ) ) ),
inference(paramod_ordered,[status(thm)],[8,247]) ).
thf(456,plain,
! [B: $i,A: $i] :
( ( in @ A @ ( setadjoin @ A @ B ) )
!= ( in @ ( setadjoin @ sk1 @ sk1 ) @ sk2 ) ),
inference(simp,[status(thm)],[455]) ).
thf(463,plain,
! [B: $i,A: $i] :
( ( A
!= ( setadjoin @ sk1 @ sk1 ) )
| ( ( setadjoin @ A @ B )
!= sk2 ) ),
inference(simp,[status(thm)],[456]) ).
thf(468,plain,
! [A: $i] :
( ( setadjoin @ ( setadjoin @ sk1 @ sk1 ) @ A )
!= sk2 ),
inference(simp,[status(thm)],[463]) ).
thf(5,plain,
in @ sk1 @ omega,
inference(cnfConj,[status(thm)],[4]) ).
thf(27,plain,
! [B: $i,A: $i] :
( ~ $true
| ~ ( in @ B @ A )
| ( ( in @ sk1 @ omega )
!= ( in @ A @ B ) ) ),
inference(paramod_ordered,[status(thm)],[5,26]) ).
thf(28,plain,
! [B: $i,A: $i] :
( ~ ( in @ B @ A )
| ( ( in @ sk1 @ omega )
!= ( in @ A @ B ) ) ),
inference(simp,[status(thm)],[27]) ).
thf(29,plain,
~ ( in @ omega @ sk1 ),
inference(pattern_uni,[status(thm)],[28:[bind(A,$thf( sk1 )),bind(B,$thf( omega ))]]) ).
thf(9,plain,
in @ sk2 @ omega,
inference(cnfConj,[status(thm)],[4]) ).
thf(33,plain,
! [B: $i,A: $i] :
( ~ $true
| ~ ( in @ B @ A )
| ( ( in @ sk2 @ omega )
!= ( in @ A @ B ) ) ),
inference(paramod_ordered,[status(thm)],[9,26]) ).
thf(34,plain,
! [B: $i,A: $i] :
( ~ ( in @ B @ A )
| ( ( in @ sk2 @ omega )
!= ( in @ A @ B ) ) ),
inference(simp,[status(thm)],[33]) ).
thf(35,plain,
~ ( in @ omega @ sk2 ),
inference(pattern_uni,[status(thm)],[34:[bind(A,$thf( sk2 )),bind(B,$thf( omega ))]]) ).
thf(201,plain,
( ~ $true
| ( ( in @ sk2 @ omega )
!= ( in @ omega @ sk2 ) ) ),
inference(paramod_ordered,[status(thm)],[9,35]) ).
thf(202,plain,
( ( in @ sk2 @ omega )
!= ( in @ omega @ sk2 ) ),
inference(simp,[status(thm)],[201]) ).
thf(205,plain,
( ( sk2 != omega )
| ( sk2 != omega ) ),
inference(simp,[status(thm)],[202]) ).
thf(211,plain,
sk2 != omega,
inference(simp,[status(thm)],[205]) ).
thf(53,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ~ $true
| ~ ( in @ D @ C )
| ( ( in @ A @ ( setadjoin @ A @ B ) )
!= ( in @ C @ D ) ) ),
inference(paramod_ordered,[status(thm)],[8,26]) ).
thf(54,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ~ ( in @ D @ C )
| ( ( in @ A @ ( setadjoin @ A @ B ) )
!= ( in @ C @ D ) ) ),
inference(simp,[status(thm)],[53]) ).
thf(55,plain,
! [B: $i,A: $i] :
~ ( in @ ( setadjoin @ A @ B ) @ A ),
inference(pattern_uni,[status(thm)],[54:[bind(A,$thf( E )),bind(B,$thf( F )),bind(C,$thf( E )),bind(D,$thf( setadjoin @ E @ F ))]]) ).
thf(60,plain,
! [B: $i,A: $i] :
~ ( in @ ( setadjoin @ A @ B ) @ A ),
inference(simp,[status(thm)],[55]) ).
thf(11,plain,
! [D: $o,C: $i,B: $i,A: $i] :
( ~ ( in @ C @ ( setadjoin @ A @ B ) )
| ( C = A )
| ( in @ C @ B )
| D ),
inference(cnfConj,[status(thm)],[4]) ).
thf(24,plain,
! [D: $o,C: $i,B: $i,A: $i] :
( ( C = A )
| ~ ( in @ C @ ( setadjoin @ A @ B ) )
| ( in @ C @ B )
| D ),
inference(lifteq,[status(thm)],[11]) ).
thf(25,plain,
! [D: $o,C: $i,B: $i,A: $i] :
( ( C = A )
| ~ ( in @ C @ ( setadjoin @ A @ B ) )
| ( in @ C @ B )
| D ),
inference(simp,[status(thm)],[24]) ).
thf(221,plain,
! [D: $o,C: $i,B: $i,A: $i] :
( ( C = A )
| ~ $true
| ( in @ C @ B )
| D
| ( ( in @ sk2 @ ( setadjoin @ sk1 @ sk1 ) )
!= ( in @ C @ ( setadjoin @ A @ B ) ) ) ),
inference(paramod_ordered,[status(thm)],[52,25]) ).
thf(222,plain,
! [D: $o,C: $i,B: $i,A: $i] :
( ( C = A )
| ( in @ C @ B )
| D
| ( ( in @ sk2 @ ( setadjoin @ sk1 @ sk1 ) )
!= ( in @ C @ ( setadjoin @ A @ B ) ) ) ),
inference(simp,[status(thm)],[221]) ).
thf(223,plain,
! [A: $o] :
( ( sk2 = sk1 )
| ( in @ sk2 @ sk1 )
| A ),
inference(pattern_uni,[status(thm)],[222:[bind(A,$thf( sk1 )),bind(B,$thf( sk1 )),bind(C,$thf( sk2 ))]]) ).
thf(263,plain,
! [A: $o] :
( ( sk2 = sk1 )
| ( in @ sk2 @ sk1 )
| A ),
inference(simp,[status(thm)],[223]) ).
thf(6,plain,
sk1 != sk2,
inference(cnfConj,[status(thm)],[4]) ).
thf(19,plain,
sk2 != sk1,
inference(lifteq,[status(thm)],[6]) ).
thf(264,plain,
! [A: $o] :
( ( in @ sk2 @ sk1 )
| A ),
inference(simplifyReflect,[status(thm)],[263,19]) ).
thf(298,plain,
! [A: $o] :
( ( in @ sk2 @ sk1 )
| ( A
!= ( in @ sk2 @ sk1 ) )
| ~ $true ),
inference(eqfactor_ordered,[status(thm)],[264]) ).
thf(305,plain,
in @ sk2 @ sk1,
inference(pattern_uni,[status(thm)],[298:[bind(A,$thf( in @ sk2 @ sk1 ))]]) ).
thf(337,plain,
! [B: $i,A: $i] :
( ~ $true
| ~ ( in @ B @ A )
| ( ( in @ sk2 @ sk1 )
!= ( in @ A @ B ) ) ),
inference(paramod_ordered,[status(thm)],[305,26]) ).
thf(338,plain,
! [B: $i,A: $i] :
( ~ ( in @ B @ A )
| ( ( in @ sk2 @ sk1 )
!= ( in @ A @ B ) ) ),
inference(simp,[status(thm)],[337]) ).
thf(339,plain,
~ ( in @ sk1 @ sk2 ),
inference(pattern_uni,[status(thm)],[338:[bind(A,$thf( sk2 )),bind(B,$thf( sk1 ))]]) ).
thf(393,plain,
! [B: $i,A: $i] :
( ~ $true
| ( ( in @ A @ ( setadjoin @ A @ B ) )
!= ( in @ sk1 @ sk2 ) ) ),
inference(paramod_ordered,[status(thm)],[8,339]) ).
thf(394,plain,
! [B: $i,A: $i] :
( ( in @ A @ ( setadjoin @ A @ B ) )
!= ( in @ sk1 @ sk2 ) ),
inference(simp,[status(thm)],[393]) ).
thf(400,plain,
! [B: $i,A: $i] :
( ( A != sk1 )
| ( ( setadjoin @ A @ B )
!= sk2 ) ),
inference(simp,[status(thm)],[394]) ).
thf(402,plain,
! [A: $i] :
( ( setadjoin @ sk1 @ A )
!= sk2 ),
inference(simp,[status(thm)],[400]) ).
thf(42,plain,
( ~ $true
| ( ( in @ sk1 @ omega )
!= ( in @ omega @ sk1 ) ) ),
inference(paramod_ordered,[status(thm)],[5,29]) ).
thf(43,plain,
( ( in @ sk1 @ omega )
!= ( in @ omega @ sk1 ) ),
inference(simp,[status(thm)],[42]) ).
thf(46,plain,
( ( sk1 != omega )
| ( sk1 != omega ) ),
inference(simp,[status(thm)],[43]) ).
thf(48,plain,
sk1 != omega,
inference(simp,[status(thm)],[46]) ).
thf(49,plain,
! [B: $i,A: $i] :
( ~ $true
| ( ( in @ A @ ( setadjoin @ A @ B ) )
!= ( in @ omega @ sk1 ) ) ),
inference(paramod_ordered,[status(thm)],[8,29]) ).
thf(50,plain,
! [B: $i,A: $i] :
( ( in @ A @ ( setadjoin @ A @ B ) )
!= ( in @ omega @ sk1 ) ),
inference(simp,[status(thm)],[49]) ).
thf(59,plain,
! [B: $i,A: $i] :
( ( A != omega )
| ( ( setadjoin @ A @ B )
!= sk1 ) ),
inference(simp,[status(thm)],[50]) ).
thf(62,plain,
! [A: $i] :
( ( setadjoin @ omega @ A )
!= sk1 ),
inference(simp,[status(thm)],[59]) ).
thf(39,plain,
! [B: $i,A: $i] :
( ~ ( in @ A @ B )
| ( ( in @ B @ A )
!= ( in @ A @ B ) )
| ~ $true ),
inference(eqfactor_ordered,[status(thm)],[26]) ).
thf(40,plain,
! [A: $i] :
~ ( in @ A @ A ),
inference(pattern_uni,[status(thm)],[39:[bind(A,$thf( B ))]]) ).
thf(41,plain,
! [A: $i] :
~ ( in @ A @ A ),
inference(simp,[status(thm)],[40]) ).
thf(362,plain,
! [C: $i,B: $i,A: $i] :
( ~ $true
| ( ( in @ A @ ( setadjoin @ A @ B ) )
!= ( in @ C @ C ) ) ),
inference(paramod_ordered,[status(thm)],[8,41]) ).
thf(363,plain,
! [C: $i,B: $i,A: $i] :
( ( in @ A @ ( setadjoin @ A @ B ) )
!= ( in @ C @ C ) ),
inference(simp,[status(thm)],[362]) ).
thf(369,plain,
! [C: $i,B: $i,A: $i] :
( ( A != C )
| ( ( setadjoin @ A @ B )
!= C ) ),
inference(simp,[status(thm)],[363]) ).
thf(372,plain,
! [B: $i,A: $i] :
( ( setadjoin @ B @ A )
!= B ),
inference(simp,[status(thm)],[369]) ).
thf(358,plain,
! [A: $i] :
( ~ $true
| ( ( in @ sk2 @ ( setadjoin @ sk1 @ sk1 ) )
!= ( in @ A @ A ) ) ),
inference(paramod_ordered,[status(thm)],[52,41]) ).
thf(359,plain,
! [A: $i] :
( ( in @ sk2 @ ( setadjoin @ sk1 @ sk1 ) )
!= ( in @ A @ A ) ),
inference(simp,[status(thm)],[358]) ).
thf(368,plain,
! [A: $i] :
( ( sk2 != A )
| ( ( setadjoin @ sk1 @ sk1 )
!= A ) ),
inference(simp,[status(thm)],[359]) ).
thf(371,plain,
( ( setadjoin @ sk1 @ sk1 )
!= sk2 ),
inference(simp,[status(thm)],[368]) ).
thf(203,plain,
! [B: $i,A: $i] :
( ~ $true
| ( ( in @ A @ ( setadjoin @ A @ B ) )
!= ( in @ omega @ sk2 ) ) ),
inference(paramod_ordered,[status(thm)],[8,35]) ).
thf(204,plain,
! [B: $i,A: $i] :
( ( in @ A @ ( setadjoin @ A @ B ) )
!= ( in @ omega @ sk2 ) ),
inference(simp,[status(thm)],[203]) ).
thf(207,plain,
! [B: $i,A: $i] :
( ( A != omega )
| ( ( setadjoin @ A @ B )
!= sk2 ) ),
inference(simp,[status(thm)],[204]) ).
thf(213,plain,
! [A: $i] :
( ( setadjoin @ omega @ A )
!= sk2 ),
inference(simp,[status(thm)],[207]) ).
thf(89,plain,
! [D: $o,C: $i,B: $i,A: $i] :
( ( C = A )
| ~ ( in @ C @ ( setadjoin @ A @ B ) )
| ( in @ C @ B )
| ~ $true
| ( D
!= ( in @ omega @ sk1 ) ) ),
inference(paramod_ordered,[status(thm)],[25,29]) ).
thf(90,plain,
! [D: $o,C: $i,B: $i,A: $i] :
( ( C = A )
| ~ ( in @ C @ ( setadjoin @ A @ B ) )
| ( in @ C @ B )
| ( D
!= ( in @ omega @ sk1 ) ) ),
inference(simp,[status(thm)],[89]) ).
thf(91,plain,
! [C: $i,B: $i,A: $i] :
( ( C = A )
| ~ ( in @ C @ ( setadjoin @ A @ B ) )
| ( in @ C @ B ) ),
inference(pattern_uni,[status(thm)],[90:[bind(A,$thf( A )),bind(B,$thf( B )),bind(C,$thf( C )),bind(D,$thf( in @ omega @ sk1 ))]]) ).
thf(953,plain,
$false,
inference(e,[status(thm)],[468,29,211,60,21,9,339,402,48,26,8,19,305,62,5,247,52,372,41,371,213,91,3,35]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SEU811^2 : TPTP v9.3.1. Released v3.7.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 14:33:03 UTC 2026
% 0.00/0.11 % CPUTime :
% 0.00/0.11 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.41/0.39 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.58/0.49 % [INFO] Parsing done (101ms).
% 0.58/0.50 % [INFO] Running in sequential loop mode.
% 1.05/0.71 % [INFO] eprover registered as external prover.
% 1.05/0.72 % [INFO] Scanning for conjecture ...
% 1.27/0.80 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.27/0.82 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.27/0.82 % [INFO] Problem is higher-order (TPTP THF).
% 1.27/0.82 % [INFO] Type checking passed.
% 1.27/0.82 % [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 ...
% 5.71/2.15 % External prover 'e' found a proof!
% 5.71/2.15 % [INFO] Killing All external provers ...
% 5.71/2.15 % Time passed: 1966ms (effective reasoning time: 1643ms)
% 5.71/2.15 % 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)>
% 5.71/2.15 % Axioms used in derivation (0):
% 5.71/2.15 % No. of inferences in proof: 80
% 5.71/2.15 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1966 ms resp. 1643 ms w/o parsing
% 5.71/2.19 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 5.71/2.19 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------