%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : NUM547+1 : TPTP v9.3.1. Released v4.0.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 : 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 : Sun Sep 27 08:09:07 AM UTC 2026
% Result : Theorem 105.01s 34.38s
% Output : Refutation 105.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 9
% Syntax : Number of formulae : 41 ( 14 unt; 0 typ; 3 def)
% Number of atoms : 200 ( 60 equ; 0 cnn)
% Maximal formula atoms : 51 ( 4 avg)
% Number of connectives : 574 ( 87 ~; 73 |; 51 &; 339 @)
% ( 3 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 26 ( 7 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 18 ( 15 usr; 8 con; 0-3 aty)
% Number of variables : 68 ( 7 ^; 50 !; 8 ?; 68 :)
% ( 0 !>; 0 ?*; 0 @-; 3 @+)
% Comments :
%------------------------------------------------------------------------------
thf(slcrc0_decl,type,
slcrc0: $i ).
thf(aSet0_decl,type,
aSet0: $i > $o ).
thf(aElementOf0_decl,type,
aElementOf0: $i > $i > $o ).
thf(aSubsetOf0_decl,type,
aSubsetOf0: $i > $i > $o ).
thf(szNzAzT0_decl,type,
szNzAzT0: $i ).
thf(slbdtsldtrb0_decl,type,
slbdtsldtrb0: $i > $i > $i ).
thf(sbrdtbr0_decl,type,
sbrdtbr0: $i > $i ).
thf(xS_decl,type,
xS: $i ).
thf(xk_decl,type,
xk: $i ).
thf(sz00_decl,type,
sz00: $i ).
thf(xT_decl,type,
xT: $i ).
thf(sk6_decl,type,
sk6: $i > $i ).
thf(sk9_decl,type,
sk9: $i > $i > $i > $o ).
thf(sk10_decl,type,
sk10: $i > $i > $i > $i ).
thf(sk11_decl,type,
sk11: $i > $i > $i > $i ).
thf(sk6_def,definition,
( sk6
= ( ^ [A: $i] :
@+[B: $i] : ( A @ ( B @ aElementOf0 ) ) ) ) ).
thf(sk10_def,definition,
( sk10
= ( ^ [A: $i,B: $i,C: $i] :
@+[D: $i] :
~ ( ( A @ ( D @ aElementOf0 ) )
=> ( ( ( D @ sbrdtbr0 )
= B )
& ( C @ ( D @ aSubsetOf0 ) ) ) ) ) ) ).
thf(sk11_def,definition,
( sk11
= ( ^ [A: $i,B: $i,C: $i] :
@+[D: $i] :
~ ( ( ( ( D @ sbrdtbr0 )
= B )
& ( C @ ( D @ aSubsetOf0 ) ) )
=> ( A @ ( D @ aElementOf0 ) ) ) ) ) ).
thf(43,axiom,
! [A: $i,B: $i] :
( ( ( szNzAzT0 @ ( B @ aElementOf0 ) )
& ( A @ aSet0 ) )
=> ! [C: $i] :
( ( C
= ( B @ ( A @ slbdtsldtrb0 ) ) )
<=> ( ! [D: $i] :
( ( C @ ( D @ aElementOf0 ) )
<=> ( ( ( D @ sbrdtbr0 )
= B )
& ( A @ ( D @ aSubsetOf0 ) ) ) )
& ( C @ aSet0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefSel) ).
thf(220,plain,
! [A: $i,B: $i] :
( ( ( szNzAzT0 @ ( B @ aElementOf0 ) )
& ( A @ aSet0 ) )
=> ! [C: $i] :
( ( ( ! [D: $i] :
( ( ( ( ( D @ sbrdtbr0 )
= B )
& ( A @ ( D @ aSubsetOf0 ) ) )
=> ( C @ ( D @ aElementOf0 ) ) )
& ( ( C @ ( D @ aElementOf0 ) )
=> ( ( ( D @ sbrdtbr0 )
= B )
& ( A @ ( D @ aSubsetOf0 ) ) ) ) )
& ( C @ aSet0 ) )
=> ( C
= ( B @ ( A @ slbdtsldtrb0 ) ) ) )
& ( ( C
= ( B @ ( A @ slbdtsldtrb0 ) ) )
=> ( ! [D: $i] :
( ( ( ( ( D @ sbrdtbr0 )
= B )
& ( A @ ( D @ aSubsetOf0 ) ) )
=> ( C @ ( D @ aElementOf0 ) ) )
& ( ( C @ ( D @ aElementOf0 ) )
=> ( ( ( D @ sbrdtbr0 )
= B )
& ( A @ ( D @ aSubsetOf0 ) ) ) ) )
& ( C @ aSet0 ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[43]) ).
thf(221,plain,
! [A: $i,B: $i] :
( ( ( szNzAzT0 @ ( B @ aElementOf0 ) )
& ( A @ aSet0 ) )
=> ( ! [C: $i] :
( ( ! [D: $i] :
( ( ( ( D @ sbrdtbr0 )
= B )
& ( A @ ( D @ aSubsetOf0 ) ) )
=> ( C @ ( D @ aElementOf0 ) ) )
& ! [D: $i] :
( ( C @ ( D @ aElementOf0 ) )
=> ( ( ( D @ sbrdtbr0 )
= B )
& ( A @ ( D @ aSubsetOf0 ) ) ) )
& ( C @ aSet0 ) )
=> ( C
= ( B @ ( A @ slbdtsldtrb0 ) ) ) )
& ! [C: $i] :
( ( C
= ( B @ ( A @ slbdtsldtrb0 ) ) )
=> ( ! [D: $i] :
( ( ( ( D @ sbrdtbr0 )
= B )
& ( A @ ( D @ aSubsetOf0 ) ) )
=> ( C @ ( D @ aElementOf0 ) ) )
& ! [D: $i] :
( ( C @ ( D @ aElementOf0 ) )
=> ( ( ( D @ sbrdtbr0 )
= B )
& ( A @ ( D @ aSubsetOf0 ) ) ) )
& ( C @ aSet0 ) ) ) ) ),
inference(miniscope,[status(thm)],[220]) ).
thf(222,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( F
= ( B @ ( A @ slbdtsldtrb0 ) ) )
| ~ ( F @ ( A @ ( B @ ( F @ sk11 ) ) @ aElementOf0 ) )
| ( F @ ( B @ ( A @ sk9 ) ) )
| ~ ( F @ aSet0 )
| ~ ( szNzAzT0 @ ( B @ aElementOf0 ) )
| ~ ( A @ aSet0 ) )
& ( ( F
= ( B @ ( A @ slbdtsldtrb0 ) ) )
| ( ( A @ ( B @ ( F @ sk11 ) ) @ sbrdtbr0 )
= B )
| ( F @ ( B @ ( A @ sk9 ) ) )
| ~ ( F @ aSet0 )
| ~ ( szNzAzT0 @ ( B @ aElementOf0 ) )
| ~ ( A @ aSet0 ) )
& ( ( F
= ( B @ ( A @ slbdtsldtrb0 ) ) )
| ( A @ ( A @ ( B @ ( F @ sk11 ) ) @ aSubsetOf0 ) )
| ( F @ ( B @ ( A @ sk9 ) ) )
| ~ ( F @ aSet0 )
| ~ ( szNzAzT0 @ ( B @ aElementOf0 ) )
| ~ ( A @ aSet0 ) )
& ( ( F
= ( B @ ( A @ slbdtsldtrb0 ) ) )
| ~ ( F @ ( B @ ( A @ sk9 ) ) )
| ( ( A @ ( B @ ( F @ sk10 ) ) @ sbrdtbr0 )
!= B )
| ~ ( A @ ( A @ ( B @ ( F @ sk10 ) ) @ aSubsetOf0 ) )
| ~ ( F @ aSet0 )
| ~ ( szNzAzT0 @ ( B @ aElementOf0 ) )
| ~ ( A @ aSet0 ) )
& ( ( F
= ( B @ ( A @ slbdtsldtrb0 ) ) )
| ~ ( F @ ( B @ ( A @ sk9 ) ) )
| ( F @ ( A @ ( B @ ( F @ sk10 ) ) @ aElementOf0 ) )
| ~ ( F @ aSet0 )
| ~ ( szNzAzT0 @ ( B @ aElementOf0 ) )
| ~ ( A @ aSet0 ) )
& ( ( C @ ( E @ aElementOf0 ) )
| ( ( E @ sbrdtbr0 )
!= B )
| ~ ( A @ ( E @ aSubsetOf0 ) )
| ( C
!= ( B @ ( A @ slbdtsldtrb0 ) ) )
| ~ ( szNzAzT0 @ ( B @ aElementOf0 ) )
| ~ ( A @ aSet0 ) )
& ( ( ( D @ sbrdtbr0 )
= B )
| ~ ( C @ ( D @ aElementOf0 ) )
| ( C
!= ( B @ ( A @ slbdtsldtrb0 ) ) )
| ~ ( szNzAzT0 @ ( B @ aElementOf0 ) )
| ~ ( A @ aSet0 ) )
& ( ( A @ ( D @ aSubsetOf0 ) )
| ~ ( C @ ( D @ aElementOf0 ) )
| ( C
!= ( B @ ( A @ slbdtsldtrb0 ) ) )
| ~ ( szNzAzT0 @ ( B @ aElementOf0 ) )
| ~ ( A @ aSet0 ) )
& ( ( C @ aSet0 )
| ( C
!= ( B @ ( A @ slbdtsldtrb0 ) ) )
| ~ ( szNzAzT0 @ ( B @ aElementOf0 ) )
| ~ ( A @ aSet0 ) ) ),
inference(cnf,[status(esa)],[221]) ).
thf(223,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ aSet0 )
| ( C
!= ( B @ ( A @ slbdtsldtrb0 ) ) )
| ~ ( szNzAzT0 @ ( B @ aElementOf0 ) )
| ~ ( A @ aSet0 ) ),
inference(cnfConj,[status(thm)],[222]) ).
thf(246,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ aSet0 )
| ~ ( szNzAzT0 @ ( B @ aElementOf0 ) )
| ~ ( A @ aSet0 )
| ( C
!= ( B @ ( A @ slbdtsldtrb0 ) ) ) ),
inference(lifteq,[status(thm)],[223]) ).
thf(247,plain,
! [B: $i,A: $i] :
( ( B @ ( A @ slbdtsldtrb0 ) @ aSet0 )
| ~ ( szNzAzT0 @ ( B @ aElementOf0 ) )
| ~ ( A @ aSet0 ) ),
inference(simp,[status(thm)],[246]) ).
thf(35,axiom,
! [A: $i] :
( ( A = slcrc0 )
<=> ( ~ ? [B: $i] : ( A @ ( B @ aElementOf0 ) )
& ( A @ aSet0 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefEmp) ).
thf(183,plain,
! [A: $i] :
( ( ( ~ ? [B: $i] : ( A @ ( B @ aElementOf0 ) )
& ( A @ aSet0 ) )
=> ( A = slcrc0 ) )
& ( ( A = slcrc0 )
=> ( ~ ? [B: $i] : ( A @ ( B @ aElementOf0 ) )
& ( A @ aSet0 ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[35]) ).
thf(184,plain,
( ! [A: $i] :
( ( ~ ? [B: $i] : ( A @ ( B @ aElementOf0 ) )
& ( A @ aSet0 ) )
=> ( A = slcrc0 ) )
& ! [A: $i] :
( ( A = slcrc0 )
=> ( ~ ? [B: $i] : ( A @ ( B @ aElementOf0 ) )
& ( A @ aSet0 ) ) ) ),
inference(miniscope,[status(thm)],[183]) ).
thf(185,plain,
! [C: $i,B: $i,A: $i] :
( ( ( C = slcrc0 )
| ( C @ ( C @ sk6 @ aElementOf0 ) )
| ~ ( C @ aSet0 ) )
& ( ~ ( A @ ( B @ aElementOf0 ) )
| ( A != slcrc0 ) )
& ( ( A @ aSet0 )
| ( A != slcrc0 ) ) ),
inference(cnf,[status(esa)],[184]) ).
thf(188,plain,
! [A: $i] :
( ( A = slcrc0 )
| ( A @ ( A @ sk6 @ aElementOf0 ) )
| ~ ( A @ aSet0 ) ),
inference(cnfConj,[status(thm)],[185]) ).
thf(193,plain,
! [A: $i] :
( ( A @ ( A @ sk6 @ aElementOf0 ) )
| ~ ( A @ aSet0 )
| ( A = slcrc0 ) ),
inference(lifteq,[status(thm)],[188]) ).
thf(194,plain,
! [A: $i] :
( ( A @ ( A @ sk6 @ aElementOf0 ) )
| ~ ( A @ aSet0 )
| ( A = slcrc0 ) ),
inference(simp,[status(thm)],[193]) ).
thf(1,conjecture,
? [A: $i] : ( xk @ ( xS @ slbdtsldtrb0 ) @ ( A @ aElementOf0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
thf(2,negated_conjecture,
~ ? [A: $i] : ( xk @ ( xS @ slbdtsldtrb0 ) @ ( A @ aElementOf0 ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(67,plain,
~ ? [A: $i] : ( xk @ ( xS @ slbdtsldtrb0 ) @ ( A @ aElementOf0 ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(68,plain,
! [A: $i] :
~ ( xk @ ( xS @ slbdtsldtrb0 ) @ ( A @ aElementOf0 ) ),
inference(cnf,[status(esa)],[67]) ).
thf(34838,plain,
! [B: $i,A: $i] :
( ( ( A @ ( A @ sk6 @ aElementOf0 ) )
!= ( xk @ ( xS @ slbdtsldtrb0 ) @ ( B @ aElementOf0 ) ) )
| ~ $true
| ~ ( A @ aSet0 )
| ( A = slcrc0 ) ),
inference(paramod_ordered,[status(thm)],[194,68]) ).
thf(34839,plain,
! [B: $i,A: $i] :
( ( ( A @ ( A @ sk6 @ aElementOf0 ) )
!= ( xk @ ( xS @ slbdtsldtrb0 ) @ ( B @ aElementOf0 ) ) )
| ~ ( A @ aSet0 )
| ( A = slcrc0 ) ),
inference(simp,[status(thm)],[34838]) ).
thf(34840,plain,
( ~ ( xk @ ( xS @ slbdtsldtrb0 ) @ aSet0 )
| ( ( xk @ ( xS @ slbdtsldtrb0 ) )
= slcrc0 ) ),
inference(pattern_uni,[status(thm)],[34839:[bind(A,$thf( xk @ ( xS @ slbdtsldtrb0 ) )),bind(B,$thf( xk @ ( xS @ slbdtsldtrb0 ) @ sk6 ))]]) ).
thf(51,axiom,
( ( ( xk @ ( xS @ slbdtsldtrb0 ) )
!= slcrc0 )
& ( xk @ ( xT @ slbdtsldtrb0 ) @ ( xk @ ( xS @ slbdtsldtrb0 ) @ aSubsetOf0 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2227) ).
thf(320,plain,
( ( ( xk @ ( xS @ slbdtsldtrb0 ) )
!= slcrc0 )
& ( xk @ ( xT @ slbdtsldtrb0 ) @ ( xk @ ( xS @ slbdtsldtrb0 ) @ aSubsetOf0 ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[51]) ).
thf(321,plain,
( ( ( xk @ ( xS @ slbdtsldtrb0 ) )
!= slcrc0 )
& ( xk @ ( xT @ slbdtsldtrb0 ) @ ( xk @ ( xS @ slbdtsldtrb0 ) @ aSubsetOf0 ) ) ),
inference(cnf,[status(esa)],[320]) ).
thf(323,plain,
( ( xk @ ( xS @ slbdtsldtrb0 ) )
!= slcrc0 ),
inference(cnfConj,[status(thm)],[321]) ).
thf(324,plain,
( ( xk @ ( xS @ slbdtsldtrb0 ) )
!= slcrc0 ),
inference(lifteq,[status(thm)],[323]) ).
thf(36344,plain,
~ ( xk @ ( xS @ slbdtsldtrb0 ) @ aSet0 ),
inference(simplifyReflect,[status(thm)],[34840,324]) ).
thf(66782,plain,
! [B: $i,A: $i] :
( ( ( B @ ( A @ slbdtsldtrb0 ) @ aSet0 )
!= ( xk @ ( xS @ slbdtsldtrb0 ) @ aSet0 ) )
| ~ $true
| ~ ( szNzAzT0 @ ( B @ aElementOf0 ) )
| ~ ( A @ aSet0 ) ),
inference(paramod_ordered,[status(thm)],[247,36344]) ).
thf(66783,plain,
! [B: $i,A: $i] :
( ( ( B @ ( A @ slbdtsldtrb0 ) @ aSet0 )
!= ( xk @ ( xS @ slbdtsldtrb0 ) @ aSet0 ) )
| ~ ( szNzAzT0 @ ( B @ aElementOf0 ) )
| ~ ( A @ aSet0 ) ),
inference(simp,[status(thm)],[66782]) ).
thf(66784,plain,
( ~ ( szNzAzT0 @ ( xk @ aElementOf0 ) )
| ~ ( xS @ aSet0 ) ),
inference(pattern_uni,[status(thm)],[66783:[bind(A,$thf( xS )),bind(B,$thf( xk ))]]) ).
thf(52,axiom,
( ( xk != sz00 )
& ( xT @ aSet0 )
& ( xS @ aSet0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2202_02) ).
thf(325,plain,
( ( xk != sz00 )
& ( xT @ aSet0 )
& ( xS @ aSet0 ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[52]) ).
thf(326,plain,
( ( xk != sz00 )
& ( xT @ aSet0 )
& ( xS @ aSet0 ) ),
inference(cnf,[status(esa)],[325]) ).
thf(327,plain,
xS @ aSet0,
inference(cnfConj,[status(thm)],[326]) ).
thf(53,axiom,
szNzAzT0 @ ( xk @ aElementOf0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2202) ).
thf(331,plain,
szNzAzT0 @ ( xk @ aElementOf0 ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[53]) ).
thf(67277,plain,
( ~ $true
| ~ $true ),
inference(rewrite,[status(thm)],[66784,327,331]) ).
thf(67278,plain,
$false,
inference(simp,[status(thm)],[67277]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM547+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.13 % 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.23/0.51 % Computer : n013.cluster.edu
% 0.23/0.51 % Model : x86_64 x86_64
% 0.23/0.51 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.23/0.51 % Memory : 8046.5625MB
% 0.23/0.51 % OS : Linux 6.8.0-71-generic
% 0.23/0.51 % CPULimit : 300
% 0.23/0.51 % WCLimit : 300
% 0.23/0.51 % DateTime : Sat Sep 26 03:10:36 UTC 2026
% 0.23/0.51 % CPUTime :
% 0.23/0.51 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.91/1.03 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.56/1.25 % [INFO] Parsing done (217ms).
% 1.56/1.26 % [INFO] Running in sequential loop mode.
% 2.81/1.60 % [INFO] eprover registered as external prover.
% 2.81/1.61 % [INFO] Scanning for conjecture ...
% 2.81/1.67 % [INFO] Definitions in FOF are currently treated as axioms.
% 2.81/1.68 % [INFO] Definitions in FOF are currently treated as axioms.
% 2.81/1.70 % [INFO] Definitions in FOF are currently treated as axioms.
% 3.02/1.70 % [INFO] Definitions in FOF are currently treated as axioms.
% 3.02/1.72 % [INFO] Definitions in FOF are currently treated as axioms.
% 3.02/1.72 % [INFO] Definitions in FOF are currently treated as axioms.
% 3.02/1.73 % [INFO] Definitions in FOF are currently treated as axioms.
% 3.02/1.74 % [INFO] Definitions in FOF are currently treated as axioms.
% 3.02/1.76 % [INFO] Found a conjecture (or negated_conjecture) and 64 axioms. Running axiom selection ...
% 3.38/1.85 % [INFO] Axiom selection finished. Selected 64 axioms (removed 0 axioms).
% 3.38/1.87 % [INFO] Definitions in FOF are currently treated as axioms.
% 3.38/1.89 % [INFO] Definitions in FOF are currently treated as axioms.
% 3.38/1.89 % [INFO] Definitions in FOF are currently treated as axioms.
% 3.38/1.89 % [INFO] Definitions in FOF are currently treated as axioms.
% 3.38/1.90 % [INFO] Definitions in FOF are currently treated as axioms.
% 3.65/1.90 % [INFO] Definitions in FOF are currently treated as axioms.
% 3.65/1.90 % [INFO] Definitions in FOF are currently treated as axioms.
% 3.65/1.91 % [INFO] Definitions in FOF are currently treated as axioms.
% 3.65/1.92 % [INFO] Problem is first-order (TPTP FOF).
% 3.65/1.93 % [INFO] Type checking passed.
% 3.65/1.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 ...
% 105.01/34.38 % [INFO] Killing All external provers ...
% 105.01/34.38 % Time passed: 33726ms (effective reasoning time: 33113ms)
% 105.01/34.38 % 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)>
% 105.01/34.38 % Axioms used in derivation (5): mDefEmp, mDefSel, m__2227, m__2202, m__2202_02
% 105.01/34.38 % No. of inferences in proof: 38
% 105.01/34.38 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 33726 ms resp. 33113 ms w/o parsing
% 105.15/34.44 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 105.15/34.44 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------