%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SEU671^2 : TPTP v9.3.1. Released v3.7.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 : n001.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:28:58 AM UTC 2026
% Result : Theorem 31.02s 8.19s
% Output : Refutation 26.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 14
% Syntax : Number of formulae : 114 ( 49 unt; 0 typ; 13 def)
% Number of atoms : 359 ( 126 equ; 0 cnn)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 1331 ( 136 ~; 125 |; 51 &; 989 @)
% ( 0 <=>; 30 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 8 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 113 ( 113 >; 0 *; 0 +; 0 <<)
% Number of symbols : 20 ( 17 usr; 11 con; 0-3 aty)
% Number of variables : 428 ( 72 ^; 317 !; 30 ?; 428 :)
% ( 0 !>; 0 ?*; 0 @-; 9 @+)
% Comments :
%------------------------------------------------------------------------------
thf(in_decl,type,
in: $i > $i > $o ).
thf(dsetconstr_decl,type,
dsetconstr: $i > ( $i > $o ) > $i ).
thf(dsetconstrER_decl,type,
dsetconstrER: $o ).
thf(kpair_decl,type,
kpair: $i > $i > $i ).
thf(cartprod_decl,type,
cartprod: $i > $i > $i ).
thf(setukpairinjL_decl,type,
setukpairinjL: $o ).
thf(setukpairinjR_decl,type,
setukpairinjR: $o ).
thf(dpsetconstr_decl,type,
dpsetconstr: $i > $i > ( $i > $i > $o ) > $i ).
thf(sk1_decl,type,
sk1: $i ).
thf(sk2_decl,type,
sk2: $i ).
thf(sk3_decl,type,
sk3: $i > $i > $o ).
thf(sk4_decl,type,
sk4: $i ).
thf(sk5_decl,type,
sk5: $i ).
thf(sk6_decl,type,
sk6: $i > $i > $i ).
thf(sk7_decl,type,
sk7: $i > $i > $i ).
thf(sk8_decl,type,
sk8: $i ).
thf(sk9_decl,type,
sk9: $i ).
thf(dsetconstrER_def,definition,
( dsetconstrER
= ( ! [A: $i,B: $i > $o,C: $i] :
( ( in @ C @ ( dsetconstr @ A @ B ) )
=> ( B @ C ) ) ) ) ).
thf(setukpairinjL_def,definition,
( setukpairinjL
= ( ! [A: $i,B: $i,C: $i,D: $i] :
( ( ( kpair @ A @ B )
= ( kpair @ C @ D ) )
=> ( A = C ) ) ) ) ).
thf(setukpairinjR_def,definition,
( setukpairinjR
= ( ! [A: $i,B: $i,C: $i,D: $i] :
( ( ( kpair @ A @ B )
= ( kpair @ C @ D ) )
=> ( B = D ) ) ) ) ).
thf(dpsetconstr_def,definition,
( dpsetconstr
= ( ^ [A: $i,B: $i,C: $i > $i > $o] :
( dsetconstr @ ( cartprod @ A @ B )
@ ^ [D: $i] :
? [E: $i] :
( ( in @ E @ A )
& ? [F: $i] :
( ( in @ F @ B )
& ( C @ E @ F )
& ( D
= ( kpair @ E @ F ) ) ) ) ) ) ) ).
thf(sk1_def,definition,
( sk1
= ( @+[A: $i] :
~ ! [B: $i,C: $i > $i > $o,D: $i,E: $i] :
( ( in @ ( kpair @ D @ E )
@ ( dsetconstr @ ( cartprod @ A @ B )
@ ^ [F: $i] :
? [G: $i] :
( ( in @ G @ A )
& ? [H: $i] :
( ( in @ H @ B )
& ( C @ G @ H )
& ( F
= ( kpair @ G @ H ) ) ) ) ) )
=> ( C @ D @ E ) ) ) ) ).
thf(sk2_def,definition,
( sk2
= ( @+[A: $i] :
~ ! [B: $i > $i > $o,C: $i,D: $i] :
( ( in @ ( kpair @ C @ D )
@ ( dsetconstr @ ( cartprod @ sk1 @ A )
@ ^ [E: $i] :
? [F: $i] :
( ( in @ F @ sk1 )
& ? [G: $i] :
( ( in @ G @ A )
& ( B @ F @ G )
& ( E
= ( kpair @ F @ G ) ) ) ) ) )
=> ( B @ C @ D ) ) ) ) ).
thf(sk3_def,definition,
( sk3
= ( @+[A: $i > $i > $o] :
~ ! [B: $i,C: $i] :
( ( in @ ( kpair @ B @ C )
@ ( dsetconstr @ ( cartprod @ sk1 @ sk2 )
@ ^ [D: $i] :
? [E: $i] :
( ( in @ E @ sk1 )
& ? [F: $i] :
( ( in @ F @ sk2 )
& ( A @ E @ F )
& ( D
= ( kpair @ E @ F ) ) ) ) ) )
=> ( A @ B @ C ) ) ) ) ).
thf(sk4_def,definition,
( sk4
= ( @+[A: $i] :
~ ! [B: $i] :
( ( in @ ( kpair @ A @ B )
@ ( dsetconstr @ ( cartprod @ sk1 @ sk2 )
@ ^ [C: $i] :
? [D: $i] :
( ( in @ D @ sk1 )
& ? [E: $i] :
( ( in @ E @ sk2 )
& ( sk3 @ D @ E )
& ( C
= ( kpair @ D @ E ) ) ) ) ) )
=> ( sk3 @ A @ B ) ) ) ) ).
thf(sk5_def,definition,
( sk5
= ( @+[A: $i] :
~ ( ( in @ ( kpair @ sk4 @ A )
@ ( dsetconstr @ ( cartprod @ sk1 @ sk2 )
@ ^ [B: $i] :
? [C: $i] :
( ( in @ C @ sk1 )
& ? [D: $i] :
( ( in @ D @ sk2 )
& ( sk3 @ C @ D )
& ( B
= ( kpair @ C @ D ) ) ) ) ) )
=> ( sk3 @ sk4 @ A ) ) ) ) ).
thf(sk6_def,definition,
( sk6
= ( @+[A: $i > $i > $i] :
! [B: $i,C: $i] :
( ( A @ B @ ( kpair @ B @ C ) )
= C ) ) ) ).
thf(sk7_def,definition,
( sk7
= ( @+[A: $i > $i > $i] :
! [B: $i,C: $i] :
( ( A @ C @ ( kpair @ B @ C ) )
= B ) ) ) ).
thf(sk8_def,definition,
( sk8
= ( @+[A: $i] :
( ( in @ A @ sk1 )
& ? [B: $i] :
( ( in @ B @ sk2 )
& ( sk3 @ A @ B )
& ( ( kpair @ sk4 @ sk5 )
= ( kpair @ A @ B ) ) ) ) ) ) ).
thf(sk9_def,definition,
( sk9
= ( @+[A: $i] :
( ( in @ A @ sk2 )
& ( sk3 @ sk8 @ A )
& ( ( kpair @ sk4 @ sk5 )
= ( kpair @ sk8 @ A ) ) ) ) ) ).
thf(1,conjecture,
( dsetconstrER
=> ( setukpairinjL
=> ( setukpairinjR
=> ! [A: $i,B: $i,C: $i > $i > $o,D: $i,E: $i] :
( ( in @ ( kpair @ D @ E ) @ ( dpsetconstr @ A @ B @ C ) )
=> ( C @ D @ E ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dpsetconstrER) ).
thf(2,negated_conjecture,
~ ( dsetconstrER
=> ( setukpairinjL
=> ( setukpairinjR
=> ! [A: $i,B: $i,C: $i > $i > $o,D: $i,E: $i] :
( ( in @ ( kpair @ D @ E ) @ ( dpsetconstr @ A @ B @ C ) )
=> ( C @ D @ E ) ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ( ! [A: $i,B: $i > $o,C: $i] :
( ( in @ C @ ( dsetconstr @ A @ B ) )
=> ( B @ C ) )
=> ( ! [A: $i,B: $i,C: $i,D: $i] :
( ( ( kpair @ A @ B )
= ( kpair @ C @ D ) )
=> ( A = C ) )
=> ( ! [A: $i,B: $i,C: $i,D: $i] :
( ( ( kpair @ A @ B )
= ( kpair @ C @ D ) )
=> ( B = D ) )
=> ! [A: $i,B: $i,C: $i > $i > $o,D: $i,E: $i] :
( ( in @ ( kpair @ D @ E )
@ ( dsetconstr @ ( cartprod @ A @ B )
@ ^ [F: $i] :
? [G: $i] :
( ( in @ G @ A )
& ? [H: $i] :
( ( in @ H @ B )
& ( C @ G @ H )
& ( F
= ( kpair @ G @ H ) ) ) ) ) )
=> ( C @ D @ E ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
~ ( ! [A: $i,B: $i > $o,C: $i] :
( ( in @ C @ ( dsetconstr @ A @ B ) )
=> ( B @ C ) )
=> ( ! [A: $i,B: $i,C: $i] :
( ? [D: $i] :
( ( kpair @ A @ B )
= ( kpair @ C @ D ) )
=> ( A = C ) )
=> ( ! [A: $i,B: $i,C: $i,D: $i] :
( ( ( kpair @ A @ B )
= ( kpair @ C @ D ) )
=> ( B = D ) )
=> ! [A: $i,B: $i,C: $i > $i > $o,D: $i,E: $i] :
( ( in @ ( kpair @ D @ E )
@ ( dsetconstr @ ( cartprod @ A @ B )
@ ^ [F: $i] :
? [G: $i] :
( ( in @ G @ A )
& ? [H: $i] :
( ( in @ H @ B )
& ( C @ G @ H )
& ( F
= ( kpair @ G @ H ) ) ) ) ) )
=> ( C @ D @ E ) ) ) ) ),
inference(miniscope,[status(thm)],[3]) ).
thf(5,plain,
! [K: $i,J: $i,I: $i,H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i > $o,A: $i] :
( ( ~ ( in @ C @ ( dsetconstr @ A @ B ) )
| ( B @ C ) )
& ( ( ( kpair @ D @ E )
!= ( kpair @ F @ G ) )
| ( D = F ) )
& ( ( ( kpair @ H @ I )
!= ( kpair @ J @ K ) )
| ( I = K ) )
& ( in @ ( kpair @ sk4 @ sk5 )
@ ( dsetconstr @ ( cartprod @ sk1 @ sk2 )
@ ^ [L: $i] :
? [M: $i] :
( ( in @ M @ sk1 )
& ? [N: $i] :
( ( in @ N @ sk2 )
& ( sk3 @ M @ N )
& ( L
= ( kpair @ M @ N ) ) ) ) ) )
& ~ ( sk3 @ sk4 @ sk5 ) ),
inference(cnf,[status(esa)],[4]) ).
thf(10,plain,
! [C: $i,B: $i > $o,A: $i] :
( ~ ( in @ C @ ( dsetconstr @ A @ B ) )
| ( B @ C ) ),
inference(cnfConj,[status(thm)],[5]) ).
thf(7,plain,
( in @ ( kpair @ sk4 @ sk5 )
@ ( dsetconstr @ ( cartprod @ sk1 @ sk2 )
@ ^ [A: $i] :
? [B: $i] :
( ( in @ B @ sk1 )
& ? [C: $i] :
( ( in @ C @ sk2 )
& ( sk3 @ B @ C )
& ( A
= ( kpair @ B @ C ) ) ) ) ) ),
inference(cnfConj,[status(thm)],[5]) ).
thf(25,plain,
! [C: $i,B: $i > $o,A: $i] :
( ~ $true
| ( B @ C )
| ( ( in @ ( kpair @ sk4 @ sk5 )
@ ( dsetconstr @ ( cartprod @ sk1 @ sk2 )
@ ^ [D: $i] :
? [E: $i] :
( ( in @ E @ sk1 )
& ? [F: $i] :
( ( in @ F @ sk2 )
& ( sk3 @ E @ F )
& ( D
= ( kpair @ E @ F ) ) ) ) ) )
!= ( in @ C @ ( dsetconstr @ A @ B ) ) ) ),
inference(paramod_ordered,[status(thm)],[7,10]) ).
thf(26,plain,
! [C: $i,B: $i > $o,A: $i] :
( ( B @ C )
| ( ( in @ ( kpair @ sk4 @ sk5 )
@ ( dsetconstr @ ( cartprod @ sk1 @ sk2 )
@ ^ [D: $i] :
? [E: $i] :
( ( in @ E @ sk1 )
& ? [F: $i] :
( ( in @ F @ sk2 )
& ( sk3 @ E @ F )
& ( D
= ( kpair @ E @ F ) ) ) ) ) )
!= ( in @ C @ ( dsetconstr @ A @ B ) ) ) ),
inference(simp,[status(thm)],[25]) ).
thf(27,plain,
? [A: $i] :
( ( in @ A @ sk1 )
& ? [B: $i] :
( ( in @ B @ sk2 )
& ( sk3 @ A @ B )
& ( ( kpair @ sk4 @ sk5 )
= ( kpair @ A @ B ) ) ) ),
inference(pattern_uni,[status(thm)],[26:[bind(A,$thf( cartprod @ sk1 @ sk2 )),bind(B,$thf( ^ [D: $i] : ? [E: $i] : ( ( in @ E @ sk1 ) & ? [F: $i] : ( ( in @ F @ sk2 ) & ( sk3 @ E @ F ) & ( D = ( kpair @ E @ F ) ) ) ) )),bind(C,$thf( kpair @ sk4 @ sk5 ))]]) ).
thf(44,plain,
( ( in @ sk8 @ sk1 )
& ( in @ sk9 @ sk2 )
& ( sk3 @ sk8 @ sk9 )
& ( ( kpair @ sk4 @ sk5 )
= ( kpair @ sk8 @ sk9 ) ) ),
inference(cnf,[status(esa)],[27]) ).
thf(47,plain,
sk3 @ sk8 @ sk9,
inference(cnfConj,[status(thm)],[44]) ).
thf(6,plain,
~ ( sk3 @ sk4 @ sk5 ),
inference(cnfConj,[status(thm)],[5]) ).
thf(82,plain,
( ~ $true
| ( ( sk3 @ sk8 @ sk9 )
!= ( sk3 @ sk4 @ sk5 ) ) ),
inference(paramod_ordered,[status(thm)],[47,6]) ).
thf(83,plain,
( ( sk3 @ sk8 @ sk9 )
!= ( sk3 @ sk4 @ sk5 ) ),
inference(simp,[status(thm)],[82]) ).
thf(84,plain,
( ( sk8 != sk4 )
| ( sk9 != sk5 ) ),
inference(simp,[status(thm)],[83]) ).
thf(21,plain,
! [F: $i,E: $i > $o,D: $i,C: $i,B: $i > $o,A: $i] :
( ~ ( in @ C @ ( dsetconstr @ A @ B ) )
| ~ $true
| ( E @ F )
| ( ( B @ C )
!= ( in @ F @ ( dsetconstr @ D @ E ) ) ) ),
inference(paramod_ordered,[status(thm)],[10,10]) ).
thf(22,plain,
! [F: $i,E: $i > $o,D: $i,C: $i,B: $i > $o,A: $i] :
( ~ ( in @ C @ ( dsetconstr @ A @ B ) )
| ( E @ F )
| ( ( B @ C )
!= ( in @ F @ ( dsetconstr @ D @ E ) ) ) ),
inference(simp,[status(thm)],[21]) ).
thf(39,plain,
! [D: $i > $i,C: $i > $o,B: $i,A: $i] :
( ~ ( in @ ( dsetconstr @ B @ C )
@ ( dsetconstr @ A
@ ^ [E: $i] : ( in @ ( D @ E ) @ E ) ) )
| ( C @ ( D @ ( dsetconstr @ B @ C ) ) ) ),
inference(pre_uni,[status(thm)],[22:[bind(A,$thf( A )),bind(B,$thf( ^ [H: $i] : ( in @ ( G @ H ) @ H ) )),bind(C,$thf( dsetconstr @ D @ E )),bind(D,$thf( D )),bind(E,$thf( E )),bind(F,$thf( G @ ( dsetconstr @ D @ E ) ))]]) ).
thf(43,plain,
! [D: $i > $i,C: $i > $o,B: $i,A: $i] :
( ~ ( in @ ( dsetconstr @ B @ C )
@ ( dsetconstr @ A
@ ^ [E: $i] : ( in @ ( D @ E ) @ E ) ) )
| ( C @ ( D @ ( dsetconstr @ B @ C ) ) ) ),
inference(simp,[status(thm)],[39]) ).
thf(33,plain,
! [B: $i,A: $i] :
( ~ ( in @ B
@ ( dsetconstr @ A
@ ^ [C: $i] : $false ) )
| $false ),
inference(prim_subst,[status(thm)],[10:[bind(A,$thf( A )),bind(B,$thf( ^ [D: $i] : $false ))]]) ).
thf(40,plain,
! [B: $i,A: $i] :
~ ( in @ B
@ ( dsetconstr @ A
@ ^ [C: $i] : $false ) ),
inference(simp,[status(thm)],[33]) ).
thf(45,plain,
in @ sk8 @ sk1,
inference(cnfConj,[status(thm)],[44]) ).
thf(23,plain,
! [C: $i,B: $i > $o,A: $i] :
( ~ ( in @ C @ ( dsetconstr @ A @ B ) )
| ~ $true
| ( ( B @ C )
!= ( sk3 @ sk4 @ sk5 ) ) ),
inference(paramod_ordered,[status(thm)],[10,6]) ).
thf(24,plain,
! [C: $i,B: $i > $o,A: $i] :
( ~ ( in @ C @ ( dsetconstr @ A @ B ) )
| ( ( B @ C )
!= ( sk3 @ sk4 @ sk5 ) ) ),
inference(simp,[status(thm)],[23]) ).
thf(36,plain,
! [A: $i] :
~ ( in @ sk5 @ ( dsetconstr @ A @ ( sk3 @ sk4 ) ) ),
inference(pre_uni,[status(thm)],[24:[bind(A,$thf( A )),bind(B,$thf( sk3 @ sk4 )),bind(C,$thf( sk5 ))]]) ).
thf(116,plain,
! [A: $i] :
( ~ $true
| ( ( in @ sk8 @ sk1 )
!= ( in @ sk5 @ ( dsetconstr @ A @ ( sk3 @ sk4 ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[45,36]) ).
thf(117,plain,
! [A: $i] :
( ( in @ sk8 @ sk1 )
!= ( in @ sk5 @ ( dsetconstr @ A @ ( sk3 @ sk4 ) ) ) ),
inference(simp,[status(thm)],[116]) ).
thf(126,plain,
! [A: $i] :
( ( sk8 != sk5 )
| ( ( dsetconstr @ A @ ( sk3 @ sk4 ) )
!= sk1 ) ),
inference(simp,[status(thm)],[117]) ).
thf(38,plain,
! [E: $i > $i > $o,D: $i > $i,C: $i > $i,B: $i,A: $i] :
( ~ ( in @ B
@ ( dsetconstr @ A
@ ^ [F: $i] : ( in @ ( C @ F ) @ ( dsetconstr @ ( D @ F ) @ ( E @ F ) ) ) ) )
| ( E @ B @ ( C @ B ) ) ),
inference(pre_uni,[status(thm)],[22:[bind(A,$thf( A )),bind(B,$thf( ^ [J: $i] : ( in @ ( G @ J ) @ ( dsetconstr @ ( I @ J ) @ ( J @ J ) ) ) )),bind(C,$thf( C )),bind(D,$thf( I @ C )),bind(E,$thf( J @ C )),bind(F,$thf( G @ C ))]]) ).
thf(42,plain,
! [E: $i > $i > $o,D: $i > $i,C: $i > $i,B: $i,A: $i] :
( ~ ( in @ B
@ ( dsetconstr @ A
@ ^ [F: $i] : ( in @ ( C @ F ) @ ( dsetconstr @ ( D @ F ) @ ( E @ F ) ) ) ) )
| ( E @ B @ ( C @ B ) ) ),
inference(simp,[status(thm)],[38]) ).
thf(28,plain,
! [C: $i,B: $i > $o,A: $i] :
( ~ ( in @ C @ ( dsetconstr @ A @ B ) )
| ( ( B @ C )
!= ( ~ ( in @ C @ ( dsetconstr @ A @ B ) ) ) )
| ~ $true ),
inference(eqfactor_ordered,[status(thm)],[10]) ).
thf(37,plain,
! [A: $i] :
~ ( in
@ ( dsetconstr @ A
@ ^ [B: $i] :
~ ( in @ B @ B ) )
@ ( dsetconstr @ A
@ ^ [B: $i] :
~ ( in @ B @ B ) ) ),
inference(pre_uni,[status(thm)],[28:[bind(A,$thf( A )),bind(B,$thf( ^ [D: $i] : ~ ( in @ D @ D ) )),bind(C,$thf( dsetconstr @ A @ ^ [D: $i] : ~ ( in @ D @ D ) ))]]) ).
thf(8,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( kpair @ A @ B )
!= ( kpair @ C @ D ) )
| ( A = C ) ),
inference(cnfConj,[status(thm)],[5]) ).
thf(15,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( kpair @ A @ B )
!= ( kpair @ C @ D ) )
| ( A = C ) ),
inference(lifteq,[status(thm)],[8]) ).
thf(16,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( kpair @ A @ B )
!= ( kpair @ C @ D ) )
| ( A = C ) ),
inference(simp,[status(thm)],[15]) ).
thf(17,plain,
? [A: $i > $i > $i] :
! [B: $i,C: $i] :
( ( A @ C @ ( kpair @ B @ C ) )
= B ),
inference(detectInverse,[status(thm)],[16]) ).
thf(18,plain,
! [B: $i,A: $i] :
( ( sk7 @ B @ ( kpair @ A @ B ) )
= A ),
inference(cnf,[status(esa)],[17]) ).
thf(20,plain,
! [B: $i,A: $i] :
( ( sk7 @ B @ ( kpair @ A @ B ) )
= A ),
inference(lifteq,[status(thm)],[18]) ).
thf(46,plain,
in @ sk9 @ sk2,
inference(cnfConj,[status(thm)],[44]) ).
thf(48,plain,
( ( kpair @ sk4 @ sk5 )
= ( kpair @ sk8 @ sk9 ) ),
inference(cnfConj,[status(thm)],[44]) ).
thf(49,plain,
( ( kpair @ sk8 @ sk9 )
= ( kpair @ sk4 @ sk5 ) ),
inference(lifteq,[status(thm)],[48]) ).
thf(9,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( kpair @ A @ B )
!= ( kpair @ C @ D ) )
| ( B = D ) ),
inference(cnfConj,[status(thm)],[5]) ).
thf(11,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( kpair @ A @ B )
!= ( kpair @ C @ D ) )
| ( B = D ) ),
inference(lifteq,[status(thm)],[9]) ).
thf(12,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( kpair @ A @ B )
!= ( kpair @ C @ D ) )
| ( B = D ) ),
inference(simp,[status(thm)],[11]) ).
thf(13,plain,
? [A: $i > $i > $i] :
! [B: $i,C: $i] :
( ( A @ B @ ( kpair @ B @ C ) )
= C ),
inference(detectInverse,[status(thm)],[12]) ).
thf(14,plain,
! [B: $i,A: $i] :
( ( sk6 @ A @ ( kpair @ A @ B ) )
= B ),
inference(cnf,[status(esa)],[13]) ).
thf(19,plain,
! [B: $i,A: $i] :
( ( sk6 @ A @ ( kpair @ A @ B ) )
= B ),
inference(lifteq,[status(thm)],[14]) ).
thf(88,plain,
! [B: $i,A: $i] :
( ( ( sk6 @ A @ ( kpair @ sk4 @ sk5 ) )
= B )
| ( ( kpair @ sk8 @ sk9 )
!= ( kpair @ A @ B ) ) ),
inference(paramod_ordered,[status(thm)],[49,19]) ).
thf(89,plain,
( ( sk6 @ sk8 @ ( kpair @ sk4 @ sk5 ) )
= sk9 ),
inference(pattern_uni,[status(thm)],[88:[bind(A,$thf( sk8 )),bind(B,$thf( sk9 ))]]) ).
thf(68,plain,
! [C: $i,B: $i > $o,A: $i] :
( ~ $true
| ( B @ C )
| ( ( in @ sk8 @ sk1 )
!= ( in @ C @ ( dsetconstr @ A @ B ) ) ) ),
inference(paramod_ordered,[status(thm)],[45,10]) ).
thf(69,plain,
! [C: $i,B: $i > $o,A: $i] :
( ( B @ C )
| ( ( in @ sk8 @ sk1 )
!= ( in @ C @ ( dsetconstr @ A @ B ) ) ) ),
inference(simp,[status(thm)],[68]) ).
thf(72,plain,
! [C: $i,B: $i > $o,A: $i] :
( ( B @ C )
| ( sk8 != C )
| ( ( dsetconstr @ A @ B )
!= sk1 ) ),
inference(simp,[status(thm)],[69]) ).
thf(74,plain,
! [B: $i > $o,A: $i] :
( ( B @ sk8 )
| ( ( dsetconstr @ A @ B )
!= sk1 ) ),
inference(simp,[status(thm)],[72]) ).
thf(277,plain,
! [B: $i,A: $i] :
( ~ $true
| ( ( in @ sk9 @ sk2 )
!= ( in @ B
@ ( dsetconstr @ A
@ ^ [C: $i] : $false ) ) ) ),
inference(paramod_ordered,[status(thm)],[46,40]) ).
thf(278,plain,
! [B: $i,A: $i] :
( ( in @ sk9 @ sk2 )
!= ( in @ B
@ ( dsetconstr @ A
@ ^ [C: $i] : $false ) ) ),
inference(simp,[status(thm)],[277]) ).
thf(289,plain,
! [B: $i,A: $i] :
( ( sk9 != B )
| ( ( dsetconstr @ A
@ ^ [C: $i] : $false )
!= sk2 ) ),
inference(simp,[status(thm)],[278]) ).
thf(292,plain,
! [A: $i] :
( ( dsetconstr @ A
@ ^ [B: $i] : $false )
!= sk2 ),
inference(simp,[status(thm)],[289]) ).
thf(30,plain,
! [D: $i > $o,C: $i > $o,B: $i,A: $i] :
( ~ ( in @ B
@ ( dsetconstr @ A
@ ^ [E: $i] :
( ( C @ E )
| ( D @ E ) ) ) )
| ( C @ B )
| ( D @ B ) ),
inference(prim_subst,[status(thm)],[10:[bind(A,$thf( A )),bind(B,$thf( ^ [F: $i] : ( ( D @ F ) | ( E @ F ) ) ))]]) ).
thf(52,plain,
! [D: $i > $o,C: $i > $o,B: $i,A: $i] :
( ~ ( in @ B
@ ( dsetconstr @ A
@ ^ [E: $i] :
( ( C @ E )
| ( D @ E ) ) ) )
| ( C @ B )
| ( D @ B ) ),
inference(cnf,[status(esa)],[30]) ).
thf(53,plain,
! [D: $i > $o,C: $i > $o,B: $i,A: $i] :
( ~ ( in @ B
@ ( dsetconstr @ A
@ ^ [E: $i] :
( ( C @ E )
| ( D @ E ) ) ) )
| ( C @ B )
| ( D @ B ) ),
inference(simp,[status(thm)],[52]) ).
thf(329,plain,
! [D: $i,C: $i,B: $i > $o,A: $i] :
( ~ ( in @ C @ ( dsetconstr @ A @ B ) )
| ~ $true
| ( ( B @ C )
!= ( in
@ ( dsetconstr @ D
@ ^ [E: $i] :
~ ( in @ E @ E ) )
@ ( dsetconstr @ D
@ ^ [E: $i] :
~ ( in @ E @ E ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[10,37]) ).
thf(330,plain,
! [D: $i,C: $i,B: $i > $o,A: $i] :
( ~ ( in @ C @ ( dsetconstr @ A @ B ) )
| ( ( B @ C )
!= ( in
@ ( dsetconstr @ D
@ ^ [E: $i] :
~ ( in @ E @ E ) )
@ ( dsetconstr @ D
@ ^ [E: $i] :
~ ( in @ E @ E ) ) ) ) ),
inference(simp,[status(thm)],[329]) ).
thf(345,plain,
! [B: $i,A: $i] :
~ ( in
@ ( dsetconstr @ B
@ ^ [C: $i] :
~ ( in @ C @ C ) )
@ ( dsetconstr @ A
@ ^ [C: $i] : ( in @ C @ C ) ) ),
inference(pre_uni,[status(thm)],[330:[bind(A,$thf( A )),bind(B,$thf( ^ [E: $i] : ( in @ E @ E ) )),bind(C,$thf( dsetconstr @ D @ ^ [E: $i] : ~ ( in @ E @ E ) )),bind(D,$thf( D ))]]) ).
thf(356,plain,
! [B: $i,A: $i] :
~ ( in
@ ( dsetconstr @ B
@ ^ [C: $i] :
~ ( in @ C @ C ) )
@ ( dsetconstr @ A
@ ^ [C: $i] : ( in @ C @ C ) ) ),
inference(simp,[status(thm)],[345]) ).
thf(169,plain,
! [E: $i > $o,D: $i > $o,C: $i > $o,B: $i,A: $i] :
( ~ ( in @ B
@ ( dsetconstr @ A
@ ^ [F: $i] :
( ( C @ F )
| ( D @ F )
| ( E @ F ) ) ) )
| ( C @ B )
| ( D @ B )
| ( E @ B ) ),
inference(prim_subst,[status(thm)],[53:[bind(A,$thf( A )),bind(B,$thf( B )),bind(C,$thf( C )),bind(D,$thf( ^ [G: $i] : ( ( E @ G ) | ( F @ G ) ) ))]]) ).
thf(240,plain,
! [E: $i > $o,D: $i > $o,C: $i > $o,B: $i,A: $i] :
( ~ ( in @ B
@ ( dsetconstr @ A
@ ^ [F: $i] :
( ( C @ F )
| ( D @ F )
| ( E @ F ) ) ) )
| ( C @ B )
| ( D @ B )
| ( E @ B ) ),
inference(cnf,[status(esa)],[169]) ).
thf(241,plain,
! [E: $i > $o,D: $i > $o,C: $i > $o,B: $i,A: $i] :
( ~ ( in @ B
@ ( dsetconstr @ A
@ ^ [F: $i] :
( ( C @ F )
| ( D @ F )
| ( E @ F ) ) ) )
| ( C @ B )
| ( D @ B )
| ( E @ B ) ),
inference(simp,[status(thm)],[240]) ).
thf(451,plain,
! [J: $i > $o,I: $i > $o,H: $i > $o,G: $i,F: $i,E: $i > $o,D: $i > $o,C: $i > $o,B: $i,A: $i] :
( ~ ( in @ B
@ ( dsetconstr @ A
@ ^ [K: $i] :
( ( C @ K )
| ( D @ K )
| ( E @ K ) ) ) )
| ( C @ B )
| ( E @ B )
| ~ $true
| ( H @ G )
| ( I @ G )
| ( J @ G )
| ( ( D @ B )
!= ( in @ G
@ ( dsetconstr @ F
@ ^ [K: $i] :
( ( H @ K )
| ( I @ K )
| ( J @ K ) ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[241,241]) ).
thf(452,plain,
! [J: $i > $o,I: $i > $o,H: $i > $o,G: $i,F: $i,E: $i > $o,D: $i > $o,C: $i > $o,B: $i,A: $i] :
( ~ ( in @ B
@ ( dsetconstr @ A
@ ^ [K: $i] :
( ( C @ K )
| ( D @ K )
| ( E @ K ) ) ) )
| ( C @ B )
| ( E @ B )
| ( H @ G )
| ( I @ G )
| ( J @ G )
| ( ( D @ B )
!= ( in @ G
@ ( dsetconstr @ F
@ ^ [K: $i] :
( ( H @ K )
| ( I @ K )
| ( J @ K ) ) ) ) ) ),
inference(simp,[status(thm)],[451]) ).
thf(534,plain,
! [I: $i > $i > $o,H: $i > $i > $o,G: $i > $i > $o,F: $i > $i,E: $i > $i,D: $i > $o,C: $i > $o,B: $i,A: $i] :
( ~ ( in @ B
@ ( dsetconstr @ A
@ ^ [J: $i] :
( ( C @ J )
| ( in @ ( E @ J )
@ ( dsetconstr @ ( F @ J )
@ ^ [K: $i] :
( ( G @ J @ K )
| ( H @ J @ K )
| ( I @ J @ K ) ) ) )
| ( D @ J ) ) ) )
| ( C @ B )
| ( D @ B )
| ( G @ B @ ( E @ B ) )
| ( H @ B @ ( E @ B ) )
| ( I @ B @ ( E @ B ) ) ),
inference(pre_uni,[status(thm)],[452:[bind(A,$thf( A )),bind(B,$thf( B )),bind(C,$thf( C )),bind(D,$thf( ^ [P: $i] : ( in @ ( K @ P ) @ ( dsetconstr @ ( M @ P ) @ ^ [Q: $i] : ( ( O @ P @ Q ) | ( Q @ P @ Q ) | ( R @ P @ Q ) ) ) ) )),bind(E,$thf( E )),bind(F,$thf( M @ B )),bind(G,$thf( K @ B )),bind(H,$thf( O @ B )),bind(I,$thf( Q @ B )),bind(J,$thf( R @ B ))]]) ).
thf(610,plain,
! [I: $i > $i > $o,H: $i > $i > $o,G: $i > $i > $o,F: $i > $i,E: $i > $i,D: $i > $o,C: $i > $o,B: $i,A: $i] :
( ~ ( in @ B
@ ( dsetconstr @ A
@ ^ [J: $i] :
( ( C @ J )
| ( in @ ( E @ J )
@ ( dsetconstr @ ( F @ J )
@ ^ [K: $i] :
( ( G @ J @ K )
| ( H @ J @ K )
| ( I @ J @ K ) ) ) )
| ( D @ J ) ) ) )
| ( C @ B )
| ( D @ B )
| ( G @ B @ ( E @ B ) )
| ( H @ B @ ( E @ B ) )
| ( I @ B @ ( E @ B ) ) ),
inference(simp,[status(thm)],[534]) ).
thf(35,plain,
! [A: $i] :
~ ( in @ sk4
@ ( dsetconstr @ A
@ ^ [B: $i] : ( sk3 @ B @ sk5 ) ) ),
inference(pre_uni,[status(thm)],[24:[bind(A,$thf( A )),bind(B,$thf( ^ [D: $i] : ( sk3 @ D @ sk5 ) )),bind(C,$thf( sk4 ))]]) ).
thf(70,plain,
! [A: $i] :
( ~ $true
| ( ( in @ sk8 @ sk1 )
!= ( in @ sk4
@ ( dsetconstr @ A
@ ^ [B: $i] : ( sk3 @ B @ sk5 ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[45,35]) ).
thf(71,plain,
! [A: $i] :
( ( in @ sk8 @ sk1 )
!= ( in @ sk4
@ ( dsetconstr @ A
@ ^ [B: $i] : ( sk3 @ B @ sk5 ) ) ) ),
inference(simp,[status(thm)],[70]) ).
thf(73,plain,
! [A: $i] :
( ( sk8 != sk4 )
| ( ( dsetconstr @ A
@ ^ [B: $i] : ( sk3 @ B @ sk5 ) )
!= sk1 ) ),
inference(simp,[status(thm)],[71]) ).
thf(120,plain,
! [A: $i] :
( ~ $true
| ( ( in @ sk9 @ sk2 )
!= ( in @ sk5 @ ( dsetconstr @ A @ ( sk3 @ sk4 ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[46,36]) ).
thf(121,plain,
! [A: $i] :
( ( in @ sk9 @ sk2 )
!= ( in @ sk5 @ ( dsetconstr @ A @ ( sk3 @ sk4 ) ) ) ),
inference(simp,[status(thm)],[120]) ).
thf(128,plain,
! [A: $i] :
( ( sk9 != sk5 )
| ( ( dsetconstr @ A @ ( sk3 @ sk4 ) )
!= sk2 ) ),
inference(simp,[status(thm)],[121]) ).
thf(273,plain,
! [B: $i,A: $i] :
( ~ $true
| ( ( in @ sk8 @ sk1 )
!= ( in @ B
@ ( dsetconstr @ A
@ ^ [C: $i] : $false ) ) ) ),
inference(paramod_ordered,[status(thm)],[45,40]) ).
thf(274,plain,
! [B: $i,A: $i] :
( ( in @ sk8 @ sk1 )
!= ( in @ B
@ ( dsetconstr @ A
@ ^ [C: $i] : $false ) ) ),
inference(simp,[status(thm)],[273]) ).
thf(283,plain,
! [B: $i,A: $i] :
( ( sk8 != B )
| ( ( dsetconstr @ A
@ ^ [C: $i] : $false )
!= sk1 ) ),
inference(simp,[status(thm)],[274]) ).
thf(298,plain,
! [A: $i] :
( ( dsetconstr @ A
@ ^ [B: $i] : $false )
!= sk1 ),
inference(simp,[status(thm)],[283]) ).
thf(55,plain,
! [D: $i,C: $i,B: $i > $o,A: $i] :
( ~ ( in @ C @ ( dsetconstr @ A @ B ) )
| ~ $true
| ( ( B @ C )
!= ( in @ sk4
@ ( dsetconstr @ D
@ ^ [E: $i] : ( sk3 @ E @ sk5 ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[10,35]) ).
thf(56,plain,
! [D: $i,C: $i,B: $i > $o,A: $i] :
( ~ ( in @ C @ ( dsetconstr @ A @ B ) )
| ( ( B @ C )
!= ( in @ sk4
@ ( dsetconstr @ D
@ ^ [E: $i] : ( sk3 @ E @ sk5 ) ) ) ) ),
inference(simp,[status(thm)],[55]) ).
thf(59,plain,
! [B: $i,A: $i] :
~ ( in
@ ( dsetconstr @ B
@ ^ [C: $i] : ( sk3 @ C @ sk5 ) )
@ ( dsetconstr @ A @ ( in @ sk4 ) ) ),
inference(pre_uni,[status(thm)],[56:[bind(A,$thf( A )),bind(B,$thf( in @ sk4 )),bind(C,$thf( dsetconstr @ D @ ^ [E: $i] : ( sk3 @ E @ sk5 ) )),bind(D,$thf( D ))]]) ).
thf(64,plain,
! [B: $i,A: $i] :
~ ( in
@ ( dsetconstr @ B
@ ^ [C: $i] : ( sk3 @ C @ sk5 ) )
@ ( dsetconstr @ A @ ( in @ sk4 ) ) ),
inference(simp,[status(thm)],[59]) ).
thf(75,plain,
! [C: $i,B: $i > $o,A: $i] :
( ~ $true
| ( B @ C )
| ( ( in @ sk9 @ sk2 )
!= ( in @ C @ ( dsetconstr @ A @ B ) ) ) ),
inference(paramod_ordered,[status(thm)],[46,10]) ).
thf(76,plain,
! [C: $i,B: $i > $o,A: $i] :
( ( B @ C )
| ( ( in @ sk9 @ sk2 )
!= ( in @ C @ ( dsetconstr @ A @ B ) ) ) ),
inference(simp,[status(thm)],[75]) ).
thf(79,plain,
! [C: $i,B: $i > $o,A: $i] :
( ( B @ C )
| ( sk9 != C )
| ( ( dsetconstr @ A @ B )
!= sk2 ) ),
inference(simp,[status(thm)],[76]) ).
thf(81,plain,
! [B: $i > $o,A: $i] :
( ( B @ sk9 )
| ( ( dsetconstr @ A @ B )
!= sk2 ) ),
inference(simp,[status(thm)],[79]) ).
thf(90,plain,
! [B: $i,A: $i] :
( ( ( sk7 @ B @ ( kpair @ sk4 @ sk5 ) )
= A )
| ( ( kpair @ sk8 @ sk9 )
!= ( kpair @ A @ B ) ) ),
inference(paramod_ordered,[status(thm)],[49,20]) ).
thf(91,plain,
( ( sk7 @ sk9 @ ( kpair @ sk4 @ sk5 ) )
= sk8 ),
inference(pattern_uni,[status(thm)],[90:[bind(A,$thf( sk8 )),bind(B,$thf( sk9 ))]]) ).
thf(61,plain,
! [B: $i > $i,A: $i] :
~ ( in @ sk4
@ ( dsetconstr @ A
@ ^ [C: $i] :
( in @ C
@ ( dsetconstr @ ( B @ C )
@ ^ [D: $i] : ( sk3 @ D @ sk5 ) ) ) ) ),
inference(pre_uni,[status(thm)],[56:[bind(A,$thf( A )),bind(B,$thf( ^ [F: $i] : ( in @ F @ ( dsetconstr @ ( G @ F ) @ ^ [G: $i] : ( sk3 @ G @ sk5 ) ) ) )),bind(C,$thf( sk4 )),bind(D,$thf( G @ sk4 ))]]) ).
thf(66,plain,
! [B: $i > $i,A: $i] :
~ ( in @ sk4
@ ( dsetconstr @ A
@ ^ [C: $i] :
( in @ C
@ ( dsetconstr @ ( B @ C )
@ ^ [D: $i] : ( sk3 @ D @ sk5 ) ) ) ) ),
inference(simp,[status(thm)],[61]) ).
thf(77,plain,
! [A: $i] :
( ~ $true
| ( ( in @ sk9 @ sk2 )
!= ( in @ sk4
@ ( dsetconstr @ A
@ ^ [B: $i] : ( sk3 @ B @ sk5 ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[46,35]) ).
thf(78,plain,
! [A: $i] :
( ( in @ sk9 @ sk2 )
!= ( in @ sk4
@ ( dsetconstr @ A
@ ^ [B: $i] : ( sk3 @ B @ sk5 ) ) ) ),
inference(simp,[status(thm)],[77]) ).
thf(80,plain,
! [A: $i] :
( ( sk9 != sk4 )
| ( ( dsetconstr @ A
@ ^ [B: $i] : ( sk3 @ B @ sk5 ) )
!= sk2 ) ),
inference(simp,[status(thm)],[78]) ).
thf(62,plain,
! [B: $i > $i,A: $i] :
~ ( in @ sk5
@ ( dsetconstr @ A
@ ^ [C: $i] :
( in @ sk4
@ ( dsetconstr @ ( B @ C )
@ ^ [D: $i] : ( sk3 @ D @ C ) ) ) ) ),
inference(pre_uni,[status(thm)],[56:[bind(A,$thf( A )),bind(B,$thf( ^ [F: $i] : ( in @ sk4 @ ( dsetconstr @ ( G @ F ) @ ^ [G: $i] : ( sk3 @ G @ F ) ) ) )),bind(C,$thf( sk5 )),bind(D,$thf( G @ sk5 ))]]) ).
thf(67,plain,
! [B: $i > $i,A: $i] :
~ ( in @ sk5
@ ( dsetconstr @ A
@ ^ [C: $i] :
( in @ sk4
@ ( dsetconstr @ ( B @ C )
@ ^ [D: $i] : ( sk3 @ D @ C ) ) ) ) ),
inference(simp,[status(thm)],[62]) ).
thf(2502,plain,
$false,
inference(e,[status(thm)],[10,84,43,40,126,47,42,37,20,46,89,74,292,6,53,356,610,73,128,298,45,64,12,49,81,7,91,66,3,35,241,80,67,16,36,19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU671^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.08 % 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.10/0.22 % Computer : n001.cluster.edu
% 0.10/0.22 % Model : x86_64 x86_64
% 0.10/0.22 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.22 % Memory : 8046.5625MB
% 0.10/0.22 % OS : Linux 6.8.0-71-generic
% 0.10/0.22 % CPULimit : 300
% 0.10/0.22 % WCLimit : 300
% 0.10/0.22 % DateTime : Tue Sep 29 14:12:50 UTC 2026
% 0.10/0.22 % CPUTime :
% 0.10/0.22 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
% 1.05/0.81 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.24/1.01 % [INFO] Parsing done (197ms).
% 1.24/1.02 % [INFO] Running in sequential loop mode.
% 2.11/1.42 % [INFO] eprover registered as external prover.
% 2.11/1.43 % [INFO] Scanning for conjecture ...
% 2.30/1.56 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 2.30/1.60 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.50/1.60 % [INFO] Problem is higher-order (TPTP THF).
% 2.50/1.60 % [INFO] Type checking passed.
% 2.50/1.61 % [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 ...
% 31.02/8.18 % External prover 'e' found a proof!
% 31.02/8.18 % [INFO] Killing All external provers ...
% 31.02/8.19 % Time passed: 7816ms (effective reasoning time: 7158ms)
% 31.02/8.19 % 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)>
% 31.02/8.19 % Axioms used in derivation (0):
% 31.02/8.19 % No. of inferences in proof: 101
% 31.02/8.19 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 7816 ms resp. 7158 ms w/o parsing
% 26.16/8.33 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 26.16/8.33 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------