TSTP Solution File: SEU504^1 by Leo-III-SAT---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.12
% Problem : SEU504^1 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n006.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 03:42:21 EDT 2024
% Result : Theorem 4.64s 2.60s
% Output : Refutation 4.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 52
% Syntax : Number of formulae : 60 ( 26 unt; 30 typ; 21 def)
% Number of atoms : 315 ( 56 equ; 0 cnn)
% Maximal formula atoms : 59 ( 10 avg)
% Number of connectives : 726 ( 19 ~; 9 |; 56 &; 466 @)
% ( 0 <=>; 176 =>; 0 <=; 0 <~>)
% Maximal formula depth : 32 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 36 ( 36 >; 0 *; 0 +; 0 <<)
% Number of symbols : 34 ( 32 usr; 26 con; 0-2 aty)
% Number of variables : 216 ( 3 ^ 163 !; 50 ?; 216 :)
% Comments :
%------------------------------------------------------------------------------
thf(in_type,type,
in: $i > $i > $o ).
thf(exu_type,type,
exu: ( $i > $o ) > $o ).
thf(exu_def,definition,
( exu
= ( ^ [A: $i > $o] :
? [B: $i] :
( ( A @ B )
& ! [C: $i] :
( ( A @ C )
=> ( B = C ) ) ) ) ) ).
thf(setextAx_type,type,
setextAx: $o ).
thf(setextAx_def,definition,
( setextAx
= ( ! [A: $i,B: $i] :
( ! [C: $i] :
( ( in @ C @ A )
= ( in @ C @ B ) )
=> ( A = B ) ) ) ) ).
thf(emptyset_type,type,
emptyset: $i ).
thf(emptysetAx_type,type,
emptysetAx: $o ).
thf(emptysetAx_def,definition,
( emptysetAx
= ( ! [A: $i] :
~ ( in @ A @ emptyset ) ) ) ).
thf(setadjoin_type,type,
setadjoin: $i > $i > $i ).
thf(setadjoinAx_type,type,
setadjoinAx: $o ).
thf(setadjoinAx_def,definition,
( setadjoinAx
= ( ! [A: $i,B: $i,C: $i] :
( ( in @ C @ ( setadjoin @ A @ B ) )
= ( ( C = A )
| ( in @ C @ B ) ) ) ) ) ).
thf(powerset_type,type,
powerset: $i > $i ).
thf(powersetAx_type,type,
powersetAx: $o ).
thf(powersetAx_def,definition,
( powersetAx
= ( ! [A: $i,B: $i] :
( ( in @ B @ ( powerset @ A ) )
= ( ! [C: $i] :
( ( in @ C @ B )
=> ( in @ C @ A ) ) ) ) ) ) ).
thf(setunion_type,type,
setunion: $i > $i ).
thf(setunionAx_type,type,
setunionAx: $o ).
thf(setunionAx_def,definition,
( setunionAx
= ( ! [A: $i,B: $i] :
( ( in @ B @ ( setunion @ A ) )
= ( ? [C: $i] :
( ( in @ B @ C )
& ( in @ C @ A ) ) ) ) ) ) ).
thf(omega_type,type,
omega: $i ).
thf(omega0Ax_type,type,
omega0Ax: $o ).
thf(omega0Ax_def,definition,
( omega0Ax
= ( in @ emptyset @ omega ) ) ).
thf(omegaSAx_type,type,
omegaSAx: $o ).
thf(omegaSAx_def,definition,
( omegaSAx
= ( ! [A: $i] :
( ( in @ A @ omega )
=> ( in @ ( setadjoin @ A @ A ) @ omega ) ) ) ) ).
thf(omegaIndAx_type,type,
omegaIndAx: $o ).
thf(omegaIndAx_def,definition,
( omegaIndAx
= ( ! [A: $i] :
( ( ( in @ emptyset @ A )
& ! [B: $i] :
( ( ( in @ B @ omega )
& ( in @ B @ A ) )
=> ( in @ ( setadjoin @ B @ B ) @ A ) ) )
=> ! [B: $i] :
( ( in @ B @ omega )
=> ( in @ B @ A ) ) ) ) ) ).
thf(replAx_type,type,
replAx: $o ).
thf(replAx_def,definition,
( replAx
= ( ! [A: $i > $i > $o,B: $i] :
( ! [C: $i] :
( ( in @ C @ B )
=> ( exu @ ( A @ C ) ) )
=> ? [C: $i] :
! [D: $i] :
( ( in @ D @ C )
= ( ? [E: $i] :
( ( in @ E @ B )
& ( A @ E @ D ) ) ) ) ) ) ) ).
thf(foundationAx_type,type,
foundationAx: $o ).
thf(foundationAx_def,definition,
( foundationAx
= ( ! [A: $i] :
( ? [B: $i] : ( in @ B @ A )
=> ? [B: $i] :
( ( in @ B @ A )
& ~ ? [C: $i] :
( ( in @ C @ B )
& ( in @ C @ A ) ) ) ) ) ) ).
thf(wellorderingAx_type,type,
wellorderingAx: $o ).
thf(wellorderingAx_def,definition,
( wellorderingAx
= ( ! [A: $i] :
? [B: $i] :
( ! [C: $i] :
( ( in @ C @ B )
=> ! [D: $i] :
( ( in @ D @ C )
=> ( in @ D @ A ) ) )
& ! [C: $i,D: $i] :
( ( ( in @ C @ A )
& ( in @ D @ A ) )
=> ( ! [E: $i] :
( ( in @ E @ B )
=> ( ( in @ C @ E )
= ( in @ D @ E ) ) )
=> ( C = D ) ) )
& ! [C: $i,D: $i] :
( ( ( in @ C @ B )
& ( in @ D @ B ) )
=> ( ! [E: $i] :
( ( in @ E @ C )
=> ( in @ E @ D ) )
| ! [E: $i] :
( ( in @ E @ D )
=> ( in @ E @ C ) ) ) )
& ! [C: $i] :
( ( ! [D: $i] :
( ( in @ D @ C )
=> ( in @ D @ A ) )
& ? [D: $i] : ( in @ D @ C ) )
=> ? [D: $i,E: $i] :
( ( in @ D @ B )
& ( in @ E @ C )
& ~ ? [F: $i] :
( ( in @ F @ D )
& ( in @ F @ C ) )
& ! [F: $i] :
( ( in @ F @ B )
=> ( ! [G: $i] :
( ( in @ G @ F )
=> ( in @ G @ D ) )
| ( in @ E @ F ) ) ) ) ) ) ) ) ).
thf(descrp_type,type,
descrp: $o ).
thf(descrp_def,definition,
( descrp
= ( ! [A: $i > $o] :
( ( exu @ A )
=> ( A @ ( descr @ A ) ) ) ) ) ).
thf(dsetconstr_type,type,
dsetconstr: $i > ( $i > $o ) > $i ).
thf(dsetconstrI_type,type,
dsetconstrI: $o ).
thf(dsetconstrI_def,definition,
( dsetconstrI
= ( ! [A: $i,B: $i > $o,C: $i] :
( ( in @ C @ A )
=> ( ( B @ C )
=> ( in @ C @ ( dsetconstr @ A @ B ) ) ) ) ) ) ).
thf(dsetconstrEL_type,type,
dsetconstrEL: $o ).
thf(dsetconstrEL_def,definition,
( dsetconstrEL
= ( ! [A: $i,B: $i > $o,C: $i] :
( ( in @ C @ ( dsetconstr @ A @ B ) )
=> ( in @ C @ A ) ) ) ) ).
thf(dsetconstrER_type,type,
dsetconstrER: $o ).
thf(dsetconstrER_def,definition,
( dsetconstrER
= ( ! [A: $i,B: $i > $o,C: $i] :
( ( in @ C @ ( dsetconstr @ A @ B ) )
=> ( B @ C ) ) ) ) ).
thf(exuE1_type,type,
exuE1: $o ).
thf(exuE1_def,definition,
( exuE1
= ( ! [A: $i > $o] :
( ( exu @ A )
=> ? [B: $i] :
( ( A @ B )
& ! [C: $i] :
( ( A @ C )
=> ( B = C ) ) ) ) ) ) ).
thf(prop2setE_type,type,
prop2setE: $o ).
thf(prop2setE_def,definition,
( prop2setE
= ( ! [A: $o,B: $i] :
( ( in @ B @ ( prop2set @ A ) )
=> A ) ) ) ).
thf(emptysetE_type,type,
emptysetE: $o ).
thf(emptysetE_def,definition,
( emptysetE
= ( ! [A: $i] :
( ( in @ A @ emptyset )
=> ! [B: $o] : B ) ) ) ).
thf(emptysetimpfalse_type,type,
emptysetimpfalse: $o ).
thf(emptysetimpfalse_def,definition,
( emptysetimpfalse
= ( ! [A: $i] :
( ( in @ A @ emptyset )
=> $false ) ) ) ).
thf(notinemptyset_type,type,
notinemptyset: $o ).
thf(notinemptyset_def,definition,
( notinemptyset
= ( ! [A: $i] :
~ ( in @ A @ emptyset ) ) ) ).
thf(sk14_type,type,
sk14: $i > $o ).
thf(sk15_type,type,
sk15: $i ).
thf(1,conjecture,
( setextAx
=> ( emptysetAx
=> ( setadjoinAx
=> ( powersetAx
=> ( setunionAx
=> ( omega0Ax
=> ( omegaSAx
=> ( omegaIndAx
=> ( replAx
=> ( foundationAx
=> ( wellorderingAx
=> ( descrp
=> ( dsetconstrI
=> ( dsetconstrEL
=> ( dsetconstrER
=> ( exuE1
=> ( prop2setE
=> ( emptysetE
=> ( emptysetimpfalse
=> ( notinemptyset
=> ! [A: $i > $o] :
( ( exu @ A )
=> ? [B: $i] : ( A @ B ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',exuE3e) ).
thf(2,negated_conjecture,
~ ( setextAx
=> ( emptysetAx
=> ( setadjoinAx
=> ( powersetAx
=> ( setunionAx
=> ( omega0Ax
=> ( omegaSAx
=> ( omegaIndAx
=> ( replAx
=> ( foundationAx
=> ( wellorderingAx
=> ( descrp
=> ( dsetconstrI
=> ( dsetconstrEL
=> ( dsetconstrER
=> ( exuE1
=> ( prop2setE
=> ( emptysetE
=> ( emptysetimpfalse
=> ( notinemptyset
=> ! [A: $i > $o] :
( ( exu @ A )
=> ? [B: $i] : ( A @ B ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ( ! [A: $i,B: $i] :
( ! [C: $i] :
( ( in @ C @ A )
= ( in @ C @ B ) )
=> ( A = B ) )
=> ( ! [A: $i] :
~ ( in @ A @ emptyset )
=> ( ! [A: $i,B: $i,C: $i] :
( ( in @ C @ ( setadjoin @ A @ B ) )
= ( ( C = A )
| ( in @ C @ B ) ) )
=> ( ! [A: $i,B: $i] :
( ( in @ B @ ( powerset @ A ) )
= ( ! [C: $i] :
( ( in @ C @ B )
=> ( in @ C @ A ) ) ) )
=> ( ! [A: $i,B: $i] :
( ( in @ B @ ( setunion @ A ) )
= ( ? [C: $i] :
( ( in @ B @ C )
& ( in @ C @ A ) ) ) )
=> ( ( in @ emptyset @ omega )
=> ( ! [A: $i] :
( ( in @ A @ omega )
=> ( in @ ( setadjoin @ A @ A ) @ omega ) )
=> ( ! [A: $i] :
( ( ( in @ emptyset @ A )
& ! [B: $i] :
( ( ( in @ B @ omega )
& ( in @ B @ A ) )
=> ( in @ ( setadjoin @ B @ B ) @ A ) ) )
=> ! [B: $i] :
( ( in @ B @ omega )
=> ( in @ B @ A ) ) )
=> ( ! [A: $i > $i > $o,B: $i] :
( ! [C: $i] :
( ( in @ C @ B )
=> ? [D: $i] :
( ( A @ C @ D )
& ! [E: $i] :
( ( A @ C @ E )
=> ( D = E ) ) ) )
=> ? [C: $i] :
! [D: $i] :
( ( in @ D @ C )
= ( ? [E: $i] :
( ( in @ E @ B )
& ( A @ E @ D ) ) ) ) )
=> ( ! [A: $i] :
( ? [B: $i] : ( in @ B @ A )
=> ? [B: $i] :
( ( in @ B @ A )
& ~ ? [C: $i] :
( ( in @ C @ B )
& ( in @ C @ A ) ) ) )
=> ( ! [A: $i] :
? [B: $i] :
( ! [C: $i] :
( ( in @ C @ B )
=> ! [D: $i] :
( ( in @ D @ C )
=> ( in @ D @ A ) ) )
& ! [C: $i,D: $i] :
( ( ( in @ C @ A )
& ( in @ D @ A ) )
=> ( ! [E: $i] :
( ( in @ E @ B )
=> ( ( in @ C @ E )
= ( in @ D @ E ) ) )
=> ( C = D ) ) )
& ! [C: $i,D: $i] :
( ( ( in @ C @ B )
& ( in @ D @ B ) )
=> ( ! [E: $i] :
( ( in @ E @ C )
=> ( in @ E @ D ) )
| ! [E: $i] :
( ( in @ E @ D )
=> ( in @ E @ C ) ) ) )
& ! [C: $i] :
( ( ! [D: $i] :
( ( in @ D @ C )
=> ( in @ D @ A ) )
& ? [D: $i] : ( in @ D @ C ) )
=> ? [D: $i,E: $i] :
( ( in @ D @ B )
& ( in @ E @ C )
& ~ ? [F: $i] :
( ( in @ F @ D )
& ( in @ F @ C ) )
& ! [F: $i] :
( ( in @ F @ B )
=> ( ! [G: $i] :
( ( in @ G @ F )
=> ( in @ G @ D ) )
| ( in @ E @ F ) ) ) ) ) )
=> ( ! [A: $i > $o] :
( ? [B: $i] :
( ( A @ B )
& ! [C: $i] :
( ( A @ C )
=> ( B = C ) ) )
=> ( A @ ( descr @ A ) ) )
=> ( ! [A: $i,B: $i > $o,C: $i] :
( ( in @ C @ A )
=> ( ( B @ C )
=> ( in @ C @ ( dsetconstr @ A @ B ) ) ) )
=> ( ! [A: $i,B: $i > $o,C: $i] :
( ( in @ C @ ( dsetconstr @ A @ B ) )
=> ( in @ C @ A ) )
=> ( ! [A: $i,B: $i > $o,C: $i] :
( ( in @ C @ ( dsetconstr @ A @ B ) )
=> ( B @ C ) )
=> ( ! [A: $o,B: $i] :
( ( in @ B
@ ( dsetconstr @ ( powerset @ emptyset )
@ ^ [C: $i] : A ) )
=> A )
=> ( ! [A: $i] :
( ( in @ A @ emptyset )
=> ! [B: $o] : B )
=> ( ! [A: $i] :
~ ( in @ A @ emptyset )
=> ( ! [A: $i] :
~ ( in @ A @ emptyset )
=> ! [A: $i > $o] :
( ? [B: $i] :
( ( A @ B )
& ! [C: $i] :
( ( A @ C )
=> ( B = C ) ) )
=> ? [B: $i] : ( A @ B ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
~ ( ! [A: $i,B: $i] :
( ! [C: $i] :
( ( in @ C @ A )
= ( in @ C @ B ) )
=> ( A = B ) )
=> ( ~ ? [A: $i] : ( in @ A @ emptyset )
=> ( ! [A: $i,B: $i,C: $i] :
( ( in @ C @ ( setadjoin @ A @ B ) )
= ( ( C = A )
| ( in @ C @ B ) ) )
=> ( ! [A: $i,B: $i] :
( ( in @ B @ ( powerset @ A ) )
= ( ! [C: $i] :
( ( in @ C @ B )
=> ( in @ C @ A ) ) ) )
=> ( ! [A: $i,B: $i] :
( ( in @ B @ ( setunion @ A ) )
= ( ? [C: $i] :
( ( in @ B @ C )
& ( in @ C @ A ) ) ) )
=> ( ( in @ emptyset @ omega )
=> ( ! [A: $i] :
( ( in @ A @ omega )
=> ( in @ ( setadjoin @ A @ A ) @ omega ) )
=> ( ! [A: $i] :
( ( ( in @ emptyset @ A )
& ! [B: $i] :
( ( ( in @ B @ omega )
& ( in @ B @ A ) )
=> ( in @ ( setadjoin @ B @ B ) @ A ) ) )
=> ! [B: $i] :
( ( in @ B @ omega )
=> ( in @ B @ A ) ) )
=> ( ! [A: $i > $i > $o,B: $i] :
( ! [C: $i] :
( ( in @ C @ B )
=> ? [D: $i] :
( ( A @ C @ D )
& ! [E: $i] :
( ( A @ C @ E )
=> ( D = E ) ) ) )
=> ? [C: $i] :
! [D: $i] :
( ( in @ D @ C )
= ( ? [E: $i] :
( ( in @ E @ B )
& ( A @ E @ D ) ) ) ) )
=> ( ! [A: $i] :
( ? [B: $i] : ( in @ B @ A )
=> ? [B: $i] :
( ( in @ B @ A )
& ~ ? [C: $i] :
( ( in @ C @ B )
& ( in @ C @ A ) ) ) )
=> ( ! [A: $i] :
? [B: $i] :
( ! [C: $i] :
( ( in @ C @ B )
=> ! [D: $i] :
( ( in @ D @ C )
=> ( in @ D @ A ) ) )
& ! [C: $i,D: $i] :
( ( ( in @ C @ A )
& ( in @ D @ A ) )
=> ( ! [E: $i] :
( ( in @ E @ B )
=> ( ( in @ C @ E )
= ( in @ D @ E ) ) )
=> ( C = D ) ) )
& ! [C: $i,D: $i] :
( ( ( in @ C @ B )
& ( in @ D @ B ) )
=> ( ! [E: $i] :
( ( in @ E @ C )
=> ( in @ E @ D ) )
| ! [E: $i] :
( ( in @ E @ D )
=> ( in @ E @ C ) ) ) )
& ! [C: $i] :
( ( ! [D: $i] :
( ( in @ D @ C )
=> ( in @ D @ A ) )
& ? [D: $i] : ( in @ D @ C ) )
=> ? [D: $i] :
( ( in @ D @ B )
& ? [E: $i] :
( ( in @ E @ C )
& ~ ? [F: $i] :
( ( in @ F @ D )
& ( in @ F @ C ) )
& ! [F: $i] :
( ( in @ F @ B )
=> ( ! [G: $i] :
( ( in @ G @ F )
=> ( in @ G @ D ) )
| ( in @ E @ F ) ) ) ) ) ) )
=> ( ! [A: $i > $o] :
( ? [B: $i] :
( ( A @ B )
& ! [C: $i] :
( ( A @ C )
=> ( B = C ) ) )
=> ( A @ ( descr @ A ) ) )
=> ( ! [A: $i,B: $i > $o,C: $i] :
( ( in @ C @ A )
=> ( ( B @ C )
=> ( in @ C @ ( dsetconstr @ A @ B ) ) ) )
=> ( ! [A: $i,B: $i > $o,C: $i] :
( ( in @ C @ ( dsetconstr @ A @ B ) )
=> ( in @ C @ A ) )
=> ( ! [A: $i,B: $i > $o,C: $i] :
( ( in @ C @ ( dsetconstr @ A @ B ) )
=> ( B @ C ) )
=> ( ! [A: $o] :
( ? [B: $i] :
( in @ B
@ ( dsetconstr @ ( powerset @ emptyset )
@ ^ [C: $i] : A ) )
=> A )
=> ( ( ? [A: $i] : ( in @ A @ emptyset )
=> ! [A: $o] : A )
=> ( ~ ? [A: $i] : ( in @ A @ emptyset )
=> ( ~ ? [A: $i] : ( in @ A @ emptyset )
=> ! [A: $i > $o] :
( ? [B: $i] :
( ( A @ B )
& ! [C: $i] :
( ( A @ C )
=> ( B = C ) ) )
=> ? [B: $i] : ( A @ B ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(miniscope,[status(thm)],[3]) ).
thf(6,plain,
sk14 @ sk15,
inference(cnf,[status(esa)],[4]) ).
thf(21,plain,
! [A: $i] :
~ ( sk14 @ A ),
inference(cnf,[status(esa)],[4]) ).
thf(63,plain,
! [A: $i] :
~ ( sk14 @ A ),
inference(simp,[status(thm)],[21]) ).
thf(87,plain,
$false,
inference(rewrite,[status(thm)],[6,63]) ).
thf(88,plain,
$false,
inference(simp,[status(thm)],[87]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : SEU504^1 : TPTP v8.2.0. Released v3.7.0.
% 0.05/0.12 % Command : run_Leo-III %s %d
% 0.11/0.32 % Computer : n006.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Sun May 19 16:19:24 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.99/0.94 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.45/1.15 % [INFO] Parsing done (208ms).
% 1.56/1.17 % [INFO] Running in sequential loop mode.
% 2.02/1.53 % [INFO] nitpick registered as external prover.
% 2.15/1.53 % [INFO] Scanning for conjecture ...
% 2.48/1.73 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 2.70/1.77 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.70/1.77 % [INFO] Problem is higher-order (TPTP THF).
% 2.70/1.77 % [INFO] Type checking passed.
% 2.70/1.78 % [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 ...
% 4.54/2.59 % [INFO] Killing All external provers ...
% 4.64/2.60 % Time passed: 2125ms (effective reasoning time: 1422ms)
% 4.64/2.60 % 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)>
% 4.64/2.60 % Axioms used in derivation (0):
% 4.64/2.60 % No. of inferences in proof: 9
% 4.64/2.60 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 2125 ms resp. 1422 ms w/o parsing
% 4.78/2.69 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.78/2.69 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------