%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : LCL674+1.005 : 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 : n016.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 : Sun Sep 27 07:52:29 AM UTC 2026
% Result : Theorem 5.27s 2.92s
% Output : Refutation 5.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of formulae : 8 ( 3 unt; 0 typ; 0 def)
% Number of atoms : 372 ( 0 equ; 0 cnn)
% Maximal formula atoms : 121 ( 46 avg)
% Number of connectives : 1147 ( 332 ~; 198 |; 164 &; 451 @)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 29 ( 14 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 15 ( 14 usr; 1 con; 0-2 aty)
% Number of variables : 83 ( 0 ^; 80 !; 3 ?; 83 :)
% Comments :
%------------------------------------------------------------------------------
thf(r1_decl,type,
r1: $i > $i > $o ).
thf(p3_decl,type,
p3: $i > $o ).
thf(p6_decl,type,
p6: $i > $o ).
thf(p106_decl,type,
p106: $i > $o ).
thf(p105_decl,type,
p105: $i > $o ).
thf(p104_decl,type,
p104: $i > $o ).
thf(p5_decl,type,
p5: $i > $o ).
thf(p103_decl,type,
p103: $i > $o ).
thf(p4_decl,type,
p4: $i > $o ).
thf(p102_decl,type,
p102: $i > $o ).
thf(p101_decl,type,
p101: $i > $o ).
thf(p2_decl,type,
p2: $i > $o ).
thf(p100_decl,type,
p100: $i > $o ).
thf(p1_decl,type,
p1: $i > $o ).
thf(1,conjecture,
~ ? [A: $i] :
~ ( ~ ( ( A @ p100 )
& ~ ( A @ p101 )
& ! [B: $i] :
( ( ( ~ ( B @ p101 )
| ( B @ p100 ) )
& ( ~ ( B @ p102 )
| ( B @ p101 ) )
& ( ~ ( B @ p103 )
| ( B @ p102 ) )
& ( ~ ( B @ p104 )
| ( B @ p103 ) )
& ( ~ ( B @ p105 )
| ( B @ p104 ) )
& ( ~ ( B @ p106 )
| ( B @ p105 ) )
& ( ~ ( B @ p100 )
| ( ( ~ ( B @ p1 )
| ! [C: $i] :
( ~ ( C @ p100 )
| ( C @ p1 )
| ~ ( C @ ( B @ r1 ) ) ) )
& ( ( B @ p1 )
| ! [C: $i] :
( ~ ( C @ p100 )
| ~ ( C @ p1 )
| ~ ( C @ ( B @ r1 ) ) ) ) ) )
& ( ~ ( B @ p101 )
| ( ( ~ ( B @ p2 )
| ! [C: $i] :
( ~ ( C @ p101 )
| ( C @ p2 )
| ~ ( C @ ( B @ r1 ) ) ) )
& ( ( B @ p2 )
| ! [C: $i] :
( ~ ( C @ p101 )
| ~ ( C @ p2 )
| ~ ( C @ ( B @ r1 ) ) ) ) ) )
& ( ~ ( B @ p102 )
| ( ( ~ ( B @ p3 )
| ! [C: $i] :
( ~ ( C @ p102 )
| ( C @ p3 )
| ~ ( C @ ( B @ r1 ) ) ) )
& ( ( B @ p3 )
| ! [C: $i] :
( ~ ( C @ p102 )
| ~ ( C @ p3 )
| ~ ( C @ ( B @ r1 ) ) ) ) ) )
& ( ~ ( B @ p103 )
| ( ( ~ ( B @ p4 )
| ! [C: $i] :
( ~ ( C @ p103 )
| ( C @ p4 )
| ~ ( C @ ( B @ r1 ) ) ) )
& ( ( B @ p4 )
| ! [C: $i] :
( ~ ( C @ p103 )
| ~ ( C @ p4 )
| ~ ( C @ ( B @ r1 ) ) ) ) ) )
& ( ~ ( B @ p104 )
| ( ( ~ ( B @ p5 )
| ! [C: $i] :
( ~ ( C @ p104 )
| ( C @ p5 )
| ~ ( C @ ( B @ r1 ) ) ) )
& ( ( B @ p5 )
| ! [C: $i] :
( ~ ( C @ p104 )
| ~ ( C @ p5 )
| ~ ( C @ ( B @ r1 ) ) ) ) ) )
& ( ~ ( B @ p105 )
| ( ( ~ ( B @ p6 )
| ! [C: $i] :
( ~ ( C @ p105 )
| ( C @ p6 )
| ~ ( C @ ( B @ r1 ) ) ) )
& ( ( B @ p6 )
| ! [C: $i] :
( ~ ( C @ p105 )
| ~ ( C @ p6 )
| ~ ( C @ ( B @ r1 ) ) ) ) ) )
& ( ~ ( ( B @ p100 )
& ~ ( B @ p101 ) )
| ( ~ ! [C: $i] :
( ~ ( ( C @ p101 )
& ~ ( C @ p102 )
& ( C @ p2 ) )
| ~ ( C @ ( B @ r1 ) ) )
& ~ ! [C: $i] :
( ~ ( ( C @ p101 )
& ~ ( C @ p102 )
& ~ ( C @ p2 ) )
| ~ ( C @ ( B @ r1 ) ) ) ) )
& ( ~ ( ( B @ p101 )
& ~ ( B @ p102 ) )
| ( ~ ! [C: $i] :
( ~ ( ( C @ p102 )
& ~ ( C @ p103 )
& ( C @ p3 ) )
| ~ ( C @ ( B @ r1 ) ) )
& ~ ! [C: $i] :
( ~ ( ( C @ p102 )
& ~ ( C @ p103 )
& ~ ( C @ p3 ) )
| ~ ( C @ ( B @ r1 ) ) ) ) )
& ( ~ ( ( B @ p102 )
& ~ ( B @ p103 ) )
| ( ~ ! [C: $i] :
( ~ ( ( C @ p103 )
& ~ ( C @ p104 )
& ( C @ p4 ) )
| ~ ( C @ ( B @ r1 ) ) )
& ~ ! [C: $i] :
( ~ ( ( C @ p103 )
& ~ ( C @ p104 )
& ~ ( C @ p4 ) )
| ~ ( C @ ( B @ r1 ) ) ) ) )
& ( ~ ( ( B @ p103 )
& ~ ( B @ p104 ) )
| ( ~ ! [C: $i] :
( ~ ( ( C @ p104 )
& ~ ( C @ p105 )
& ( C @ p5 ) )
| ~ ( C @ ( B @ r1 ) ) )
& ~ ! [C: $i] :
( ~ ( ( C @ p104 )
& ~ ( C @ p105 )
& ~ ( C @ p5 ) )
| ~ ( C @ ( B @ r1 ) ) ) ) )
& ( ~ ( ( B @ p104 )
& ~ ( B @ p105 ) )
| ( ~ ! [C: $i] :
( ~ ( ( C @ p105 )
& ~ ( C @ p106 )
& ( C @ p6 ) )
| ~ ( C @ ( B @ r1 ) ) )
& ~ ! [C: $i] :
( ~ ( ( C @ p105 )
& ~ ( C @ p106 )
& ~ ( C @ p6 ) )
| ~ ( C @ ( B @ r1 ) ) ) ) ) )
| ~ ( B @ ( A @ r1 ) ) ) )
| ~ ! [B: $i] :
( ( B @ p3 )
| ~ ( B @ ( A @ r1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',main) ).
thf(2,negated_conjecture,
~ ~ ? [A: $i] :
~ ( ~ ( ( A @ p100 )
& ~ ( A @ p101 )
& ! [B: $i] :
( ( ( ~ ( B @ p101 )
| ( B @ p100 ) )
& ( ~ ( B @ p102 )
| ( B @ p101 ) )
& ( ~ ( B @ p103 )
| ( B @ p102 ) )
& ( ~ ( B @ p104 )
| ( B @ p103 ) )
& ( ~ ( B @ p105 )
| ( B @ p104 ) )
& ( ~ ( B @ p106 )
| ( B @ p105 ) )
& ( ~ ( B @ p100 )
| ( ( ~ ( B @ p1 )
| ! [C: $i] :
( ~ ( C @ p100 )
| ( C @ p1 )
| ~ ( C @ ( B @ r1 ) ) ) )
& ( ( B @ p1 )
| ! [C: $i] :
( ~ ( C @ p100 )
| ~ ( C @ p1 )
| ~ ( C @ ( B @ r1 ) ) ) ) ) )
& ( ~ ( B @ p101 )
| ( ( ~ ( B @ p2 )
| ! [C: $i] :
( ~ ( C @ p101 )
| ( C @ p2 )
| ~ ( C @ ( B @ r1 ) ) ) )
& ( ( B @ p2 )
| ! [C: $i] :
( ~ ( C @ p101 )
| ~ ( C @ p2 )
| ~ ( C @ ( B @ r1 ) ) ) ) ) )
& ( ~ ( B @ p102 )
| ( ( ~ ( B @ p3 )
| ! [C: $i] :
( ~ ( C @ p102 )
| ( C @ p3 )
| ~ ( C @ ( B @ r1 ) ) ) )
& ( ( B @ p3 )
| ! [C: $i] :
( ~ ( C @ p102 )
| ~ ( C @ p3 )
| ~ ( C @ ( B @ r1 ) ) ) ) ) )
& ( ~ ( B @ p103 )
| ( ( ~ ( B @ p4 )
| ! [C: $i] :
( ~ ( C @ p103 )
| ( C @ p4 )
| ~ ( C @ ( B @ r1 ) ) ) )
& ( ( B @ p4 )
| ! [C: $i] :
( ~ ( C @ p103 )
| ~ ( C @ p4 )
| ~ ( C @ ( B @ r1 ) ) ) ) ) )
& ( ~ ( B @ p104 )
| ( ( ~ ( B @ p5 )
| ! [C: $i] :
( ~ ( C @ p104 )
| ( C @ p5 )
| ~ ( C @ ( B @ r1 ) ) ) )
& ( ( B @ p5 )
| ! [C: $i] :
( ~ ( C @ p104 )
| ~ ( C @ p5 )
| ~ ( C @ ( B @ r1 ) ) ) ) ) )
& ( ~ ( B @ p105 )
| ( ( ~ ( B @ p6 )
| ! [C: $i] :
( ~ ( C @ p105 )
| ( C @ p6 )
| ~ ( C @ ( B @ r1 ) ) ) )
& ( ( B @ p6 )
| ! [C: $i] :
( ~ ( C @ p105 )
| ~ ( C @ p6 )
| ~ ( C @ ( B @ r1 ) ) ) ) ) )
& ( ~ ( ( B @ p100 )
& ~ ( B @ p101 ) )
| ( ~ ! [C: $i] :
( ~ ( ( C @ p101 )
& ~ ( C @ p102 )
& ( C @ p2 ) )
| ~ ( C @ ( B @ r1 ) ) )
& ~ ! [C: $i] :
( ~ ( ( C @ p101 )
& ~ ( C @ p102 )
& ~ ( C @ p2 ) )
| ~ ( C @ ( B @ r1 ) ) ) ) )
& ( ~ ( ( B @ p101 )
& ~ ( B @ p102 ) )
| ( ~ ! [C: $i] :
( ~ ( ( C @ p102 )
& ~ ( C @ p103 )
& ( C @ p3 ) )
| ~ ( C @ ( B @ r1 ) ) )
& ~ ! [C: $i] :
( ~ ( ( C @ p102 )
& ~ ( C @ p103 )
& ~ ( C @ p3 ) )
| ~ ( C @ ( B @ r1 ) ) ) ) )
& ( ~ ( ( B @ p102 )
& ~ ( B @ p103 ) )
| ( ~ ! [C: $i] :
( ~ ( ( C @ p103 )
& ~ ( C @ p104 )
& ( C @ p4 ) )
| ~ ( C @ ( B @ r1 ) ) )
& ~ ! [C: $i] :
( ~ ( ( C @ p103 )
& ~ ( C @ p104 )
& ~ ( C @ p4 ) )
| ~ ( C @ ( B @ r1 ) ) ) ) )
& ( ~ ( ( B @ p103 )
& ~ ( B @ p104 ) )
| ( ~ ! [C: $i] :
( ~ ( ( C @ p104 )
& ~ ( C @ p105 )
& ( C @ p5 ) )
| ~ ( C @ ( B @ r1 ) ) )
& ~ ! [C: $i] :
( ~ ( ( C @ p104 )
& ~ ( C @ p105 )
& ~ ( C @ p5 ) )
| ~ ( C @ ( B @ r1 ) ) ) ) )
& ( ~ ( ( B @ p104 )
& ~ ( B @ p105 ) )
| ( ~ ! [C: $i] :
( ~ ( ( C @ p105 )
& ~ ( C @ p106 )
& ( C @ p6 ) )
| ~ ( C @ ( B @ r1 ) ) )
& ~ ! [C: $i] :
( ~ ( ( C @ p105 )
& ~ ( C @ p106 )
& ~ ( C @ p6 ) )
| ~ ( C @ ( B @ r1 ) ) ) ) ) )
| ~ ( B @ ( A @ r1 ) ) ) )
| ~ ! [B: $i] :
( ( B @ p3 )
| ~ ( B @ ( A @ r1 ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(5,plain,
~ ~ ? [A: $i] :
~ ( ~ ( ( A @ p100 )
& ~ ( A @ p101 )
& ! [B: $i] :
( ( ( ~ ( B @ p101 )
| ( B @ p100 ) )
& ( ~ ( B @ p102 )
| ( B @ p101 ) )
& ( ~ ( B @ p103 )
| ( B @ p102 ) )
& ( ~ ( B @ p104 )
| ( B @ p103 ) )
& ( ~ ( B @ p105 )
| ( B @ p104 ) )
& ( ~ ( B @ p106 )
| ( B @ p105 ) )
& ( ~ ( B @ p100 )
| ( ( ~ ( B @ p1 )
| ! [C: $i] :
( ~ ( C @ p100 )
| ( C @ p1 )
| ~ ( C @ ( B @ r1 ) ) ) )
& ( ( B @ p1 )
| ! [C: $i] :
( ~ ( C @ p100 )
| ~ ( C @ p1 )
| ~ ( C @ ( B @ r1 ) ) ) ) ) )
& ( ~ ( B @ p101 )
| ( ( ~ ( B @ p2 )
| ! [C: $i] :
( ~ ( C @ p101 )
| ( C @ p2 )
| ~ ( C @ ( B @ r1 ) ) ) )
& ( ( B @ p2 )
| ! [C: $i] :
( ~ ( C @ p101 )
| ~ ( C @ p2 )
| ~ ( C @ ( B @ r1 ) ) ) ) ) )
& ( ~ ( B @ p102 )
| ( ( ~ ( B @ p3 )
| ! [C: $i] :
( ~ ( C @ p102 )
| ( C @ p3 )
| ~ ( C @ ( B @ r1 ) ) ) )
& ( ( B @ p3 )
| ! [C: $i] :
( ~ ( C @ p102 )
| ~ ( C @ p3 )
| ~ ( C @ ( B @ r1 ) ) ) ) ) )
& ( ~ ( B @ p103 )
| ( ( ~ ( B @ p4 )
| ! [C: $i] :
( ~ ( C @ p103 )
| ( C @ p4 )
| ~ ( C @ ( B @ r1 ) ) ) )
& ( ( B @ p4 )
| ! [C: $i] :
( ~ ( C @ p103 )
| ~ ( C @ p4 )
| ~ ( C @ ( B @ r1 ) ) ) ) ) )
& ( ~ ( B @ p104 )
| ( ( ~ ( B @ p5 )
| ! [C: $i] :
( ~ ( C @ p104 )
| ( C @ p5 )
| ~ ( C @ ( B @ r1 ) ) ) )
& ( ( B @ p5 )
| ! [C: $i] :
( ~ ( C @ p104 )
| ~ ( C @ p5 )
| ~ ( C @ ( B @ r1 ) ) ) ) ) )
& ( ~ ( B @ p105 )
| ( ( ~ ( B @ p6 )
| ! [C: $i] :
( ~ ( C @ p105 )
| ( C @ p6 )
| ~ ( C @ ( B @ r1 ) ) ) )
& ( ( B @ p6 )
| ! [C: $i] :
( ~ ( C @ p105 )
| ~ ( C @ p6 )
| ~ ( C @ ( B @ r1 ) ) ) ) ) )
& ( ~ ( ( B @ p100 )
& ~ ( B @ p101 ) )
| ( ~ ! [C: $i] :
( ~ ( ( C @ p101 )
& ~ ( C @ p102 )
& ( C @ p2 ) )
| ~ ( C @ ( B @ r1 ) ) )
& ~ ! [C: $i] :
( ~ ( ( C @ p101 )
& ~ ( C @ p102 )
& ~ ( C @ p2 ) )
| ~ ( C @ ( B @ r1 ) ) ) ) )
& ( ~ ( ( B @ p101 )
& ~ ( B @ p102 ) )
| ( ~ ! [C: $i] :
( ~ ( ( C @ p102 )
& ~ ( C @ p103 )
& ( C @ p3 ) )
| ~ ( C @ ( B @ r1 ) ) )
& ~ ! [C: $i] :
( ~ ( ( C @ p102 )
& ~ ( C @ p103 )
& ~ ( C @ p3 ) )
| ~ ( C @ ( B @ r1 ) ) ) ) )
& ( ~ ( ( B @ p102 )
& ~ ( B @ p103 ) )
| ( ~ ! [C: $i] :
( ~ ( ( C @ p103 )
& ~ ( C @ p104 )
& ( C @ p4 ) )
| ~ ( C @ ( B @ r1 ) ) )
& ~ ! [C: $i] :
( ~ ( ( C @ p103 )
& ~ ( C @ p104 )
& ~ ( C @ p4 ) )
| ~ ( C @ ( B @ r1 ) ) ) ) )
& ( ~ ( ( B @ p103 )
& ~ ( B @ p104 ) )
| ( ~ ! [C: $i] :
( ~ ( ( C @ p104 )
& ~ ( C @ p105 )
& ( C @ p5 ) )
| ~ ( C @ ( B @ r1 ) ) )
& ~ ! [C: $i] :
( ~ ( ( C @ p104 )
& ~ ( C @ p105 )
& ~ ( C @ p5 ) )
| ~ ( C @ ( B @ r1 ) ) ) ) )
& ( ~ ( ( B @ p104 )
& ~ ( B @ p105 ) )
| ( ~ ! [C: $i] :
( ~ ( ( C @ p105 )
& ~ ( C @ p106 )
& ( C @ p6 ) )
| ~ ( C @ ( B @ r1 ) ) )
& ~ ! [C: $i] :
( ~ ( ( C @ p105 )
& ~ ( C @ p106 )
& ~ ( C @ p6 ) )
| ~ ( C @ ( B @ r1 ) ) ) ) ) )
| ~ ( B @ ( A @ r1 ) ) ) )
| ~ ! [B: $i] :
( ( B @ p3 )
| ~ ( B @ ( A @ r1 ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(3,axiom,
! [A: $i] : ( A @ ( A @ r1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity) ).
thf(128,plain,
! [A: $i] : ( A @ ( A @ r1 ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(4,axiom,
! [A: $i,B: $i,C: $i] :
( ( ( C @ ( B @ r1 ) )
& ( B @ ( A @ r1 ) ) )
=> ( C @ ( A @ r1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity) ).
thf(130,plain,
! [A: $i,B: $i,C: $i] :
( ( ( C @ ( B @ r1 ) )
& ( B @ ( A @ r1 ) ) )
=> ( C @ ( A @ r1 ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(132,plain,
$false,
inference(e,[status(thm)],[5,128,130]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL674+1.005 : 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.13/0.39 % Computer : n016.cluster.edu
% 0.13/0.39 % Model : x86_64 x86_64
% 0.13/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.39 % Memory : 8046.5625MB
% 0.13/0.39 % OS : Linux 6.8.0-71-generic
% 0.13/0.39 % CPULimit : 300
% 0.13/0.39 % WCLimit : 300
% 0.13/0.39 % DateTime : Fri Sep 25 23:19:16 UTC 2026
% 0.13/0.40 % CPUTime :
% 0.13/0.40 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/1.01 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.39/1.22 % [INFO] Parsing done (206ms).
% 1.39/1.23 % [INFO] Running in sequential loop mode.
% 2.10/1.64 % [INFO] eprover registered as external prover.
% 2.10/1.65 % [INFO] Scanning for conjecture ...
% 2.51/1.81 % [INFO] Found a conjecture (or negated_conjecture) and 2 axioms. Running axiom selection ...
% 2.51/1.88 % [INFO] Axiom selection finished. Selected 2 axioms (removed 0 axioms).
% 2.51/1.89 % [INFO] Problem is first-order (TPTP FOF).
% 2.72/1.90 % [INFO] Type checking passed.
% 2.72/1.90 % [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.27/2.91 % External prover 'e' found a proof!
% 5.27/2.92 % [INFO] Killing All external provers ...
% 5.27/2.92 % Time passed: 2340ms (effective reasoning time: 1675ms)
% 5.27/2.92 % 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.27/2.92 % Axioms used in derivation (2): reflexivity, transitivity
% 5.27/2.92 % No. of inferences in proof: 8
% 5.27/2.92 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 2340 ms resp. 1675 ms w/o parsing
% 5.27/3.00 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 5.27/3.00 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------