%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SEU960^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 : n004.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:39 AM UTC 2026
% Result : Theorem 82.87s 18.36s
% Output : Refutation 67.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 7
% Syntax : Number of formulae : 48 ( 15 unt; 0 typ; 6 def)
% Number of atoms : 112 ( 22 equ; 0 cnn)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 604 ( 74 ~; 65 |; 31 &; 388 @)
% ( 0 <=>; 46 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 7 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 127 ( 127 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 163 ( 83 ^; 74 !; 0 ?; 163 :)
% ( 0 !>; 0 ?*; 0 @-; 6 @+)
% Comments :
%------------------------------------------------------------------------------
thf(a_type,type,
a: $tType ).
thf(sk1_decl,type,
sk1: a > a ).
thf(sk2_decl,type,
sk2: a > a ).
thf(sk3_decl,type,
sk3: a > a ).
thf(sk4_decl,type,
sk4: ( ( a > a ) > $o ) > a > a ).
thf(sk5_decl,type,
sk5: ( ( a > a ) > $o ) > a > a ).
thf(sk6_decl,type,
sk6: ( a > a ) > $o ).
thf(sk1_def,definition,
( sk1
= ( @+[A: a > a] :
~ ! [B: a > a,C: a > a] :
( ( ! [D: ( a > a ) > $o] :
( ( ( D @ A )
& ! [E: a > a] :
( ( D @ E )
=> ( D
@ ^ [F: a] : ( A @ ( E @ F ) ) ) ) )
=> ( D @ B ) )
& ! [D: ( a > a ) > $o] :
( ( ( D @ A )
& ! [E: a > a] :
( ( D @ E )
=> ( D
@ ^ [F: a] : ( A @ ( E @ F ) ) ) ) )
=> ( D @ C ) ) )
=> ! [D: ( a > a ) > $o] :
( ( ( D @ A )
& ! [E: a > a] :
( ( D @ E )
=> ( D
@ ^ [F: a] : ( A @ ( E @ F ) ) ) ) )
=> ( D
@ ^ [E: a] : ( B @ ( C @ E ) ) ) ) ) ) ) ).
thf(sk2_def,definition,
( sk2
= ( @+[A: a > a] :
~ ! [B: a > a] :
( ( ! [C: ( a > a ) > $o] :
( ( ( C @ sk1 )
& ! [D: a > a] :
( ( C @ D )
=> ( C
@ ^ [E: a] : ( sk1 @ ( D @ E ) ) ) ) )
=> ( C @ A ) )
& ! [C: ( a > a ) > $o] :
( ( ( C @ sk1 )
& ! [D: a > a] :
( ( C @ D )
=> ( C
@ ^ [E: a] : ( sk1 @ ( D @ E ) ) ) ) )
=> ( C @ B ) ) )
=> ! [C: ( a > a ) > $o] :
( ( ( C @ sk1 )
& ! [D: a > a] :
( ( C @ D )
=> ( C
@ ^ [E: a] : ( sk1 @ ( D @ E ) ) ) ) )
=> ( C
@ ^ [D: a] : ( A @ ( B @ D ) ) ) ) ) ) ) ).
thf(sk3_def,definition,
( sk3
= ( @+[A: a > a] :
~ ( ( ! [B: ( a > a ) > $o] :
( ( ( B @ sk1 )
& ! [C: a > a] :
( ( B @ C )
=> ( B
@ ^ [D: a] : ( sk1 @ ( C @ D ) ) ) ) )
=> ( B @ sk2 ) )
& ! [B: ( a > a ) > $o] :
( ( ( B @ sk1 )
& ! [C: a > a] :
( ( B @ C )
=> ( B
@ ^ [D: a] : ( sk1 @ ( C @ D ) ) ) ) )
=> ( B @ A ) ) )
=> ! [B: ( a > a ) > $o] :
( ( ( B @ sk1 )
& ! [C: a > a] :
( ( B @ C )
=> ( B
@ ^ [D: a] : ( sk1 @ ( C @ D ) ) ) ) )
=> ( B
@ ^ [C: a] : ( sk2 @ ( A @ C ) ) ) ) ) ) ) ).
thf(sk4_def,definition,
( sk4
= ( ^ [A: ( a > a ) > $o] :
@+[B: a > a] :
~ ( ( A @ B )
=> ( A
@ ^ [C: a] : ( sk1 @ ( B @ C ) ) ) ) ) ) ).
thf(sk5_def,definition,
( sk5
= ( ^ [A: ( a > a ) > $o] :
@+[B: a > a] :
~ ( ( A @ B )
=> ( A
@ ^ [C: a] : ( sk1 @ ( B @ C ) ) ) ) ) ) ).
thf(sk6_def,definition,
( sk6
= ( @+[A: ( a > a ) > $o] :
~ ( ( ( A @ sk1 )
& ! [B: a > a] :
( ( A @ B )
=> ( A
@ ^ [C: a] : ( sk1 @ ( B @ C ) ) ) ) )
=> ( A
@ ^ [B: a] : ( sk2 @ ( sk3 @ B ) ) ) ) ) ) ).
thf(1,conjecture,
! [A: a > a,B: a > a,C: a > a] :
( ( ! [D: ( a > a ) > $o] :
( ( ( D @ A )
& ! [E: a > a] :
( ( D @ E )
=> ( D
@ ^ [F: a] : ( A @ ( E @ F ) ) ) ) )
=> ( D @ B ) )
& ! [D: ( a > a ) > $o] :
( ( ( D @ A )
& ! [E: a > a] :
( ( D @ E )
=> ( D
@ ^ [F: a] : ( A @ ( E @ F ) ) ) ) )
=> ( D @ C ) ) )
=> ! [D: ( a > a ) > $o] :
( ( ( D @ A )
& ! [E: a > a] :
( ( D @ E )
=> ( D
@ ^ [F: a] : ( A @ ( E @ F ) ) ) ) )
=> ( D
@ ^ [E: a] : ( B @ ( C @ E ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM135D_pme) ).
thf(2,negated_conjecture,
~ ! [A: a > a,B: a > a,C: a > a] :
( ( ! [D: ( a > a ) > $o] :
( ( ( D @ A )
& ! [E: a > a] :
( ( D @ E )
=> ( D
@ ^ [F: a] : ( A @ ( E @ F ) ) ) ) )
=> ( D @ B ) )
& ! [D: ( a > a ) > $o] :
( ( ( D @ A )
& ! [E: a > a] :
( ( D @ E )
=> ( D
@ ^ [F: a] : ( A @ ( E @ F ) ) ) ) )
=> ( D @ C ) ) )
=> ! [D: ( a > a ) > $o] :
( ( ( D @ A )
& ! [E: a > a] :
( ( D @ E )
=> ( D
@ ^ [F: a] : ( A @ ( E @ F ) ) ) ) )
=> ( D
@ ^ [E: a] : ( B @ ( C @ E ) ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ! [A: a > a,B: a > a,C: a > a] :
( ( ! [D: ( a > a ) > $o] :
( ( ( D @ A )
& ! [E: a > a] :
( ( D @ E )
=> ( D
@ ^ [F: a] : ( A @ ( E @ F ) ) ) ) )
=> ( D @ B ) )
& ! [D: ( a > a ) > $o] :
( ( ( D @ A )
& ! [E: a > a] :
( ( D @ E )
=> ( D
@ ^ [F: a] : ( A @ ( E @ F ) ) ) ) )
=> ( D @ C ) ) )
=> ! [D: ( a > a ) > $o] :
( ( ( D @ A )
& ! [E: a > a] :
( ( D @ E )
=> ( D
@ ^ [F: a] : ( A @ ( E @ F ) ) ) ) )
=> ( D
@ ^ [E: a] : ( B @ ( C @ E ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
! [C: a > a,B: ( a > a ) > $o,A: ( a > a ) > $o] :
( ( ~ ( A @ sk1 )
| ( A @ ( sk4 @ A ) )
| ( A @ sk2 ) )
& ( ~ ( A @ sk1 )
| ~ ( A
@ ^ [D: a] : ( sk1 @ ( sk4 @ A @ D ) ) )
| ( A @ sk2 ) )
& ( ~ ( B @ sk1 )
| ( B @ ( sk5 @ B ) )
| ( B @ sk3 ) )
& ( ~ ( B @ sk1 )
| ~ ( B
@ ^ [D: a] : ( sk1 @ ( sk5 @ B @ D ) ) )
| ( B @ sk3 ) )
& ( sk6 @ sk1 )
& ( ~ ( sk6 @ C )
| ( sk6
@ ^ [D: a] : ( sk1 @ ( C @ D ) ) ) )
& ~ ( sk6
@ ^ [D: a] : ( sk2 @ ( sk3 @ D ) ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(9,plain,
! [A: ( a > a ) > $o] :
( ~ ( A @ sk1 )
| ( A @ ( sk4 @ A ) )
| ( A @ sk2 ) ),
inference(cnfConj,[status(thm)],[4]) ).
thf(7,plain,
! [A: a > a] :
( ~ ( sk6 @ A )
| ( sk6
@ ^ [B: a] : ( sk1 @ ( A @ B ) ) ) ),
inference(cnfConj,[status(thm)],[4]) ).
thf(23,plain,
! [A: a > a] :
( ~ ( sk6 @ A )
| ( sk6
@ ^ [B: a] : ( sk1 @ ( A @ B ) ) ) ),
inference(simp,[status(thm)],[7]) ).
thf(10,plain,
! [A: ( a > a ) > $o] :
( ~ ( A @ sk1 )
| ~ ( A
@ ^ [B: a] : ( sk1 @ ( sk4 @ A @ B ) ) )
| ( A @ sk2 ) ),
inference(cnfConj,[status(thm)],[4]) ).
thf(8,plain,
~ ( sk6
@ ^ [A: a] : ( sk2 @ ( sk3 @ A ) ) ),
inference(cnfConj,[status(thm)],[4]) ).
thf(39,plain,
! [A: ( a > a ) > $o] :
( ~ ( A @ sk1 )
| ~ ( A
@ ^ [B: a] : ( sk1 @ ( sk4 @ A @ B ) ) )
| ~ $true
| ( ( A @ sk2 )
!= ( sk6
@ ^ [B: a] : ( sk2 @ ( sk3 @ B ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[10,8]) ).
thf(40,plain,
! [A: ( a > a ) > $o] :
( ~ ( A @ sk1 )
| ~ ( A
@ ^ [B: a] : ( sk1 @ ( sk4 @ A @ B ) ) )
| ( ( A @ sk2 )
!= ( sk6
@ ^ [B: a] : ( sk2 @ ( sk3 @ B ) ) ) ) ),
inference(simp,[status(thm)],[39]) ).
thf(74,plain,
( ~ ( sk6
@ ^ [A: a] : ( sk1 @ ( sk3 @ A ) ) )
| ~ ( sk6
@ ^ [A: a] :
( sk1
@ ( sk4
@ ^ [B: a > a] :
( sk6
@ ^ [C: a] : ( B @ ( sk3 @ C ) ) )
@ ( sk3 @ A ) ) ) ) ),
inference(pre_uni,[status(thm)],[40:[bind(A,$thf( ^ [B: a > a] : ( sk6 @ ^ [C: a] : ( B @ ( sk3 @ C ) ) ) ))]]) ).
thf(6,plain,
sk6 @ sk1,
inference(cnfConj,[status(thm)],[4]) ).
thf(11,plain,
! [A: ( a > a ) > $o] :
( ~ ( A @ sk1 )
| ( A @ ( sk5 @ A ) )
| ( A @ sk3 ) ),
inference(cnfConj,[status(thm)],[4]) ).
thf(24,plain,
! [A: ( a > a ) > $o] :
( ~ ( A @ sk1 )
| ( A @ ( sk5 @ A ) )
| ( A @ sk3 ) ),
inference(simp,[status(thm)],[11]) ).
thf(1769,plain,
! [A: ( a > a ) > $o] :
( ~ $true
| ( A @ ( sk5 @ A ) )
| ( A @ sk3 )
| ( ( sk6 @ sk1 )
!= ( A @ sk1 ) ) ),
inference(paramod_ordered,[status(thm)],[6,24]) ).
thf(1770,plain,
! [A: ( a > a ) > $o] :
( ( A @ ( sk5 @ A ) )
| ( A @ sk3 )
| ( ( sk6 @ sk1 )
!= ( A @ sk1 ) ) ),
inference(simp,[status(thm)],[1769]) ).
thf(1911,plain,
( ( sk6 @ ( sk5 @ sk6 ) )
| ( sk6 @ sk3 ) ),
inference(pre_uni,[status(thm)],[1770:[bind(A,$thf( sk6 ))]]) ).
thf(5,plain,
! [A: ( a > a ) > $o] :
( ~ ( A @ sk1 )
| ~ ( A
@ ^ [B: a] : ( sk1 @ ( sk5 @ A @ B ) ) )
| ( A @ sk3 ) ),
inference(cnfConj,[status(thm)],[4]) ).
thf(16,plain,
! [A: ( a > a ) > $o] :
( ~ ( A @ sk1 )
| ~ ( A
@ ^ [B: a] : ( sk1 @ ( sk5 @ A @ B ) ) )
| ( A @ sk3 ) ),
inference(simp,[status(thm)],[5]) ).
thf(329,plain,
! [A: ( a > a ) > $o] :
( ~ $true
| ~ ( A
@ ^ [B: a] : ( sk1 @ ( sk5 @ A @ B ) ) )
| ( A @ sk3 )
| ( ( sk6 @ sk1 )
!= ( A @ sk1 ) ) ),
inference(paramod_ordered,[status(thm)],[6,16]) ).
thf(330,plain,
! [A: ( a > a ) > $o] :
( ~ ( A
@ ^ [B: a] : ( sk1 @ ( sk5 @ A @ B ) ) )
| ( A @ sk3 )
| ( ( sk6 @ sk1 )
!= ( A @ sk1 ) ) ),
inference(simp,[status(thm)],[329]) ).
thf(425,plain,
( ~ ( sk6
@ ^ [A: a] : ( sk1 @ ( sk5 @ sk6 @ A ) ) )
| ( sk6 @ sk3 ) ),
inference(pre_uni,[status(thm)],[330:[bind(A,$thf( sk6 ))]]) ).
thf(1197,plain,
! [A: a > a] :
( ~ ( sk6 @ A )
| ~ $true
| ( sk6 @ sk3 )
| ( ( sk6
@ ^ [B: a] : ( sk1 @ ( A @ B ) ) )
!= ( sk6
@ ^ [B: a] : ( sk1 @ ( sk5 @ sk6 @ B ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[23,425]) ).
thf(1198,plain,
! [A: a > a] :
( ~ ( sk6 @ A )
| ( sk6 @ sk3 )
| ( ( sk6
@ ^ [B: a] : ( sk1 @ ( A @ B ) ) )
!= ( sk6
@ ^ [B: a] : ( sk1 @ ( sk5 @ sk6 @ B ) ) ) ) ),
inference(simp,[status(thm)],[1197]) ).
thf(1199,plain,
( ~ ( sk6 @ ( sk5 @ sk6 ) )
| ( sk6 @ sk3 ) ),
inference(pattern_uni,[status(thm)],[1198:[bind(A,$thf( sk5 @ sk6 ))]]) ).
thf(2666,plain,
( ( sk6 @ sk3 )
| ~ $true
| ( sk6 @ sk3 )
| ( ( sk6 @ ( sk5 @ sk6 ) )
!= ( sk6 @ ( sk5 @ sk6 ) ) ) ),
inference(paramod_ordered,[status(thm)],[1911,1199]) ).
thf(2667,plain,
( ( sk6 @ sk3 )
| ( ( sk6 @ ( sk5 @ sk6 ) )
!= ( sk6 @ ( sk5 @ sk6 ) ) ) ),
inference(simp,[status(thm)],[2666]) ).
thf(2668,plain,
sk6 @ sk3,
inference(pattern_uni,[status(thm)],[2667:[]]) ).
thf(2750,plain,
! [A: a > a] :
( ~ $true
| ( sk6
@ ^ [B: a] : ( sk1 @ ( A @ B ) ) )
| ( ( sk6 @ sk3 )
!= ( sk6 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[2668,23]) ).
thf(2751,plain,
! [A: a > a] :
( ( sk6
@ ^ [B: a] : ( sk1 @ ( A @ B ) ) )
| ( ( sk6 @ sk3 )
!= ( sk6 @ A ) ) ),
inference(simp,[status(thm)],[2750]) ).
thf(2752,plain,
( sk6
@ ^ [A: a] : ( sk1 @ ( sk3 @ A ) ) ),
inference(pattern_uni,[status(thm)],[2751:[bind(A,$thf( sk3 ))]]) ).
thf(3359,plain,
( ~ $true
| ~ ( sk6
@ ^ [A: a] :
( sk1
@ ( sk4
@ ^ [B: a > a] :
( sk6
@ ^ [C: a] : ( B @ ( sk3 @ C ) ) )
@ ( sk3 @ A ) ) ) ) ),
inference(rewrite,[status(thm)],[74,2752]) ).
thf(3360,plain,
~ ( sk6
@ ^ [A: a] :
( sk1
@ ( sk4
@ ^ [B: a > a] :
( sk6
@ ^ [C: a] : ( B @ ( sk3 @ C ) ) )
@ ( sk3 @ A ) ) ) ),
inference(simp,[status(thm)],[3359]) ).
thf(5504,plain,
! [A: a > a] :
( ~ ( sk6 @ A )
| ~ $true
| ( ( sk6
@ ^ [B: a] : ( sk1 @ ( A @ B ) ) )
!= ( sk6
@ ^ [B: a] :
( sk1
@ ( sk4
@ ^ [C: a > a] :
( sk6
@ ^ [D: a] : ( C @ ( sk3 @ D ) ) )
@ ( sk3 @ B ) ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[23,3360]) ).
thf(5505,plain,
! [A: a > a] :
( ~ ( sk6 @ A )
| ( ( sk6
@ ^ [B: a] : ( sk1 @ ( A @ B ) ) )
!= ( sk6
@ ^ [B: a] :
( sk1
@ ( sk4
@ ^ [C: a > a] :
( sk6
@ ^ [D: a] : ( C @ ( sk3 @ D ) ) )
@ ( sk3 @ B ) ) ) ) ) ),
inference(simp,[status(thm)],[5504]) ).
thf(5506,plain,
~ ( sk6
@ ^ [A: a] :
( sk4
@ ^ [B: a > a] :
( sk6
@ ^ [C: a] : ( B @ ( sk3 @ C ) ) )
@ ( sk3 @ A ) ) ),
inference(pattern_uni,[status(thm)],[5505:[bind(A,$thf( ^ [B: a] : ( sk4 @ ^ [C: a > a] : ( sk6 @ ^ [D: a] : ( C @ ( sk3 @ D ) ) ) @ ( sk3 @ B ) ) ))]]) ).
thf(5559,plain,
! [A: ( a > a ) > $o] :
( ~ ( A @ sk1 )
| ( A @ sk2 )
| ~ $true
| ( ( A @ ( sk4 @ A ) )
!= ( sk6
@ ^ [B: a] :
( sk4
@ ^ [C: a > a] :
( sk6
@ ^ [D: a] : ( C @ ( sk3 @ D ) ) )
@ ( sk3 @ B ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[9,5506]) ).
thf(5560,plain,
! [A: ( a > a ) > $o] :
( ~ ( A @ sk1 )
| ( A @ sk2 )
| ( ( A @ ( sk4 @ A ) )
!= ( sk6
@ ^ [B: a] :
( sk4
@ ^ [C: a > a] :
( sk6
@ ^ [D: a] : ( C @ ( sk3 @ D ) ) )
@ ( sk3 @ B ) ) ) ) ),
inference(simp,[status(thm)],[5559]) ).
thf(5605,plain,
( ~ ( sk6
@ ^ [A: a] : ( sk1 @ ( sk3 @ A ) ) )
| ( sk6
@ ^ [A: a] : ( sk2 @ ( sk3 @ A ) ) ) ),
inference(pre_uni,[status(thm)],[5560:[bind(A,$thf( ^ [B: a > a] : ( sk6 @ ^ [C: a] : ( B @ ( sk3 @ C ) ) ) ))]]) ).
thf(13495,plain,
( ~ $true
| $false ),
inference(rewrite,[status(thm)],[5605,2752,8]) ).
thf(13496,plain,
$false,
inference(simp,[status(thm)],[13495]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU960^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08 % 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.12/0.23 % Computer : n004.cluster.edu
% 0.12/0.23 % Model : x86_64 x86_64
% 0.12/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.23 % Memory : 8046.5625MB
% 0.12/0.23 % OS : Linux 6.8.0-71-generic
% 0.12/0.23 % CPULimit : 300
% 0.12/0.23 % WCLimit : 300
% 0.12/0.23 % DateTime : Tue Sep 29 14:50:51 UTC 2026
% 0.12/0.23 % CPUTime :
% 0.12/0.23 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.66/0.54 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.99/0.64 % [INFO] Parsing done (102ms).
% 0.99/0.65 % [INFO] Running in sequential loop mode.
% 1.29/0.86 % [INFO] eprover registered as external prover.
% 1.29/0.86 % [INFO] Scanning for conjecture ...
% 1.55/0.91 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.55/0.93 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.55/0.93 % [INFO] Problem is higher-order (TPTP THF).
% 1.55/0.93 % [INFO] Type checking passed.
% 1.55/0.94 % [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 ...
% 82.87/18.35 % [INFO] Killing All external provers ...
% 82.87/18.36 % Time passed: 18041ms (effective reasoning time: 17701ms)
% 82.87/18.36 % 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)>
% 82.87/18.36 % Axioms used in derivation (0):
% 82.87/18.36 % No. of inferences in proof: 42
% 82.87/18.36 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 18041 ms resp. 17701 ms w/o parsing
% 67.77/18.44 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 67.77/18.44 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------