%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SEU968^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 : n013.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 52.37s 12.94s
% Output : Refutation 52.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 7
% Syntax : Number of formulae : 45 ( 15 unt; 0 typ; 6 def)
% Number of atoms : 98 ( 20 equ; 0 cnn)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 576 ( 67 ~; 63 |; 31 &; 367 @)
% ( 0 <=>; 48 =>; 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 : 201 ( 121 ^; 74 !; 0 ?; 201 :)
% ( 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
@ ^ [E: a] : E )
& ! [E: a > a] :
( ( D @ E )
=> ( D
@ ^ [F: a] : ( A @ ( E @ F ) ) ) ) )
=> ( D @ B ) )
& ! [D: ( a > a ) > $o] :
( ( ( D
@ ^ [E: a] : E )
& ! [E: a > a] :
( ( D @ E )
=> ( D
@ ^ [F: a] : ( A @ ( E @ F ) ) ) ) )
=> ( D @ C ) ) )
=> ! [D: ( a > a ) > $o] :
( ( ( D
@ ^ [E: a] : E )
& ! [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
@ ^ [D: a] : D )
& ! [D: a > a] :
( ( C @ D )
=> ( C
@ ^ [E: a] : ( sk1 @ ( D @ E ) ) ) ) )
=> ( C @ A ) )
& ! [C: ( a > a ) > $o] :
( ( ( C
@ ^ [D: a] : D )
& ! [D: a > a] :
( ( C @ D )
=> ( C
@ ^ [E: a] : ( sk1 @ ( D @ E ) ) ) ) )
=> ( C @ B ) ) )
=> ! [C: ( a > a ) > $o] :
( ( ( C
@ ^ [D: a] : D )
& ! [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
@ ^ [C: a] : C )
& ! [C: a > a] :
( ( B @ C )
=> ( B
@ ^ [D: a] : ( sk1 @ ( C @ D ) ) ) ) )
=> ( B @ sk2 ) )
& ! [B: ( a > a ) > $o] :
( ( ( B
@ ^ [C: a] : C )
& ! [C: a > a] :
( ( B @ C )
=> ( B
@ ^ [D: a] : ( sk1 @ ( C @ D ) ) ) ) )
=> ( B @ A ) ) )
=> ! [B: ( a > a ) > $o] :
( ( ( B
@ ^ [C: a] : C )
& ! [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
@ ^ [B: a] : B )
& ! [B: a > a] :
( ( A @ B )
=> ( A
@ ^ [C: a] : ( sk1 @ ( B @ C ) ) ) ) )
=> ( A
@ ^ [B: a] : ( sk2 @ ( sk3 @ B ) ) ) ) ) ) ).
thf(1,conjecture,
( ! [A: a > a] : ( A = A )
=> ! [A: a > a,B: a > a,C: a > a] :
( ( ! [D: ( a > a ) > $o] :
( ( ( D
@ ^ [E: a] : E )
& ! [E: a > a] :
( ( D @ E )
=> ( D
@ ^ [F: a] : ( A @ ( E @ F ) ) ) ) )
=> ( D @ B ) )
& ! [D: ( a > a ) > $o] :
( ( ( D
@ ^ [E: a] : E )
& ! [E: a > a] :
( ( D @ E )
=> ( D
@ ^ [F: a] : ( A @ ( E @ F ) ) ) ) )
=> ( D @ C ) ) )
=> ! [D: ( a > a ) > $o] :
( ( ( D
@ ^ [E: a] : E )
& ! [E: a > a] :
( ( D @ E )
=> ( D
@ ^ [F: a] : ( A @ ( E @ F ) ) ) ) )
=> ( D
@ ^ [E: a] : ( B @ ( C @ E ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM135C_pme) ).
thf(2,negated_conjecture,
~ ( ! [A: a > a] : ( A = A )
=> ! [A: a > a,B: a > a,C: a > a] :
( ( ! [D: ( a > a ) > $o] :
( ( ( D
@ ^ [E: a] : E )
& ! [E: a > a] :
( ( D @ E )
=> ( D
@ ^ [F: a] : ( A @ ( E @ F ) ) ) ) )
=> ( D @ B ) )
& ! [D: ( a > a ) > $o] :
( ( ( D
@ ^ [E: a] : E )
& ! [E: a > a] :
( ( D @ E )
=> ( D
@ ^ [F: a] : ( A @ ( E @ F ) ) ) ) )
=> ( D @ C ) ) )
=> ! [D: ( a > a ) > $o] :
( ( ( D
@ ^ [E: a] : E )
& ! [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
@ ^ [E: a] : E )
& ! [E: a > a] :
( ( D @ E )
=> ( D
@ ^ [F: a] : ( A @ ( E @ F ) ) ) ) )
=> ( D @ B ) )
& ! [D: ( a > a ) > $o] :
( ( ( D
@ ^ [E: a] : E )
& ! [E: a > a] :
( ( D @ E )
=> ( D
@ ^ [F: a] : ( A @ ( E @ F ) ) ) ) )
=> ( D @ C ) ) )
=> ! [D: ( a > a ) > $o] :
( ( ( D
@ ^ [E: a] : E )
& ! [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
@ ^ [D: a] : D )
| ( A @ ( sk4 @ A ) )
| ( A @ sk2 ) )
& ( ~ ( A
@ ^ [D: a] : D )
| ~ ( A
@ ^ [D: a] : ( sk1 @ ( sk4 @ A @ D ) ) )
| ( A @ sk2 ) )
& ( ~ ( B
@ ^ [D: a] : D )
| ( B @ ( sk5 @ B ) )
| ( B @ sk3 ) )
& ( ~ ( B
@ ^ [D: a] : D )
| ~ ( B
@ ^ [D: a] : ( sk1 @ ( sk5 @ B @ D ) ) )
| ( B @ sk3 ) )
& ( sk6
@ ^ [D: a] : D )
& ( ~ ( 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
@ ^ [B: a] : B )
| ( A @ ( sk4 @ A ) )
| ( A @ sk2 ) ),
inference(cnfConj,[status(thm)],[4]) ).
thf(10,plain,
! [A: a > a] :
( ~ ( sk6 @ A )
| ( sk6
@ ^ [B: a] : ( sk1 @ ( A @ B ) ) ) ),
inference(cnfConj,[status(thm)],[4]) ).
thf(16,plain,
! [A: a > a] :
( ~ ( sk6 @ A )
| ( sk6
@ ^ [B: a] : ( sk1 @ ( A @ B ) ) ) ),
inference(simp,[status(thm)],[10]) ).
thf(8,plain,
! [A: ( a > a ) > $o] :
( ~ ( A
@ ^ [B: a] : B )
| ~ ( A
@ ^ [B: a] : ( sk1 @ ( sk4 @ A @ B ) ) )
| ( A @ sk2 ) ),
inference(cnfConj,[status(thm)],[4]) ).
thf(5,plain,
~ ( sk6
@ ^ [A: a] : ( sk2 @ ( sk3 @ A ) ) ),
inference(cnfConj,[status(thm)],[4]) ).
thf(31,plain,
! [A: ( a > a ) > $o] :
( ~ ( A
@ ^ [B: a] : B )
| ~ ( A
@ ^ [B: a] : ( sk1 @ ( sk4 @ A @ B ) ) )
| ~ $true
| ( ( A @ sk2 )
!= ( sk6
@ ^ [B: a] : ( sk2 @ ( sk3 @ B ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[8,5]) ).
thf(32,plain,
! [A: ( a > a ) > $o] :
( ~ ( A
@ ^ [B: a] : B )
| ~ ( A
@ ^ [B: a] : ( sk1 @ ( sk4 @ A @ B ) ) )
| ( ( A @ sk2 )
!= ( sk6
@ ^ [B: a] : ( sk2 @ ( sk3 @ B ) ) ) ) ),
inference(simp,[status(thm)],[31]) ).
thf(69,plain,
( ~ ( sk6 @ sk3 )
| ~ ( sk6
@ ^ [A: a] :
( sk1
@ ( sk4
@ ^ [B: a > a] :
( sk6
@ ^ [C: a] : ( B @ ( sk3 @ C ) ) )
@ ( sk3 @ A ) ) ) ) ),
inference(pre_uni,[status(thm)],[32:[bind(A,$thf( ^ [B: a > a] : ( sk6 @ ^ [C: a] : ( B @ ( sk3 @ C ) ) ) ))]]) ).
thf(7,plain,
( sk6
@ ^ [A: a] : A ),
inference(cnfConj,[status(thm)],[4]) ).
thf(6,plain,
! [A: ( a > a ) > $o] :
( ~ ( A
@ ^ [B: a] : B )
| ( A @ ( sk5 @ A ) )
| ( A @ sk3 ) ),
inference(cnfConj,[status(thm)],[4]) ).
thf(19,plain,
! [A: ( a > a ) > $o] :
( ~ ( A
@ ^ [B: a] : B )
| ( A @ ( sk5 @ A ) )
| ( A @ sk3 ) ),
inference(simp,[status(thm)],[6]) ).
thf(459,plain,
! [A: ( a > a ) > $o] :
( ~ $true
| ( A @ ( sk5 @ A ) )
| ( A @ sk3 )
| ( ( sk6
@ ^ [B: a] : B )
!= ( A
@ ^ [B: a] : B ) ) ),
inference(paramod_ordered,[status(thm)],[7,19]) ).
thf(460,plain,
! [A: ( a > a ) > $o] :
( ( A @ ( sk5 @ A ) )
| ( A @ sk3 )
| ( ( sk6
@ ^ [B: a] : B )
!= ( A
@ ^ [B: a] : B ) ) ),
inference(simp,[status(thm)],[459]) ).
thf(528,plain,
( ( sk6 @ ( sk5 @ sk6 ) )
| ( sk6 @ sk3 ) ),
inference(pre_uni,[status(thm)],[460:[bind(A,$thf( sk6 ))]]) ).
thf(684,plain,
! [A: a > a] :
( ( sk6 @ sk3 )
| ~ $true
| ( sk6
@ ^ [B: a] : ( sk1 @ ( A @ B ) ) )
| ( ( sk6 @ ( sk5 @ sk6 ) )
!= ( sk6 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[528,16]) ).
thf(685,plain,
! [A: a > a] :
( ( sk6 @ sk3 )
| ( sk6
@ ^ [B: a] : ( sk1 @ ( A @ B ) ) )
| ( ( sk6 @ ( sk5 @ sk6 ) )
!= ( sk6 @ A ) ) ),
inference(simp,[status(thm)],[684]) ).
thf(686,plain,
( ( sk6 @ sk3 )
| ( sk6
@ ^ [A: a] : ( sk1 @ ( sk5 @ sk6 @ A ) ) ) ),
inference(pattern_uni,[status(thm)],[685:[bind(A,$thf( sk5 @ sk6 ))]]) ).
thf(11,plain,
! [A: ( a > a ) > $o] :
( ~ ( A
@ ^ [B: a] : B )
| ~ ( A
@ ^ [B: a] : ( sk1 @ ( sk5 @ A @ B ) ) )
| ( A @ sk3 ) ),
inference(cnfConj,[status(thm)],[4]) ).
thf(24,plain,
! [A: ( a > a ) > $o] :
( ~ ( A
@ ^ [B: a] : B )
| ~ ( A
@ ^ [B: a] : ( sk1 @ ( sk5 @ A @ B ) ) )
| ( A @ sk3 ) ),
inference(simp,[status(thm)],[11]) ).
thf(2315,plain,
! [A: ( a > a ) > $o] :
( ( sk6 @ sk3 )
| ~ ( A
@ ^ [B: a] : B )
| ~ $true
| ( A @ sk3 )
| ( ( sk6
@ ^ [B: a] : ( sk1 @ ( sk5 @ sk6 @ B ) ) )
!= ( A
@ ^ [B: a] : ( sk1 @ ( sk5 @ A @ B ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[686,24]) ).
thf(2316,plain,
! [A: ( a > a ) > $o] :
( ( sk6 @ sk3 )
| ~ ( A
@ ^ [B: a] : B )
| ( A @ sk3 )
| ( ( sk6
@ ^ [B: a] : ( sk1 @ ( sk5 @ sk6 @ B ) ) )
!= ( A
@ ^ [B: a] : ( sk1 @ ( sk5 @ A @ B ) ) ) ) ),
inference(simp,[status(thm)],[2315]) ).
thf(2383,plain,
( ( sk6 @ sk3 )
| ~ ( sk6
@ ^ [A: a] : A )
| ( sk6 @ sk3 ) ),
inference(pre_uni,[status(thm)],[2316:[bind(A,$thf( sk6 ))]]) ).
thf(2420,plain,
( ( sk6 @ sk3 )
| ~ ( sk6
@ ^ [A: a] : A ) ),
inference(simp,[status(thm)],[2383]) ).
thf(2427,plain,
( ( sk6 @ sk3 )
| ~ $true ),
inference(rewrite,[status(thm)],[2420,7]) ).
thf(2428,plain,
sk6 @ sk3,
inference(simp,[status(thm)],[2427]) ).
thf(2431,plain,
( ~ $true
| ~ ( sk6
@ ^ [A: a] :
( sk1
@ ( sk4
@ ^ [B: a > a] :
( sk6
@ ^ [C: a] : ( B @ ( sk3 @ C ) ) )
@ ( sk3 @ A ) ) ) ) ),
inference(rewrite,[status(thm)],[69,2428]) ).
thf(2432,plain,
~ ( sk6
@ ^ [A: a] :
( sk1
@ ( sk4
@ ^ [B: a > a] :
( sk6
@ ^ [C: a] : ( B @ ( sk3 @ C ) ) )
@ ( sk3 @ A ) ) ) ),
inference(simp,[status(thm)],[2431]) ).
thf(4554,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)],[16,2432]) ).
thf(4555,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)],[4554]) ).
thf(4556,plain,
~ ( sk6
@ ^ [A: a] :
( sk4
@ ^ [B: a > a] :
( sk6
@ ^ [C: a] : ( B @ ( sk3 @ C ) ) )
@ ( sk3 @ A ) ) ),
inference(pattern_uni,[status(thm)],[4555:[bind(A,$thf( ^ [B: a] : ( sk4 @ ^ [C: a > a] : ( sk6 @ ^ [D: a] : ( C @ ( sk3 @ D ) ) ) @ ( sk3 @ B ) ) ))]]) ).
thf(4630,plain,
! [A: ( a > a ) > $o] :
( ~ ( A
@ ^ [B: a] : B )
| ( 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,4556]) ).
thf(4631,plain,
! [A: ( a > a ) > $o] :
( ~ ( A
@ ^ [B: a] : B )
| ( A @ sk2 )
| ( ( A @ ( sk4 @ A ) )
!= ( sk6
@ ^ [B: a] :
( sk4
@ ^ [C: a > a] :
( sk6
@ ^ [D: a] : ( C @ ( sk3 @ D ) ) )
@ ( sk3 @ B ) ) ) ) ),
inference(simp,[status(thm)],[4630]) ).
thf(4663,plain,
( ~ ( sk6 @ sk3 )
| ( sk6
@ ^ [A: a] : ( sk2 @ ( sk3 @ A ) ) ) ),
inference(pre_uni,[status(thm)],[4631:[bind(A,$thf( ^ [B: a > a] : ( sk6 @ ^ [C: a] : ( B @ ( sk3 @ C ) ) ) ))]]) ).
thf(4689,plain,
( ~ $true
| $false ),
inference(rewrite,[status(thm)],[4663,5,2428]) ).
thf(4690,plain,
$false,
inference(simp,[status(thm)],[4689]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU968^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.07/0.26 % Computer : n013.cluster.edu
% 0.07/0.26 % Model : x86_64 x86_64
% 0.07/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.26 % Memory : 8046.5625MB
% 0.07/0.26 % OS : Linux 6.8.0-71-generic
% 0.07/0.26 % CPULimit : 300
% 0.07/0.26 % WCLimit : 300
% 0.07/0.26 % DateTime : Tue Sep 29 14:52:51 UTC 2026
% 0.20/0.26 % CPUTime :
% 0.20/0.26 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.94/0.84 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.32/1.04 % [INFO] Parsing done (197ms).
% 1.32/1.05 % [INFO] Running in sequential loop mode.
% 1.85/1.44 % [INFO] eprover registered as external prover.
% 1.85/1.45 % [INFO] Scanning for conjecture ...
% 2.03/1.54 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 2.03/1.58 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.03/1.58 % [INFO] Problem is higher-order (TPTP THF).
% 2.03/1.59 % [INFO] Type checking passed.
% 2.03/1.59 % [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 ...
% 52.37/12.94 % [INFO] Killing All external provers ...
% 52.37/12.94 % Time passed: 12533ms (effective reasoning time: 11881ms)
% 52.37/12.94 % 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)>
% 52.37/12.94 % Axioms used in derivation (0):
% 52.37/12.94 % No. of inferences in proof: 39
% 52.37/12.94 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 12533 ms resp. 11881 ms w/o parsing
% 52.37/13.02 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 52.37/13.02 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------