%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU684^2 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n018.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:32:58 AM UTC 2026
% Result : Theorem 0.18s 0.32s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 33
% Number of leaves : 8
% Syntax : Number of formulae : 93 ( 56 unt; 0 typ; 0 def)
% Number of atoms : 787 ( 185 equ; 0 cnn)
% Maximal formula atoms : 6 ( 8 avg)
% Number of connectives : 1091 ( 27 ~; 54 |; 42 &; 882 @)
% ( 0 <=>; 48 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 25 ( 25 >; 0 *; 0 +; 0 <<)
% Number of symbols : 43 ( 38 usr; 12 con; 0-4 aty)
% ( 24 !!; 14 ??; 0 @@+; 0 @@-)
% Number of variables : 266 ( 182 ^; 74 !; 10 ?; 266 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
in: $i > $i > $o ).
thf(func_def_2,type,
setadjoin: $i > $i > $i ).
thf(func_def_3,type,
setunion: $i > $i ).
thf(func_def_4,type,
dsetconstr: $i > ( $i > $o ) > $i ).
thf(func_def_5,type,
dsetconstrER: $o ).
thf(func_def_7,type,
subset: $i > $i > $o ).
thf(func_def_8,type,
kpair: $i > $i > $i ).
thf(func_def_9,type,
cartprod: $i > $i > $i ).
thf(func_def_10,type,
singleton: $i > $o ).
thf(func_def_11,type,
ex1: $i > ( $i > $o ) > $o ).
thf(func_def_12,type,
theprop: $o ).
thf(func_def_13,type,
breln: $i > $i > $i > $o ).
thf(func_def_14,type,
func: $i > $i > $i > $o ).
thf(func_def_15,type,
funcImageSingleton: $o ).
thf(func_def_16,type,
ap: $i > $i > $i > $i > $i ).
thf(func_def_17,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_18,type,
vIMP: $o > $o > $o ).
thf(func_def_19,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_20,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_21,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_22,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_23,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_24,type,
vAND: $o > $o > $o ).
thf(func_def_25,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_26,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_27,type,
db4:
!>[X0: $tType] : X0 ).
thf(func_def_34,type,
vNOT: $o > $o ).
thf(func_def_35,type,
sK4: $i > $i ).
thf(func_def_36,type,
sK5: $i > $i > $i > $i ).
thf(func_def_37,type,
sK6: $i > $i > $i > $i ).
thf(func_def_38,type,
sK7: $i > $i > $i > $i ).
thf(func_def_40,type,
sK9: $i > $i ).
thf(f1,axiom,
( dsetconstrER
= ( ! [X0: $i,X1: $i > $o,X2: $i] :
( ( in @ X2
@ ( dsetconstr @ X0
@ ^ [X3: $i] : ( X1 @ X3 ) ) )
=> ( X1 @ X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dsetconstrER) ).
thf(f2,axiom,
( singleton
= ( ^ [X0: $i] :
? [X1: $i] :
( ( X0
= ( setadjoin @ X1 @ emptyset ) )
& ( in @ X1 @ X0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',singleton) ).
thf(f3,axiom,
( ex1
= ( ^ [X0: $i,X1: $i > $o] :
( singleton
@ ( dsetconstr @ X0
@ ^ [X2: $i] : ( X1 @ X2 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ex1) ).
thf(f4,axiom,
( theprop
= ( ! [X0: $i] :
( ( singleton @ X0 )
=> ( in @ ( setunion @ X0 ) @ X0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',theprop) ).
thf(f5,axiom,
( breln
= ( ^ [X0: $i,X1: $i,X2: $i] : ( subset @ X2 @ ( cartprod @ X0 @ X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',breln) ).
thf(f6,axiom,
( func
= ( ^ [X0: $i,X1: $i,X2: $i] :
( ! [X3: $i] :
( ( in @ X3 @ X0 )
=> ( ex1 @ X1
@ ^ [X4: $i] : ( in @ ( kpair @ X3 @ X4 ) @ X2 ) ) )
& ( breln @ X0 @ X1 @ X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',func) ).
thf(f8,axiom,
( ap
= ( ^ [X0: $i,X1: $i,X2: $i,X3: $i] :
( setunion
@ ( dsetconstr @ X1
@ ^ [X4: $i] : ( in @ ( kpair @ X3 @ X4 ) @ X2 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ap) ).
thf(f9,conjecture,
( dsetconstrER
=> ( theprop
=> ( funcImageSingleton
=> ! [X0: $i,X1: $i,X2: $i] :
( ( func @ X0 @ X1 @ X2 )
=> ! [X3: $i] :
( ( in @ X3 @ X0 )
=> ( in @ ( kpair @ X3 @ ( ap @ X0 @ X1 @ X2 @ X3 ) ) @ X2 ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',funcGraphProp1) ).
thf(f10,negated_conjecture,
~ ( dsetconstrER
=> ( theprop
=> ( funcImageSingleton
=> ! [X0: $i,X1: $i,X2: $i] :
( ( func @ X0 @ X1 @ X2 )
=> ! [X3: $i] :
( ( in @ X3 @ X0 )
=> ( in @ ( kpair @ X3 @ ( ap @ X0 @ X1 @ X2 @ X3 ) ) @ X2 ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f9]) ).
thf(f11,plain,
( dsetconstrER
= ( ! [X0: $i,X1: $i > $o,X2: $i] :
( ( in @ X2
@ ( dsetconstr @ X0
@ ^ [X3: $i] : ( X1 @ X3 ) ) )
=> ( X1 @ X2 ) ) ) ),
inference(rectify,[],[f1]) ).
thf(f12,plain,
( dsetconstrER
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0
@ ( dsetconstr @ Y2
@ ^ [Y3: $i] : ( Y1 @ Y3 ) ) )
=> ( Y1 @ Y0 ) ) ) ) ) ),
inference(fool_elimination,[],[f11]) ).
thf(f13,plain,
( singleton
= ( ^ [X0: $i] :
? [X1: $i] :
( ( X0
= ( setadjoin @ X1 @ emptyset ) )
& ( in @ X1 @ X0 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f14,plain,
( singleton
= ( ^ [Y0: $i] :
( ?? @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ Y0 )
& ( ( setadjoin @ Y1 @ emptyset )
= Y0 ) ) ) ) ),
inference(fool_elimination,[],[f13]) ).
thf(f15,plain,
( ex1
= ( ^ [X0: $i,X1: $i > $o] :
( singleton
@ ( dsetconstr @ X0
@ ^ [X2: $i] : ( X1 @ X2 ) ) ) ) ),
inference(rectify,[],[f3]) ).
thf(f16,plain,
( ex1
= ( ^ [Y0: $i,Y1: $i > $o] :
( singleton
@ ( dsetconstr @ Y0
@ ^ [Y2: $i] : ( Y1 @ Y2 ) ) ) ) ),
inference(fool_elimination,[],[f15]) ).
thf(f17,plain,
( theprop
= ( ! [X0: $i] :
( ( singleton @ X0 )
=> ( in @ ( setunion @ X0 ) @ X0 ) ) ) ),
inference(rectify,[],[f4]) ).
thf(f18,plain,
( theprop
= ( !! @ $i
@ ^ [Y0: $i] :
( ( singleton @ Y0 )
=> ( in @ ( setunion @ Y0 ) @ Y0 ) ) ) ),
inference(fool_elimination,[],[f17]) ).
thf(f19,plain,
( breln
= ( ^ [Y0: $i,Y1: $i,Y2: $i] : ( subset @ Y2 @ ( cartprod @ Y0 @ Y1 ) ) ) ),
inference(fool_elimination,[],[f5]) ).
thf(f20,plain,
( func
= ( ^ [X0: $i,X1: $i,X2: $i] :
( ! [X3: $i] :
( ( in @ X3 @ X0 )
=> ( ex1 @ X1
@ ^ [X4: $i] : ( in @ ( kpair @ X3 @ X4 ) @ X2 ) ) )
& ( breln @ X0 @ X1 @ X2 ) ) ) ),
inference(rectify,[],[f6]) ).
thf(f21,plain,
( func
= ( ^ [Y0: $i,Y1: $i,Y2: $i] :
( ( breln @ Y0 @ Y1 @ Y2 )
& ( !! @ $i
@ ^ [Y3: $i] :
( ( in @ Y3 @ Y0 )
=> ( ex1 @ Y1
@ ^ [Y4: $i] : ( in @ ( kpair @ Y3 @ Y4 ) @ Y2 ) ) ) ) ) ) ),
inference(fool_elimination,[],[f20]) ).
thf(f24,plain,
( ap
= ( ^ [X0: $i,X1: $i,X2: $i,X3: $i] :
( setunion
@ ( dsetconstr @ X1
@ ^ [X4: $i] : ( in @ ( kpair @ X3 @ X4 ) @ X2 ) ) ) ) ),
inference(rectify,[],[f8]) ).
thf(f25,plain,
( ap
= ( ^ [Y0: $i,Y1: $i,Y2: $i,Y3: $i] :
( setunion
@ ( dsetconstr @ Y1
@ ^ [Y4: $i] : ( in @ ( kpair @ Y3 @ Y4 ) @ Y2 ) ) ) ) ),
inference(fool_elimination,[],[f24]) ).
thf(f26,plain,
~ ( dsetconstrER
=> ( theprop
=> ( funcImageSingleton
=> ! [X0: $i,X1: $i,X2: $i] :
( ( func @ X0 @ X1 @ X2 )
=> ! [X3: $i] :
( ( in @ X3 @ X0 )
=> ( in @ ( kpair @ X3 @ ( ap @ X0 @ X1 @ X2 @ X3 ) ) @ X2 ) ) ) ) ) ),
inference(rectify,[],[f10]) ).
thf(f27,plain,
~ ( ( dsetconstrER = $true )
=> ( ( theprop = $true )
=> ( ( funcImageSingleton = $true )
=> ! [X0: $i,X1: $i,X2: $i] :
( ( ( func @ X0 @ X1 @ X2 )
= $true )
=> ! [X3: $i] :
( ( ( in @ X3 @ X0 )
= $true )
=> ( ( in @ ( kpair @ X3 @ ( ap @ X0 @ X1 @ X2 @ X3 ) ) @ X2 )
= $true ) ) ) ) ) ),
inference(fool_elimination,[],[f26]) ).
thf(f28,plain,
( ? [X0: $i,X1: $i,X2: $i] :
( ? [X3: $i] :
( ( ( in @ ( kpair @ X3 @ ( ap @ X0 @ X1 @ X2 @ X3 ) ) @ X2 )
!= $true )
& ( ( in @ X3 @ X0 )
= $true ) )
& ( ( func @ X0 @ X1 @ X2 )
= $true ) )
& ( funcImageSingleton = $true )
& ( theprop = $true )
& ( dsetconstrER = $true ) ),
inference(ennf_transformation,[],[f27]) ).
thf(f29,plain,
( ? [X0: $i,X1: $i,X2: $i] :
( ? [X3: $i] :
( ( ( in @ ( kpair @ X3 @ ( ap @ X0 @ X1 @ X2 @ X3 ) ) @ X2 )
!= $true )
& ( ( in @ X3 @ X0 )
= $true ) )
& ( ( func @ X0 @ X1 @ X2 )
= $true ) )
& ( funcImageSingleton = $true )
& ( theprop = $true )
& ( dsetconstrER = $true ) ),
inference(flattening,[],[f28]) ).
thf(f30,plain,
( ( $true
!= ( in @ ( kpair @ sK3 @ ( ap @ sK0 @ sK1 @ sK2 @ sK3 ) ) @ sK2 ) )
& ( $true
= ( in @ sK3 @ sK0 ) )
& ( $true
= ( func @ sK0 @ sK1 @ sK2 ) )
& ( funcImageSingleton = $true )
& ( theprop = $true )
& ( dsetconstrER = $true ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f29]) ).
thf(f31,plain,
( dsetconstrER
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0
@ ( dsetconstr @ Y2
@ ^ [Y3: $i] : ( Y1 @ Y3 ) ) )
=> ( Y1 @ Y0 ) ) ) ) ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f32,plain,
( singleton
= ( ^ [Y0: $i] :
( ?? @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ Y0 )
& ( ( setadjoin @ Y1 @ emptyset )
= Y0 ) ) ) ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f33,plain,
( ex1
= ( ^ [Y0: $i,Y1: $i > $o] :
( singleton
@ ( dsetconstr @ Y0
@ ^ [Y2: $i] : ( Y1 @ Y2 ) ) ) ) ),
inference(cnf_transformation,[],[f16]) ).
thf(f34,plain,
( theprop
= ( !! @ $i
@ ^ [Y0: $i] :
( ( singleton @ Y0 )
=> ( in @ ( setunion @ Y0 ) @ Y0 ) ) ) ),
inference(cnf_transformation,[],[f18]) ).
thf(f35,plain,
( breln
= ( ^ [Y0: $i,Y1: $i,Y2: $i] : ( subset @ Y2 @ ( cartprod @ Y0 @ Y1 ) ) ) ),
inference(cnf_transformation,[],[f19]) ).
thf(f36,plain,
( func
= ( ^ [Y0: $i,Y1: $i,Y2: $i] :
( ( breln @ Y0 @ Y1 @ Y2 )
& ( !! @ $i
@ ^ [Y3: $i] :
( ( in @ Y3 @ Y0 )
=> ( ex1 @ Y1
@ ^ [Y4: $i] : ( in @ ( kpair @ Y3 @ Y4 ) @ Y2 ) ) ) ) ) ) ),
inference(cnf_transformation,[],[f21]) ).
thf(f38,plain,
( ap
= ( ^ [Y0: $i,Y1: $i,Y2: $i,Y3: $i] :
( setunion
@ ( dsetconstr @ Y1
@ ^ [Y4: $i] : ( in @ ( kpair @ Y3 @ Y4 ) @ Y2 ) ) ) ) ),
inference(cnf_transformation,[],[f25]) ).
thf(f39,plain,
dsetconstrER = $true,
inference(cnf_transformation,[],[f30]) ).
thf(f40,plain,
theprop = $true,
inference(cnf_transformation,[],[f30]) ).
thf(f42,plain,
( $true
= ( func @ sK0 @ sK1 @ sK2 ) ),
inference(cnf_transformation,[],[f30]) ).
thf(f43,plain,
( $true
= ( in @ sK3 @ sK0 ) ),
inference(cnf_transformation,[],[f30]) ).
thf(f44,plain,
( $true
!= ( in @ ( kpair @ sK3 @ ( ap @ sK0 @ sK1 @ sK2 @ sK3 ) ) @ sK2 ) ),
inference(cnf_transformation,[],[f30]) ).
thf(f47,plain,
( ex1
= ( ^ [Y0: $i,Y1: $i > $o] :
( ^ [Y2: $i] :
( ?? @ $i
@ ^ [Y3: $i] :
( ( in @ Y3 @ Y2 )
& ( ( setadjoin @ Y3 @ emptyset )
= Y2 ) ) )
@ ( dsetconstr @ Y0
@ ^ [Y2: $i] : ( Y1 @ Y2 ) ) ) ) ),
inference(definition_unfolding,[],[f33,f32]) ).
thf(f48,plain,
( func
= ( ^ [Y0: $i,Y1: $i,Y2: $i] :
( ( ^ [Y3: $i,Y4: $i,Y5: $i] : ( subset @ Y5 @ ( cartprod @ Y3 @ Y4 ) )
@ Y0
@ Y1
@ Y2 )
& ( !! @ $i
@ ^ [Y3: $i] :
( ( in @ Y3 @ Y0 )
=> ( ^ [Y4: $i,Y5: $i > $o] :
( ^ [Y6: $i] :
( ?? @ $i
@ ^ [Y7: $i] :
( ( in @ Y7 @ Y6 )
& ( ( setadjoin @ Y7 @ emptyset )
= Y6 ) ) )
@ ( dsetconstr @ Y4
@ ^ [Y6: $i] : ( Y5 @ Y6 ) ) )
@ Y1
@ ^ [Y4: $i] : ( in @ ( kpair @ Y3 @ Y4 ) @ Y2 ) ) ) ) ) ) ),
inference(definition_unfolding,[],[f36,f35,f47]) ).
thf(f49,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0
@ ( dsetconstr @ Y2
@ ^ [Y3: $i] : ( Y1 @ Y3 ) ) )
=> ( Y1 @ Y0 ) ) ) ) )
= $true ),
inference(definition_unfolding,[],[f31,f39]) ).
thf(f50,plain,
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( ^ [Y1: $i] :
( ?? @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
& ( ( setadjoin @ Y2 @ emptyset )
= Y1 ) ) )
@ Y0 )
=> ( in @ ( setunion @ Y0 ) @ Y0 ) ) ) ),
inference(definition_unfolding,[],[f34,f40,f32]) ).
thf(f52,plain,
( $true
!= ( in
@ ( kpair @ sK3
@ ( ^ [Y0: $i,Y1: $i,Y2: $i,Y3: $i] :
( setunion
@ ( dsetconstr @ Y1
@ ^ [Y4: $i] : ( in @ ( kpair @ Y3 @ Y4 ) @ Y2 ) ) )
@ sK0
@ sK1
@ sK2
@ sK3 ) )
@ sK2 ) ),
inference(definition_unfolding,[],[f44,f38]) ).
thf(f53,plain,
( $true
= ( ^ [Y0: $i,Y1: $i,Y2: $i] :
( ( ^ [Y3: $i,Y4: $i,Y5: $i] : ( subset @ Y5 @ ( cartprod @ Y3 @ Y4 ) )
@ Y0
@ Y1
@ Y2 )
& ( !! @ $i
@ ^ [Y3: $i] :
( ( in @ Y3 @ Y0 )
=> ( ^ [Y4: $i,Y5: $i > $o] :
( ^ [Y6: $i] :
( ?? @ $i
@ ^ [Y7: $i] :
( ( in @ Y7 @ Y6 )
& ( ( setadjoin @ Y7 @ emptyset )
= Y6 ) ) )
@ ( dsetconstr @ Y4
@ ^ [Y6: $i] : ( Y5 @ Y6 ) ) )
@ Y1
@ ^ [Y4: $i] : ( in @ ( kpair @ Y3 @ Y4 ) @ Y2 ) ) ) ) )
@ sK0
@ sK1
@ sK2 ) ),
inference(definition_unfolding,[],[f42,f48]) ).
thf(f54,plain,
( $true
= ( ( subset @ sK2 @ ( cartprod @ sK0 @ sK1 ) )
& ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ sK0 )
=> ( ?? @ $i
@ ^ [Y1: $i] :
( ( in @ Y1
@ ( dsetconstr @ sK1
@ ^ [Y2: $i] : ( in @ ( kpair @ Y0 @ Y2 ) @ sK2 ) ) )
& ( ( setadjoin @ Y1 @ emptyset )
= ( dsetconstr @ sK1
@ ^ [Y2: $i] : ( in @ ( kpair @ Y0 @ Y2 ) @ sK2 ) ) ) ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f53]) ).
thf(f55,plain,
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ sK0 )
=> ( ?? @ $i
@ ^ [Y1: $i] :
( ( in @ Y1
@ ( dsetconstr @ sK1
@ ^ [Y2: $i] : ( in @ ( kpair @ Y0 @ Y2 ) @ sK2 ) ) )
& ( ( setadjoin @ Y1 @ emptyset )
= ( dsetconstr @ sK1
@ ^ [Y2: $i] : ( in @ ( kpair @ Y0 @ Y2 ) @ sK2 ) ) ) ) ) ) ) ),
inference(and_proxy_clausification,[],[f54]) ).
thf(f57,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( in @ Y0 @ sK0 )
=> ( ?? @ $i
@ ^ [Y1: $i] :
( ( in @ Y1
@ ( dsetconstr @ sK1
@ ^ [Y2: $i] : ( in @ ( kpair @ Y0 @ Y2 ) @ sK2 ) ) )
& ( ( setadjoin @ Y1 @ emptyset )
= ( dsetconstr @ sK1
@ ^ [Y2: $i] : ( in @ ( kpair @ Y0 @ Y2 ) @ sK2 ) ) ) ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f55]) ).
thf(f58,plain,
! [X1: $i] :
( $true
= ( ( in @ X1 @ sK0 )
=> ( ?? @ $i
@ ^ [Y0: $i] :
( ( in @ Y0
@ ( dsetconstr @ sK1
@ ^ [Y1: $i] : ( in @ ( kpair @ X1 @ Y1 ) @ sK2 ) ) )
& ( ( setadjoin @ Y0 @ emptyset )
= ( dsetconstr @ sK1
@ ^ [Y1: $i] : ( in @ ( kpair @ X1 @ Y1 ) @ sK2 ) ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f57]) ).
thf(f59,plain,
! [X1: $i] :
( ( $false
= ( in @ X1 @ sK0 ) )
| ( $true
= ( ?? @ $i
@ ^ [Y0: $i] :
( ( in @ Y0
@ ( dsetconstr @ sK1
@ ^ [Y1: $i] : ( in @ ( kpair @ X1 @ Y1 ) @ sK2 ) ) )
& ( ( setadjoin @ Y0 @ emptyset )
= ( dsetconstr @ sK1
@ ^ [Y1: $i] : ( in @ ( kpair @ X1 @ Y1 ) @ sK2 ) ) ) ) ) ) ),
inference(imp_proxy_clausification,[],[f58]) ).
thf(f60,plain,
! [X1: $i] :
( ( $false
= ( in @ X1 @ sK0 ) )
| ( $true
= ( ^ [Y0: $i] :
( ( in @ Y0
@ ( dsetconstr @ sK1
@ ^ [Y1: $i] : ( in @ ( kpair @ X1 @ Y1 ) @ sK2 ) ) )
& ( ( setadjoin @ Y0 @ emptyset )
= ( dsetconstr @ sK1
@ ^ [Y1: $i] : ( in @ ( kpair @ X1 @ Y1 ) @ sK2 ) ) ) )
@ ( sK4 @ X1 ) ) ) ),
inference(sigma_proxy_clausification,[],[f59]) ).
thf(f61,plain,
! [X1: $i] :
( ( $false
= ( in @ X1 @ sK0 ) )
| ( $true
= ( ( in @ ( sK4 @ X1 )
@ ( dsetconstr @ sK1
@ ^ [Y0: $i] : ( in @ ( kpair @ X1 @ Y0 ) @ sK2 ) ) )
& ( ( setadjoin @ ( sK4 @ X1 ) @ emptyset )
= ( dsetconstr @ sK1
@ ^ [Y0: $i] : ( in @ ( kpair @ X1 @ Y0 ) @ sK2 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f60]) ).
thf(f62,plain,
! [X1: $i] :
( ( $false
= ( in @ X1 @ sK0 ) )
| ( $true
= ( ( setadjoin @ ( sK4 @ X1 ) @ emptyset )
= ( dsetconstr @ sK1
@ ^ [Y0: $i] : ( in @ ( kpair @ X1 @ Y0 ) @ sK2 ) ) ) ) ),
inference(and_proxy_clausification,[],[f61]) ).
thf(f63,plain,
! [X1: $i] :
( ( $true
= ( in @ ( sK4 @ X1 )
@ ( dsetconstr @ sK1
@ ^ [Y0: $i] : ( in @ ( kpair @ X1 @ Y0 ) @ sK2 ) ) ) )
| ( $false
= ( in @ X1 @ sK0 ) ) ),
inference(and_proxy_clausification,[],[f61]) ).
thf(f64,plain,
! [X1: $i] :
( ( ( dsetconstr @ sK1
@ ^ [Y0: $i] : ( in @ ( kpair @ X1 @ Y0 ) @ sK2 ) )
= ( setadjoin @ ( sK4 @ X1 ) @ emptyset ) )
| ( $false
= ( in @ X1 @ sK0 ) ) ),
inference(equality_proxy_clausification,[],[f62]) ).
thf(f65,plain,
( $true
!= ( in
@ ( kpair @ sK3
@ ( setunion
@ ( dsetconstr @ sK1
@ ^ [Y0: $i] : ( in @ ( kpair @ sK3 @ Y0 ) @ sK2 ) ) ) )
@ sK2 ) ),
inference(beta-eta_normalization,[],[f52]) ).
thf(f94,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( ^ [Y1: $i] :
( ?? @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
& ( ( setadjoin @ Y2 @ emptyset )
= Y1 ) ) )
@ Y0 )
=> ( in @ ( setunion @ Y0 ) @ Y0 ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f50]) ).
thf(f95,plain,
! [X1: $i] :
( $true
= ( ( ?? @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ X1 )
& ( ( setadjoin @ Y0 @ emptyset )
= X1 ) ) )
=> ( in @ ( setunion @ X1 ) @ X1 ) ) ),
inference(beta-eta_normalization,[],[f94]) ).
thf(f96,plain,
! [X1: $i] :
( ( $false
= ( ?? @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ X1 )
& ( ( setadjoin @ Y0 @ emptyset )
= X1 ) ) ) )
| ( $true
= ( in @ ( setunion @ X1 ) @ X1 ) ) ),
inference(imp_proxy_clausification,[],[f95]) ).
thf(f97,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( ^ [Y0: $i] :
( ( in @ Y0 @ X1 )
& ( ( setadjoin @ Y0 @ emptyset )
= X1 ) )
@ X2 ) )
| ( $true
= ( in @ ( setunion @ X1 ) @ X1 ) ) ),
inference(pi_proxy_clausification,[],[f96]) ).
thf(f98,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( ( in @ X2 @ X1 )
& ( ( setadjoin @ X2 @ emptyset )
= X1 ) ) )
| ( $true
= ( in @ ( setunion @ X1 ) @ X1 ) ) ),
inference(beta-eta_normalization,[],[f97]) ).
thf(f99,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( ( setadjoin @ X2 @ emptyset )
= X1 ) )
| ( $true
= ( in @ ( setunion @ X1 ) @ X1 ) )
| ( $false
= ( in @ X2 @ X1 ) ) ),
inference(and_proxy_clausification,[],[f98]) ).
thf(f100,plain,
! [X2: $i,X1: $i] :
( ( ( setadjoin @ X2 @ emptyset )
!= X1 )
| ( $true
= ( in @ ( setunion @ X1 ) @ X1 ) )
| ( $false
= ( in @ X2 @ X1 ) ) ),
inference(equality_proxy_clausification,[],[f99]) ).
thf(f101,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0
@ ( dsetconstr @ Y2
@ ^ [Y3: $i] : ( Y1 @ Y3 ) ) )
=> ( Y1 @ Y0 ) ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f49]) ).
thf(f102,plain,
! [X1: $i] :
( $true
= ( !! @ ( $i > $o )
@ ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ X1 @ ( dsetconstr @ Y1 @ Y0 ) )
=> ( Y0 @ X1 ) ) ) ) ),
inference(beta-eta_normalization,[],[f101]) ).
thf(f103,plain,
! [X2: $i > $o,X1: $i] :
( $true
= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ X1 @ ( dsetconstr @ Y1 @ Y0 ) )
=> ( Y0 @ X1 ) ) )
@ X2 ) ),
inference(pi_proxy_clausification,[],[f102]) ).
thf(f104,plain,
! [X2: $i > $o,X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ X1 @ ( dsetconstr @ Y0 @ X2 ) )
=> ( X2 @ X1 ) ) ) ),
inference(beta-eta_normalization,[],[f103]) ).
thf(f105,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( in @ X1 @ ( dsetconstr @ Y0 @ X2 ) )
=> ( X2 @ X1 ) )
@ X3 ) ),
inference(pi_proxy_clausification,[],[f104]) ).
thf(f106,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( $true
= ( ( in @ X1 @ ( dsetconstr @ X3 @ X2 ) )
=> ( X2 @ X1 ) ) ),
inference(beta-eta_normalization,[],[f105]) ).
thf(f107,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( ( $false
= ( in @ X1 @ ( dsetconstr @ X3 @ X2 ) ) )
| ( $true
= ( X2 @ X1 ) ) ),
inference(imp_proxy_clausification,[],[f106]) ).
thf(f120,plain,
! [X0: $i] :
( ( $true
= ( in @ ( setunion @ ( setadjoin @ X0 @ emptyset ) ) @ ( setadjoin @ X0 @ emptyset ) ) )
| ( $false
= ( in @ X0 @ ( setadjoin @ X0 @ emptyset ) ) ) ),
inference(equality_resolution,[],[f100]) ).
thf(f141,plain,
! [X0: $i,X1: $i] :
( ( ( setadjoin @ ( sK4 @ X1 ) @ emptyset )
= ( setadjoin @ ( sK4 @ X0 ) @ emptyset ) )
| ( $false
= ( in @ X1 @ sK0 ) )
| ( $false
= ( in @ X0 @ sK0 ) )
| ( ( ^ [Y0: $i] : X0 )
!= ( ^ [Y0: $i] : X1 ) ) ),
inference(constrained_superposition,[],[f64,f64]) ).
thf(f142,plain,
! [X0: $i,X1: $i] :
( ( $false
= ( in @ X1 @ ( setadjoin @ ( sK4 @ X0 ) @ emptyset ) ) )
| ( $true
= ( ^ [Y0: $i] : ( in @ ( kpair @ X0 @ Y0 ) @ sK2 )
@ X1 ) )
| ( $false
= ( in @ X0 @ sK0 ) ) ),
inference(constrained_superposition,[],[f107,f64]) ).
thf(f144,plain,
( ( $true
!= ( in @ ( kpair @ sK3 @ ( setunion @ ( setadjoin @ ( sK4 @ sK3 ) @ emptyset ) ) ) @ sK2 ) )
| ( ( in @ sK3 @ sK0 )
= $false ) ),
inference(constrained_superposition,[],[f65,f64]) ).
thf(f145,plain,
! [X0: $i,X1: $i] :
( ( $true
= ( in @ ( sK4 @ X1 ) @ ( setadjoin @ ( sK4 @ X0 ) @ emptyset ) ) )
| ( $false
= ( in @ X1 @ sK0 ) )
| ( $false
= ( in @ X0 @ sK0 ) )
| ( ( ^ [Y0: $i] : X0 )
!= ( ^ [Y0: $i] : X1 ) ) ),
inference(constrained_superposition,[],[f63,f64]) ).
thf(f146,plain,
! [X0: $i,X1: $i] :
( ( $false
= ( in @ X1 @ ( setadjoin @ ( sK4 @ X0 ) @ emptyset ) ) )
| ( $true
= ( in @ ( kpair @ X0 @ X1 ) @ sK2 ) )
| ( $false
= ( in @ X0 @ sK0 ) ) ),
inference(beta-eta_normalization,[],[f142]) ).
thf(f147,plain,
( ( $true = $false )
| ( $true
!= ( in @ ( kpair @ sK3 @ ( setunion @ ( setadjoin @ ( sK4 @ sK3 ) @ emptyset ) ) ) @ sK2 ) ) ),
inference(forward_demodulation,[],[f144,f43]) ).
thf(f148,plain,
( $true
!= ( in @ ( kpair @ sK3 @ ( setunion @ ( setadjoin @ ( sK4 @ sK3 ) @ emptyset ) ) ) @ sK2 ) ),
inference(trivial_inequality_removal,[],[f147]) ).
thf(f158,plain,
! [X0: $i] :
( ( $true = $false )
| ( $false
= ( in @ ( sK4 @ X0 ) @ ( setadjoin @ ( sK4 @ X0 ) @ emptyset ) ) )
| ( $true
= ( in @ ( kpair @ X0 @ ( setunion @ ( setadjoin @ ( sK4 @ X0 ) @ emptyset ) ) ) @ sK2 ) )
| ( $false
= ( in @ X0 @ sK0 ) ) ),
inference(constrained_superposition,[],[f120,f146]) ).
thf(f159,plain,
! [X0: $i] :
( ( $true
= ( in @ ( kpair @ X0 @ ( setunion @ ( setadjoin @ ( sK4 @ X0 ) @ emptyset ) ) ) @ sK2 ) )
| ( $false
= ( in @ ( sK4 @ X0 ) @ ( setadjoin @ ( sK4 @ X0 ) @ emptyset ) ) )
| ( $false
= ( in @ X0 @ sK0 ) ) ),
inference(trivial_inequality_removal,[],[f158]) ).
thf(f174,plain,
! [X0: $i] :
( ( $true
!= ( in @ ( kpair @ sK3 @ ( setunion @ ( setadjoin @ ( sK4 @ X0 ) @ emptyset ) ) ) @ sK2 ) )
| ( $false
= ( in @ X0 @ sK0 ) )
| ( ( in @ sK3 @ sK0 )
= $false )
| ( ( ^ [Y0: $i] : X0 )
!= ( ^ [Y0: $i] : sK3 ) ) ),
inference(constrained_superposition,[],[f148,f141]) ).
thf(f182,plain,
! [X0: $i] :
( ( $true = $false )
| ( $true
!= ( in @ ( kpair @ sK3 @ ( setunion @ ( setadjoin @ ( sK4 @ X0 ) @ emptyset ) ) ) @ sK2 ) )
| ( $false
= ( in @ X0 @ sK0 ) )
| ( ( ^ [Y0: $i] : X0 )
!= ( ^ [Y0: $i] : sK3 ) ) ),
inference(forward_demodulation,[],[f174,f43]) ).
thf(f183,plain,
! [X0: $i] :
( ( $true
!= ( in @ ( kpair @ sK3 @ ( setunion @ ( setadjoin @ ( sK4 @ X0 ) @ emptyset ) ) ) @ sK2 ) )
| ( $false
= ( in @ X0 @ sK0 ) )
| ( ( ^ [Y0: $i] : X0 )
!= ( ^ [Y0: $i] : sK3 ) ) ),
inference(trivial_inequality_removal,[],[f182]) ).
thf(f217,plain,
( ( $true != $true )
| ( ( in @ sK3 @ sK0 )
= $false )
| ( ( ^ [Y0: $i] : sK3 )
!= ( ^ [Y0: $i] : sK3 ) )
| ( $false
= ( in @ ( sK4 @ sK3 ) @ ( setadjoin @ ( sK4 @ sK3 ) @ emptyset ) ) )
| ( ( in @ sK3 @ sK0 )
= $false ) ),
inference(constrained_superposition,[],[f183,f159]) ).
thf(f218,plain,
( ( $true != $true )
| ( ( in @ sK3 @ sK0 )
= $false )
| ( ( ^ [Y0: $i] : sK3 )
!= ( ^ [Y0: $i] : sK3 ) )
| ( $false
= ( in @ ( sK4 @ sK3 ) @ ( setadjoin @ ( sK4 @ sK3 ) @ emptyset ) ) ) ),
inference(duplicate_literal_removal,[],[f217]) ).
thf(f219,plain,
( ( ( in @ sK3 @ sK0 )
= $false )
| ( $false
= ( in @ ( sK4 @ sK3 ) @ ( setadjoin @ ( sK4 @ sK3 ) @ emptyset ) ) ) ),
inference(trivial_inequality_removal,[],[f218]) ).
thf(f225,plain,
( ( $true = $false )
| ( $false
= ( in @ ( sK4 @ sK3 ) @ ( setadjoin @ ( sK4 @ sK3 ) @ emptyset ) ) ) ),
inference(forward_demodulation,[],[f219,f43]) ).
thf(f226,plain,
( $false
= ( in @ ( sK4 @ sK3 ) @ ( setadjoin @ ( sK4 @ sK3 ) @ emptyset ) ) ),
inference(trivial_inequality_removal,[],[f225]) ).
thf(f237,plain,
( ( $true = $false )
| ( ( in @ sK3 @ sK0 )
= $false )
| ( ( in @ sK3 @ sK0 )
= $false )
| ( ( ^ [Y0: $i] : sK3 )
!= ( ^ [Y0: $i] : sK3 ) ) ),
inference(constrained_superposition,[],[f145,f226]) ).
thf(f238,plain,
( ( $true = $false )
| ( ( in @ sK3 @ sK0 )
= $false )
| ( ( ^ [Y0: $i] : sK3 )
!= ( ^ [Y0: $i] : sK3 ) ) ),
inference(duplicate_literal_removal,[],[f237]) ).
thf(f239,plain,
( ( in @ sK3 @ sK0 )
= $false ),
inference(trivial_inequality_removal,[],[f238]) ).
thf(f249,plain,
$true = $false,
inference(constrained_superposition,[],[f43,f239]) ).
thf(f250,plain,
$false,
inference(trivial_inequality_removal,[],[f249]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU684^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.18 % Computer : n018.cluster.edu
% 0.09/0.18 % Model : x86_64 x86_64
% 0.09/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18 % Memory : 8046.5625MB
% 0.09/0.18 % OS : Linux 6.8.0-71-generic
% 0.09/0.18 % CPULimit : 300
% 0.09/0.18 % WCLimit : 300
% 0.09/0.18 % DateTime : Tue Sep 29 14:10:56 UTC 2026
% 0.09/0.18 % CPUTime :
% 0.09/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.21 Running first-order model finding
% 0.09/0.21 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.32 % (132999)Will run a generic schedule for satisfiability detection.
% 0.18/0.32 % (133004)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1699976641_2999 on theBenchmark for (2999ds/0Mi)
% 0.18/0.32 % Exception at run slice level
% 0.18/0.32 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.18/0.32 % (133005)% WARNING: option uhcvi not known.
% 0.18/0.32 % (133005)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2665483454:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.18/0.32 % (133008)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3741717670:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.18/0.32 % (133007)dis+10_1_sil=32000:sp=arity:random_seed=1781164196:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.18/0.32 % (133006)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=169145698:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.18/0.32 % (133009)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=883127517:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.18/0.32 % (133005)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.18/0.32 % (133008)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.18/0.32 % (133005)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.18/0.32 % (133010)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3678371305:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.18/0.32 % (133012)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2229958332:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.18/0.32 % Exception at run slice level
% 0.18/0.32 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.18/0.32 % (133009)Instruction limit reached!
% 0.18/0.32 % (133009)------------------------------
% 0.18/0.32 % (133009)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.32 % (133009)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.32 % (133009)CaDiCaL version: 2.1.3
% 0.18/0.32 % (133009)Termination reason: Instruction limit
% 0.18/0.32 % (133009)Termination phase: Saturation
% 0.18/0.32 % (133009)Time elapsed: 0.036 s
% 0.18/0.32 % (133009)Peak memory usage: 12 MB
% 0.18/0.32 % (133009)Instructions burned: 135 (million)
% 0.18/0.32 % (133020)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3676633001:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 0.18/0.32 % (133026)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=2718867895:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 0.18/0.32 % (133026)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.18/0.32 % (133026)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.18/0.32 % (133007)Instruction limit reached!
% 0.18/0.32 % (133007)------------------------------
% 0.18/0.32 % (133007)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.32 % (133007)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.32 % (133007)CaDiCaL version: 2.1.3
% 0.18/0.32 % (133007)Termination reason: Instruction limit
% 0.18/0.32 % (133007)Termination phase: Saturation
% 0.18/0.32 % (133007)Time elapsed: 0.053 s
% 0.18/0.32 % (133007)Peak memory usage: 12 MB
% 0.18/0.32 % (133007)Instructions burned: 105 (million)
% 0.18/0.32 % (133026) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-132999-133026"...
% 0.18/0.32 % (133026)...printing done.
% 0.18/0.32 % (133026)Refutation found. Thanks to Tanya!
% 0.18/0.32 % SZS status Theorem for theBenchmark
% 0.18/0.32 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.32 % (133026)------------------------------
% 0.18/0.32 % (133026)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.32 % (133026)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.32 % (133026)CaDiCaL version: 2.1.3
% 0.18/0.32 % (133026)Termination reason: Refutation
% 0.18/0.32 % (133026)Time elapsed: 0.010 s
% 0.18/0.32 % (133026)Peak memory usage: 13 MB
% 0.18/0.32 % (133026)Instructions burned: 32 (million)
% 0.18/0.32 % (132999)Success in time 0.098 s
% 0.18/0.32 % Vampire exiting
%------------------------------------------------------------------------------