TSTP Solution File: SEV447^1 by Leo-III-SAT---1.7.15
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.15
% Problem : SEV447^1 : TPTP v8.2.0. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d SAT
% Computer : n020.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 Jun 24 16:00:17 EDT 2024
% Result : Theorem 161.03s 23.02s
% Output : Refutation 161.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 3
% Syntax : Number of formulae : 60 ( 23 unt; 0 typ; 0 def)
% Number of atoms : 382 ( 109 equ; 0 cnn)
% Maximal formula atoms : 5 ( 6 avg)
% Number of connectives : 529 ( 86 ~; 45 |; 0 &; 398 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 35 ( 35 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 4 con; 0-3 aty)
% Number of variables : 124 ( 13 ^ 100 !; 11 ?; 124 :)
% Comments :
%------------------------------------------------------------------------------
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(sk3_type,type,
sk3: skt1 ).
thf(sk5_type,type,
sk5:
!>[TA: $tType] : ( TA > skt1 ) ).
thf(sk78_type,type,
sk78: skt1 ).
thf(3,axiom,
! [TA: $tType,A: TA > $o,B: TA] :
( ( '\'const/sets/IN\'' @ TA @ B @ A )
= ( A @ B ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/sets/IN_') ).
thf(8,plain,
! [TA: $tType,A: TA > $o,B: TA] :
( ( '\'const/sets/IN\'' @ TA @ B @ A )
= ( A @ B ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(9,plain,
! [TA: $tType,B: TA,A: TA > $o] :
( ( '\'const/sets/IN\'' @ TA @ B @ A )
= ( A @ B ) ),
inference(cnf,[status(esa)],[8]) ).
thf(10,plain,
! [TA: $tType,B: TA,A: TA > $o] :
( ( '\'const/sets/IN\'' @ TA @ B @ A )
= ( A @ B ) ),
inference(lifteq,[status(thm)],[9]) ).
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(11,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(12,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)],[11]) ).
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(lifteq,[status(thm)],[12]) ).
thf(115,plain,
! [TA: $tType,TB: $tType,D: TB > $o,C: TB > $o,B: TA,A: TA > $o] :
( ( ( '\'const/sets/IN\'' @ TA @ B @ A )
= ( ! [E: TB] :
( ( '\'const/sets/IN\'' @ TB @ E @ C )
= ( '\'const/sets/IN\'' @ TB @ E @ D ) ) ) )
| ( ( A @ B )
!= ( C = D ) ) ),
inference(paramod_ordered,[status(thm)],[10,13]) ).
thf(134,plain,
! [TA: $tType,TB: $tType,C: TA > TB > $o,B: TA > TB > $o,A: TA] :
( ( '\'const/sets/IN\'' @ TA @ A
@ ^ [D: TA] :
( ( B @ D )
= ( C @ D ) ) )
= ( ! [D: TB] :
( ( '\'const/sets/IN\'' @ TB @ D @ ( B @ A ) )
= ( '\'const/sets/IN\'' @ TB @ D @ ( C @ A ) ) ) ) ),
inference(pre_uni,[status(thm)],[115:[bind(A,$thf( ^ [G: TA] : ( ( E @ G ) = ( F @ G ) ) )),bind(B,$thf( B )),bind(C,$thf( E @ B )),bind(D,$thf( F @ B ))]]) ).
thf(142,plain,
! [TA: $tType,TB: $tType,C: TA > TB > $o,B: TA > TB > $o,A: TA] :
( ( '\'const/sets/IN\'' @ TA @ A
@ ^ [D: TA] :
( ( B @ D )
= ( C @ D ) ) )
= ( ! [D: TB] :
( ( '\'const/sets/IN\'' @ TB @ D @ ( B @ A ) )
= ( '\'const/sets/IN\'' @ TB @ D @ ( C @ A ) ) ) ) ),
inference(simp,[status(thm)],[134]) ).
thf(1,conjecture,
! [TA: $tType,A: TA > $o,B: TA > $o] :
( ( A != B )
= ( ? [C: TA] :
( ( '\'const/sets/IN\'' @ TA @ C @ B )
= ( ~ ( '\'const/sets/IN\'' @ TA @ C @ A ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/sets/NOT_EQUAL_SETS_') ).
thf(2,negated_conjecture,
~ ! [TA: $tType,A: TA > $o,B: TA > $o] :
( ( A != B )
= ( ? [C: TA] :
( ( '\'const/sets/IN\'' @ TA @ C @ B )
= ( ~ ( '\'const/sets/IN\'' @ TA @ C @ A ) ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(5,plain,
~ ! [TA: $tType,A: TA > $o,B: TA > $o] :
( ( A != B )
= ( ? [C: TA] :
( ( '\'const/sets/IN\'' @ TA @ C @ B )
= ( ~ ( '\'const/sets/IN\'' @ TA @ C @ A ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(6,plain,
( ( sk1 != sk2 )
!= ( ? [A: skt1] :
( ( '\'const/sets/IN\'' @ skt1 @ A @ sk2 )
= ( ~ ( '\'const/sets/IN\'' @ skt1 @ A @ sk1 ) ) ) ) ),
inference(cnf,[status(esa)],[5]) ).
thf(7,plain,
( ( sk1 != sk2 )
!= ( ? [A: skt1] :
( ( '\'const/sets/IN\'' @ skt1 @ A @ sk2 )
= ( ~ ( '\'const/sets/IN\'' @ skt1 @ A @ sk1 ) ) ) ) ),
inference(lifteq,[status(thm)],[6]) ).
thf(23,plain,
! [TA: $tType,B: TA,A: TA > $o] :
( ( ( ~ ( '\'const/sets/IN\'' @ TA @ B @ A ) )
!= ( ? [C: skt1] :
( ( '\'const/sets/IN\'' @ skt1 @ C @ sk2 )
= ( ~ ( '\'const/sets/IN\'' @ skt1 @ C @ sk1 ) ) ) ) )
| ( ( A @ B )
!= ( sk1 = sk2 ) ) ),
inference(paramod_ordered,[status(thm)],[10,7]) ).
thf(26,plain,
! [TA: $tType,A: TA] :
( ( ~ ( '\'const/sets/IN\'' @ TA @ A
@ ^ [B: TA] : ( sk1 = sk2 ) ) )
!= ( ? [B: skt1] :
( ( '\'const/sets/IN\'' @ skt1 @ B @ sk2 )
= ( ~ ( '\'const/sets/IN\'' @ skt1 @ B @ sk1 ) ) ) ) ),
inference(pre_uni,[status(thm)],[23:[bind(A,$thf( ^ [C: TA] : ( sk1 = sk2 ) )),bind(B,$thf( B ))]]) ).
thf(28,plain,
! [TA: $tType,A: TA] :
( ( ~ ( '\'const/sets/IN\'' @ TA @ A
@ ^ [B: TA] : ( sk1 = sk2 ) ) )
!= ( ? [B: skt1] :
( ( '\'const/sets/IN\'' @ skt1 @ B @ sk2 )
= ( ~ ( '\'const/sets/IN\'' @ skt1 @ B @ sk1 ) ) ) ) ),
inference(simp,[status(thm)],[26]) ).
thf(48,plain,
! [TA: $tType,A: TA] :
( ~ ( '\'const/sets/IN\'' @ TA @ A
@ ^ [B: TA] : ( sk1 = sk2 ) )
| ? [B: skt1] :
( ( '\'const/sets/IN\'' @ skt1 @ B @ sk2 )
= ( ~ ( '\'const/sets/IN\'' @ skt1 @ B @ sk1 ) ) ) ),
inference(bool_ext,[status(thm)],[28]) ).
thf(58,plain,
! [TA: $tType,A: TA] :
( ( ( '\'const/sets/IN\'' @ skt1 @ ( sk5 @ TA @ A ) @ sk2 )
= ( ~ ( '\'const/sets/IN\'' @ skt1 @ ( sk5 @ TA @ A ) @ sk1 ) ) )
| ~ ( '\'const/sets/IN\'' @ TA @ A
@ ^ [B: TA] : ( sk1 = sk2 ) ) ),
inference(cnf,[status(esa)],[48]) ).
thf(59,plain,
! [TA: $tType,A: TA] :
( ( ( '\'const/sets/IN\'' @ skt1 @ ( sk5 @ TA @ A ) @ sk2 )
= ( ~ ( '\'const/sets/IN\'' @ skt1 @ ( sk5 @ TA @ A ) @ sk1 ) ) )
| ~ ( '\'const/sets/IN\'' @ TA @ A
@ ^ [B: TA] : ( sk1 = sk2 ) ) ),
inference(lifteq,[status(thm)],[58]) ).
thf(14,plain,
( ~ ( ( sk1 != sk2 ) )
| ~ ? [A: skt1] :
( ( '\'const/sets/IN\'' @ skt1 @ A @ sk2 )
= ( ~ ( '\'const/sets/IN\'' @ skt1 @ A @ sk1 ) ) ) ),
inference(bool_ext,[status(thm)],[7]) ).
thf(16,plain,
! [A: skt1] :
( ( ( '\'const/sets/IN\'' @ skt1 @ A @ sk2 )
!= ( ~ ( '\'const/sets/IN\'' @ skt1 @ A @ sk1 ) ) )
| ( sk1 = sk2 ) ),
inference(cnf,[status(esa)],[14]) ).
thf(17,plain,
! [A: skt1] :
( ( ( '\'const/sets/IN\'' @ skt1 @ A @ sk2 )
!= ( ~ ( '\'const/sets/IN\'' @ skt1 @ A @ sk1 ) ) )
| ( sk2 = sk1 ) ),
inference(lifteq,[status(thm)],[16]) ).
thf(1700,plain,
! [TA: $tType,B: skt1,A: TA] :
( ~ ( '\'const/sets/IN\'' @ TA @ A
@ ^ [C: TA] : ( sk1 = sk2 ) )
| ( ( '\'const/sets/IN\'' @ skt1 @ ( sk5 @ TA @ A ) @ sk1 )
!= ( '\'const/sets/IN\'' @ skt1 @ B @ sk1 ) )
| ( sk2 = sk1 )
| ( ( '\'const/sets/IN\'' @ skt1 @ ( sk5 @ TA @ A ) @ sk2 )
!= ( '\'const/sets/IN\'' @ skt1 @ B @ sk2 ) ) ),
inference(paramod_ordered,[status(thm)],[59,17]) ).
thf(1701,plain,
! [TA: $tType,A: TA] :
( ~ ( '\'const/sets/IN\'' @ TA @ A
@ ^ [B: TA] : ( sk1 = sk2 ) )
| ( ( '\'const/sets/IN\'' @ skt1 @ ( sk5 @ TA @ A ) @ sk1 )
!= ( '\'const/sets/IN\'' @ skt1 @ ( sk5 @ TA @ A ) @ sk1 ) )
| ( sk2 = sk1 ) ),
inference(pattern_uni,[status(thm)],[1700:[bind(A,$thf( C )),bind(B,$thf( sk5 @ TA @ C ))]]) ).
thf(1879,plain,
! [TA: $tType,A: TA] :
( ~ ( '\'const/sets/IN\'' @ TA @ A
@ ^ [B: TA] : ( sk1 = sk2 ) )
| ( sk2 = sk1 ) ),
inference(simp,[status(thm)],[1701]) ).
thf(15,plain,
( ( sk1 != sk2 )
| ? [A: skt1] :
( ( '\'const/sets/IN\'' @ skt1 @ A @ sk2 )
= ( ~ ( '\'const/sets/IN\'' @ skt1 @ A @ sk1 ) ) ) ),
inference(bool_ext,[status(thm)],[7]) ).
thf(18,plain,
( ( ( '\'const/sets/IN\'' @ skt1 @ sk3 @ sk2 )
= ( ~ ( '\'const/sets/IN\'' @ skt1 @ sk3 @ sk1 ) ) )
| ( sk1 != sk2 ) ),
inference(cnf,[status(esa)],[15]) ).
thf(19,plain,
( ( ( '\'const/sets/IN\'' @ skt1 @ sk3 @ sk2 )
= ( ~ ( '\'const/sets/IN\'' @ skt1 @ sk3 @ sk1 ) ) )
| ( sk2 != sk1 ) ),
inference(lifteq,[status(thm)],[18]) ).
thf(157,plain,
! [TA: $tType,B: TA,A: TA > $o] :
( ( ( ~ ( A @ B ) )
= ( '\'const/sets/IN\'' @ skt1 @ sk3 @ sk2 ) )
| ( sk2 != sk1 )
| ( ( '\'const/sets/IN\'' @ TA @ B @ A )
!= ( '\'const/sets/IN\'' @ skt1 @ sk3 @ sk1 ) ) ),
inference(paramod_ordered,[status(thm)],[10,19]) ).
thf(158,plain,
( ( ( ~ ( sk1 @ sk3 ) )
= ( '\'const/sets/IN\'' @ skt1 @ sk3 @ sk2 ) )
| ( sk2 != sk1 ) ),
inference(pattern_uni,[status(thm)],[157:[bind(A,$thf( sk1 )),bind(B,$thf( sk3 )),bind_type(TA,$thf( skt1 ))]]) ).
thf(5057,plain,
( ( sk2 != sk1 )
| ( ( sk1 @ sk3 )
= ( '\'const/sets/IN\'' @ skt1 @ sk3 @ sk2 ) )
| ( ( '\'const/sets/IN\'' @ skt1 @ sk3 @ sk2 )
!= ( '\'const/sets/IN\'' @ skt1 @ sk3 @ sk1 ) ) ),
inference(paramod_ordered,[status(thm)],[158,19]) ).
thf(5101,plain,
( ( ( sk1 @ sk3 )
= ( '\'const/sets/IN\'' @ skt1 @ sk3 @ sk2 ) )
| ( sk2 != sk1 )
| ( sk3 != sk3 )
| ( sk2 != sk1 ) ),
inference(simp,[status(thm)],[5057]) ).
thf(5164,plain,
( ( ( sk1 @ sk3 )
= ( '\'const/sets/IN\'' @ skt1 @ sk3 @ sk2 ) )
| ( sk2 != sk1 ) ),
inference(simp,[status(thm)],[5101]) ).
thf(6844,plain,
( ( sk2 != sk1 )
| ( ( sk1 @ sk3 )
!= ( sk1 @ sk3 ) ) ),
inference(paramod_ordered,[status(thm)],[5164,158]) ).
thf(6845,plain,
sk2 != sk1,
inference(pattern_uni,[status(thm)],[6844:[]]) ).
thf(14580,plain,
! [TA: $tType,A: TA] :
~ ( '\'const/sets/IN\'' @ TA @ A
@ ^ [B: TA] : ( sk1 = sk2 ) ),
inference(simplifyReflect,[status(thm)],[1879,6845]) ).
thf(14610,plain,
! [TA: $tType,TB: $tType,TC: $tType,D: TC,C: TA > TB > $o,B: TA > TB > $o,A: TA] :
( ~ ! [E: TB] :
( ( '\'const/sets/IN\'' @ TB @ E @ ( B @ A ) )
= ( '\'const/sets/IN\'' @ TB @ E @ ( C @ A ) ) )
| ( ( '\'const/sets/IN\'' @ TA @ A
@ ^ [E: TA] :
( ( B @ E )
= ( C @ E ) ) )
!= ( '\'const/sets/IN\'' @ TC @ D
@ ^ [E: TC] : ( sk1 = sk2 ) ) ) ),
inference(paramod_ordered,[status(thm)],[142,14580]) ).
thf(14611,plain,
~ ! [A: skt1] :
( ( '\'const/sets/IN\'' @ skt1 @ A @ sk1 )
= ( '\'const/sets/IN\'' @ skt1 @ A @ sk2 ) ),
inference(pattern_uni,[status(thm)],[14610:[bind(A,$thf( A )),bind(B,$thf( ^ [E: TC] : sk1 )),bind(C,$thf( ^ [E: TC] : sk2 )),bind(D,$thf( A )),bind_type(TA,$thf( TC )),bind_type(TB,$thf( skt1 ))]]) ).
thf(14655,plain,
( ( '\'const/sets/IN\'' @ skt1 @ sk78 @ sk1 )
!= ( '\'const/sets/IN\'' @ skt1 @ sk78 @ sk2 ) ),
inference(cnf,[status(esa)],[14611]) ).
thf(14656,plain,
( ( '\'const/sets/IN\'' @ skt1 @ sk78 @ sk2 )
!= ( '\'const/sets/IN\'' @ skt1 @ sk78 @ sk1 ) ),
inference(lifteq,[status(thm)],[14655]) ).
thf(14681,plain,
( ( '\'const/sets/IN\'' @ skt1 @ sk78 @ sk2 )
| ( '\'const/sets/IN\'' @ skt1 @ sk78 @ sk1 ) ),
inference(bool_ext,[status(thm)],[14656]) ).
thf(203,plain,
! [A: skt1] :
( ( sk2 = sk1 )
| ~ ( '\'const/sets/IN\'' @ skt1 @ A @ sk2 )
| ~ ~ ( '\'const/sets/IN\'' @ skt1 @ A @ sk1 ) ),
inference(bool_ext,[status(thm)],[17]) ).
thf(250,plain,
! [A: skt1] :
( ( '\'const/sets/IN\'' @ skt1 @ A @ sk1 )
| ~ ( '\'const/sets/IN\'' @ skt1 @ A @ sk2 )
| ( sk2 = sk1 ) ),
inference(cnf,[status(esa)],[203]) ).
thf(32526,plain,
! [A: skt1] :
( ( '\'const/sets/IN\'' @ skt1 @ A @ sk1 )
| ~ ( '\'const/sets/IN\'' @ skt1 @ A @ sk2 ) ),
inference(simplifyReflect,[status(thm)],[250,6845]) ).
thf(32553,plain,
! [A: skt1] :
( ( '\'const/sets/IN\'' @ skt1 @ sk78 @ sk1 )
| ( '\'const/sets/IN\'' @ skt1 @ A @ sk1 )
| ( ( '\'const/sets/IN\'' @ skt1 @ sk78 @ sk2 )
!= ( '\'const/sets/IN\'' @ skt1 @ A @ sk2 ) ) ),
inference(paramod_ordered,[status(thm)],[14681,32526]) ).
thf(32554,plain,
( ( '\'const/sets/IN\'' @ skt1 @ sk78 @ sk1 )
| ( '\'const/sets/IN\'' @ skt1 @ sk78 @ sk1 ) ),
inference(pattern_uni,[status(thm)],[32553:[bind(A,$thf( sk78 ))]]) ).
thf(32587,plain,
'\'const/sets/IN\'' @ skt1 @ sk78 @ sk1,
inference(simp,[status(thm)],[32554]) ).
thf(204,plain,
! [A: skt1] :
( ( sk2 = sk1 )
| ( '\'const/sets/IN\'' @ skt1 @ A @ sk2 )
| ~ ( '\'const/sets/IN\'' @ skt1 @ A @ sk1 ) ),
inference(bool_ext,[status(thm)],[17]) ).
thf(251,plain,
! [A: skt1] :
( ~ ( '\'const/sets/IN\'' @ skt1 @ A @ sk1 )
| ( '\'const/sets/IN\'' @ skt1 @ A @ sk2 )
| ( sk2 = sk1 ) ),
inference(cnf,[status(esa)],[204]) ).
thf(33094,plain,
! [A: skt1] :
( ~ ( '\'const/sets/IN\'' @ skt1 @ A @ sk1 )
| ( '\'const/sets/IN\'' @ skt1 @ A @ sk2 ) ),
inference(simplifyReflect,[status(thm)],[251,6845]) ).
thf(33155,plain,
! [A: skt1] :
( ( '\'const/sets/IN\'' @ skt1 @ A @ sk2 )
| ( ( '\'const/sets/IN\'' @ skt1 @ sk78 @ sk1 )
!= ( '\'const/sets/IN\'' @ skt1 @ A @ sk1 ) ) ),
inference(paramod_ordered,[status(thm)],[32587,33094]) ).
thf(33156,plain,
'\'const/sets/IN\'' @ skt1 @ sk78 @ sk2,
inference(pattern_uni,[status(thm)],[33155:[bind(A,$thf( sk78 ))]]) ).
thf(14680,plain,
( ~ ( '\'const/sets/IN\'' @ skt1 @ sk78 @ sk2 )
| ~ ( '\'const/sets/IN\'' @ skt1 @ sk78 @ sk1 ) ),
inference(bool_ext,[status(thm)],[14656]) ).
thf(32606,plain,
( ~ ( '\'const/sets/IN\'' @ skt1 @ sk78 @ sk2 )
| ~ $true ),
inference(rewrite,[status(thm)],[14680,32587]) ).
thf(32607,plain,
~ ( '\'const/sets/IN\'' @ skt1 @ sk78 @ sk2 ),
inference(simp,[status(thm)],[32606]) ).
thf(33739,plain,
$false,
inference(rewrite,[status(thm)],[33156,32607]) ).
thf(33740,plain,
$false,
inference(simp,[status(thm)],[33739]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SEV447^1 : TPTP v8.2.0. Released v7.0.0.
% 0.00/0.11 % Command : run_Leo-III %s %d SAT
% 0.10/0.32 % Computer : n020.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Fri Jun 21 19:40:10 EDT 2024
% 0.10/0.32 % CPUTime :
% 0.85/0.86 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.17/0.97 % [INFO] Parsing done (107ms).
% 1.17/0.97 % [INFO] Running in sequential loop mode.
% 1.61/1.19 % [INFO] nitpick registered as external prover.
% 1.61/1.20 % [INFO] Scanning for conjecture ...
% 1.80/1.25 % [INFO] Found a conjecture (or negated_conjecture) and 2 axioms. Running axiom selection ...
% 1.80/1.28 % [INFO] Axiom selection finished. Selected 2 axioms (removed 0 axioms).
% 1.80/1.28 % [INFO] Problem is higher-order (TPTP THF).
% 1.80/1.29 % [INFO] Type checking passed.
% 1.80/1.29 % [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 ...
% 161.03/23.02 % [INFO] Killing All external provers ...
% 161.03/23.02 % Time passed: 22498ms (effective reasoning time: 22042ms)
% 161.03/23.02 % 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)>
% 161.03/23.02 % Axioms used in derivation (2): thm/sets/IN_, thm/sets/EXTENSION_
% 161.03/23.02 % No. of inferences in proof: 60
% 161.03/23.02 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 22498 ms resp. 22042 ms w/o parsing
% 161.03/23.06 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 161.03/23.06 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------