TSTP Solution File: SEV448^1 by Leo-III-SAT---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.12
% Problem : SEV448^1 : TPTP v8.2.0. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n008.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 : Tue May 21 04:11:29 EDT 2024
% Result : Theorem 101.69s 15.03s
% Output : Refutation 101.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 32
% Number of leaves : 10
% Syntax : Number of formulae : 66 ( 17 unt; 7 typ; 0 def)
% Number of atoms : 390 ( 78 equ; 0 cnn)
% Maximal formula atoms : 8 ( 6 avg)
% Number of connectives : 544 ( 62 ~; 55 |; 9 &; 408 @)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 52 ( 52 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 82 ( 0 ^ 79 !; 0 ?; 82 :)
% ( 3 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf('\'const/sets/SUBSET\'_type',type,
'\'const/sets/SUBSET\'':
!>[TA: $tType] : ( ( TA > $o ) > ( TA > $o ) > $o ) ).
thf('\'const/sets/IN\'_type',type,
'\'const/sets/IN\'':
!>[TA: $tType] : ( TA > ( TA > $o ) > $o ) ).
thf(skt1_type,type,
skt1: $tType ).
thf(sk1_type,type,
sk1: skt1 > $o ).
thf(sk2_type,type,
sk2: skt1 > $o ).
thf(sk5_type,type,
sk5:
!>[TA: $tType] : ( ( TA > $o ) > ( TA > $o ) > TA ) ).
thf(sk6_type,type,
sk6: skt1 ).
thf(4,axiom,
! [TA: $tType,A: TA > $o,B: TA > $o] :
( ( A = B )
= ( ! [C: TA] :
( ( '\'const/sets/IN\'' @ TA @ C @ A )
= ( '\'const/sets/IN\'' @ TA @ C @ B ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/sets/EXTENSION_') ).
thf(12,plain,
! [TA: $tType,A: TA > $o,B: TA > $o] :
( ( A = B )
= ( ! [C: TA] :
( ( '\'const/sets/IN\'' @ TA @ C @ A )
= ( '\'const/sets/IN\'' @ TA @ C @ B ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(13,plain,
! [TA: $tType,B: TA > $o,A: TA > $o] :
( ( A = B )
= ( ! [C: TA] :
( ( '\'const/sets/IN\'' @ TA @ C @ A )
= ( '\'const/sets/IN\'' @ TA @ C @ B ) ) ) ),
inference(cnf,[status(esa)],[12]) ).
thf(14,plain,
! [TA: $tType,B: TA > $o,A: TA > $o] :
( ( A = B )
= ( ! [C: TA] :
( ( '\'const/sets/IN\'' @ TA @ C @ A )
= ( '\'const/sets/IN\'' @ TA @ C @ B ) ) ) ),
inference(lifteq,[status(thm)],[13]) ).
thf(179,plain,
! [TA: $tType,B: TA > $o,A: TA > $o] :
( ( A = B )
| ~ ! [C: TA] :
( ( '\'const/sets/IN\'' @ TA @ C @ A )
= ( '\'const/sets/IN\'' @ TA @ C @ B ) ) ),
inference(bool_ext,[status(thm)],[14]) ).
thf(184,plain,
! [TA: $tType,B: TA > $o,A: TA > $o] :
( ( A = B )
| ~ ! [C: TA] :
( ( '\'const/sets/IN\'' @ TA @ C @ A )
= ( '\'const/sets/IN\'' @ TA @ C @ B ) ) ),
inference(lifteq,[status(thm)],[179]) ).
thf(192,plain,
! [TA: $tType,B: TA > $o,A: TA > $o] :
( ( ( '\'const/sets/IN\'' @ TA @ ( sk5 @ TA @ B @ A ) @ A )
!= ( '\'const/sets/IN\'' @ TA @ ( sk5 @ TA @ B @ A ) @ B ) )
| ( A = B ) ),
inference(cnf,[status(esa)],[184]) ).
thf(193,plain,
! [TA: $tType,B: TA > $o,A: TA > $o] :
( ( ( '\'const/sets/IN\'' @ TA @ ( sk5 @ TA @ B @ A ) @ A )
!= ( '\'const/sets/IN\'' @ TA @ ( sk5 @ TA @ B @ A ) @ B ) )
| ( A = B ) ),
inference(lifteq,[status(thm)],[192]) ).
thf(1,conjecture,
! [TA: $tType,A: TA > $o,B: TA > $o] :
( ( ( '\'const/sets/SUBSET\'' @ TA @ A @ B )
& ( '\'const/sets/SUBSET\'' @ TA @ B @ A ) )
= ( A = B ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/sets/SUBSET_ANTISYM_EQ_') ).
thf(2,negated_conjecture,
~ ! [TA: $tType,A: TA > $o,B: TA > $o] :
( ( ( '\'const/sets/SUBSET\'' @ TA @ A @ B )
& ( '\'const/sets/SUBSET\'' @ TA @ B @ A ) )
= ( A = B ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(6,plain,
~ ! [TA: $tType,A: TA > $o,B: TA > $o] :
( ( ( '\'const/sets/SUBSET\'' @ TA @ A @ B )
& ( '\'const/sets/SUBSET\'' @ TA @ B @ A ) )
= ( A = B ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(7,plain,
( ( ( '\'const/sets/SUBSET\'' @ skt1 @ sk1 @ sk2 )
& ( '\'const/sets/SUBSET\'' @ skt1 @ sk2 @ sk1 ) )
!= ( sk1 = sk2 ) ),
inference(cnf,[status(esa)],[6]) ).
thf(8,plain,
( ( ( '\'const/sets/SUBSET\'' @ skt1 @ sk1 @ sk2 )
& ( '\'const/sets/SUBSET\'' @ skt1 @ sk2 @ sk1 ) )
!= ( sk1 = sk2 ) ),
inference(lifteq,[status(thm)],[7]) ).
thf(19,plain,
( ( ( '\'const/sets/SUBSET\'' @ skt1 @ sk1 @ sk2 )
& ( '\'const/sets/SUBSET\'' @ skt1 @ sk2 @ sk1 ) )
| ( sk1 = sk2 ) ),
inference(bool_ext,[status(thm)],[8]) ).
thf(21,plain,
( ( sk2 = sk1 )
| ( ( '\'const/sets/SUBSET\'' @ skt1 @ sk1 @ sk2 )
& ( '\'const/sets/SUBSET\'' @ skt1 @ sk2 @ sk1 ) ) ),
inference(lifteq,[status(thm)],[19]) ).
thf(24,plain,
( ( '\'const/sets/SUBSET\'' @ skt1 @ sk1 @ sk2 )
| ( sk2 = sk1 ) ),
inference(cnf,[status(esa)],[21]) ).
thf(5,axiom,
! [TA: $tType,A: TA > $o,B: TA > $o] :
( ( '\'const/sets/SUBSET\'' @ TA @ A @ B )
= ( ! [C: TA] :
( ( '\'const/sets/IN\'' @ TA @ C @ A )
=> ( '\'const/sets/IN\'' @ TA @ C @ B ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/sets/SUBSET_') ).
thf(15,plain,
! [TA: $tType,A: TA > $o,B: TA > $o] :
( ( '\'const/sets/SUBSET\'' @ TA @ A @ B )
= ( ! [C: TA] :
( ( '\'const/sets/IN\'' @ TA @ C @ A )
=> ( '\'const/sets/IN\'' @ TA @ C @ B ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(16,plain,
! [TA: $tType,B: TA > $o,A: TA > $o] :
( ( '\'const/sets/SUBSET\'' @ TA @ A @ B )
= ( ! [C: TA] :
( ( '\'const/sets/IN\'' @ TA @ C @ A )
=> ( '\'const/sets/IN\'' @ TA @ C @ B ) ) ) ),
inference(cnf,[status(esa)],[15]) ).
thf(17,plain,
! [TA: $tType,B: TA > $o,A: TA > $o] :
( ( '\'const/sets/SUBSET\'' @ TA @ A @ B )
= ( ! [C: TA] :
( ( '\'const/sets/IN\'' @ TA @ C @ A )
=> ( '\'const/sets/IN\'' @ TA @ C @ B ) ) ) ),
inference(lifteq,[status(thm)],[16]) ).
thf(18,plain,
( ~ ( ( '\'const/sets/SUBSET\'' @ skt1 @ sk1 @ sk2 )
& ( '\'const/sets/SUBSET\'' @ skt1 @ sk2 @ sk1 ) )
| ( sk1 != sk2 ) ),
inference(bool_ext,[status(thm)],[8]) ).
thf(20,plain,
( ( sk2 != sk1 )
| ~ ( ( '\'const/sets/SUBSET\'' @ skt1 @ sk1 @ sk2 )
& ( '\'const/sets/SUBSET\'' @ skt1 @ sk2 @ sk1 ) ) ),
inference(lifteq,[status(thm)],[18]) ).
thf(22,plain,
( ~ ( '\'const/sets/SUBSET\'' @ skt1 @ sk1 @ sk2 )
| ~ ( '\'const/sets/SUBSET\'' @ skt1 @ sk2 @ sk1 )
| ( sk2 != sk1 ) ),
inference(cnf,[status(esa)],[20]) ).
thf(75,plain,
( ~ ( '\'const/sets/SUBSET\'' @ skt1 @ sk1 @ sk2 )
| ( sk2 != sk1 )
| ( ( '\'const/sets/SUBSET\'' @ skt1 @ sk2 @ sk1 )
!= ( '\'const/sets/SUBSET\'' @ skt1 @ sk1 @ sk2 ) )
| ~ $true ),
inference(eqfactor_ordered,[status(thm)],[22]) ).
thf(79,plain,
( ~ ( '\'const/sets/SUBSET\'' @ skt1 @ sk1 @ sk2 )
| ( sk2 != sk1 )
| ( sk2 != sk1 )
| ( sk2 != sk1 ) ),
inference(simp,[status(thm)],[75]) ).
thf(82,plain,
( ~ ( '\'const/sets/SUBSET\'' @ skt1 @ sk1 @ sk2 )
| ( sk2 != sk1 ) ),
inference(simp,[status(thm)],[79]) ).
thf(229,plain,
! [TA: $tType,B: TA > $o,A: TA > $o] :
( ~ ! [C: TA] :
( ( '\'const/sets/IN\'' @ TA @ C @ A )
=> ( '\'const/sets/IN\'' @ TA @ C @ B ) )
| ( sk2 != sk1 )
| ( ( '\'const/sets/SUBSET\'' @ TA @ A @ B )
!= ( '\'const/sets/SUBSET\'' @ skt1 @ sk1 @ sk2 ) ) ),
inference(paramod_ordered,[status(thm)],[17,82]) ).
thf(230,plain,
( ~ ! [A: skt1] :
( ( '\'const/sets/IN\'' @ skt1 @ A @ sk1 )
=> ( '\'const/sets/IN\'' @ skt1 @ A @ sk2 ) )
| ( sk2 != sk1 ) ),
inference(pattern_uni,[status(thm)],[229:[bind(A,$thf( sk1 )),bind(B,$thf( sk2 )),bind_type(TA,$thf( skt1 ))]]) ).
thf(239,plain,
( ( sk2 != sk1 )
| ( '\'const/sets/IN\'' @ skt1 @ sk6 @ sk1 ) ),
inference(cnf,[status(esa)],[230]) ).
thf(367,plain,
( ( '\'const/sets/SUBSET\'' @ skt1 @ sk1 @ sk2 )
| ( '\'const/sets/IN\'' @ skt1 @ sk6 @ sk1 )
| ( sk2 != sk2 ) ),
inference(paramod_ordered,[status(thm)],[24,239]) ).
thf(368,plain,
( ( '\'const/sets/SUBSET\'' @ skt1 @ sk1 @ sk2 )
| ( '\'const/sets/IN\'' @ skt1 @ sk6 @ sk1 ) ),
inference(pattern_uni,[status(thm)],[367:[]]) ).
thf(238,plain,
( ( sk2 != sk1 )
| ~ ( '\'const/sets/IN\'' @ skt1 @ sk6 @ sk2 ) ),
inference(cnf,[status(esa)],[230]) ).
thf(624,plain,
( ( '\'const/sets/SUBSET\'' @ skt1 @ sk1 @ sk2 )
| ( sk2 != sk1 )
| ( ( '\'const/sets/IN\'' @ skt1 @ sk6 @ sk2 )
!= ( '\'const/sets/IN\'' @ skt1 @ sk6 @ sk1 ) ) ),
inference(paramod_ordered,[status(thm)],[368,238]) ).
thf(665,plain,
( ( '\'const/sets/SUBSET\'' @ skt1 @ sk1 @ sk2 )
| ( sk2 != sk1 )
| ( sk6 != sk6 )
| ( sk2 != sk1 ) ),
inference(simp,[status(thm)],[624]) ).
thf(676,plain,
( ( '\'const/sets/SUBSET\'' @ skt1 @ sk1 @ sk2 )
| ( sk2 != sk1 ) ),
inference(simp,[status(thm)],[665]) ).
thf(1219,plain,
( ( sk2 != sk1 )
| ( ( '\'const/sets/SUBSET\'' @ skt1 @ sk1 @ sk2 )
!= ( '\'const/sets/SUBSET\'' @ skt1 @ sk1 @ sk2 ) ) ),
inference(paramod_ordered,[status(thm)],[676,82]) ).
thf(1220,plain,
sk2 != sk1,
inference(pattern_uni,[status(thm)],[1219:[]]) ).
thf(7462,plain,
! [B: skt1 > $o,A: skt1 > $o] :
( ( ( '\'const/sets/IN\'' @ skt1 @ ( sk5 @ skt1 @ B @ A ) @ A )
!= ( '\'const/sets/IN\'' @ skt1 @ ( sk5 @ skt1 @ B @ A ) @ B ) )
| ( B != sk1 )
| ( A != sk2 ) ),
inference(paramod_ordered,[status(thm)],[193,1220]) ).
thf(7463,plain,
! [A: skt1 > $o] :
( ( ( '\'const/sets/IN\'' @ skt1 @ ( sk5 @ skt1 @ A @ sk2 ) @ sk2 )
!= ( '\'const/sets/IN\'' @ skt1 @ ( sk5 @ skt1 @ A @ sk2 ) @ A ) )
| ( A != sk1 ) ),
inference(pattern_uni,[status(thm)],[7462:[bind(A,$thf( sk2 )),bind(B,$thf( B ))]]) ).
thf(7608,plain,
( ( '\'const/sets/IN\'' @ skt1 @ ( sk5 @ skt1 @ sk1 @ sk2 ) @ sk2 )
!= ( '\'const/sets/IN\'' @ skt1 @ ( sk5 @ skt1 @ sk1 @ sk2 ) @ sk1 ) ),
inference(simp,[status(thm)],[7463]) ).
thf(9298,plain,
( ( '\'const/sets/IN\'' @ skt1 @ ( sk5 @ skt1 @ sk1 @ sk2 ) @ sk2 )
| ( '\'const/sets/IN\'' @ skt1 @ ( sk5 @ skt1 @ sk1 @ sk2 ) @ sk1 ) ),
inference(bool_ext,[status(thm)],[7608]) ).
thf(203,plain,
! [TA: $tType,B: TA > $o,A: TA > $o] :
( ! [C: TA] :
( ( '\'const/sets/IN\'' @ TA @ C @ A )
=> ( '\'const/sets/IN\'' @ TA @ C @ B ) )
| ( sk2 = sk1 )
| ( ( '\'const/sets/SUBSET\'' @ TA @ A @ B )
!= ( '\'const/sets/SUBSET\'' @ skt1 @ sk1 @ sk2 ) ) ),
inference(paramod_ordered,[status(thm)],[17,24]) ).
thf(204,plain,
( ! [A: skt1] :
( ( '\'const/sets/IN\'' @ skt1 @ A @ sk1 )
=> ( '\'const/sets/IN\'' @ skt1 @ A @ sk2 ) )
| ( sk2 = sk1 ) ),
inference(pattern_uni,[status(thm)],[203:[bind(A,$thf( sk1 )),bind(B,$thf( sk2 )),bind_type(TA,$thf( skt1 ))]]) ).
thf(246,plain,
! [A: skt1] :
( ( sk2 = sk1 )
| ~ ( '\'const/sets/IN\'' @ skt1 @ A @ sk1 )
| ( '\'const/sets/IN\'' @ skt1 @ A @ sk2 ) ),
inference(cnf,[status(esa)],[204]) ).
thf(13567,plain,
! [A: skt1] :
( ~ ( '\'const/sets/IN\'' @ skt1 @ A @ sk1 )
| ( '\'const/sets/IN\'' @ skt1 @ A @ sk2 ) ),
inference(simplifyReflect,[status(thm)],[246,1220]) ).
thf(13589,plain,
! [A: skt1] :
( ~ ( '\'const/sets/IN\'' @ skt1 @ A @ sk1 )
| ~ ( '\'const/sets/IN\'' @ skt1 @ ( sk5 @ skt1 @ sk1 @ sk2 ) @ sk1 )
| ( ( '\'const/sets/IN\'' @ skt1 @ A @ sk2 )
!= ( '\'const/sets/IN\'' @ skt1 @ ( sk5 @ skt1 @ sk1 @ sk2 ) @ sk2 ) ) ),
inference(paramod_ordered,[status(thm)],[13567,7608]) ).
thf(13590,plain,
( ~ ( '\'const/sets/IN\'' @ skt1 @ ( sk5 @ skt1 @ sk1 @ sk2 ) @ sk1 )
| ~ ( '\'const/sets/IN\'' @ skt1 @ ( sk5 @ skt1 @ sk1 @ sk2 ) @ sk1 ) ),
inference(pattern_uni,[status(thm)],[13589:[bind(A,$thf( sk5 @ skt1 @ sk1 @ sk2 ))]]) ).
thf(13687,plain,
~ ( '\'const/sets/IN\'' @ skt1 @ ( sk5 @ skt1 @ sk1 @ sk2 ) @ sk1 ),
inference(simp,[status(thm)],[13590]) ).
thf(13927,plain,
( ( '\'const/sets/IN\'' @ skt1 @ ( sk5 @ skt1 @ sk1 @ sk2 ) @ sk2 )
| $false ),
inference(rewrite,[status(thm)],[9298,13687]) ).
thf(13928,plain,
'\'const/sets/IN\'' @ skt1 @ ( sk5 @ skt1 @ sk1 @ sk2 ) @ sk2,
inference(simp,[status(thm)],[13927]) ).
thf(23,plain,
( ( '\'const/sets/SUBSET\'' @ skt1 @ sk2 @ sk1 )
| ( sk2 = sk1 ) ),
inference(cnf,[status(esa)],[21]) ).
thf(217,plain,
! [TA: $tType,B: TA > $o,A: TA > $o] :
( ! [C: TA] :
( ( '\'const/sets/IN\'' @ TA @ C @ A )
=> ( '\'const/sets/IN\'' @ TA @ C @ B ) )
| ( sk2 = sk1 )
| ( ( '\'const/sets/SUBSET\'' @ TA @ A @ B )
!= ( '\'const/sets/SUBSET\'' @ skt1 @ sk2 @ sk1 ) ) ),
inference(paramod_ordered,[status(thm)],[17,23]) ).
thf(218,plain,
( ! [A: skt1] :
( ( '\'const/sets/IN\'' @ skt1 @ A @ sk2 )
=> ( '\'const/sets/IN\'' @ skt1 @ A @ sk1 ) )
| ( sk2 = sk1 ) ),
inference(pattern_uni,[status(thm)],[217:[bind(A,$thf( sk2 )),bind(B,$thf( sk1 )),bind_type(TA,$thf( skt1 ))]]) ).
thf(251,plain,
! [A: skt1] :
( ( sk2 = sk1 )
| ~ ( '\'const/sets/IN\'' @ skt1 @ A @ sk2 )
| ( '\'const/sets/IN\'' @ skt1 @ A @ sk1 ) ),
inference(cnf,[status(esa)],[218]) ).
thf(16136,plain,
! [A: skt1] :
( ~ ( '\'const/sets/IN\'' @ skt1 @ A @ sk2 )
| ( '\'const/sets/IN\'' @ skt1 @ A @ sk1 ) ),
inference(simplifyReflect,[status(thm)],[251,1220]) ).
thf(16144,plain,
! [A: skt1] :
( ( '\'const/sets/IN\'' @ skt1 @ A @ sk1 )
| ( ( '\'const/sets/IN\'' @ skt1 @ ( sk5 @ skt1 @ sk1 @ sk2 ) @ sk2 )
!= ( '\'const/sets/IN\'' @ skt1 @ A @ sk2 ) ) ),
inference(paramod_ordered,[status(thm)],[13928,16136]) ).
thf(16145,plain,
'\'const/sets/IN\'' @ skt1 @ ( sk5 @ skt1 @ sk1 @ sk2 ) @ sk1,
inference(pattern_uni,[status(thm)],[16144:[bind(A,$thf( sk5 @ skt1 @ sk1 @ sk2 ))]]) ).
thf(16186,plain,
$false,
inference(rewrite,[status(thm)],[16145,13687]) ).
thf(16187,plain,
$false,
inference(simp,[status(thm)],[16186]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SEV448^1 : TPTP v8.2.0. Released v7.0.0.
% 0.16/0.15 % Command : run_Leo-III %s %d
% 0.16/0.36 % Computer : n008.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 : Sun May 19 19:00:54 EDT 2024
% 0.16/0.36 % CPUTime :
% 0.92/0.85 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.18/0.95 % [INFO] Parsing done (99ms).
% 1.18/0.96 % [INFO] Running in sequential loop mode.
% 1.55/1.16 % [INFO] nitpick registered as external prover.
% 1.55/1.16 % [INFO] Scanning for conjecture ...
% 1.66/1.21 % [INFO] Found a conjecture (or negated_conjecture) and 3 axioms. Running axiom selection ...
% 1.66/1.23 % [INFO] Axiom selection finished. Selected 3 axioms (removed 0 axioms).
% 1.83/1.24 % [INFO] Problem is higher-order (TPTP THF).
% 1.83/1.24 % [INFO] Type checking passed.
% 1.83/1.24 % [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 ...
% 101.69/15.02 % [INFO] Killing All external provers ...
% 101.69/15.03 % Time passed: 14501ms (effective reasoning time: 14061ms)
% 101.69/15.03 % 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)>
% 101.69/15.03 % Axioms used in derivation (2): thm/sets/EXTENSION_, thm/sets/SUBSET_
% 101.69/15.03 % No. of inferences in proof: 59
% 101.69/15.03 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 14501 ms resp. 14061 ms w/o parsing
% 101.75/15.06 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 101.75/15.06 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------