%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SEU782^2 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% Computer : n007.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:18 AM UTC 2026
% Result : Theorem 28.34s 8.80s
% Output : Refutation 28.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 10
% Syntax : Number of formulae : 51 ( 17 unt; 0 typ; 9 def)
% Number of atoms : 208 ( 25 equ; 0 cnn)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 769 ( 71 ~; 70 |; 9 &; 566 @)
% ( 0 <=>; 53 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 7 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 16 ( 13 usr; 8 con; 0-3 aty)
% Number of variables : 127 ( 6 ^; 117 !; 0 ?; 127 :)
% ( 0 !>; 0 ?*; 0 @-; 4 @+)
% Comments :
%------------------------------------------------------------------------------
thf(in_decl,type,
in: $i > $i > $o ).
thf(subset_decl,type,
subset: $i > $i > $o ).
thf(subsetI1_decl,type,
subsetI1: $o ).
thf(subsetE_decl,type,
subsetE: $o ).
thf(binunion_decl,type,
binunion: $i > $i > $i ).
thf(binunionEcases_decl,type,
binunionEcases: $o ).
thf(cartprod_decl,type,
cartprod: $i > $i > $i ).
thf(breln_decl,type,
breln: $i > $i > $i > $o ).
thf(breln1_decl,type,
breln1: $i > $i > $o ).
thf(sk1_decl,type,
sk1: $i > $i > $i ).
thf(sk2_decl,type,
sk2: $i ).
thf(sk3_decl,type,
sk3: $i ).
thf(sk4_decl,type,
sk4: $i ).
thf(subsetI1_def,definition,
( subsetI1
= ( ! [A: $i,B: $i] :
( ! [C: $i] :
( ( in @ C @ A )
=> ( in @ C @ B ) )
=> ( subset @ A @ B ) ) ) ) ).
thf(subsetE_def,definition,
( subsetE
= ( ! [A: $i,B: $i,C: $i] :
( ( subset @ A @ B )
=> ( ( in @ C @ A )
=> ( in @ C @ B ) ) ) ) ) ).
thf(binunionEcases_def,definition,
( binunionEcases
= ( ! [A: $i,B: $i,C: $i,D: $o] :
( ( in @ C @ ( binunion @ A @ B ) )
=> ( ( ( in @ C @ A )
=> D )
=> ( ( ( in @ C @ B )
=> D )
=> D ) ) ) ) ) ).
thf(breln_def,definition,
( breln
= ( ^ [A: $i,B: $i,C: $i] : ( subset @ C @ ( cartprod @ A @ B ) ) ) ) ).
thf(breln1_def,definition,
( breln1
= ( ^ [A: $i] : ( breln @ A @ A ) ) ) ).
thf(sk1_def,definition,
( sk1
= ( ^ [A: $i,B: $i] :
@+[C: $i] :
~ ( ( in @ C @ B )
=> ( in @ C @ A ) ) ) ) ).
thf(sk2_def,definition,
( sk2
= ( @+[A: $i] :
~ ! [B: $i] :
( ( subset @ B @ ( cartprod @ A @ A ) )
=> ! [C: $i] :
( ( subset @ C @ ( cartprod @ A @ A ) )
=> ( subset @ ( binunion @ B @ C ) @ ( cartprod @ A @ A ) ) ) ) ) ) ).
thf(sk3_def,definition,
( sk3
= ( @+[A: $i] :
~ ( ( subset @ A @ ( cartprod @ sk2 @ sk2 ) )
=> ! [B: $i] :
( ( subset @ B @ ( cartprod @ sk2 @ sk2 ) )
=> ( subset @ ( binunion @ A @ B ) @ ( cartprod @ sk2 @ sk2 ) ) ) ) ) ) ).
thf(sk4_def,definition,
( sk4
= ( @+[A: $i] :
~ ( ( subset @ A @ ( cartprod @ sk2 @ sk2 ) )
=> ( subset @ ( binunion @ sk3 @ A ) @ ( cartprod @ sk2 @ sk2 ) ) ) ) ) ).
thf(1,conjecture,
( subsetI1
=> ( subsetE
=> ( binunionEcases
=> ! [A: $i,B: $i] :
( ( breln1 @ A @ B )
=> ! [C: $i] :
( ( breln1 @ A @ C )
=> ( breln1 @ A @ ( binunion @ B @ C ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',breln1unionprop) ).
thf(2,negated_conjecture,
~ ( subsetI1
=> ( subsetE
=> ( binunionEcases
=> ! [A: $i,B: $i] :
( ( breln1 @ A @ B )
=> ! [C: $i] :
( ( breln1 @ A @ C )
=> ( breln1 @ A @ ( binunion @ B @ C ) ) ) ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ( ! [A: $i,B: $i] :
( ! [C: $i] :
( ( in @ C @ A )
=> ( in @ C @ B ) )
=> ( subset @ A @ B ) )
=> ( ! [A: $i,B: $i,C: $i] :
( ( subset @ A @ B )
=> ( ( in @ C @ A )
=> ( in @ C @ B ) ) )
=> ( ! [A: $i,B: $i,C: $i,D: $o] :
( ( in @ C @ ( binunion @ A @ B ) )
=> ( ( ( in @ C @ A )
=> D )
=> ( ( ( in @ C @ B )
=> D )
=> D ) ) )
=> ! [A: $i,B: $i] :
( ( subset @ B @ ( cartprod @ A @ A ) )
=> ! [C: $i] :
( ( subset @ C @ ( cartprod @ A @ A ) )
=> ( subset @ ( binunion @ B @ C ) @ ( cartprod @ A @ A ) ) ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
~ ( ! [A: $i,B: $i] :
( ! [C: $i] :
( ( in @ C @ A )
=> ( in @ C @ B ) )
=> ( subset @ A @ B ) )
=> ( ! [A: $i,B: $i] :
( ( subset @ A @ B )
=> ! [C: $i] :
( ( in @ C @ A )
=> ( in @ C @ B ) ) )
=> ( ! [A: $i,B: $i,C: $i] :
( ( in @ C @ ( binunion @ A @ B ) )
=> ! [D: $o] :
( ( ( in @ C @ A )
=> D )
=> ( ( ( in @ C @ B )
=> D )
=> D ) ) )
=> ! [A: $i,B: $i] :
( ( subset @ B @ ( cartprod @ A @ A ) )
=> ! [C: $i] :
( ( subset @ C @ ( cartprod @ A @ A ) )
=> ( subset @ ( binunion @ B @ C ) @ ( cartprod @ A @ A ) ) ) ) ) ) ),
inference(miniscope,[status(thm)],[3]) ).
thf(5,plain,
! [I: $o,H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( in @ ( sk1 @ B @ A ) @ A )
| ( subset @ A @ B ) )
& ( ~ ( in @ ( sk1 @ B @ A ) @ B )
| ( subset @ A @ B ) )
& ( ~ ( subset @ C @ D )
| ~ ( in @ E @ C )
| ( in @ E @ D ) )
& ( ~ ( in @ H @ ( binunion @ F @ G ) )
| ( in @ H @ F )
| ( in @ H @ G )
| I )
& ( ~ ( in @ H @ ( binunion @ F @ G ) )
| ( in @ H @ F )
| ~ I
| I )
& ( ~ ( in @ H @ ( binunion @ F @ G ) )
| ~ I
| ( in @ H @ G )
| I )
& ( ~ ( in @ H @ ( binunion @ F @ G ) )
| ~ I
| ~ I
| I )
& ( subset @ sk3 @ ( cartprod @ sk2 @ sk2 ) )
& ( subset @ sk4 @ ( cartprod @ sk2 @ sk2 ) )
& ~ ( subset @ ( binunion @ sk3 @ sk4 ) @ ( cartprod @ sk2 @ sk2 ) ) ),
inference(cnf,[status(esa)],[4]) ).
thf(8,plain,
! [B: $i,A: $i] :
( ( in @ ( sk1 @ B @ A ) @ A )
| ( subset @ A @ B ) ),
inference(cnfConj,[status(thm)],[5]) ).
thf(12,plain,
~ ( subset @ ( binunion @ sk3 @ sk4 ) @ ( cartprod @ sk2 @ sk2 ) ),
inference(cnfConj,[status(thm)],[5]) ).
thf(47,plain,
! [B: $i,A: $i] :
( ( in @ ( sk1 @ B @ A ) @ A )
| ~ $true
| ( ( subset @ A @ B )
!= ( subset @ ( binunion @ sk3 @ sk4 ) @ ( cartprod @ sk2 @ sk2 ) ) ) ),
inference(paramod_ordered,[status(thm)],[8,12]) ).
thf(48,plain,
! [B: $i,A: $i] :
( ( in @ ( sk1 @ B @ A ) @ A )
| ( ( subset @ A @ B )
!= ( subset @ ( binunion @ sk3 @ sk4 ) @ ( cartprod @ sk2 @ sk2 ) ) ) ),
inference(simp,[status(thm)],[47]) ).
thf(49,plain,
in @ ( sk1 @ ( cartprod @ sk2 @ sk2 ) @ ( binunion @ sk3 @ sk4 ) ) @ ( binunion @ sk3 @ sk4 ),
inference(pattern_uni,[status(thm)],[48:[bind(A,$thf( binunion @ sk3 @ sk4 )),bind(B,$thf( cartprod @ sk2 @ sk2 ))]]) ).
thf(13,plain,
! [D: $o,C: $i,B: $i,A: $i] :
( ~ ( in @ C @ ( binunion @ A @ B ) )
| ( in @ C @ A )
| ( in @ C @ B )
| D ),
inference(cnfConj,[status(thm)],[5]) ).
thf(18,plain,
! [D: $o,C: $i,B: $i,A: $i] :
( ~ ( in @ C @ ( binunion @ A @ B ) )
| ( in @ C @ A )
| ( in @ C @ B )
| D ),
inference(simp,[status(thm)],[13]) ).
thf(9,plain,
subset @ sk3 @ ( cartprod @ sk2 @ sk2 ),
inference(cnfConj,[status(thm)],[5]) ).
thf(15,plain,
! [C: $i,B: $i,A: $i] :
( ~ ( subset @ A @ B )
| ~ ( in @ C @ A )
| ( in @ C @ B ) ),
inference(cnfConj,[status(thm)],[5]) ).
thf(20,plain,
! [C: $i,B: $i,A: $i] :
( ~ ( subset @ A @ B )
| ~ ( in @ C @ A )
| ( in @ C @ B ) ),
inference(simp,[status(thm)],[15]) ).
thf(32,plain,
! [C: $i,B: $i,A: $i] :
( ~ $true
| ~ ( in @ C @ A )
| ( in @ C @ B )
| ( ( subset @ sk3 @ ( cartprod @ sk2 @ sk2 ) )
!= ( subset @ A @ B ) ) ),
inference(paramod_ordered,[status(thm)],[9,20]) ).
thf(33,plain,
! [C: $i,B: $i,A: $i] :
( ~ ( in @ C @ A )
| ( in @ C @ B )
| ( ( subset @ sk3 @ ( cartprod @ sk2 @ sk2 ) )
!= ( subset @ A @ B ) ) ),
inference(simp,[status(thm)],[32]) ).
thf(34,plain,
! [A: $i] :
( ~ ( in @ A @ sk3 )
| ( in @ A @ ( cartprod @ sk2 @ sk2 ) ) ),
inference(pattern_uni,[status(thm)],[33:[bind(A,$thf( sk3 )),bind(B,$thf( cartprod @ sk2 @ sk2 )),bind(C,$thf( C ))]]) ).
thf(38,plain,
! [A: $i] :
( ~ ( in @ A @ sk3 )
| ( in @ A @ ( cartprod @ sk2 @ sk2 ) ) ),
inference(simp,[status(thm)],[34]) ).
thf(10,plain,
! [B: $i,A: $i] :
( ~ ( in @ ( sk1 @ B @ A ) @ B )
| ( subset @ A @ B ) ),
inference(cnfConj,[status(thm)],[5]) ).
thf(98,plain,
! [B: $i,A: $i] :
( ~ ( in @ ( sk1 @ B @ A ) @ B )
| ~ $true
| ( ( subset @ A @ B )
!= ( subset @ ( binunion @ sk3 @ sk4 ) @ ( cartprod @ sk2 @ sk2 ) ) ) ),
inference(paramod_ordered,[status(thm)],[10,12]) ).
thf(99,plain,
! [B: $i,A: $i] :
( ~ ( in @ ( sk1 @ B @ A ) @ B )
| ( ( subset @ A @ B )
!= ( subset @ ( binunion @ sk3 @ sk4 ) @ ( cartprod @ sk2 @ sk2 ) ) ) ),
inference(simp,[status(thm)],[98]) ).
thf(100,plain,
~ ( in @ ( sk1 @ ( cartprod @ sk2 @ sk2 ) @ ( binunion @ sk3 @ sk4 ) ) @ ( cartprod @ sk2 @ sk2 ) ),
inference(pattern_uni,[status(thm)],[99:[bind(A,$thf( binunion @ sk3 @ sk4 )),bind(B,$thf( cartprod @ sk2 @ sk2 ))]]) ).
thf(146,plain,
! [A: $i] :
( ~ ( in @ A @ sk3 )
| ~ $true
| ( ( in @ A @ ( cartprod @ sk2 @ sk2 ) )
!= ( in @ ( sk1 @ ( cartprod @ sk2 @ sk2 ) @ ( binunion @ sk3 @ sk4 ) ) @ ( cartprod @ sk2 @ sk2 ) ) ) ),
inference(paramod_ordered,[status(thm)],[38,100]) ).
thf(147,plain,
! [A: $i] :
( ~ ( in @ A @ sk3 )
| ( ( in @ A @ ( cartprod @ sk2 @ sk2 ) )
!= ( in @ ( sk1 @ ( cartprod @ sk2 @ sk2 ) @ ( binunion @ sk3 @ sk4 ) ) @ ( cartprod @ sk2 @ sk2 ) ) ) ),
inference(simp,[status(thm)],[146]) ).
thf(148,plain,
~ ( in @ ( sk1 @ ( cartprod @ sk2 @ sk2 ) @ ( binunion @ sk3 @ sk4 ) ) @ sk3 ),
inference(pattern_uni,[status(thm)],[147:[bind(A,$thf( sk1 @ ( cartprod @ sk2 @ sk2 ) @ ( binunion @ sk3 @ sk4 ) ))]]) ).
thf(274,plain,
! [D: $o,C: $i,B: $i,A: $i] :
( ~ ( in @ C @ ( binunion @ A @ B ) )
| ( in @ C @ A )
| ( in @ C @ B )
| ~ $true
| ( D
!= ( in @ ( sk1 @ ( cartprod @ sk2 @ sk2 ) @ ( binunion @ sk3 @ sk4 ) ) @ sk3 ) ) ),
inference(paramod_ordered,[status(thm)],[18,148]) ).
thf(275,plain,
! [D: $o,C: $i,B: $i,A: $i] :
( ~ ( in @ C @ ( binunion @ A @ B ) )
| ( in @ C @ A )
| ( in @ C @ B )
| ( D
!= ( in @ ( sk1 @ ( cartprod @ sk2 @ sk2 ) @ ( binunion @ sk3 @ sk4 ) ) @ sk3 ) ) ),
inference(simp,[status(thm)],[274]) ).
thf(276,plain,
! [C: $i,B: $i,A: $i] :
( ~ ( in @ C @ ( binunion @ A @ B ) )
| ( in @ C @ A )
| ( in @ C @ B ) ),
inference(pattern_uni,[status(thm)],[275:[bind(A,$thf( A )),bind(B,$thf( B )),bind(C,$thf( C )),bind(D,$thf( in @ ( sk1 @ ( cartprod @ sk2 @ sk2 ) @ ( binunion @ sk3 @ sk4 ) ) @ sk3 ))]]) ).
thf(8289,plain,
! [C: $i,B: $i,A: $i] :
( ~ $true
| ( in @ C @ A )
| ( in @ C @ B )
| ( ( in @ ( sk1 @ ( cartprod @ sk2 @ sk2 ) @ ( binunion @ sk3 @ sk4 ) ) @ ( binunion @ sk3 @ sk4 ) )
!= ( in @ C @ ( binunion @ A @ B ) ) ) ),
inference(paramod_ordered,[status(thm)],[49,276]) ).
thf(8290,plain,
! [C: $i,B: $i,A: $i] :
( ( in @ C @ A )
| ( in @ C @ B )
| ( ( in @ ( sk1 @ ( cartprod @ sk2 @ sk2 ) @ ( binunion @ sk3 @ sk4 ) ) @ ( binunion @ sk3 @ sk4 ) )
!= ( in @ C @ ( binunion @ A @ B ) ) ) ),
inference(simp,[status(thm)],[8289]) ).
thf(8291,plain,
( ( in @ ( sk1 @ ( cartprod @ sk2 @ sk2 ) @ ( binunion @ sk3 @ sk4 ) ) @ sk3 )
| ( in @ ( sk1 @ ( cartprod @ sk2 @ sk2 ) @ ( binunion @ sk3 @ sk4 ) ) @ sk4 ) ),
inference(pattern_uni,[status(thm)],[8290:[bind(A,$thf( sk3 )),bind(B,$thf( sk4 )),bind(C,$thf( sk1 @ ( cartprod @ sk2 @ sk2 ) @ ( binunion @ sk3 @ sk4 ) ))]]) ).
thf(11,plain,
subset @ sk4 @ ( cartprod @ sk2 @ sk2 ),
inference(cnfConj,[status(thm)],[5]) ).
thf(35,plain,
! [C: $i,B: $i,A: $i] :
( ~ $true
| ~ ( in @ C @ A )
| ( in @ C @ B )
| ( ( subset @ sk4 @ ( cartprod @ sk2 @ sk2 ) )
!= ( subset @ A @ B ) ) ),
inference(paramod_ordered,[status(thm)],[11,20]) ).
thf(36,plain,
! [C: $i,B: $i,A: $i] :
( ~ ( in @ C @ A )
| ( in @ C @ B )
| ( ( subset @ sk4 @ ( cartprod @ sk2 @ sk2 ) )
!= ( subset @ A @ B ) ) ),
inference(simp,[status(thm)],[35]) ).
thf(37,plain,
! [A: $i] :
( ~ ( in @ A @ sk4 )
| ( in @ A @ ( cartprod @ sk2 @ sk2 ) ) ),
inference(pattern_uni,[status(thm)],[36:[bind(A,$thf( sk4 )),bind(B,$thf( cartprod @ sk2 @ sk2 )),bind(C,$thf( C ))]]) ).
thf(39,plain,
! [A: $i] :
( ~ ( in @ A @ sk4 )
| ( in @ A @ ( cartprod @ sk2 @ sk2 ) ) ),
inference(simp,[status(thm)],[37]) ).
thf(141,plain,
! [A: $i] :
( ~ ( in @ A @ sk4 )
| ~ $true
| ( ( in @ A @ ( cartprod @ sk2 @ sk2 ) )
!= ( in @ ( sk1 @ ( cartprod @ sk2 @ sk2 ) @ ( binunion @ sk3 @ sk4 ) ) @ ( cartprod @ sk2 @ sk2 ) ) ) ),
inference(paramod_ordered,[status(thm)],[39,100]) ).
thf(142,plain,
! [A: $i] :
( ~ ( in @ A @ sk4 )
| ( ( in @ A @ ( cartprod @ sk2 @ sk2 ) )
!= ( in @ ( sk1 @ ( cartprod @ sk2 @ sk2 ) @ ( binunion @ sk3 @ sk4 ) ) @ ( cartprod @ sk2 @ sk2 ) ) ) ),
inference(simp,[status(thm)],[141]) ).
thf(143,plain,
~ ( in @ ( sk1 @ ( cartprod @ sk2 @ sk2 ) @ ( binunion @ sk3 @ sk4 ) ) @ sk4 ),
inference(pattern_uni,[status(thm)],[142:[bind(A,$thf( sk1 @ ( cartprod @ sk2 @ sk2 ) @ ( binunion @ sk3 @ sk4 ) ))]]) ).
thf(14794,plain,
( $false
| $false ),
inference(rewrite,[status(thm)],[8291,148,143]) ).
thf(14795,plain,
$false,
inference(simp,[status(thm)],[14794]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU782^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.08 % Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% 0.11/0.22 % Computer : n007.cluster.edu
% 0.11/0.22 % Model : x86_64 x86_64
% 0.11/0.22 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.22 % Memory : 8046.5625MB
% 0.11/0.22 % OS : Linux 6.8.0-71-generic
% 0.11/0.22 % CPULimit : 300
% 0.11/0.22 % WCLimit : 300
% 0.11/0.22 % DateTime : Tue Sep 29 14:26:25 UTC 2026
% 0.11/0.23 % CPUTime :
% 0.11/0.23 Running java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% 0.64/0.54 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.00/0.65 % [INFO] Parsing done (101ms).
% 1.00/0.65 % [INFO] Running in sequential loop mode.
% 1.48/0.95 % [INFO] eprover registered as external prover.
% 1.48/0.96 % [INFO] Scanning for conjecture ...
% 1.86/1.11 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 2.05/1.16 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.05/1.16 % [INFO] Problem is higher-order (TPTP THF).
% 2.05/1.17 % [INFO] Type checking passed.
% 2.05/1.18 % [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 ...
% 36.47/8.79 % [INFO] Killing All external provers ...
% 36.47/8.80 % Time passed: 8465ms (effective reasoning time: 8137ms)
% 36.47/8.80 % 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)>
% 28.34/8.80 % Axioms used in derivation (0):
% 28.34/8.80 % No. of inferences in proof: 42
% 28.34/8.80 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 8465 ms resp. 8137 ms w/o parsing
% 28.34/8.86 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 28.34/8.86 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------