%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : NUM636^3 : TPTP v9.3.1. Released v3.7.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 : n018.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:17:51 AM UTC 2026
% Result : Theorem 45.07s 12.87s
% Output : Refutation 36.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 28
% Number of leaves : 10
% Syntax : Number of formulae : 126 ( 41 unt; 0 typ; 4 def)
% Number of atoms : 422 ( 407 equ; 99 cnn)
% Maximal formula atoms : 4 ( 3 avg)
% Number of connectives : 1373 ( 273 ~; 254 |; 6 &; 831 @)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 71 ( 71 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 313 ( 93 ^; 214 !; 3 ?; 313 :)
% ( 0 !>; 0 ?*; 0 @-; 3 @+)
% Comments :
%------------------------------------------------------------------------------
thf(one_decl,type,
one: $i ).
thf(succ_decl,type,
succ: $i > $i ).
thf(m_decl,type,
m: $i > $o ).
thf(sk1_decl,type,
sk1: $i ).
thf(sk2_decl,type,
sk2: $i > $i ).
thf(sk3_decl,type,
sk3: ( $i > $o ) > $i ).
thf(m_def,definition,
( m
= ( ^ [A: $i] :
( ( succ @ A )
!= A ) ) ) ).
thf(sk1_def,definition,
( sk1
= ( @+[A: $i] :
( ( succ @ A )
= A ) ) ) ).
thf(sk2_def,definition,
( sk2
= ( @+[A: $i > $i] :
! [B: $i] :
( ( A @ ( succ @ B ) )
= B ) ) ) ).
thf(sk3_def,definition,
( sk3
= ( ^ [A: $i > $o] :
@+[B: $i] :
~ ( ( A @ B )
=> ( A @ ( succ @ B ) ) ) ) ) ).
thf(1,conjecture,
! [A: $i] : ( m @ A ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m_is_all) ).
thf(2,negated_conjecture,
~ ! [A: $i] : ( m @ A ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(8,plain,
~ ! [A: $i] :
( ( succ @ A )
!= A ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(9,plain,
~ ~ ? [A: $i] :
( ( succ @ A )
= A ),
inference(miniscope,[status(thm)],[8]) ).
thf(10,plain,
( ( succ @ sk1 )
= sk1 ),
inference(cnf,[status(esa)],[9]) ).
thf(11,plain,
( ( succ @ sk1 )
= sk1 ),
inference(lifteq,[status(thm)],[10]) ).
thf(4,axiom,
! [A: $i,B: $i] :
( ( ( succ @ A )
= ( succ @ B ) )
=> ( A = B ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',succ_injective) ).
thf(16,plain,
! [A: $i,B: $i] :
( ( ( succ @ A )
= ( succ @ B ) )
=> ( A = B ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(17,plain,
! [B: $i,A: $i] :
( ( ( succ @ A )
!= ( succ @ B ) )
| ( A = B ) ),
inference(cnf,[status(esa)],[16]) ).
thf(18,plain,
! [B: $i,A: $i] :
( ( ( succ @ A )
!= ( succ @ B ) )
| ( A = B ) ),
inference(lifteq,[status(thm)],[17]) ).
thf(332,plain,
! [B: $i,A: $i] :
( ( ( succ @ A )
!= sk1 )
| ( A = B )
| ( ( succ @ sk1 )
!= ( succ @ B ) ) ),
inference(paramod_ordered,[status(thm)],[11,18]) ).
thf(333,plain,
! [A: $i] :
( ( ( succ @ A )
!= sk1 )
| ( A = sk1 ) ),
inference(pattern_uni,[status(thm)],[332:[bind(A,$thf( A )),bind(B,$thf( sk1 ))]]) ).
thf(5,axiom,
! [A: $i > $o] :
( ( ( A @ one )
& ! [B: $i] :
( ( A @ B )
=> ( A @ ( succ @ B ) ) ) )
=> ! [B: $i] : ( A @ B ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',induction) ).
thf(21,plain,
! [A: $i > $o] :
( ( ( A @ one )
& ! [B: $i] :
( ( A @ B )
=> ( A @ ( succ @ B ) ) ) )
=> ! [B: $i] : ( A @ B ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(22,plain,
! [B: $i,A: $i > $o] :
( ( ~ ( A @ one )
| ( A @ ( sk3 @ A ) )
| ( A @ B ) )
& ( ~ ( A @ one )
| ~ ( A @ ( succ @ ( sk3 @ A ) ) )
| ( A @ B ) ) ),
inference(cnf,[status(esa)],[21]) ).
thf(23,plain,
! [B: $i,A: $i > $o] :
( ~ ( A @ one )
| ( A @ ( sk3 @ A ) )
| ( A @ B ) ),
inference(cnfConj,[status(thm)],[22]) ).
thf(25,plain,
! [A: $i] :
( ( one != one )
| ( one
= ( sk3 @ ( (=) @ $i @ one ) ) )
| ( one = A ) ),
inference(replace_leibeq,[status(thm)],[23:[bind(A,$thf( (=) @ $i @ one ))]]) ).
thf(27,plain,
! [A: $i] :
( ( one != one )
| ( ( sk3 @ ( (=) @ $i @ one ) )
= one )
| ( one = A ) ),
inference(lifteq,[status(thm)],[25]) ).
thf(28,plain,
! [A: $i] :
( ( ( sk3 @ ( (=) @ $i @ one ) )
= one )
| ( one = A ) ),
inference(simp,[status(thm)],[27]) ).
thf(3,axiom,
! [A: $i] :
( ( succ @ A )
!= one ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',one_is_first) ).
thf(12,plain,
! [A: $i] :
( ( succ @ A )
!= one ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(13,plain,
~ ? [A: $i] :
( ( succ @ A )
= one ),
inference(miniscope,[status(thm)],[12]) ).
thf(14,plain,
! [A: $i] :
( ( succ @ A )
!= one ),
inference(cnf,[status(esa)],[13]) ).
thf(15,plain,
! [A: $i] :
( ( succ @ A )
!= one ),
inference(lifteq,[status(thm)],[14]) ).
thf(186,plain,
! [B: $i,A: $i] :
( ( ( sk3 @ ( (=) @ $i @ one ) )
= one )
| ( one != one )
| ( A
!= ( succ @ B ) ) ),
inference(paramod_ordered,[status(thm)],[28,15]) ).
thf(187,plain,
! [B: $i,A: $i] :
( ( ( sk3 @ ( (=) @ $i @ one ) )
= one )
| ( A
!= ( succ @ B ) ) ),
inference(simp,[status(thm)],[186]) ).
thf(188,plain,
( ( sk3 @ ( (=) @ $i @ one ) )
= one ),
inference(pattern_uni,[status(thm)],[187:[bind(A,$thf( succ @ C )),bind(B,$thf( C ))]]) ).
thf(482,plain,
! [D: $i,C: $i > $o,B: $i,A: $i > $o] :
( ~ ( A @ one )
| ( A @ B )
| ~ $true
| ( C @ ( sk3 @ C ) )
| ( C @ D )
| ( ( A @ ( sk3 @ A ) )
!= ( C @ one ) ) ),
inference(paramod_ordered,[status(thm)],[23,23]) ).
thf(483,plain,
! [D: $i,C: $i > $o,B: $i,A: $i > $o] :
( ~ ( A @ one )
| ( A @ B )
| ( C @ ( sk3 @ C ) )
| ( C @ D )
| ( ( A @ ( sk3 @ A ) )
!= ( C @ one ) ) ),
inference(simp,[status(thm)],[482]) ).
thf(534,plain,
! [C: $i,B: $i > $o,A: $i] :
( ( one != one )
| ( one = A )
| ( B @ ( sk3 @ B ) )
| ( B @ C )
| ( ( one
= ( sk3 @ ( (=) @ $i @ one ) ) )
!= ( B @ one ) ) ),
inference(replace_leibeq,[status(thm)],[483:[bind(A,$thf( (=) @ $i @ one ))]]) ).
thf(562,plain,
! [C: $i,B: $i > $o,A: $i] :
( ( one != one )
| ( one = A )
| ( B @ ( sk3 @ B ) )
| ( B @ C )
| ( ( one
= ( sk3 @ ( (=) @ $i @ one ) ) )
!= ( B @ one ) ) ),
inference(lifteq,[status(thm)],[534]) ).
thf(604,plain,
! [B: $i,A: $i] :
( ( one
= ( sk3 @ ( (=) @ $i @ B ) ) )
| ( one
= ( sk3
@ ( (=) @ $i
@ ( sk3
@ ^ [C: $i] :
( one
= ( sk3 @ ( (=) @ $i @ C ) ) ) ) ) ) )
| ( one = A ) ),
inference(pre_uni,[status(thm)],[562:[bind(A,$thf( A )),bind(B,$thf( ^ [D: $i] : ( one = ( sk3 @ ( (=) @ $i @ D ) ) ) )),bind(C,$thf( C ))]]) ).
thf(665,plain,
! [B: $i,A: $i] :
( ( ( sk3 @ ( (=) @ $i @ B ) )
= one )
| ( ( sk3
@ ( (=) @ $i
@ ( sk3
@ ^ [C: $i] :
( one
= ( sk3 @ ( (=) @ $i @ C ) ) ) ) ) )
= one )
| ( one = A ) ),
inference(lifteq,[status(thm)],[604]) ).
thf(666,plain,
! [B: $i,A: $i] :
( ( ( sk3 @ ( (=) @ $i @ B ) )
= one )
| ( ( sk3
@ ( (=) @ $i
@ ( sk3
@ ^ [C: $i] :
( one
= ( sk3 @ ( (=) @ $i @ C ) ) ) ) ) )
= one )
| ( one = A ) ),
inference(simp,[status(thm)],[665]) ).
thf(1432,plain,
! [B: $i,A: $i] :
( ( ( sk3 @ ( (=) @ $i @ B ) )
= one )
| ( one = A )
| ( ( sk3
@ ( (=) @ $i
@ ( sk3
@ ^ [C: $i] :
( one
= ( sk3 @ ( (=) @ $i @ C ) ) ) ) ) )
!= ( sk3 @ ( (=) @ $i @ B ) ) )
| ( one != one ) ),
inference(eqfactor_ordered,[status(thm)],[666]) ).
thf(1473,plain,
! [A: $i] :
( ( ( sk3
@ ( (=) @ $i
@ ( sk3
@ ^ [B: $i] :
( one
= ( sk3 @ ( (=) @ $i @ B ) ) ) ) ) )
= one )
| ( one = A ) ),
inference(pattern_uni,[status(thm)],[1432:[bind(A,$thf( A )),bind(B,$thf( sk3 @ ^ [C: $i] : ( one = ( sk3 @ ( (=) @ $i @ C ) ) ) ))]]) ).
thf(2105,plain,
! [B: $i,A: $i] :
( ( ( sk3
@ ( (=) @ $i
@ ( sk3
@ ^ [C: $i] :
( one
= ( sk3 @ ( (=) @ $i @ C ) ) ) ) ) )
= one )
| ( one != one )
| ( A
!= ( succ @ B ) ) ),
inference(paramod_ordered,[status(thm)],[1473,15]) ).
thf(2106,plain,
! [B: $i,A: $i] :
( ( ( sk3
@ ( (=) @ $i
@ ( sk3
@ ^ [C: $i] :
( one
= ( sk3 @ ( (=) @ $i @ C ) ) ) ) ) )
= one )
| ( A
!= ( succ @ B ) ) ),
inference(simp,[status(thm)],[2105]) ).
thf(2107,plain,
( ( sk3
@ ( (=) @ $i
@ ( sk3
@ ^ [A: $i] :
( one
= ( sk3 @ ( (=) @ $i @ A ) ) ) ) ) )
= one ),
inference(pattern_uni,[status(thm)],[2106:[bind(A,$thf( succ @ C )),bind(B,$thf( C ))]]) ).
thf(24,plain,
! [B: $i,A: $i > $o] :
( ~ ( A @ one )
| ~ ( A @ ( succ @ ( sk3 @ A ) ) )
| ( A @ B ) ),
inference(cnfConj,[status(thm)],[22]) ).
thf(49,plain,
! [B: $i,A: $i > $o] :
( ~ ( A @ one )
| ~ ( A @ ( succ @ ( sk3 @ A ) ) )
| ( ( A @ B )
!= ( ~ ( A @ one ) ) )
| ~ $true ),
inference(eqfactor_ordered,[status(thm)],[24]) ).
thf(75,plain,
! [B: $i,A: $i > $o] :
( ~ ( A @ one )
| ~ ( A @ ( succ @ ( sk3 @ A ) ) )
| ( ( A @ B )
!= ( ~ ( A @ one ) ) ) ),
inference(simp,[status(thm)],[49]) ).
thf(2308,plain,
! [B: $i,A: $i > $o] :
( ~ ( A @ one )
| ~ ( A @ ( succ @ one ) )
| ( ( A @ B )
!= ( ~ ( A @ one ) ) )
| ( ( sk3
@ ( (=) @ $i
@ ( sk3
@ ^ [C: $i] :
( one
= ( sk3 @ ( (=) @ $i @ C ) ) ) ) ) )
!= ( sk3 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[2107,75]) ).
thf(2309,plain,
! [A: $i] :
( ( ( sk3
@ ^ [B: $i] :
( one
= ( sk3 @ ( (=) @ $i @ B ) ) ) )
!= one )
| ( ( sk3
@ ^ [B: $i] :
( one
= ( sk3 @ ( (=) @ $i @ B ) ) ) )
!= ( succ @ one ) )
| ( ( ( sk3
@ ^ [B: $i] :
( one
= ( sk3 @ ( (=) @ $i @ B ) ) ) )
= A )
!= ( ( sk3
@ ^ [B: $i] :
( one
= ( sk3 @ ( (=) @ $i @ B ) ) ) )
!= one ) ) ),
inference(pattern_uni,[status(thm)],[2308:[bind(A,$thf( (=) @ $i @ ( sk3 @ ^ [C: $i] : ( one = ( sk3 @ ( (=) @ $i @ C ) ) ) ) )),bind(B,$thf( B ))]]) ).
thf(2335,plain,
! [A: $i] :
( ( ( sk3
@ ^ [B: $i] :
( one
= ( sk3 @ ( (=) @ $i @ B ) ) ) )
!= one )
| ( ( sk3
@ ^ [B: $i] :
( one
= ( sk3 @ ( (=) @ $i @ B ) ) ) )
!= ( succ @ one ) )
| ( ( ( sk3
@ ^ [B: $i] :
( one
= ( sk3 @ ( (=) @ $i @ B ) ) ) )
= A )
!= ( ( sk3
@ ^ [B: $i] :
( one
= ( sk3 @ ( (=) @ $i @ B ) ) ) )
!= one ) ) ),
inference(lifteq,[status(thm)],[2309]) ).
thf(2364,plain,
! [A: $i] :
( ( ( sk3
@ ^ [B: $i] :
( one
= ( sk3 @ ( (=) @ $i @ B ) ) ) )
!= one )
| ( ( sk3
@ ^ [B: $i] :
( one
= ( sk3 @ ( (=) @ $i @ B ) ) ) )
!= ( succ @ one ) )
| ( ( ( sk3
@ ^ [B: $i] :
( one
= ( sk3 @ ( (=) @ $i @ B ) ) ) )
= A )
!= ( ( sk3
@ ^ [B: $i] :
( one
= ( sk3 @ ( (=) @ $i @ B ) ) ) )
!= one ) ) ),
inference(simp,[status(thm)],[2335]) ).
thf(2879,plain,
! [A: $i] :
( ( one != one )
| ( ( sk3
@ ^ [B: $i] :
( one
= ( sk3 @ ( (=) @ $i @ B ) ) ) )
!= ( succ @ one ) )
| ( ( ( sk3
@ ^ [B: $i] :
( one
= ( sk3 @ ( (=) @ $i @ B ) ) ) )
= A )
!= ( ( sk3
@ ^ [B: $i] :
( one
= ( sk3 @ ( (=) @ $i @ B ) ) ) )
!= one ) )
| ( ( sk3 @ ( (=) @ $i @ one ) )
!= ( sk3
@ ^ [B: $i] :
( one
= ( sk3 @ ( (=) @ $i @ B ) ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[188,2364]) ).
thf(2880,plain,
! [A: $i] :
( ( ( sk3
@ ^ [B: $i] :
( one
= ( sk3 @ ( (=) @ $i @ B ) ) ) )
!= ( succ @ one ) )
| ( ( ( sk3
@ ^ [B: $i] :
( one
= ( sk3 @ ( (=) @ $i @ B ) ) ) )
= A )
!= ( ( sk3
@ ^ [B: $i] :
( one
= ( sk3 @ ( (=) @ $i @ B ) ) ) )
!= one ) )
| ( ( sk3 @ ( (=) @ $i @ one ) )
!= ( sk3
@ ^ [B: $i] :
( one
= ( sk3 @ ( (=) @ $i @ B ) ) ) ) ) ),
inference(simp,[status(thm)],[2879]) ).
thf(2953,plain,
! [A: $i] :
( ( ( sk3
@ ^ [B: $i] :
( one
= ( sk3 @ ( (=) @ $i @ B ) ) ) )
!= ( succ @ one ) )
| ( ( ( sk3
@ ^ [B: $i] :
( one
= ( sk3 @ ( (=) @ $i @ B ) ) ) )
= A )
!= ( ( sk3
@ ^ [B: $i] :
( one
= ( sk3 @ ( (=) @ $i @ B ) ) ) )
!= one ) )
| ( ( (=) @ $i @ one )
!= ( ^ [B: $i] :
( one
= ( sk3 @ ( (=) @ $i @ B ) ) ) ) ) ),
inference(simp,[status(thm)],[2880]) ).
thf(19,plain,
? [A: $i > $i] :
! [B: $i] :
( ( A @ ( succ @ B ) )
= B ),
inference(detectInverse,[status(thm)],[18]) ).
thf(20,plain,
! [A: $i] :
( ( sk2 @ ( succ @ A ) )
= A ),
inference(cnf,[status(esa)],[19]) ).
thf(355,plain,
! [A: $i] :
( ( sk2 @ ( succ @ A ) )
= A ),
inference(lifteq,[status(thm)],[20]) ).
thf(356,plain,
! [A: $i] :
( ( ( sk2 @ sk1 )
= A )
| ( ( succ @ sk1 )
!= ( succ @ A ) ) ),
inference(paramod_ordered,[status(thm)],[11,355]) ).
thf(357,plain,
( ( sk2 @ sk1 )
= sk1 ),
inference(pattern_uni,[status(thm)],[356:[bind(A,$thf( sk1 ))]]) ).
thf(47,plain,
! [B: $i,A: $i > $o] :
( ~ ( A @ one )
| ( A @ B )
| ( ( A @ ( succ @ ( sk3 @ A ) ) )
!= ( A @ one ) )
| ~ $true ),
inference(eqfactor_ordered,[status(thm)],[24]) ).
thf(77,plain,
! [B: $i,A: $i > $o] :
( ~ ( A @ one )
| ( A @ B )
| ( ( A @ ( succ @ ( sk3 @ A ) ) )
!= ( A @ one ) ) ),
inference(pre_uni,[status(thm)],[47:[]]) ).
thf(78,plain,
! [B: $i,A: $i > $o] :
( ( A @ B )
| ~ ( A @ one )
| ( ( A @ ( succ @ ( sk3 @ A ) ) )
!= ( A @ one ) ) ),
inference(pre_uni,[status(thm)],[77:[]]) ).
thf(50,plain,
! [B: $i,A: $i > $o] :
( ~ ( A @ one )
| ~ ( A @ ( succ @ ( sk3 @ A ) ) )
| ( ( A @ B )
!= ( ~ ( A @ ( succ @ ( sk3 @ A ) ) ) ) )
| ~ $true ),
inference(eqfactor_ordered,[status(thm)],[24]) ).
thf(70,plain,
! [B: $i,A: $i > $o] :
( ~ ( A @ one )
| ~ ( A @ ( succ @ ( sk3 @ A ) ) )
| ( ( A @ B )
!= ( ~ ( A @ ( succ @ ( sk3 @ A ) ) ) ) ) ),
inference(simp,[status(thm)],[50]) ).
thf(715,plain,
! [B: $i,A: $i > $o] :
( ~ ( A @ one )
| ~ ( A @ sk1 )
| ( ( A @ B )
!= ( ~ ( A @ ( succ @ ( sk3 @ A ) ) ) ) )
| ( ( succ @ ( sk3 @ A ) )
!= ( succ @ sk1 ) ) ),
inference(paramod_ordered,[status(thm)],[11,70]) ).
thf(773,plain,
! [B: $i,A: $i > $o] :
( ~ ( A @ one )
| ~ ( A @ sk1 )
| ( ( A @ B )
!= ( ~ ( A @ ( succ @ ( sk3 @ A ) ) ) ) )
| ( ( sk3 @ A )
!= sk1 ) ),
inference(simp,[status(thm)],[715]) ).
thf(7,axiom,
! [A: $i] :
( ( m @ A )
=> ( m @ ( succ @ A ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m_is_next) ).
thf(34,plain,
! [A: $i] :
( ( ( succ @ A )
!= A )
=> ( ( succ @ ( succ @ A ) )
!= ( succ @ A ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).
thf(114,plain,
! [B: $i,A: $i > $o] :
( ~ ( A @ one )
| ( ( A @ B )
!= ( ~ ( A @ one ) ) )
| ( ( A @ ( succ @ ( sk3 @ A ) ) )
!= ( A @ one ) )
| ~ $true ),
inference(eqfactor_ordered,[status(thm)],[75]) ).
thf(135,plain,
! [B: $i,A: $i > $o] :
( ~ ( A @ one )
| ( ( A @ B )
!= ( ~ ( A @ one ) ) )
| ( ( A @ ( succ @ ( sk3 @ A ) ) )
!= ( A @ one ) ) ),
inference(pre_uni,[status(thm)],[114:[]]) ).
thf(2990,plain,
! [A: $i] :
( ( ( sk3
@ ^ [B: $i] :
( one
= ( sk3 @ ( (=) @ $i @ B ) ) ) )
!= ( succ @ one ) )
| ( ( one = A )
!= ( ( sk3
@ ^ [B: $i] :
( one
= ( sk3 @ ( (=) @ $i @ B ) ) ) )
!= one ) )
| ( ( (=) @ $i @ one )
!= ( ^ [B: $i] :
( one
= ( sk3 @ ( (=) @ $i @ B ) ) ) ) )
| ( ( sk3 @ ( (=) @ $i @ one ) )
!= ( sk3
@ ^ [B: $i] :
( one
= ( sk3 @ ( (=) @ $i @ B ) ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[188,2953]) ).
thf(3056,plain,
! [A: $i] :
( ( ( sk3
@ ^ [B: $i] :
( one
= ( sk3 @ ( (=) @ $i @ B ) ) ) )
!= ( succ @ one ) )
| ( ( one = A )
!= ( ( sk3
@ ^ [B: $i] :
( one
= ( sk3 @ ( (=) @ $i @ B ) ) ) )
!= one ) )
| ( ( (=) @ $i @ one )
!= ( ^ [B: $i] :
( one
= ( sk3 @ ( (=) @ $i @ B ) ) ) ) )
| ( ( (=) @ $i @ one )
!= ( ^ [B: $i] :
( one
= ( sk3 @ ( (=) @ $i @ B ) ) ) ) ) ),
inference(simp,[status(thm)],[2990]) ).
thf(3088,plain,
! [A: $i] :
( ( ( sk3
@ ^ [B: $i] :
( one
= ( sk3 @ ( (=) @ $i @ B ) ) ) )
!= ( succ @ one ) )
| ( ( one = A )
!= ( ( sk3
@ ^ [B: $i] :
( one
= ( sk3 @ ( (=) @ $i @ B ) ) ) )
!= one ) )
| ( ( (=) @ $i @ one )
!= ( ^ [B: $i] :
( one
= ( sk3 @ ( (=) @ $i @ B ) ) ) ) ) ),
inference(simp,[status(thm)],[3056]) ).
thf(3823,plain,
! [A: $i] :
( ( ( sk3
@ ^ [B: $i] :
( one
= ( sk3 @ ( (=) @ $i @ B ) ) ) )
!= ( succ @ one ) )
| ( ( one = A )
!= ( ( sk3
@ ^ [B: $i] :
( one
= ( sk3 @ ( (=) @ $i @ B ) ) ) )
!= one ) )
| ( ( ^ [B: $i] : one )
!= ( ^ [B: $i] : one ) )
| ( ( ^ [B: $i] : B )
!= ( ^ [B: $i] : ( sk3 @ ( (=) @ $i @ B ) ) ) ) ),
inference(simp,[status(thm)],[3088]) ).
thf(3929,plain,
! [A: $i] :
( ( ( sk3
@ ^ [B: $i] :
( one
= ( sk3 @ ( (=) @ $i @ B ) ) ) )
!= ( succ @ one ) )
| ( ( one = A )
!= ( ( sk3
@ ^ [B: $i] :
( one
= ( sk3 @ ( (=) @ $i @ B ) ) ) )
!= one ) )
| ( ( ^ [B: $i] : B )
!= ( ^ [B: $i] : ( sk3 @ ( (=) @ $i @ B ) ) ) ) ),
inference(simp,[status(thm)],[3823]) ).
thf(35,plain,
! [A: $i] :
( ( ( succ @ A )
= A )
| ( ( succ @ ( succ @ A ) )
!= ( succ @ A ) ) ),
inference(cnf,[status(esa)],[34]) ).
thf(36,plain,
! [A: $i] :
( ( ( succ @ A )
= A )
| ( ( succ @ ( succ @ A ) )
!= ( succ @ A ) ) ),
inference(lifteq,[status(thm)],[35]) ).
thf(51,plain,
! [B: $i > $o,A: $i] :
( ~ ~ ( B @ one )
| ~ ~ ( B
@ ( succ
@ ( sk3
@ ^ [C: $i] :
~ ( B @ C ) ) ) )
| ~ ( B @ A ) ),
inference(prim_subst,[status(thm)],[24:[bind(A,$thf( ^ [D: $i] : ~ ( C @ D ) ))]]) ).
thf(89,plain,
! [B: $i > $o,A: $i] :
( ( B @ one )
| ( B
@ ( succ
@ ( sk3
@ ^ [C: $i] :
~ ( B @ C ) ) ) )
| ~ ( B @ A ) ),
inference(cnf,[status(esa)],[51]) ).
thf(90,plain,
! [B: $i > $o,A: $i] :
( ( B @ one )
| ( B
@ ( succ
@ ( sk3
@ ^ [C: $i] :
~ ( B @ C ) ) ) )
| ~ ( B @ A ) ),
inference(simp,[status(thm)],[89]) ).
thf(113,plain,
! [B: $i,A: $i > $o] :
( ~ ( A @ one )
| ~ ( A @ sk1 )
| ( ( A @ B )
!= ( ~ ( A @ one ) ) )
| ( ( succ @ ( sk3 @ A ) )
!= ( succ @ sk1 ) ) ),
inference(paramod_ordered,[status(thm)],[11,75]) ).
thf(132,plain,
! [B: $i,A: $i > $o] :
( ~ ( A @ one )
| ~ ( A @ sk1 )
| ( ( A @ B )
!= ( ~ ( A @ one ) ) )
| ( ( sk3 @ A )
!= sk1 ) ),
inference(simp,[status(thm)],[113]) ).
thf(384,plain,
! [B: $i,A: $i > $o] :
( ~ ( A @ one )
| ( ( A @ B )
!= ( ~ ( A @ one ) ) )
| ( ( sk3 @ A )
!= sk1 )
| ( ( A @ sk1 )
!= ( A @ one ) )
| ~ $true ),
inference(eqfactor_ordered,[status(thm)],[132]) ).
thf(411,plain,
! [B: $i,A: $i > $o] :
( ~ ( A @ one )
| ( ( A @ B )
!= ( ~ ( A @ one ) ) )
| ( ( sk3 @ A )
!= sk1 )
| ( ( A @ sk1 )
!= ( A @ one ) ) ),
inference(pre_uni,[status(thm)],[384:[]]) ).
thf(44,plain,
! [D: $i,C: $i > $o,B: $i,A: $i > $o] :
( ~ ( A @ one )
| ~ ( A @ ( succ @ ( sk3 @ A ) ) )
| ~ ( C @ one )
| ~ $true
| ( C @ D )
| ( ( A @ B )
!= ( C @ ( succ @ ( sk3 @ C ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[24,24]) ).
thf(45,plain,
! [D: $i,C: $i > $o,B: $i,A: $i > $o] :
( ~ ( A @ one )
| ~ ( A @ ( succ @ ( sk3 @ A ) ) )
| ~ ( C @ one )
| ( C @ D )
| ( ( A @ B )
!= ( C @ ( succ @ ( sk3 @ C ) ) ) ) ),
inference(simp,[status(thm)],[44]) ).
thf(73,plain,
! [D: $i,C: $i > $o,B: $i,A: $i > $o] :
( ~ ( A @ one )
| ~ ( A @ ( succ @ ( sk3 @ A ) ) )
| ~ ( C @ one )
| ( C @ D )
| ( ( A @ B )
!= ( C @ ( succ @ ( sk3 @ C ) ) ) ) ),
inference(pre_uni,[status(thm)],[45:[]]) ).
thf(74,plain,
! [D: $i,C: $i > $o,B: $i,A: $i > $o] :
( ( C @ D )
| ~ ( C @ one )
| ~ ( A @ ( succ @ ( sk3 @ A ) ) )
| ~ ( A @ one )
| ( ( A @ B )
!= ( C @ ( succ @ ( sk3 @ C ) ) ) ) ),
inference(pre_uni,[status(thm)],[73:[]]) ).
thf(6,axiom,
m @ one,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m_is_one) ).
thf(31,plain,
( ( succ @ one )
!= one ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).
thf(32,plain,
( ( succ @ one )
!= one ),
inference(polarity_switch,[status(thm)],[31]) ).
thf(33,plain,
( ( succ @ one )
!= one ),
inference(lifteq,[status(thm)],[32]) ).
thf(46,plain,
! [B: $i,A: $i > $o] :
( ~ ( A @ one )
| ~ ( A @ sk1 )
| ( A @ B )
| ( ( succ @ ( sk3 @ A ) )
!= ( succ @ sk1 ) ) ),
inference(paramod_ordered,[status(thm)],[11,24]) ).
thf(65,plain,
! [B: $i,A: $i > $o] :
( ( A @ B )
| ~ ( A @ one )
| ~ ( A @ sk1 )
| ( ( sk3 @ A )
!= sk1 ) ),
inference(simp,[status(thm)],[46]) ).
thf(54,plain,
! [C: $i > $o,B: $i > $o,A: $i] :
( ~ ( ( B @ one )
| ( C @ one ) )
| ~ ( ( B
@ ( succ
@ ( sk3
@ ^ [D: $i] :
( ( B @ D )
| ( C @ D ) ) ) ) )
| ( C
@ ( succ
@ ( sk3
@ ^ [D: $i] :
( ( B @ D )
| ( C @ D ) ) ) ) ) )
| ( B @ A )
| ( C @ A ) ),
inference(prim_subst,[status(thm)],[24:[bind(A,$thf( ^ [E: $i] : ( ( C @ E ) | ( D @ E ) ) ))]]) ).
thf(91,plain,
! [C: $i > $o,B: $i > $o,A: $i] :
( ( ~ ( B @ one )
| ~ ( B
@ ( succ
@ ( sk3
@ ^ [D: $i] :
( ( B @ D )
| ( C @ D ) ) ) ) )
| ( B @ A )
| ( C @ A ) )
& ( ~ ( B @ one )
| ~ ( C
@ ( succ
@ ( sk3
@ ^ [D: $i] :
( ( B @ D )
| ( C @ D ) ) ) ) )
| ( B @ A )
| ( C @ A ) )
& ( ~ ( C @ one )
| ~ ( B
@ ( succ
@ ( sk3
@ ^ [D: $i] :
( ( B @ D )
| ( C @ D ) ) ) ) )
| ( B @ A )
| ( C @ A ) )
& ( ~ ( C @ one )
| ~ ( C
@ ( succ
@ ( sk3
@ ^ [D: $i] :
( ( B @ D )
| ( C @ D ) ) ) ) )
| ( B @ A )
| ( C @ A ) ) ),
inference(cnf,[status(esa)],[54]) ).
thf(93,plain,
! [C: $i > $o,B: $i > $o,A: $i] :
( ~ ( B @ one )
| ~ ( C
@ ( succ
@ ( sk3
@ ^ [D: $i] :
( ( B @ D )
| ( C @ D ) ) ) ) )
| ( B @ A )
| ( C @ A ) ),
inference(cnfConj,[status(thm)],[91]) ).
thf(97,plain,
! [C: $i > $o,B: $i > $o,A: $i] :
( ~ ( B @ one )
| ~ ( C
@ ( succ
@ ( sk3
@ ^ [D: $i] :
( ( B @ D )
| ( C @ D ) ) ) ) )
| ( B @ A )
| ( C @ A ) ),
inference(simp,[status(thm)],[93]) ).
thf(975,plain,
! [A: $i] :
( ( ( succ @ A )
= A )
| ( ( succ @ A )
!= sk1 )
| ( ( succ @ ( succ @ A ) )
!= ( succ @ sk1 ) ) ),
inference(paramod_ordered,[status(thm)],[11,36]) ).
thf(978,plain,
! [A: $i] :
( ( ( succ @ A )
= A )
| ( ( succ @ A )
!= sk1 )
| ( ( succ @ A )
!= sk1 ) ),
inference(simp,[status(thm)],[975]) ).
thf(980,plain,
! [A: $i] :
( ( ( succ @ A )
= A )
| ( ( succ @ A )
!= sk1 ) ),
inference(simp,[status(thm)],[978]) ).
thf(2975,plain,
! [A: $i] :
( ( ( sk3
@ ^ [B: $i] :
( one
= ( sk3 @ ( (=) @ $i @ B ) ) ) )
!= ( succ @ one ) )
| ( ( ( sk3
@ ^ [B: $i] :
( one
= ( sk3 @ ( (=) @ $i @ B ) ) ) )
= A )
!= ( ( sk3
@ ^ [B: $i] :
( one
= ( sk3 @ ( (=) @ $i @ B ) ) ) )
!= one ) )
| ( ( ^ [B: $i] : one )
!= ( ^ [B: $i] : one ) )
| ( ( ^ [B: $i] : B )
!= ( ^ [B: $i] : ( sk3 @ ( (=) @ $i @ B ) ) ) ) ),
inference(simp,[status(thm)],[2953]) ).
thf(3078,plain,
! [A: $i] :
( ( ( sk3
@ ^ [B: $i] :
( one
= ( sk3 @ ( (=) @ $i @ B ) ) ) )
!= ( succ @ one ) )
| ( ( ( sk3
@ ^ [B: $i] :
( one
= ( sk3 @ ( (=) @ $i @ B ) ) ) )
= A )
!= ( ( sk3
@ ^ [B: $i] :
( one
= ( sk3 @ ( (=) @ $i @ B ) ) ) )
!= one ) )
| ( ( ^ [B: $i] : B )
!= ( ^ [B: $i] : ( sk3 @ ( (=) @ $i @ B ) ) ) ) ),
inference(simp,[status(thm)],[2975]) ).
thf(605,plain,
! [B: $i,A: $i] :
( ( B
= ( sk3 @ ( (=) @ $i @ one ) ) )
| ( ( sk3
@ ^ [C: $i] :
( C
= ( sk3 @ ( (=) @ $i @ one ) ) ) )
= ( sk3 @ ( (=) @ $i @ one ) ) )
| ( one = A ) ),
inference(pre_uni,[status(thm)],[562:[bind(A,$thf( A )),bind(B,$thf( ^ [D: $i] : ( D = ( sk3 @ ( (=) @ $i @ one ) ) ) )),bind(C,$thf( C ))]]) ).
thf(667,plain,
! [B: $i,A: $i] :
( ( B
= ( sk3 @ ( (=) @ $i @ one ) ) )
| ( ( sk3
@ ^ [C: $i] :
( C
= ( sk3 @ ( (=) @ $i @ one ) ) ) )
= ( sk3 @ ( (=) @ $i @ one ) ) )
| ( one = A ) ),
inference(lifteq,[status(thm)],[605]) ).
thf(668,plain,
! [B: $i,A: $i] :
( ( B
= ( sk3 @ ( (=) @ $i @ one ) ) )
| ( ( sk3
@ ^ [C: $i] :
( C
= ( sk3 @ ( (=) @ $i @ one ) ) ) )
= ( sk3 @ ( (=) @ $i @ one ) ) )
| ( one = A ) ),
inference(simp,[status(thm)],[667]) ).
thf(4403,plain,
! [B: $i,A: $i] :
( ( B = one )
| ( ( sk3
@ ^ [C: $i] : ( C = one ) )
= one )
| ( one = A ) ),
inference(rewrite,[status(thm)],[668,188]) ).
thf(4691,plain,
! [C: $i,B: $i,A: $i] :
( ( ( sk3
@ ^ [D: $i] : ( D = one ) )
= one )
| ( one = A )
| ( one != one )
| ( B
!= ( succ @ C ) ) ),
inference(paramod_ordered,[status(thm)],[4403,15]) ).
thf(4692,plain,
! [C: $i,B: $i,A: $i] :
( ( ( sk3
@ ^ [D: $i] : ( D = one ) )
= one )
| ( one = A )
| ( B
!= ( succ @ C ) ) ),
inference(simp,[status(thm)],[4691]) ).
thf(4693,plain,
! [A: $i] :
( ( ( sk3
@ ^ [B: $i] : ( B = one ) )
= one )
| ( one = A ) ),
inference(pattern_uni,[status(thm)],[4692:[bind(A,$thf( A )),bind(B,$thf( succ @ D )),bind(C,$thf( D ))]]) ).
thf(6173,plain,
! [B: $i,A: $i] :
( ( ( sk3
@ ^ [C: $i] : ( C = one ) )
= one )
| ( one != one )
| ( A
!= ( succ @ B ) ) ),
inference(paramod_ordered,[status(thm)],[4693,15]) ).
thf(6174,plain,
! [B: $i,A: $i] :
( ( ( sk3
@ ^ [C: $i] : ( C = one ) )
= one )
| ( A
!= ( succ @ B ) ) ),
inference(simp,[status(thm)],[6173]) ).
thf(6175,plain,
( ( sk3
@ ^ [A: $i] : ( A = one ) )
= one ),
inference(pattern_uni,[status(thm)],[6174:[bind(A,$thf( succ @ C )),bind(B,$thf( C ))]]) ).
thf(92,plain,
! [C: $i > $o,B: $i > $o,A: $i] :
( ~ ( B @ one )
| ~ ( B
@ ( succ
@ ( sk3
@ ^ [D: $i] :
( ( B @ D )
| ( C @ D ) ) ) ) )
| ( B @ A )
| ( C @ A ) ),
inference(cnfConj,[status(thm)],[91]) ).
thf(96,plain,
! [C: $i > $o,B: $i > $o,A: $i] :
( ~ ( B @ one )
| ~ ( B
@ ( succ
@ ( sk3
@ ^ [D: $i] :
( ( B @ D )
| ( C @ D ) ) ) ) )
| ( B @ A )
| ( C @ A ) ),
inference(simp,[status(thm)],[92]) ).
thf(37,plain,
( ( sk1 != one )
| ( ( succ @ sk1 )
!= ( succ @ one ) ) ),
inference(paramod_ordered,[status(thm)],[11,33]) ).
thf(38,plain,
( ( sk1 != one )
| ( sk1 != one ) ),
inference(simp,[status(thm)],[37]) ).
thf(39,plain,
sk1 != one,
inference(simp,[status(thm)],[38]) ).
thf(94,plain,
! [C: $i > $o,B: $i > $o,A: $i] :
( ~ ( C @ one )
| ~ ( B
@ ( succ
@ ( sk3
@ ^ [D: $i] :
( ( B @ D )
| ( C @ D ) ) ) ) )
| ( B @ A )
| ( C @ A ) ),
inference(cnfConj,[status(thm)],[91]) ).
thf(98,plain,
! [C: $i > $o,B: $i > $o,A: $i] :
( ~ ( C @ one )
| ~ ( B
@ ( succ
@ ( sk3
@ ^ [D: $i] :
( ( B @ D )
| ( C @ D ) ) ) ) )
| ( B @ A )
| ( C @ A ) ),
inference(simp,[status(thm)],[94]) ).
thf(42,plain,
! [D: $i,C: $i > $o,B: $i,A: $i > $o] :
( ~ ( A @ one )
| ~ ( A @ ( succ @ ( sk3 @ A ) ) )
| ~ $true
| ~ ( C @ ( succ @ ( sk3 @ C ) ) )
| ( C @ D )
| ( ( A @ B )
!= ( C @ one ) ) ),
inference(paramod_ordered,[status(thm)],[24,24]) ).
thf(43,plain,
! [D: $i,C: $i > $o,B: $i,A: $i > $o] :
( ~ ( A @ one )
| ~ ( A @ ( succ @ ( sk3 @ A ) ) )
| ~ ( C @ ( succ @ ( sk3 @ C ) ) )
| ( C @ D )
| ( ( A @ B )
!= ( C @ one ) ) ),
inference(simp,[status(thm)],[42]) ).
thf(58,plain,
! [D: $i,C: $i > $o,B: $i,A: $i > $o] :
( ~ ( A @ one )
| ~ ( A @ ( succ @ ( sk3 @ A ) ) )
| ( ( succ @ ( sk3 @ C ) )
!= ( succ @ ( sk3 @ ( (=) @ $i @ ( succ @ ( sk3 @ C ) ) ) ) ) )
| ( ( succ @ ( sk3 @ C ) )
= D )
| ( ( A @ B )
!= ( ( succ @ ( sk3 @ C ) )
= one ) ) ),
inference(replace_leibeq,[status(thm)],[43:[bind(A,$thf( A )),bind(B,$thf( B )),bind(C,$thf( (=) @ $i @ ( succ @ ( sk3 @ C ) ) ))]]) ).
thf(63,plain,
! [D: $i,C: $i > $o,B: $i,A: $i > $o] :
( ( ( succ @ ( sk3 @ C ) )
!= ( succ @ ( sk3 @ ( (=) @ $i @ ( succ @ ( sk3 @ C ) ) ) ) ) )
| ( ( succ @ ( sk3 @ C ) )
= D )
| ~ ( A @ one )
| ~ ( A @ ( succ @ ( sk3 @ A ) ) )
| ( ( A @ B )
!= ( ( succ @ ( sk3 @ C ) )
= one ) ) ),
inference(lifteq,[status(thm)],[58]) ).
thf(71,plain,
! [D: $i,C: $i > $o,B: $i,A: $i > $o] :
( ~ ( A @ one )
| ~ ( A @ ( succ @ ( sk3 @ A ) ) )
| ~ ( C @ ( succ @ ( sk3 @ C ) ) )
| ( C @ D )
| ( ( A @ B )
!= ( C @ one ) ) ),
inference(pre_uni,[status(thm)],[43:[]]) ).
thf(72,plain,
! [D: $i,C: $i > $o,B: $i,A: $i > $o] :
( ( C @ D )
| ~ ( C @ ( succ @ ( sk3 @ C ) ) )
| ~ ( A @ ( succ @ ( sk3 @ A ) ) )
| ~ ( A @ one )
| ( ( A @ B )
!= ( C @ one ) ) ),
inference(pre_uni,[status(thm)],[71:[]]) ).
thf(9525,plain,
$false,
inference(e,[status(thm)],[333,2953,357,78,2364,773,34,12,135,3929,23,36,15,90,24,3088,132,411,74,70,21,33,65,97,980,188,3078,6175,96,39,98,2107,355,63,18,16,31,11,72,8,75]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM636^3 : TPTP v9.3.1. Released v3.7.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.10/0.20 % Computer : n018.cluster.edu
% 0.10/0.20 % Model : x86_64 x86_64
% 0.10/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.20 % Memory : 8046.5625MB
% 0.10/0.20 % OS : Linux 6.8.0-71-generic
% 0.10/0.20 % CPULimit : 300
% 0.10/0.20 % WCLimit : 300
% 0.10/0.20 % DateTime : Tue Sep 29 12:09:41 UTC 2026
% 0.10/0.20 % 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.87/0.77 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.18/0.96 % [INFO] Parsing done (189ms).
% 1.18/0.98 % [INFO] Running in sequential loop mode.
% 1.75/1.36 % [INFO] eprover registered as external prover.
% 1.75/1.37 % [INFO] Scanning for conjecture ...
% 1.92/1.46 % [INFO] Found a conjecture (or negated_conjecture) and 5 axioms. Running axiom selection ...
% 1.92/1.49 % [INFO] Axiom selection finished. Selected 5 axioms (removed 0 axioms).
% 2.08/1.50 % [INFO] Problem is higher-order (TPTP THF).
% 2.08/1.50 % [INFO] Type checking passed.
% 2.08/1.51 % [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 ...
% 45.07/12.87 % External prover 'e' found a proof!
% 45.07/12.87 % [INFO] Killing All external provers ...
% 45.07/12.87 % Time passed: 12532ms (effective reasoning time: 11885ms)
% 45.07/12.87 % 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)>
% 45.07/12.87 % Axioms used in derivation (5): m_is_one, succ_injective, m_is_next, induction, one_is_first
% 45.07/12.87 % No. of inferences in proof: 122
% 45.07/12.87 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 12532 ms resp. 11885 ms w/o parsing
% 36.88/12.97 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 36.88/12.97 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------