TSTP Solution File: ANA102^1 by Leo-III-SAT---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.12
% Problem : ANA102^1 : TPTP v8.2.0. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n017.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon May 20 18:39:45 EDT 2024
% Result : Theorem 137.99s 68.19s
% Output : Refutation 138.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 20
% Syntax : Number of formulae : 60 ( 13 unt; 14 typ; 0 def)
% Number of atoms : 219 ( 35 equ; 0 cnn)
% Maximal formula atoms : 8 ( 4 avg)
% Number of connectives : 518 ( 43 ~; 29 |; 12 &; 427 @)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 93 ( 93 >; 0 *; 0 +; 0 <<)
% Number of symbols : 15 ( 12 usr; 2 con; 0-4 aty)
% Number of variables : 92 ( 0 ^ 85 !; 0 ?; 92 :)
% ( 7 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf('\'type/realax/real\'_type',type,
'\'type/realax/real\'': $tType ).
thf('\'const/sets/UNION\'_type',type,
'\'const/sets/UNION\'':
!>[TA: $tType] : ( ( TA > $o ) > ( TA > $o ) > TA > $o ) ).
thf('\'const/sets/SUBSET\'_type',type,
'\'const/sets/SUBSET\'':
!>[TA: $tType] : ( ( TA > $o ) > ( TA > $o ) > $o ) ).
thf('\'const/sets/INTER\'_type',type,
'\'const/sets/INTER\'':
!>[TA: $tType] : ( ( TA > $o ) > ( TA > $o ) > TA > $o ) ).
thf('\'const/sets/FINITE\'_type',type,
'\'const/sets/FINITE\'':
!>[TA: $tType] : ( ( TA > $o ) > $o ) ).
thf('\'const/sets/EMPTY\'_type',type,
'\'const/sets/EMPTY\'':
!>[TA: $tType] : ( TA > $o ) ).
thf('\'const/sets/DISJOINT\'_type',type,
'\'const/sets/DISJOINT\'':
!>[TA: $tType] : ( ( TA > $o ) > ( TA > $o ) > $o ) ).
thf('\'const/realax/real_add\'_type',type,
'\'const/realax/real_add\'': '\'type/realax/real\'' > '\'type/realax/real\'' > '\'type/realax/real\'' ).
thf('\'const/iterate/sum\'_type',type,
'\'const/iterate/sum\'':
!>[TA: $tType] : ( ( TA > $o ) > ( TA > '\'type/realax/real\'' ) > '\'type/realax/real\'' ) ).
thf(skt1_type,type,
skt1: $tType ).
thf(sk1_type,type,
sk1: skt1 > '\'type/realax/real\'' ).
thf(sk2_type,type,
sk2: skt1 > $o ).
thf(sk3_type,type,
sk3: skt1 > $o ).
thf(sk4_type,type,
sk4: skt1 > $o ).
thf(3,axiom,
! [TA: $tType,A: TA > $o,B: TA > $o] : ( '\'const/sets/SUBSET\'' @ TA @ A @ ( '\'const/sets/UNION\'' @ TA @ B @ A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/sets/SUBSET_UNION_1') ).
thf(16,plain,
! [TA: $tType,A: TA > $o,B: TA > $o] : ( '\'const/sets/SUBSET\'' @ TA @ A @ ( '\'const/sets/UNION\'' @ TA @ B @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(17,plain,
! [TA: $tType,B: TA > $o,A: TA > $o] : ( '\'const/sets/SUBSET\'' @ TA @ A @ ( '\'const/sets/UNION\'' @ TA @ B @ A ) ),
inference(cnf,[status(esa)],[16]) ).
thf(1,conjecture,
! [TA: $tType,A: TA > '\'type/realax/real\'',B: TA > $o,C: TA > $o,D: TA > $o] :
( ( ( '\'const/sets/FINITE\'' @ TA @ D )
& ( ( '\'const/sets/INTER\'' @ TA @ B @ C )
= ( '\'const/sets/EMPTY\'' @ TA ) )
& ( ( '\'const/sets/UNION\'' @ TA @ B @ C )
= D ) )
=> ( ( '\'const/realax/real_add\'' @ ( '\'const/iterate/sum\'' @ TA @ B @ A ) @ ( '\'const/iterate/sum\'' @ TA @ C @ A ) )
= ( '\'const/iterate/sum\'' @ TA @ D @ A ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/iterate/SUM_UNION_EQ_') ).
thf(2,negated_conjecture,
~ ! [TA: $tType,A: TA > '\'type/realax/real\'',B: TA > $o,C: TA > $o,D: TA > $o] :
( ( ( '\'const/sets/FINITE\'' @ TA @ D )
& ( ( '\'const/sets/INTER\'' @ TA @ B @ C )
= ( '\'const/sets/EMPTY\'' @ TA ) )
& ( ( '\'const/sets/UNION\'' @ TA @ B @ C )
= D ) )
=> ( ( '\'const/realax/real_add\'' @ ( '\'const/iterate/sum\'' @ TA @ B @ A ) @ ( '\'const/iterate/sum\'' @ TA @ C @ A ) )
= ( '\'const/iterate/sum\'' @ TA @ D @ A ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(8,plain,
~ ! [TA: $tType,A: TA > '\'type/realax/real\'',B: TA > $o,C: TA > $o,D: TA > $o] :
( ( ( '\'const/sets/FINITE\'' @ TA @ D )
& ( ( '\'const/sets/INTER\'' @ TA @ B @ C )
= ( '\'const/sets/EMPTY\'' @ TA ) )
& ( ( '\'const/sets/UNION\'' @ TA @ B @ C )
= D ) )
=> ( ( '\'const/realax/real_add\'' @ ( '\'const/iterate/sum\'' @ TA @ B @ A ) @ ( '\'const/iterate/sum\'' @ TA @ C @ A ) )
= ( '\'const/iterate/sum\'' @ TA @ D @ A ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(12,plain,
'\'const/sets/FINITE\'' @ skt1 @ sk4,
inference(cnf,[status(esa)],[8]) ).
thf(10,plain,
( ( '\'const/sets/UNION\'' @ skt1 @ sk2 @ sk3 )
= sk4 ),
inference(cnf,[status(esa)],[8]) ).
thf(14,plain,
( sk4
= ( '\'const/sets/UNION\'' @ skt1 @ sk2 @ sk3 ) ),
inference(lifteq,[status(thm)],[10]) ).
thf(28,plain,
'\'const/sets/FINITE\'' @ skt1 @ ( '\'const/sets/UNION\'' @ skt1 @ sk2 @ sk3 ),
inference(rewrite,[status(thm)],[12,14]) ).
thf(5,axiom,
! [TA: $tType,A: TA > $o,B: TA > $o] :
( ( ( '\'const/sets/FINITE\'' @ TA @ B )
& ( '\'const/sets/SUBSET\'' @ TA @ A @ B ) )
=> ( '\'const/sets/FINITE\'' @ TA @ A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/sets/FINITE_SUBSET_') ).
thf(20,plain,
! [TA: $tType,A: TA > $o,B: TA > $o] :
( ( ( '\'const/sets/FINITE\'' @ TA @ B )
& ( '\'const/sets/SUBSET\'' @ TA @ A @ B ) )
=> ( '\'const/sets/FINITE\'' @ TA @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(21,plain,
! [TA: $tType,B: TA > $o,A: TA > $o] :
( ~ ( '\'const/sets/FINITE\'' @ TA @ B )
| ~ ( '\'const/sets/SUBSET\'' @ TA @ A @ B )
| ( '\'const/sets/FINITE\'' @ TA @ A ) ),
inference(cnf,[status(esa)],[20]) ).
thf(140,plain,
! [TA: $tType,B: TA > $o,A: TA > $o] :
( ~ ( '\'const/sets/SUBSET\'' @ TA @ A @ B )
| ( '\'const/sets/FINITE\'' @ TA @ A )
| ( ( '\'const/sets/FINITE\'' @ skt1 @ ( '\'const/sets/UNION\'' @ skt1 @ sk2 @ sk3 ) )
!= ( '\'const/sets/FINITE\'' @ TA @ B ) ) ),
inference(paramod_ordered,[status(thm)],[28,21]) ).
thf(141,plain,
! [A: skt1 > $o] :
( ~ ( '\'const/sets/SUBSET\'' @ skt1 @ A @ ( '\'const/sets/UNION\'' @ skt1 @ sk2 @ sk3 ) )
| ( '\'const/sets/FINITE\'' @ skt1 @ A ) ),
inference(pattern_uni,[status(thm)],[140:[bind(A,$thf( A )),bind(B,$thf( '\'const/sets/UNION\'' @ skt1 @ sk2 @ sk3 )),bind_type(TA,$thf( skt1 ))]]) ).
thf(1003,plain,
! [TA: $tType,C: skt1 > $o,B: TA > $o,A: TA > $o] :
( ( '\'const/sets/FINITE\'' @ skt1 @ C )
| ( ( '\'const/sets/SUBSET\'' @ TA @ A @ ( '\'const/sets/UNION\'' @ TA @ B @ A ) )
!= ( '\'const/sets/SUBSET\'' @ skt1 @ C @ ( '\'const/sets/UNION\'' @ skt1 @ sk2 @ sk3 ) ) ) ),
inference(paramod_ordered,[status(thm)],[17,141]) ).
thf(1004,plain,
'\'const/sets/FINITE\'' @ skt1 @ sk3,
inference(pattern_uni,[status(thm)],[1003:[bind(A,$thf( sk3 )),bind(B,$thf( sk2 )),bind(C,$thf( sk3 )),bind_type(TA,$thf( skt1 ))]]) ).
thf(7,axiom,
! [TA: $tType,A: TA > '\'type/realax/real\'',B: TA > $o,C: TA > $o] :
( ( ( '\'const/sets/FINITE\'' @ TA @ B )
& ( '\'const/sets/FINITE\'' @ TA @ C )
& ( '\'const/sets/DISJOINT\'' @ TA @ B @ C ) )
=> ( ( '\'const/iterate/sum\'' @ TA @ ( '\'const/sets/UNION\'' @ TA @ B @ C ) @ A )
= ( '\'const/realax/real_add\'' @ ( '\'const/iterate/sum\'' @ TA @ B @ A ) @ ( '\'const/iterate/sum\'' @ TA @ C @ A ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/iterate/SUM_UNION_') ).
thf(25,plain,
! [TA: $tType,A: TA > '\'type/realax/real\'',B: TA > $o,C: TA > $o] :
( ( ( '\'const/sets/FINITE\'' @ TA @ B )
& ( '\'const/sets/FINITE\'' @ TA @ C )
& ( '\'const/sets/DISJOINT\'' @ TA @ B @ C ) )
=> ( ( '\'const/iterate/sum\'' @ TA @ ( '\'const/sets/UNION\'' @ TA @ B @ C ) @ A )
= ( '\'const/realax/real_add\'' @ ( '\'const/iterate/sum\'' @ TA @ B @ A ) @ ( '\'const/iterate/sum\'' @ TA @ C @ A ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).
thf(26,plain,
! [TA: $tType,C: TA > $o,B: TA > $o,A: TA > '\'type/realax/real\''] :
( ~ ( '\'const/sets/FINITE\'' @ TA @ B )
| ~ ( '\'const/sets/FINITE\'' @ TA @ C )
| ~ ( '\'const/sets/DISJOINT\'' @ TA @ B @ C )
| ( ( '\'const/iterate/sum\'' @ TA @ ( '\'const/sets/UNION\'' @ TA @ B @ C ) @ A )
= ( '\'const/realax/real_add\'' @ ( '\'const/iterate/sum\'' @ TA @ B @ A ) @ ( '\'const/iterate/sum\'' @ TA @ C @ A ) ) ) ),
inference(cnf,[status(esa)],[25]) ).
thf(27,plain,
! [TA: $tType,C: TA > $o,B: TA > $o,A: TA > '\'type/realax/real\''] :
( ( ( '\'const/iterate/sum\'' @ TA @ ( '\'const/sets/UNION\'' @ TA @ B @ C ) @ A )
= ( '\'const/realax/real_add\'' @ ( '\'const/iterate/sum\'' @ TA @ B @ A ) @ ( '\'const/iterate/sum\'' @ TA @ C @ A ) ) )
| ~ ( '\'const/sets/FINITE\'' @ TA @ B )
| ~ ( '\'const/sets/FINITE\'' @ TA @ C )
| ~ ( '\'const/sets/DISJOINT\'' @ TA @ B @ C ) ),
inference(lifteq,[status(thm)],[26]) ).
thf(9,plain,
( ( '\'const/realax/real_add\'' @ ( '\'const/iterate/sum\'' @ skt1 @ sk2 @ sk1 ) @ ( '\'const/iterate/sum\'' @ skt1 @ sk3 @ sk1 ) )
!= ( '\'const/iterate/sum\'' @ skt1 @ sk4 @ sk1 ) ),
inference(cnf,[status(esa)],[8]) ).
thf(13,plain,
( ( '\'const/realax/real_add\'' @ ( '\'const/iterate/sum\'' @ skt1 @ sk2 @ sk1 ) @ ( '\'const/iterate/sum\'' @ skt1 @ sk3 @ sk1 ) )
!= ( '\'const/iterate/sum\'' @ skt1 @ sk4 @ sk1 ) ),
inference(lifteq,[status(thm)],[9]) ).
thf(31,plain,
( ( '\'const/realax/real_add\'' @ ( '\'const/iterate/sum\'' @ skt1 @ sk2 @ sk1 ) @ ( '\'const/iterate/sum\'' @ skt1 @ sk3 @ sk1 ) )
!= ( '\'const/iterate/sum\'' @ skt1 @ ( '\'const/sets/UNION\'' @ skt1 @ sk2 @ sk3 ) @ sk1 ) ),
inference(rewrite,[status(thm)],[13,14]) ).
thf(42,plain,
! [TA: $tType,C: TA > $o,B: TA > $o,A: TA > '\'type/realax/real\''] :
( ~ ( '\'const/sets/FINITE\'' @ TA @ B )
| ~ ( '\'const/sets/FINITE\'' @ TA @ C )
| ~ ( '\'const/sets/DISJOINT\'' @ TA @ B @ C )
| ( ( '\'const/iterate/sum\'' @ TA @ ( '\'const/sets/UNION\'' @ TA @ B @ C ) @ A )
!= ( '\'const/iterate/sum\'' @ skt1 @ ( '\'const/sets/UNION\'' @ skt1 @ sk2 @ sk3 ) @ sk1 ) )
| ( ( '\'const/realax/real_add\'' @ ( '\'const/iterate/sum\'' @ TA @ B @ A ) @ ( '\'const/iterate/sum\'' @ TA @ C @ A ) )
!= ( '\'const/realax/real_add\'' @ ( '\'const/iterate/sum\'' @ skt1 @ sk2 @ sk1 ) @ ( '\'const/iterate/sum\'' @ skt1 @ sk3 @ sk1 ) ) ) ),
inference(paramod_ordered,[status(thm)],[27,31]) ).
thf(43,plain,
( ~ ( '\'const/sets/FINITE\'' @ skt1 @ sk2 )
| ~ ( '\'const/sets/FINITE\'' @ skt1 @ sk3 )
| ~ ( '\'const/sets/DISJOINT\'' @ skt1 @ sk2 @ sk3 )
| ( ( '\'const/iterate/sum\'' @ skt1 @ ( '\'const/sets/UNION\'' @ skt1 @ sk2 @ sk3 ) @ sk1 )
!= ( '\'const/iterate/sum\'' @ skt1 @ ( '\'const/sets/UNION\'' @ skt1 @ sk2 @ sk3 ) @ sk1 ) ) ),
inference(pattern_uni,[status(thm)],[42:[bind(A,$thf( sk1 )),bind(B,$thf( sk2 )),bind(C,$thf( sk3 )),bind_type(TA,$thf( skt1 ))]]) ).
thf(47,plain,
( ~ ( '\'const/sets/FINITE\'' @ skt1 @ sk2 )
| ~ ( '\'const/sets/FINITE\'' @ skt1 @ sk3 )
| ~ ( '\'const/sets/DISJOINT\'' @ skt1 @ sk2 @ sk3 ) ),
inference(simp,[status(thm)],[43]) ).
thf(11,plain,
( ( '\'const/sets/INTER\'' @ skt1 @ sk2 @ sk3 )
= ( '\'const/sets/EMPTY\'' @ skt1 ) ),
inference(cnf,[status(esa)],[8]) ).
thf(15,plain,
( ( '\'const/sets/INTER\'' @ skt1 @ sk2 @ sk3 )
= ( '\'const/sets/EMPTY\'' @ skt1 ) ),
inference(lifteq,[status(thm)],[11]) ).
thf(6,axiom,
! [TA: $tType,A: TA > $o,B: TA > $o] :
( ( '\'const/sets/DISJOINT\'' @ TA @ A @ B )
= ( ( '\'const/sets/INTER\'' @ TA @ A @ B )
= ( '\'const/sets/EMPTY\'' @ TA ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/sets/DISJOINT_') ).
thf(22,plain,
! [TA: $tType,A: TA > $o,B: TA > $o] :
( ( '\'const/sets/DISJOINT\'' @ TA @ A @ B )
= ( ( '\'const/sets/INTER\'' @ TA @ A @ B )
= ( '\'const/sets/EMPTY\'' @ TA ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).
thf(23,plain,
! [TA: $tType,B: TA > $o,A: TA > $o] :
( ( '\'const/sets/DISJOINT\'' @ TA @ A @ B )
= ( ( '\'const/sets/INTER\'' @ TA @ A @ B )
= ( '\'const/sets/EMPTY\'' @ TA ) ) ),
inference(cnf,[status(esa)],[22]) ).
thf(24,plain,
! [TA: $tType,B: TA > $o,A: TA > $o] :
( ( '\'const/sets/DISJOINT\'' @ TA @ A @ B )
= ( ( '\'const/sets/INTER\'' @ TA @ A @ B )
= ( '\'const/sets/EMPTY\'' @ TA ) ) ),
inference(lifteq,[status(thm)],[23]) ).
thf(64,plain,
! [B: skt1 > $o,A: skt1 > $o] :
( ( '\'const/sets/DISJOINT\'' @ skt1 @ A @ B )
| ( ( '\'const/sets/INTER\'' @ skt1 @ sk2 @ sk3 )
!= ( '\'const/sets/INTER\'' @ skt1 @ A @ B ) ) ),
inference(paramod_ordered,[status(thm)],[15,24]) ).
thf(65,plain,
'\'const/sets/DISJOINT\'' @ skt1 @ sk2 @ sk3,
inference(pattern_uni,[status(thm)],[64:[bind(A,$thf( sk2 )),bind(B,$thf( sk3 ))]]) ).
thf(73,plain,
( ~ ( '\'const/sets/FINITE\'' @ skt1 @ sk2 )
| ~ ( '\'const/sets/FINITE\'' @ skt1 @ sk3 )
| ~ $true ),
inference(rewrite,[status(thm)],[47,65]) ).
thf(74,plain,
( ~ ( '\'const/sets/FINITE\'' @ skt1 @ sk2 )
| ~ ( '\'const/sets/FINITE\'' @ skt1 @ sk3 ) ),
inference(simp,[status(thm)],[73]) ).
thf(977,plain,
! [A: skt1 > $o] :
( ~ ( '\'const/sets/SUBSET\'' @ skt1 @ A @ ( '\'const/sets/UNION\'' @ skt1 @ sk2 @ sk3 ) )
| ~ ( '\'const/sets/FINITE\'' @ skt1 @ sk3 )
| ( ( '\'const/sets/FINITE\'' @ skt1 @ A )
!= ( '\'const/sets/FINITE\'' @ skt1 @ sk2 ) ) ),
inference(paramod_ordered,[status(thm)],[141,74]) ).
thf(978,plain,
( ~ ( '\'const/sets/SUBSET\'' @ skt1 @ sk2 @ ( '\'const/sets/UNION\'' @ skt1 @ sk2 @ sk3 ) )
| ~ ( '\'const/sets/FINITE\'' @ skt1 @ sk3 ) ),
inference(pattern_uni,[status(thm)],[977:[bind(A,$thf( sk2 ))]]) ).
thf(4,axiom,
! [TA: $tType,A: TA > $o,B: TA > $o] : ( '\'const/sets/SUBSET\'' @ TA @ A @ ( '\'const/sets/UNION\'' @ TA @ A @ B ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/sets/SUBSET_UNION_0') ).
thf(18,plain,
! [TA: $tType,A: TA > $o,B: TA > $o] : ( '\'const/sets/SUBSET\'' @ TA @ A @ ( '\'const/sets/UNION\'' @ TA @ A @ B ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(19,plain,
! [TA: $tType,B: TA > $o,A: TA > $o] : ( '\'const/sets/SUBSET\'' @ TA @ A @ ( '\'const/sets/UNION\'' @ TA @ A @ B ) ),
inference(cnf,[status(esa)],[18]) ).
thf(1042,plain,
( ~ $true
| ~ ( '\'const/sets/FINITE\'' @ skt1 @ sk3 ) ),
inference(rewrite,[status(thm)],[978,19]) ).
thf(1043,plain,
~ ( '\'const/sets/FINITE\'' @ skt1 @ sk3 ),
inference(simp,[status(thm)],[1042]) ).
thf(1055,plain,
$false,
inference(rewrite,[status(thm)],[1004,1043]) ).
thf(1056,plain,
$false,
inference(simp,[status(thm)],[1055]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : ANA102^1 : TPTP v8.2.0. Released v7.0.0.
% 0.07/0.15 % Command : run_Leo-III %s %d
% 0.16/0.36 % Computer : n017.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Mon May 20 07:52:54 EDT 2024
% 0.16/0.36 % CPUTime :
% 0.85/0.85 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.19/0.98 % [INFO] Parsing done (127ms).
% 1.19/0.99 % [INFO] Running in sequential loop mode.
% 1.78/1.21 % [INFO] nitpick registered as external prover.
% 1.78/1.21 % [INFO] Scanning for conjecture ...
% 1.90/1.28 % [INFO] Found a conjecture (or negated_conjecture) and 5 axioms. Running axiom selection ...
% 1.90/1.30 % [INFO] Axiom selection finished. Selected 5 axioms (removed 0 axioms).
% 1.90/1.32 % [INFO] Problem is higher-order (TPTP THF).
% 1.90/1.32 % [INFO] Type checking passed.
% 1.90/1.32 % [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 ...
% 137.99/68.18 % [INFO] Killing All external provers ...
% 137.99/68.18 % Time passed: 67663ms (effective reasoning time: 67192ms)
% 137.99/68.18 % 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)>
% 137.99/68.19 % Axioms used in derivation (5): thm/sets/SUBSET_UNION_0, thm/sets/SUBSET_UNION_1, thm/iterate/SUM_UNION_, thm/sets/DISJOINT_, thm/sets/FINITE_SUBSET_
% 137.99/68.19 % No. of inferences in proof: 46
% 137.99/68.19 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 67663 ms resp. 67192 ms w/o parsing
% 138.32/68.23 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 138.32/68.23 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------