%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SEV448^1 : TPTP v9.3.1. Released v7.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 : n011.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:37:18 AM UTC 2026
% Result : Theorem 62.57s 15.25s
% Output : Refutation 63.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 39
% Number of leaves : 7
% Syntax : Number of formulae : 71 ( 21 unt; 0 typ; 4 def)
% Number of atoms : 505 ( 100 equ; 0 cnn)
% Maximal formula atoms : 8 ( 7 avg)
% Number of connectives : 691 ( 86 ~; 74 |; 13 &; 507 @)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 44 ( 44 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 89 ( 3 ^; 82 !; 0 ?; 89 :)
% ( 0 !>; 0 ?*; 0 @-; 4 @+)
% Comments :
%------------------------------------------------------------------------------
thf(skt1_type,type,
skt1: $tType ).
thf('const/sets/SUBSET_decl',type,
'const/sets/SUBSET':
!>[TA: $tType] : ( ( TA > $o ) > ( TA > $o ) > $o ) ).
thf('const/sets/IN_decl',type,
'const/sets/IN':
!>[TA: $tType] : ( TA > ( TA > $o ) > $o ) ).
thf(sk1_decl,type,
sk1: skt1 > $o ).
thf(sk2_decl,type,
sk2: skt1 > $o ).
thf(sk5_decl,type,
sk5:
!>[TA: $tType] : ( ( TA > $o ) > ( TA > $o ) > TA ) ).
thf(sk7_decl,type,
sk7: skt1 ).
thf(sk1_def,definition,
( sk1
= ( @+[A: skt1 > $o] :
~ ! [B: skt1 > $o] :
( ( ( 'const/sets/SUBSET' @ skt1 @ A @ B )
& ( 'const/sets/SUBSET' @ skt1 @ B @ A ) )
= ( A = B ) ) ) ) ).
thf(sk2_def,definition,
( sk2
= ( @+[A: skt1 > $o] :
( ( ( 'const/sets/SUBSET' @ skt1 @ sk1 @ A )
& ( 'const/sets/SUBSET' @ skt1 @ A @ sk1 ) )
!= ( sk1 = A ) ) ) ) ).
thf(sk5_def,definition,
( sk5
= ( ^ [TA: $tType,A: TA > $o,B: TA > $o] :
@+[C: TA] :
( ( 'const/sets/IN' @ TA @ C @ B )
!= ( 'const/sets/IN' @ TA @ C @ A ) ) ) ) ).
thf(sk7_def,definition,
( sk7
= ( @+[A: skt1] :
~ ( ( 'const/sets/IN' @ skt1 @ A @ sk1 )
=> ( 'const/sets/IN' @ skt1 @ A @ sk2 ) ) ) ) ).
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(196,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(201,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)],[196]) ).
thf(210,plain,
! [TA: $tType,B: TA > $o,A: TA > $o] :
( ( A = B )
| ( ( 'const/sets/IN' @ TA @ ( sk5 @ TA @ B @ A ) @ A )
!= ( 'const/sets/IN' @ TA @ ( sk5 @ TA @ B @ A ) @ B ) ) ),
inference(cnf,[status(esa)],[201]) ).
thf(211,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)],[210]) ).
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(23,plain,
( ( ( sk2 = sk1 )
| ( 'const/sets/SUBSET' @ skt1 @ sk1 @ sk2 ) )
& ( ( sk2 = sk1 )
| ( 'const/sets/SUBSET' @ skt1 @ sk2 @ sk1 ) ) ),
inference(cnf,[status(esa)],[21]) ).
thf(24,plain,
( ( sk2 = sk1 )
| ( 'const/sets/SUBSET' @ skt1 @ sk1 @ sk2 ) ),
inference(cnfConj,[status(thm)],[23]) ).
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,
( ( sk2 != sk1 )
| ~ ( 'const/sets/SUBSET' @ skt1 @ sk1 @ sk2 )
| ~ ( 'const/sets/SUBSET' @ skt1 @ sk2 @ sk1 ) ),
inference(cnf,[status(esa)],[20]) ).
thf(78,plain,
( ( sk2 != sk1 )
| ~ ( 'const/sets/SUBSET' @ skt1 @ sk1 @ sk2 )
| ( ( 'const/sets/SUBSET' @ skt1 @ sk2 @ sk1 )
!= ( 'const/sets/SUBSET' @ skt1 @ sk1 @ sk2 ) )
| ~ $true ),
inference(eqfactor_ordered,[status(thm)],[22]) ).
thf(82,plain,
( ( sk2 != sk1 )
| ~ ( 'const/sets/SUBSET' @ skt1 @ sk1 @ sk2 )
| ( sk2 != sk1 )
| ( sk2 != sk1 ) ),
inference(simp,[status(thm)],[78]) ).
thf(84,plain,
( ( sk2 != sk1 )
| ~ ( 'const/sets/SUBSET' @ skt1 @ sk1 @ sk2 ) ),
inference(simp,[status(thm)],[82]) ).
thf(222,plain,
! [TA: $tType,B: TA > $o,A: TA > $o] :
( ( sk2 != sk1 )
| ~ ! [C: TA] :
( ( 'const/sets/IN' @ TA @ C @ A )
=> ( 'const/sets/IN' @ TA @ C @ B ) )
| ( ( 'const/sets/SUBSET' @ TA @ A @ B )
!= ( 'const/sets/SUBSET' @ skt1 @ sk1 @ sk2 ) ) ),
inference(paramod_ordered,[status(thm)],[17,84]) ).
thf(223,plain,
( ( sk2 != sk1 )
| ~ ! [A: skt1] :
( ( 'const/sets/IN' @ skt1 @ A @ sk1 )
=> ( 'const/sets/IN' @ skt1 @ A @ sk2 ) ) ),
inference(pattern_uni,[status(thm)],[222:[bind(A,$thf( sk1 )),bind(B,$thf( sk2 )),bind_type(TA,$thf( skt1 ))]]) ).
thf(270,plain,
( ( ( sk2 != sk1 )
| ( 'const/sets/IN' @ skt1 @ sk7 @ sk1 ) )
& ( ( sk2 != sk1 )
| ~ ( 'const/sets/IN' @ skt1 @ sk7 @ sk2 ) ) ),
inference(cnf,[status(esa)],[223]) ).
thf(271,plain,
( ( sk2 != sk1 )
| ( 'const/sets/IN' @ skt1 @ sk7 @ sk1 ) ),
inference(cnfConj,[status(thm)],[270]) ).
thf(408,plain,
( ( 'const/sets/SUBSET' @ skt1 @ sk1 @ sk2 )
| ( sk1 != sk1 )
| ( 'const/sets/IN' @ skt1 @ sk7 @ sk1 )
| ( sk2 != sk2 ) ),
inference(paramod_ordered,[status(thm)],[24,271]) ).
thf(409,plain,
( ( 'const/sets/SUBSET' @ skt1 @ sk1 @ sk2 )
| ( 'const/sets/IN' @ skt1 @ sk7 @ sk1 )
| ( sk2 != sk2 ) ),
inference(simp,[status(thm)],[408]) ).
thf(410,plain,
( ( 'const/sets/SUBSET' @ skt1 @ sk1 @ sk2 )
| ( 'const/sets/IN' @ skt1 @ sk7 @ sk1 ) ),
inference(pattern_uni,[status(thm)],[409:[]]) ).
thf(272,plain,
( ( sk2 != sk1 )
| ~ ( 'const/sets/IN' @ skt1 @ sk7 @ sk2 ) ),
inference(cnfConj,[status(thm)],[270]) ).
thf(723,plain,
( ( 'const/sets/SUBSET' @ skt1 @ sk1 @ sk2 )
| ( sk2 != sk1 )
| ~ $true
| ( ( 'const/sets/IN' @ skt1 @ sk7 @ sk2 )
!= ( 'const/sets/IN' @ skt1 @ sk7 @ sk1 ) ) ),
inference(paramod_ordered,[status(thm)],[410,272]) ).
thf(724,plain,
( ( 'const/sets/SUBSET' @ skt1 @ sk1 @ sk2 )
| ( sk2 != sk1 )
| ( ( 'const/sets/IN' @ skt1 @ sk7 @ sk2 )
!= ( 'const/sets/IN' @ skt1 @ sk7 @ sk1 ) ) ),
inference(simp,[status(thm)],[723]) ).
thf(733,plain,
( ( 'const/sets/SUBSET' @ skt1 @ sk1 @ sk2 )
| ( sk2 != sk1 )
| ( sk7 != sk7 )
| ( sk2 != sk1 ) ),
inference(simp,[status(thm)],[724]) ).
thf(744,plain,
( ( 'const/sets/SUBSET' @ skt1 @ sk1 @ sk2 )
| ( sk2 != sk1 ) ),
inference(simp,[status(thm)],[733]) ).
thf(1450,plain,
( ( sk2 != sk1 )
| ( sk2 != sk1 )
| ~ $true
| ( ( 'const/sets/SUBSET' @ skt1 @ sk1 @ sk2 )
!= ( 'const/sets/SUBSET' @ skt1 @ sk1 @ sk2 ) ) ),
inference(paramod_ordered,[status(thm)],[744,84]) ).
thf(1451,plain,
( ( sk2 != sk1 )
| ( ( 'const/sets/SUBSET' @ skt1 @ sk1 @ sk2 )
!= ( 'const/sets/SUBSET' @ skt1 @ sk1 @ sk2 ) ) ),
inference(simp,[status(thm)],[1450]) ).
thf(1452,plain,
sk2 != sk1,
inference(pattern_uni,[status(thm)],[1451:[]]) ).
thf(9727,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 ) )
| ( A != sk1 )
| ( B != sk2 ) ),
inference(paramod_ordered,[status(thm)],[211,1452]) ).
thf(9728,plain,
! [A: skt1 > $o] :
( ( ( 'const/sets/IN' @ skt1 @ ( sk5 @ skt1 @ sk2 @ A ) @ A )
!= ( 'const/sets/IN' @ skt1 @ ( sk5 @ skt1 @ sk2 @ A ) @ sk2 ) )
| ( A != sk1 ) ),
inference(pattern_uni,[status(thm)],[9727:[bind(A,$thf( A )),bind(B,$thf( sk2 ))]]) ).
thf(9951,plain,
( ( 'const/sets/IN' @ skt1 @ ( sk5 @ skt1 @ sk2 @ sk1 ) @ sk2 )
!= ( 'const/sets/IN' @ skt1 @ ( sk5 @ skt1 @ sk2 @ sk1 ) @ sk1 ) ),
inference(simp,[status(thm)],[9728]) ).
thf(11347,plain,
( ( 'const/sets/IN' @ skt1 @ ( sk5 @ skt1 @ sk2 @ sk1 ) @ sk2 )
| ( 'const/sets/IN' @ skt1 @ ( sk5 @ skt1 @ sk2 @ sk1 ) @ sk1 ) ),
inference(bool_ext,[status(thm)],[9951]) ).
thf(236,plain,
! [TA: $tType,B: TA > $o,A: TA > $o] :
( ( sk2 = sk1 )
| ! [C: TA] :
( ( 'const/sets/IN' @ TA @ C @ A )
=> ( 'const/sets/IN' @ TA @ C @ B ) )
| ( ( 'const/sets/SUBSET' @ TA @ A @ B )
!= ( 'const/sets/SUBSET' @ skt1 @ sk1 @ sk2 ) ) ),
inference(paramod_ordered,[status(thm)],[17,24]) ).
thf(237,plain,
( ( sk2 = sk1 )
| ! [A: skt1] :
( ( 'const/sets/IN' @ skt1 @ A @ sk1 )
=> ( 'const/sets/IN' @ skt1 @ A @ sk2 ) ) ),
inference(pattern_uni,[status(thm)],[236:[bind(A,$thf( sk1 )),bind(B,$thf( sk2 )),bind_type(TA,$thf( skt1 ))]]) ).
thf(256,plain,
! [A: skt1] :
( ( sk2 = sk1 )
| ~ ( 'const/sets/IN' @ skt1 @ A @ sk1 )
| ( 'const/sets/IN' @ skt1 @ A @ sk2 ) ),
inference(cnf,[status(esa)],[237]) ).
thf(13550,plain,
! [A: skt1] :
( ~ ( 'const/sets/IN' @ skt1 @ A @ sk1 )
| ( 'const/sets/IN' @ skt1 @ A @ sk2 ) ),
inference(simplifyReflect,[status(thm)],[256,1452]) ).
thf(11346,plain,
( ~ ( 'const/sets/IN' @ skt1 @ ( sk5 @ skt1 @ sk2 @ sk1 ) @ sk2 )
| ~ ( 'const/sets/IN' @ skt1 @ ( sk5 @ skt1 @ sk2 @ sk1 ) @ sk1 ) ),
inference(bool_ext,[status(thm)],[9951]) ).
thf(13576,plain,
! [A: skt1] :
( ~ ( 'const/sets/IN' @ skt1 @ A @ sk1 )
| ~ $true
| ~ ( 'const/sets/IN' @ skt1 @ ( sk5 @ skt1 @ sk2 @ sk1 ) @ sk1 )
| ( ( 'const/sets/IN' @ skt1 @ A @ sk2 )
!= ( 'const/sets/IN' @ skt1 @ ( sk5 @ skt1 @ sk2 @ sk1 ) @ sk2 ) ) ),
inference(paramod_ordered,[status(thm)],[13550,11346]) ).
thf(13577,plain,
! [A: skt1] :
( ~ ( 'const/sets/IN' @ skt1 @ A @ sk1 )
| ~ ( 'const/sets/IN' @ skt1 @ ( sk5 @ skt1 @ sk2 @ sk1 ) @ sk1 )
| ( ( 'const/sets/IN' @ skt1 @ A @ sk2 )
!= ( 'const/sets/IN' @ skt1 @ ( sk5 @ skt1 @ sk2 @ sk1 ) @ sk2 ) ) ),
inference(simp,[status(thm)],[13576]) ).
thf(13578,plain,
( ~ ( 'const/sets/IN' @ skt1 @ ( sk5 @ skt1 @ sk2 @ sk1 ) @ sk1 )
| ~ ( 'const/sets/IN' @ skt1 @ ( sk5 @ skt1 @ sk2 @ sk1 ) @ sk1 ) ),
inference(pattern_uni,[status(thm)],[13577:[bind(A,$thf( sk5 @ skt1 @ sk2 @ sk1 ))]]) ).
thf(13683,plain,
~ ( 'const/sets/IN' @ skt1 @ ( sk5 @ skt1 @ sk2 @ sk1 ) @ sk1 ),
inference(simp,[status(thm)],[13578]) ).
thf(13703,plain,
( ( 'const/sets/IN' @ skt1 @ ( sk5 @ skt1 @ sk2 @ sk1 ) @ sk2 )
| $false ),
inference(rewrite,[status(thm)],[11347,13683]) ).
thf(13704,plain,
'const/sets/IN' @ skt1 @ ( sk5 @ skt1 @ sk2 @ sk1 ) @ sk2,
inference(simp,[status(thm)],[13703]) ).
thf(25,plain,
( ( sk2 = sk1 )
| ( 'const/sets/SUBSET' @ skt1 @ sk2 @ sk1 ) ),
inference(cnfConj,[status(thm)],[23]) ).
thf(240,plain,
! [TA: $tType,B: TA > $o,A: TA > $o] :
( ( sk2 = sk1 )
| ! [C: TA] :
( ( 'const/sets/IN' @ TA @ C @ A )
=> ( 'const/sets/IN' @ TA @ C @ B ) )
| ( ( 'const/sets/SUBSET' @ TA @ A @ B )
!= ( 'const/sets/SUBSET' @ skt1 @ sk2 @ sk1 ) ) ),
inference(paramod_ordered,[status(thm)],[17,25]) ).
thf(241,plain,
( ( sk2 = sk1 )
| ! [A: skt1] :
( ( 'const/sets/IN' @ skt1 @ A @ sk2 )
=> ( 'const/sets/IN' @ skt1 @ A @ sk1 ) ) ),
inference(pattern_uni,[status(thm)],[240:[bind(A,$thf( sk2 )),bind(B,$thf( sk1 )),bind_type(TA,$thf( skt1 ))]]) ).
thf(258,plain,
! [A: skt1] :
( ( sk2 = sk1 )
| ~ ( 'const/sets/IN' @ skt1 @ A @ sk2 )
| ( 'const/sets/IN' @ skt1 @ A @ sk1 ) ),
inference(cnf,[status(esa)],[241]) ).
thf(14614,plain,
! [A: skt1] :
( ~ ( 'const/sets/IN' @ skt1 @ A @ sk2 )
| ( 'const/sets/IN' @ skt1 @ A @ sk1 ) ),
inference(simplifyReflect,[status(thm)],[258,1452]) ).
thf(14618,plain,
! [A: skt1] :
( ~ $true
| ( 'const/sets/IN' @ skt1 @ A @ sk1 )
| ( ( 'const/sets/IN' @ skt1 @ ( sk5 @ skt1 @ sk2 @ sk1 ) @ sk2 )
!= ( 'const/sets/IN' @ skt1 @ A @ sk2 ) ) ),
inference(paramod_ordered,[status(thm)],[13704,14614]) ).
thf(14619,plain,
! [A: skt1] :
( ( 'const/sets/IN' @ skt1 @ A @ sk1 )
| ( ( 'const/sets/IN' @ skt1 @ ( sk5 @ skt1 @ sk2 @ sk1 ) @ sk2 )
!= ( 'const/sets/IN' @ skt1 @ A @ sk2 ) ) ),
inference(simp,[status(thm)],[14618]) ).
thf(14620,plain,
'const/sets/IN' @ skt1 @ ( sk5 @ skt1 @ sk2 @ sk1 ) @ sk1,
inference(pattern_uni,[status(thm)],[14619:[bind(A,$thf( sk5 @ skt1 @ sk2 @ sk1 ))]]) ).
thf(14666,plain,
$false,
inference(rewrite,[status(thm)],[14620,13683]) ).
thf(14667,plain,
$false,
inference(simp,[status(thm)],[14666]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEV448^1 : TPTP v9.3.1. Released v7.0.0.
% 0.00/0.07 % 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.09/0.21 % Computer : n011.cluster.edu
% 0.09/0.21 % Model : x86_64 x86_64
% 0.09/0.21 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.21 % Memory : 8046.5625MB
% 0.09/0.21 % OS : Linux 6.8.0-71-generic
% 0.09/0.21 % CPULimit : 300
% 0.09/0.21 % WCLimit : 300
% 0.09/0.21 % DateTime : Tue Sep 29 15:48:30 UTC 2026
% 0.09/0.21 % CPUTime :
% 0.09/0.21 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.95/0.71 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.33/0.90 % [INFO] Parsing done (182ms).
% 1.33/0.91 % [INFO] Running in sequential loop mode.
% 1.93/1.32 % [INFO] eprover registered as external prover.
% 1.93/1.32 % [INFO] Scanning for conjecture ...
% 2.12/1.42 % [INFO] Found a conjecture (or negated_conjecture) and 3 axioms. Running axiom selection ...
% 2.12/1.46 % [INFO] Axiom selection finished. Selected 3 axioms (removed 0 axioms).
% 2.12/1.47 % [INFO] Problem is higher-order (TPTP THF).
% 2.12/1.48 % [INFO] Type checking passed.
% 2.12/1.48 % [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 ...
% 62.57/15.24 % [INFO] Killing All external provers ...
% 62.57/15.25 % Time passed: 14944ms (effective reasoning time: 14330ms)
% 62.57/15.25 % 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)>
% 62.57/15.25 % Axioms used in derivation (2): thm/sets/EXTENSION_, thm/sets/SUBSET_
% 62.57/15.25 % No. of inferences in proof: 67
% 62.57/15.25 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 14944 ms resp. 14330 ms w/o parsing
% 63.06/15.31 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 63.06/15.31 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------