%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU649^2 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n026.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:50 AM UTC 2026
% Result : Theorem 1.60s 0.55s
% Output : Refutation 1.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 32
% Number of leaves : 11
% Syntax : Number of formulae : 130 ( 51 unt; 0 typ; 6 def)
% Number of atoms : 1114 ( 357 equ; 0 cnn)
% Maximal formula atoms : 7 ( 8 avg)
% Number of connectives : 1264 ( 9 ~; 154 |; 18 &; 879 @)
% ( 0 <=>; 114 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 33 ( 29 usr; 18 con; 0-4 aty)
% ( 90 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 252 ( 105 ^; 143 !; 4 ?; 252 :)
% 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,
setext: $o ).
thf(func_def_5,type,
setadjoinIL: $o ).
thf(func_def_6,type,
uniqinunit: $o ).
thf(func_def_7,type,
eqinunit: $o ).
thf(func_def_8,type,
upairset2E: $o ).
thf(func_def_9,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_10,type,
vIMP: $o > $o > $o ).
thf(func_def_11,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_12,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_13,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_14,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_15,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_16,type,
vOR: $o > $o > $o ).
thf(func_def_21,type,
sF2: $o ).
thf(func_def_22,type,
sF3: $o ).
thf(func_def_23,type,
sF4: $o ).
thf(func_def_24,type,
sF5: $o ).
thf(func_def_25,type,
sF6: $o ).
thf(func_def_28,type,
vNOT: $o > $o ).
thf(func_def_31,type,
sK11: $i > $i > $i ).
thf(func_def_32,type,
sK12: $i > $i > $i ).
thf(f1,axiom,
( setext
= ( ! [X0: $i,X1: $i] :
( ! [X2: $i] :
( ( in @ X2 @ X0 )
=> ( in @ X2 @ X1 ) )
=> ( ! [X2: $i] :
( ( in @ X2 @ X1 )
=> ( in @ X2 @ X0 ) )
=> ( X0 = X1 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setext) ).
thf(f2,axiom,
( setadjoinIL
= ( ! [X0: $i,X1: $i] : ( in @ X0 @ ( setadjoin @ X0 @ X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setadjoinIL) ).
thf(f3,axiom,
( uniqinunit
= ( ! [X0: $i,X1: $i] :
( ( in @ X0 @ ( setadjoin @ X1 @ emptyset ) )
=> ( X0 = X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',uniqinunit) ).
thf(f5,axiom,
( upairset2E
= ( ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X2 @ ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) ) )
=> ( ( X2 = X1 )
| ( X2 = X0 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',upairset2E) ).
thf(f6,conjecture,
( setext
=> ( setadjoinIL
=> ( uniqinunit
=> ( eqinunit
=> ( upairset2E
=> ! [X0: $i,X1: $i] :
( ( X0 = X1 )
=> ( ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) )
= ( setadjoin @ X0 @ emptyset ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setukpairinjR11) ).
thf(f7,negated_conjecture,
~ ( setext
=> ( setadjoinIL
=> ( uniqinunit
=> ( eqinunit
=> ( upairset2E
=> ! [X0: $i,X1: $i] :
( ( X0 = X1 )
=> ( ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) )
= ( setadjoin @ X0 @ emptyset ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f6]) ).
thf(f8,plain,
( setext
= ( ! [X0: $i,X1: $i] :
( ! [X2: $i] :
( ( in @ X2 @ X0 )
=> ( in @ X2 @ X1 ) )
=> ( ! [X3: $i] :
( ( in @ X3 @ X1 )
=> ( in @ X3 @ X0 ) )
=> ( X0 = X1 ) ) ) ) ),
inference(rectify,[],[f1]) ).
thf(f9,plain,
( setext
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
=> ( in @ Y2 @ Y0 ) ) )
=> ( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y0 )
=> ( in @ Y2 @ Y1 ) ) )
=> ( Y1 = Y0 ) ) ) ) ) ),
inference(fool_elimination,[],[f8]) ).
thf(f10,plain,
( setadjoinIL
= ( ! [X0: $i,X1: $i] : ( in @ X0 @ ( setadjoin @ X0 @ X1 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f11,plain,
( setadjoinIL
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] : ( in @ Y1 @ ( setadjoin @ Y1 @ Y0 ) ) ) ) ),
inference(fool_elimination,[],[f10]) ).
thf(f12,plain,
( uniqinunit
= ( ! [X0: $i,X1: $i] :
( ( in @ X0 @ ( setadjoin @ X1 @ emptyset ) )
=> ( X0 = X1 ) ) ) ),
inference(rectify,[],[f3]) ).
thf(f13,plain,
( uniqinunit
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ ( setadjoin @ Y0 @ emptyset ) )
=> ( Y1 = Y0 ) ) ) ) ),
inference(fool_elimination,[],[f12]) ).
thf(f16,plain,
( upairset2E
= ( ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X2 @ ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) ) )
=> ( ( X2 = X1 )
| ( X2 = X0 ) ) ) ) ),
inference(rectify,[],[f5]) ).
thf(f17,plain,
( upairset2E
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ ( setadjoin @ Y2 @ ( setadjoin @ Y1 @ emptyset ) ) )
=> ( ( Y2 = Y0 )
| ( Y1 = Y0 ) ) ) ) ) ) ),
inference(fool_elimination,[],[f16]) ).
thf(f18,plain,
~ ( setext
=> ( setadjoinIL
=> ( uniqinunit
=> ( eqinunit
=> ( upairset2E
=> ! [X0: $i,X1: $i] :
( ( X0 = X1 )
=> ( ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) )
= ( setadjoin @ X0 @ emptyset ) ) ) ) ) ) ) ),
inference(rectify,[],[f7]) ).
thf(f19,plain,
~ ( ( setext = $true )
=> ( ( setadjoinIL = $true )
=> ( ( uniqinunit = $true )
=> ( ( eqinunit = $true )
=> ( ( upairset2E = $true )
=> ! [X0: $i,X1: $i] :
( ( X0 = X1 )
=> ( ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) )
= ( setadjoin @ X0 @ emptyset ) ) ) ) ) ) ) ),
inference(fool_elimination,[],[f18]) ).
thf(f20,plain,
( ? [X0: $i,X1: $i] :
( ( ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) )
!= ( setadjoin @ X0 @ emptyset ) )
& ( X0 = X1 ) )
& ( upairset2E = $true )
& ( eqinunit = $true )
& ( uniqinunit = $true )
& ( setadjoinIL = $true )
& ( setext = $true ) ),
inference(ennf_transformation,[],[f19]) ).
thf(f21,plain,
( ? [X0: $i,X1: $i] :
( ( ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) )
!= ( setadjoin @ X0 @ emptyset ) )
& ( X0 = X1 ) )
& ( upairset2E = $true )
& ( eqinunit = $true )
& ( uniqinunit = $true )
& ( setadjoinIL = $true )
& ( setext = $true ) ),
inference(flattening,[],[f20]) ).
thf(f22,plain,
( ( ( setadjoin @ sK0 @ ( setadjoin @ sK1 @ emptyset ) )
!= ( setadjoin @ sK0 @ emptyset ) )
& ( sK0 = sK1 )
& ( upairset2E = $true )
& ( eqinunit = $true )
& ( uniqinunit = $true )
& ( setadjoinIL = $true )
& ( setext = $true ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f21]) ).
thf(f23,plain,
( setext
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
=> ( in @ Y2 @ Y0 ) ) )
=> ( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y0 )
=> ( in @ Y2 @ Y1 ) ) )
=> ( Y1 = Y0 ) ) ) ) ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f24,plain,
( setadjoinIL
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] : ( in @ Y1 @ ( setadjoin @ Y1 @ Y0 ) ) ) ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f25,plain,
( uniqinunit
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ ( setadjoin @ Y0 @ emptyset ) )
=> ( Y1 = Y0 ) ) ) ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f27,plain,
( upairset2E
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ ( setadjoin @ Y2 @ ( setadjoin @ Y1 @ emptyset ) ) )
=> ( ( Y2 = Y0 )
| ( Y1 = Y0 ) ) ) ) ) ) ),
inference(cnf_transformation,[],[f17]) ).
thf(f28,plain,
setext = $true,
inference(cnf_transformation,[],[f22]) ).
thf(f29,plain,
setadjoinIL = $true,
inference(cnf_transformation,[],[f22]) ).
thf(f30,plain,
uniqinunit = $true,
inference(cnf_transformation,[],[f22]) ).
thf(f32,plain,
upairset2E = $true,
inference(cnf_transformation,[],[f22]) ).
thf(f33,plain,
sK0 = sK1,
inference(cnf_transformation,[],[f22]) ).
thf(f34,plain,
( ( setadjoin @ sK0 @ ( setadjoin @ sK1 @ emptyset ) )
!= ( setadjoin @ sK0 @ emptyset ) ),
inference(cnf_transformation,[],[f22]) ).
thf(f37,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
=> ( in @ Y2 @ Y0 ) ) )
=> ( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y0 )
=> ( in @ Y2 @ Y1 ) ) )
=> ( Y1 = Y0 ) ) ) ) )
= $true ),
inference(definition_unfolding,[],[f23,f28]) ).
thf(f38,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] : ( in @ Y1 @ ( setadjoin @ Y1 @ Y0 ) ) ) )
= $true ),
inference(definition_unfolding,[],[f24,f29]) ).
thf(f39,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ ( setadjoin @ Y0 @ emptyset ) )
=> ( Y1 = Y0 ) ) ) )
= $true ),
inference(definition_unfolding,[],[f25,f30]) ).
thf(f41,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ ( setadjoin @ Y2 @ ( setadjoin @ Y1 @ emptyset ) ) )
=> ( ( Y2 = Y0 )
| ( Y1 = Y0 ) ) ) ) ) )
= $true ),
inference(definition_unfolding,[],[f27,f32]) ).
thf(f42,plain,
( ( setadjoin @ sK1 @ emptyset )
!= ( setadjoin @ sK1 @ ( setadjoin @ sK1 @ emptyset ) ) ),
inference(definition_unfolding,[],[f34,f33,f33]) ).
thf(f43,definition,
( sF2
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
=> ( in @ Y2 @ Y0 ) ) )
=> ( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y0 )
=> ( in @ Y2 @ Y1 ) ) )
=> ( Y1 = Y0 ) ) ) ) ) ),
introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).
thf(f44,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
=> ( in @ Y2 @ Y0 ) ) )
=> ( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y0 )
=> ( in @ Y2 @ Y1 ) ) )
=> ( Y1 = Y0 ) ) ) ) )
= sF2 ),
inference(reorient_equations,[],[f43]) ).
thf(f45,plain,
$true = sF2,
inference(definition_folding,[],[f37,f44]) ).
thf(f46,definition,
( sF3
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] : ( in @ Y1 @ ( setadjoin @ Y1 @ Y0 ) ) ) ) ),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
thf(f47,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] : ( in @ Y1 @ ( setadjoin @ Y1 @ Y0 ) ) ) )
= sF3 ),
inference(reorient_equations,[],[f46]) ).
thf(f48,plain,
$true = sF3,
inference(definition_folding,[],[f38,f47]) ).
thf(f49,definition,
( sF4
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ ( setadjoin @ Y0 @ emptyset ) )
=> ( Y1 = Y0 ) ) ) ) ),
introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).
thf(f50,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ ( setadjoin @ Y0 @ emptyset ) )
=> ( Y1 = Y0 ) ) ) )
= sF4 ),
inference(reorient_equations,[],[f49]) ).
thf(f51,plain,
$true = sF4,
inference(definition_folding,[],[f39,f50]) ).
thf(f55,definition,
( sF6
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ ( setadjoin @ Y2 @ ( setadjoin @ Y1 @ emptyset ) ) )
=> ( ( Y2 = Y0 )
| ( Y1 = Y0 ) ) ) ) ) ) ),
introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).
thf(f56,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ ( setadjoin @ Y2 @ ( setadjoin @ Y1 @ emptyset ) ) )
=> ( ( Y2 = Y0 )
| ( Y1 = Y0 ) ) ) ) ) )
= sF6 ),
inference(reorient_equations,[],[f55]) ).
thf(f57,plain,
$true = sF6,
inference(definition_folding,[],[f41,f56]) ).
thf(f58,definition,
( sF7
= ( setadjoin @ sK1 @ emptyset ) ),
introduced(definition,[new_symbols(definition,[sF7])],[function_definition]) ).
thf(f59,plain,
( ( setadjoin @ sK1 @ emptyset )
= sF7 ),
inference(reorient_equations,[],[f58]) ).
thf(f60,definition,
( sF8
= ( setadjoin @ sK1 @ sF7 ) ),
introduced(definition,[new_symbols(definition,[sF8])],[function_definition]) ).
thf(f61,plain,
( ( setadjoin @ sK1 @ sF7 )
= sF8 ),
inference(reorient_equations,[],[f60]) ).
thf(f62,plain,
sF7 != sF8,
inference(definition_folding,[],[f42,f61,f59,f59]) ).
thf(f63,plain,
( ( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
=> ( in @ Y2 @ Y0 ) ) )
=> ( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y0 )
=> ( in @ Y2 @ Y1 ) ) )
=> ( Y1 = Y0 ) ) ) ) )
= $true )
| ( $false = sF2 ) ),
inference(iff_proxy_clausification,[],[f44]) ).
thf(f80,plain,
! [X1: $i] :
( ( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
=> ( in @ Y2 @ Y0 ) ) )
=> ( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y0 )
=> ( in @ Y2 @ Y1 ) ) )
=> ( Y1 = Y0 ) ) ) )
@ X1 ) )
| ( $false = sF2 ) ),
inference(pi_proxy_clausification,[],[f63]) ).
thf(f81,plain,
! [X1: $i] :
( ( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ Y0 )
=> ( in @ Y1 @ X1 ) ) )
=> ( ( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ X1 )
=> ( in @ Y1 @ Y0 ) ) )
=> ( Y0 = X1 ) ) ) ) )
| ( $false = sF2 ) ),
inference(beta-eta_normalization,[],[f80]) ).
thf(f82,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( ^ [Y0: $i] :
( ( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ Y0 )
=> ( in @ Y1 @ X1 ) ) )
=> ( ( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ X1 )
=> ( in @ Y1 @ Y0 ) ) )
=> ( Y0 = X1 ) ) )
@ X2 ) )
| ( $false = sF2 ) ),
inference(pi_proxy_clausification,[],[f81]) ).
thf(f83,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ X2 )
=> ( in @ Y0 @ X1 ) ) )
=> ( ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ X1 )
=> ( in @ Y0 @ X2 ) ) )
=> ( X2 = X1 ) ) ) )
| ( $false = sF2 ) ),
inference(beta-eta_normalization,[],[f82]) ).
thf(f84,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ X2 )
=> ( in @ Y0 @ X1 ) ) ) )
| ( $false = sF2 )
| ( $true
= ( ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ X1 )
=> ( in @ Y0 @ X2 ) ) )
=> ( X2 = X1 ) ) ) ),
inference(imp_proxy_clausification,[],[f83]) ).
thf(f85,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( ^ [Y0: $i] :
( ( in @ Y0 @ X2 )
=> ( in @ Y0 @ X1 ) )
@ ( sK11 @ X1 @ X2 ) ) )
| ( $false = sF2 )
| ( $true
= ( ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ X1 )
=> ( in @ Y0 @ X2 ) ) )
=> ( X2 = X1 ) ) ) ),
inference(sigma_proxy_clausification,[],[f84]) ).
thf(f86,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( ^ [Y0: $i] :
( ( in @ Y0 @ X2 )
=> ( in @ Y0 @ X1 ) )
@ ( sK11 @ X1 @ X2 ) ) )
| ( $false = sF2 )
| ( $false
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ X1 )
=> ( in @ Y0 @ X2 ) ) ) )
| ( $true
= ( X2 = X1 ) ) ),
inference(imp_proxy_clausification,[],[f85]) ).
thf(f87,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( ^ [Y0: $i] :
( ( in @ Y0 @ X2 )
=> ( in @ Y0 @ X1 ) )
@ ( sK11 @ X1 @ X2 ) ) )
| ( $false = sF2 )
| ( $false
= ( ^ [Y0: $i] :
( ( in @ Y0 @ X1 )
=> ( in @ Y0 @ X2 ) )
@ ( sK12 @ X1 @ X2 ) ) )
| ( $true
= ( X2 = X1 ) ) ),
inference(sigma_proxy_clausification,[],[f86]) ).
thf(f88,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( ^ [Y0: $i] :
( ( in @ Y0 @ X2 )
=> ( in @ Y0 @ X1 ) )
@ ( sK11 @ X1 @ X2 ) ) )
| ( $false = sF2 )
| ( $false
= ( ^ [Y0: $i] :
( ( in @ Y0 @ X1 )
=> ( in @ Y0 @ X2 ) )
@ ( sK12 @ X1 @ X2 ) ) )
| ( X1 = X2 ) ),
inference(equality_proxy_clausification,[],[f87]) ).
thf(f89,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( ( in @ ( sK11 @ X1 @ X2 ) @ X2 )
=> ( in @ ( sK11 @ X1 @ X2 ) @ X1 ) ) )
| ( $false = sF2 )
| ( $false
= ( ( in @ ( sK12 @ X1 @ X2 ) @ X1 )
=> ( in @ ( sK12 @ X1 @ X2 ) @ X2 ) ) )
| ( X1 = X2 ) ),
inference(beta-eta_normalization,[],[f88]) ).
thf(f90,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( in @ ( sK11 @ X1 @ X2 ) @ X1 ) )
| ( $false = sF2 )
| ( $false
= ( ( in @ ( sK12 @ X1 @ X2 ) @ X1 )
=> ( in @ ( sK12 @ X1 @ X2 ) @ X2 ) ) )
| ( X1 = X2 ) ),
inference(imp_proxy_clausification,[],[f89]) ).
thf(f91,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( in @ ( sK11 @ X1 @ X2 ) @ X2 ) )
| ( $false = sF2 )
| ( $false
= ( ( in @ ( sK12 @ X1 @ X2 ) @ X1 )
=> ( in @ ( sK12 @ X1 @ X2 ) @ X2 ) ) )
| ( X1 = X2 ) ),
inference(imp_proxy_clausification,[],[f89]) ).
thf(f92,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( in @ ( sK11 @ X1 @ X2 ) @ X2 ) )
| ( $false = sF2 )
| ( $false
= ( in @ ( sK12 @ X1 @ X2 ) @ X2 ) )
| ( X1 = X2 ) ),
inference(imp_proxy_clausification,[],[f91]) ).
thf(f93,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( in @ ( sK11 @ X1 @ X2 ) @ X2 ) )
| ( $false = sF2 )
| ( $true
= ( in @ ( sK12 @ X1 @ X2 ) @ X1 ) )
| ( X1 = X2 ) ),
inference(imp_proxy_clausification,[],[f91]) ).
thf(f94,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( in @ ( sK11 @ X1 @ X2 ) @ X1 ) )
| ( $false = sF2 )
| ( $false
= ( in @ ( sK12 @ X1 @ X2 ) @ X2 ) )
| ( X1 = X2 ) ),
inference(imp_proxy_clausification,[],[f90]) ).
thf(f95,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( in @ ( sK11 @ X1 @ X2 ) @ X1 ) )
| ( $false = sF2 )
| ( $true
= ( in @ ( sK12 @ X1 @ X2 ) @ X1 ) )
| ( X1 = X2 ) ),
inference(imp_proxy_clausification,[],[f90]) ).
thf(f96,plain,
( ( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] : ( in @ Y1 @ ( setadjoin @ Y1 @ Y0 ) ) ) )
= $true )
| ( $false = sF3 ) ),
inference(iff_proxy_clausification,[],[f47]) ).
thf(f102,plain,
! [X1: $i] :
( ( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] : ( in @ Y1 @ ( setadjoin @ Y1 @ Y0 ) ) )
@ X1 ) )
| ( $false = sF3 ) ),
inference(pi_proxy_clausification,[],[f96]) ).
thf(f103,plain,
! [X1: $i] :
( ( $true
= ( !! @ $i
@ ^ [Y0: $i] : ( in @ Y0 @ ( setadjoin @ Y0 @ X1 ) ) ) )
| ( $false = sF3 ) ),
inference(beta-eta_normalization,[],[f102]) ).
thf(f104,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( ^ [Y0: $i] : ( in @ Y0 @ ( setadjoin @ Y0 @ X1 ) )
@ X2 ) )
| ( $false = sF3 ) ),
inference(pi_proxy_clausification,[],[f103]) ).
thf(f105,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( in @ X2 @ ( setadjoin @ X2 @ X1 ) ) )
| ( $false = sF3 ) ),
inference(beta-eta_normalization,[],[f104]) ).
thf(f106,plain,
( ( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ ( setadjoin @ Y0 @ emptyset ) )
=> ( Y1 = Y0 ) ) ) )
= $true )
| ( $false = sF4 ) ),
inference(iff_proxy_clausification,[],[f50]) ).
thf(f115,plain,
! [X1: $i] :
( ( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ ( setadjoin @ Y0 @ emptyset ) )
=> ( Y1 = Y0 ) ) )
@ X1 ) )
| ( $false = sF4 ) ),
inference(pi_proxy_clausification,[],[f106]) ).
thf(f116,plain,
! [X1: $i] :
( ( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ ( setadjoin @ X1 @ emptyset ) )
=> ( Y0 = X1 ) ) ) )
| ( $false = sF4 ) ),
inference(beta-eta_normalization,[],[f115]) ).
thf(f117,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( ^ [Y0: $i] :
( ( in @ Y0 @ ( setadjoin @ X1 @ emptyset ) )
=> ( Y0 = X1 ) )
@ X2 ) )
| ( $false = sF4 ) ),
inference(pi_proxy_clausification,[],[f116]) ).
thf(f118,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( ( in @ X2 @ ( setadjoin @ X1 @ emptyset ) )
=> ( X2 = X1 ) ) )
| ( $false = sF4 ) ),
inference(beta-eta_normalization,[],[f117]) ).
thf(f119,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( in @ X2 @ ( setadjoin @ X1 @ emptyset ) ) )
| ( $false = sF4 )
| ( $true
= ( X2 = X1 ) ) ),
inference(imp_proxy_clausification,[],[f118]) ).
thf(f120,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( in @ X2 @ ( setadjoin @ X1 @ emptyset ) ) )
| ( $false = sF4 )
| ( X1 = X2 ) ),
inference(equality_proxy_clausification,[],[f119]) ).
thf(f136,plain,
( ( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ ( setadjoin @ Y2 @ ( setadjoin @ Y1 @ emptyset ) ) )
=> ( ( Y2 = Y0 )
| ( Y1 = Y0 ) ) ) ) ) )
= $true )
| ( $false = sF6 ) ),
inference(iff_proxy_clausification,[],[f56]) ).
thf(f150,plain,
! [X1: $i] :
( ( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ ( setadjoin @ Y2 @ ( setadjoin @ Y1 @ emptyset ) ) )
=> ( ( Y2 = Y0 )
| ( Y1 = Y0 ) ) ) ) )
@ X1 ) )
| ( $false = sF6 ) ),
inference(pi_proxy_clausification,[],[f136]) ).
thf(f151,plain,
! [X1: $i] :
( ( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ X1 @ ( setadjoin @ Y1 @ ( setadjoin @ Y0 @ emptyset ) ) )
=> ( ( Y1 = X1 )
| ( Y0 = X1 ) ) ) ) ) )
| ( $false = sF6 ) ),
inference(beta-eta_normalization,[],[f150]) ).
thf(f152,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ X1 @ ( setadjoin @ Y1 @ ( setadjoin @ Y0 @ emptyset ) ) )
=> ( ( Y1 = X1 )
| ( Y0 = X1 ) ) ) )
@ X2 ) )
| ( $false = sF6 ) ),
inference(pi_proxy_clausification,[],[f151]) ).
thf(f153,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ X1 @ ( setadjoin @ Y0 @ ( setadjoin @ X2 @ emptyset ) ) )
=> ( ( Y0 = X1 )
| ( X2 = X1 ) ) ) ) )
| ( $false = sF6 ) ),
inference(beta-eta_normalization,[],[f152]) ).
thf(f154,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $true
= ( ^ [Y0: $i] :
( ( in @ X1 @ ( setadjoin @ Y0 @ ( setadjoin @ X2 @ emptyset ) ) )
=> ( ( Y0 = X1 )
| ( X2 = X1 ) ) )
@ X3 ) )
| ( $false = sF6 ) ),
inference(pi_proxy_clausification,[],[f153]) ).
thf(f155,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $true
= ( ( in @ X1 @ ( setadjoin @ X3 @ ( setadjoin @ X2 @ emptyset ) ) )
=> ( ( X3 = X1 )
| ( X2 = X1 ) ) ) )
| ( $false = sF6 ) ),
inference(beta-eta_normalization,[],[f154]) ).
thf(f156,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $false
= ( in @ X1 @ ( setadjoin @ X3 @ ( setadjoin @ X2 @ emptyset ) ) ) )
| ( $false = sF6 )
| ( $true
= ( ( X3 = X1 )
| ( X2 = X1 ) ) ) ),
inference(imp_proxy_clausification,[],[f155]) ).
thf(f157,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $false
= ( in @ X1 @ ( setadjoin @ X3 @ ( setadjoin @ X2 @ emptyset ) ) ) )
| ( $false = sF6 )
| ( $true
= ( X2 = X1 ) )
| ( $true
= ( X3 = X1 ) ) ),
inference(or_proxy_clausification,[],[f156]) ).
thf(f158,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $false
= ( in @ X1 @ ( setadjoin @ X3 @ ( setadjoin @ X2 @ emptyset ) ) ) )
| ( $false = sF6 )
| ( X1 = X2 )
| ( $true
= ( X3 = X1 ) ) ),
inference(equality_proxy_clausification,[],[f157]) ).
thf(f159,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $false
= ( in @ X1 @ ( setadjoin @ X3 @ ( setadjoin @ X2 @ emptyset ) ) ) )
| ( $false = sF6 )
| ( X1 = X2 )
| ( X1 = X3 ) ),
inference(equality_proxy_clausification,[],[f158]) ).
thf(f160,plain,
! [X2: $i,X1: $i] :
( ( $true = $false )
| ( $true
= ( in @ ( sK11 @ X1 @ X2 ) @ X2 ) )
| ( $true
= ( in @ ( sK12 @ X1 @ X2 ) @ X1 ) )
| ( X1 = X2 ) ),
inference(forward_demodulation,[],[f93,f45]) ).
thf(f161,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( in @ ( sK12 @ X1 @ X2 ) @ X1 ) )
| ( $true
= ( in @ ( sK11 @ X1 @ X2 ) @ X2 ) )
| ( X1 = X2 ) ),
inference(trivial_inequality_removal,[],[f160]) ).
thf(f162,plain,
! [X2: $i,X1: $i] :
( ( $true = $false )
| ( $true
= ( in @ ( sK11 @ X1 @ X2 ) @ X2 ) )
| ( $false
= ( in @ ( sK12 @ X1 @ X2 ) @ X2 ) )
| ( X1 = X2 ) ),
inference(forward_demodulation,[],[f92,f45]) ).
thf(f163,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( in @ ( sK12 @ X1 @ X2 ) @ X2 ) )
| ( $true
= ( in @ ( sK11 @ X1 @ X2 ) @ X2 ) )
| ( X1 = X2 ) ),
inference(trivial_inequality_removal,[],[f162]) ).
thf(f164,plain,
! [X2: $i,X1: $i] :
( ( $true = $false )
| ( $false
= ( in @ ( sK11 @ X1 @ X2 ) @ X1 ) )
| ( $true
= ( in @ ( sK12 @ X1 @ X2 ) @ X1 ) )
| ( X1 = X2 ) ),
inference(forward_demodulation,[],[f95,f45]) ).
thf(f165,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( in @ ( sK12 @ X1 @ X2 ) @ X1 ) )
| ( $false
= ( in @ ( sK11 @ X1 @ X2 ) @ X1 ) )
| ( X1 = X2 ) ),
inference(trivial_inequality_removal,[],[f164]) ).
thf(f166,plain,
! [X2: $i,X1: $i] :
( ( $true = $false )
| ( $false
= ( in @ ( sK11 @ X1 @ X2 ) @ X1 ) )
| ( $false
= ( in @ ( sK12 @ X1 @ X2 ) @ X2 ) )
| ( X1 = X2 ) ),
inference(forward_demodulation,[],[f94,f45]) ).
thf(f167,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( in @ ( sK12 @ X1 @ X2 ) @ X2 ) )
| ( $false
= ( in @ ( sK11 @ X1 @ X2 ) @ X1 ) )
| ( X1 = X2 ) ),
inference(trivial_inequality_removal,[],[f166]) ).
thf(f168,plain,
! [X2: $i,X1: $i] :
( ( $true = $false )
| ( $true
= ( in @ X2 @ ( setadjoin @ X2 @ X1 ) ) ) ),
inference(forward_demodulation,[],[f105,f48]) ).
thf(f169,plain,
! [X2: $i,X1: $i] :
( $true
= ( in @ X2 @ ( setadjoin @ X2 @ X1 ) ) ),
inference(trivial_inequality_removal,[],[f168]) ).
thf(f170,plain,
! [X2: $i,X1: $i] :
( ( $true = $false )
| ( $false
= ( in @ X2 @ ( setadjoin @ X1 @ emptyset ) ) )
| ( X1 = X2 ) ),
inference(forward_demodulation,[],[f120,f51]) ).
thf(f171,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( in @ X2 @ ( setadjoin @ X1 @ emptyset ) ) )
| ( X1 = X2 ) ),
inference(trivial_inequality_removal,[],[f170]) ).
thf(f174,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $true = $false )
| ( $false
= ( in @ X1 @ ( setadjoin @ X3 @ ( setadjoin @ X2 @ emptyset ) ) ) )
| ( X1 = X2 )
| ( X1 = X3 ) ),
inference(forward_demodulation,[],[f159,f57]) ).
thf(f175,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $false
= ( in @ X1 @ ( setadjoin @ X3 @ ( setadjoin @ X2 @ emptyset ) ) ) )
| ( X1 = X2 )
| ( X1 = X3 ) ),
inference(trivial_inequality_removal,[],[f174]) ).
thf(f187,plain,
( $true
= ( in @ sK1 @ sF7 ) ),
inference(constrained_superposition,[],[f169,f59]) ).
thf(f189,plain,
! [X0: $i] :
( ( $false
= ( in @ X0 @ sF7 ) )
| ( sK1 = X0 ) ),
inference(constrained_superposition,[],[f171,f59]) ).
thf(f190,plain,
( $true
= ( in @ sK1 @ sF8 ) ),
inference(constrained_superposition,[],[f169,f61]) ).
thf(f191,plain,
! [X0: $i,X1: $i] :
( ( $false
= ( in @ X0 @ ( setadjoin @ X1 @ sF7 ) ) )
| ( sK1 = X0 )
| ( X0 = X1 ) ),
inference(constrained_superposition,[],[f175,f59]) ).
thf(f197,plain,
! [X0: $i] :
( ( $false
= ( in @ X0 @ sF8 ) )
| ( sK1 = X0 )
| ( sK1 = X0 ) ),
inference(constrained_superposition,[],[f191,f61]) ).
thf(f200,plain,
! [X0: $i] :
( ( $false
= ( in @ X0 @ sF8 ) )
| ( sK1 = X0 ) ),
inference(duplicate_literal_removal,[],[f197]) ).
thf(f212,plain,
! [X0: $i] :
( ( $true = $false )
| ( sK1
= ( sK12 @ sF8 @ X0 ) )
| ( $true
= ( in @ ( sK11 @ sF8 @ X0 ) @ X0 ) )
| ( sF8 = X0 ) ),
inference(constrained_superposition,[],[f200,f161]) ).
thf(f213,plain,
! [X0: $i] :
( ( $true
= ( in @ ( sK11 @ sF8 @ X0 ) @ X0 ) )
| ( sK1
= ( sK12 @ sF8 @ X0 ) )
| ( sF8 = X0 ) ),
inference(trivial_inequality_removal,[],[f212]) ).
thf(f235,plain,
! [X0: $i] :
( ( $false
= ( in @ sK1 @ X0 ) )
| ( $true
= ( in @ ( sK11 @ sF8 @ X0 ) @ X0 ) )
| ( sF8 = X0 )
| ( $true
= ( in @ ( sK11 @ sF8 @ X0 ) @ X0 ) )
| ( sF8 = X0 ) ),
inference(constrained_superposition,[],[f163,f213]) ).
thf(f238,plain,
! [X0: $i] :
( ( $true
= ( in @ ( sK11 @ sF8 @ X0 ) @ X0 ) )
| ( $false
= ( in @ sK1 @ X0 ) )
| ( sF8 = X0 ) ),
inference(duplicate_literal_removal,[],[f235]) ).
thf(f255,plain,
! [X0: $i] :
( ( $true = $false )
| ( sK1
= ( sK12 @ sF8 @ X0 ) )
| ( $false
= ( in @ ( sK11 @ sF8 @ X0 ) @ sF8 ) )
| ( sF8 = X0 ) ),
inference(constrained_superposition,[],[f200,f165]) ).
thf(f256,plain,
! [X0: $i] :
( ( $false
= ( in @ ( sK11 @ sF8 @ X0 ) @ sF8 ) )
| ( sK1
= ( sK12 @ sF8 @ X0 ) )
| ( sF8 = X0 ) ),
inference(trivial_inequality_removal,[],[f255]) ).
thf(f296,plain,
! [X0: $i] :
( ( $false
= ( in @ sK1 @ X0 ) )
| ( $false
= ( in @ ( sK11 @ sF8 @ X0 ) @ sF8 ) )
| ( sF8 = X0 )
| ( $false
= ( in @ ( sK11 @ sF8 @ X0 ) @ sF8 ) )
| ( sF8 = X0 ) ),
inference(constrained_superposition,[],[f167,f256]) ).
thf(f303,plain,
! [X0: $i] :
( ( $false
= ( in @ ( sK11 @ sF8 @ X0 ) @ sF8 ) )
| ( $false
= ( in @ sK1 @ X0 ) )
| ( sF8 = X0 ) ),
inference(duplicate_literal_removal,[],[f296]) ).
thf(f322,plain,
( ( $true = $false )
| ( sK1
= ( sK11 @ sF8 @ sF7 ) )
| ( $false
= ( in @ sK1 @ sF7 ) )
| ( sF7 = sF8 ) ),
inference(constrained_superposition,[],[f189,f238]) ).
thf(f323,plain,
( ( sK1
= ( sK11 @ sF8 @ sF7 ) )
| ( $false
= ( in @ sK1 @ sF7 ) )
| ( sF7 = sF8 ) ),
inference(trivial_inequality_removal,[],[f322]) ).
thf(f331,plain,
( ( sK1
= ( sK11 @ sF8 @ sF7 ) )
| ( $false
= ( in @ sK1 @ sF7 ) ) ),
inference(forward_subsumption_resolution,[],[f323,f62]) ).
thf(f333,plain,
( ( $true = $false )
| ( sK1
= ( sK11 @ sF8 @ sF7 ) ) ),
inference(forward_demodulation,[],[f331,f187]) ).
thf(f334,plain,
( sK1
= ( sK11 @ sF8 @ sF7 ) ),
inference(trivial_inequality_removal,[],[f333]) ).
thf(f433,plain,
( ( $false
= ( in @ sK1 @ sF8 ) )
| ( $false
= ( in @ sK1 @ sF7 ) )
| ( sF7 = sF8 ) ),
inference(constrained_superposition,[],[f303,f334]) ).
thf(f436,plain,
( ( $false
= ( in @ sK1 @ sF8 ) )
| ( $false
= ( in @ sK1 @ sF7 ) ) ),
inference(forward_subsumption_resolution,[],[f433,f62]) ).
thf(f437,plain,
( ( $true = $false )
| ( $false
= ( in @ sK1 @ sF7 ) ) ),
inference(forward_demodulation,[],[f436,f190]) ).
thf(f438,plain,
( $false
= ( in @ sK1 @ sF7 ) ),
inference(trivial_inequality_removal,[],[f437]) ).
thf(f493,plain,
$true = $false,
inference(constrained_superposition,[],[f187,f438]) ).
thf(f494,plain,
$false,
inference(trivial_inequality_removal,[],[f493]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU649^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.20 % Computer : n026.cluster.edu
% 0.07/0.20 % Model : x86_64 x86_64
% 0.07/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.20 % Memory : 8046.5625MB
% 0.07/0.20 % OS : Linux 6.8.0-71-generic
% 0.07/0.20 % CPULimit : 300
% 0.07/0.20 % WCLimit : 300
% 0.07/0.20 % DateTime : Tue Sep 29 14:05:12 UTC 2026
% 0.07/0.20 % CPUTime :
% 0.07/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.23 Running first-order model finding
% 0.07/0.23 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.60/0.55 % (651974)Will run a generic schedule for satisfiability detection.
% 1.60/0.55 % (651980)% WARNING: option uhcvi not known.
% 1.60/0.55 % (651981)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1233056193:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.60/0.55 % (651979)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2205694024_2999 on theBenchmark for (2999ds/0Mi)
% 1.60/0.55 % (651980)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=887283942:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.60/0.55 % (651980)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 1.60/0.55 % Exception at run slice level
% 1.60/0.55 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 1.60/0.55 % (651980)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 1.60/0.55 % (651983)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3000388988:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.60/0.55 % (651983)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 1.60/0.55 % (651989)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=370437907:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 1.60/0.55 % Exception at run slice level
% 1.60/0.55 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 1.60/0.55 % (651982)dis+10_1_sil=32000:sp=arity:random_seed=576324228:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.60/0.55 % (651985)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2327072239:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.60/0.55 % (651984)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=892905393:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 1.60/0.55 % (651992)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2117114132:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 1.60/0.55 % (651983)Instruction limit reached!
% 1.60/0.55 % (651983)------------------------------
% 1.60/0.55 % (651983)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.60/0.55 % (651983)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.60/0.55 % (651983)CaDiCaL version: 2.1.3
% 1.60/0.55 % (651983)Termination reason: Instruction limit
% 1.60/0.55 % (651983)Termination phase: Saturation
% 1.60/0.55 % (651983)Time elapsed: 0.057 s
% 1.60/0.55 % (651983)Peak memory usage: 12 MB
% 1.60/0.55 % (651983)Instructions burned: 118 (million)
% 1.60/0.55 % (651997)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=4142975351:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 1.60/0.55 % (651997)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 1.60/0.55 % (651997)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 1.60/0.55 % (651992)Instruction limit reached!
% 1.60/0.55 % (651992)------------------------------
% 1.60/0.55 % (651992)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.60/0.55 % (651992)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.60/0.55 % (651992)CaDiCaL version: 2.1.3
% 1.60/0.55 % (651992)Termination reason: Instruction limit
% 1.60/0.55 % (651992)Termination phase: Saturation
% 1.60/0.55 % (651992)Time elapsed: 0.063 s
% 1.60/0.55 % (651992)Peak memory usage: 12 MB
% 1.60/0.55 % (651992)Instructions burned: 132 (million)
% 1.60/0.55 % (651982)Instruction limit reached!
% 1.60/0.55 % (651982)------------------------------
% 1.60/0.55 % (651982)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.60/0.55 % (651982)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.60/0.55 % (651982)CaDiCaL version: 2.1.3
% 1.60/0.55 % (651982)Termination reason: Instruction limit
% 1.60/0.55 % (651982)Termination phase: Saturation
% 1.60/0.55 % (651982)Time elapsed: 0.081 s
% 1.60/0.55 % (651982)Peak memory usage: 12 MB
% 1.60/0.55 % (651982)Instructions burned: 106 (million)
% 1.60/0.55 % (651999)ott-21_1_sil=16000:fs=off:random_seed=3107718138:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 1.60/0.55 % (652000)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=4293955460:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 1.60/0.55 % (651984)Instruction limit reached!
% 1.60/0.55 % (651984)------------------------------
% 1.60/0.55 % (651984)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.60/0.55 % (651984)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.60/0.55 % (651984)CaDiCaL version: 2.1.3
% 1.60/0.55 % (651984)Termination reason: Instruction limit
% 1.60/0.55 % (651984)Termination phase: Saturation
% 1.60/0.55 % (651984)Time elapsed: 0.129 s
% 1.60/0.55 % (651984)Peak memory usage: 12 MB
% 1.60/0.55 % (651984)Instructions burned: 131 (million)
% 1.60/0.55 % (651985)Instruction limit reached!
% 1.60/0.55 % (651985)------------------------------
% 1.60/0.55 % (651985)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.60/0.55 % (651985)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.60/0.55 % (651985)CaDiCaL version: 2.1.3
% 1.60/0.55 % (651985)Termination reason: Instruction limit
% 1.60/0.55 % (651985)Termination phase: Saturation
% 1.60/0.55 % (651985)Time elapsed: 0.154 s
% 1.60/0.55 % (651985)Peak memory usage: 12 MB
% 1.60/0.55 % (651985)Instructions burned: 159 (million)
% 1.60/0.55 % (652003)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=3832846898:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 1.60/0.55 % (651999)Instruction limit reached!
% 1.60/0.55 % (651999)------------------------------
% 1.60/0.55 % (651999)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.60/0.55 % (651999)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.60/0.55 % (651999)CaDiCaL version: 2.1.3
% 1.60/0.55 % (651999)Termination reason: Instruction limit
% 1.60/0.55 % (651999)Termination phase: Saturation
% 1.60/0.55 % (651999)Time elapsed: 0.082 s
% 1.60/0.55 % (651999)Peak memory usage: 12 MB
% 1.60/0.55 % (651999)Instructions burned: 182 (million)
% 1.60/0.55 % Exception at run slice level
% 1.60/0.55 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 1.60/0.55 % (652004)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=681118072:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 1.60/0.55 % (652006)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=983948987:i=889:ins=1_2997 on theBenchmark for (2997ds/889Mi)
% 1.60/0.55 % (652007)ott+1_16_sil=32000:plsq=on:plsqc=2:sas=cadical:avsql=on:sp=reverse_frequency:plsqr=128,1:bsr=unit_only:rp=on:newcnf=on:random_seed=1409614104:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2997 on theBenchmark for (2997ds/692Mi)
% 1.60/0.55 % (652007)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 1.60/0.55 % Exception at run slice level
% 1.60/0.55 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 1.60/0.55 % (652004) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-651974-652004"...
% 1.60/0.55 % (652004)...printing done.
% 1.60/0.55 % (652004)Refutation found. Thanks to Tanya!
% 1.60/0.55 % SZS status Theorem for theBenchmark
% 1.60/0.55 % SZS output start Proof for theBenchmark
% See solution above
% 1.60/0.55 % (652004)------------------------------
% 1.60/0.55 % (652004)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.60/0.55 % (652004)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.60/0.55 % (652004)CaDiCaL version: 2.1.3
% 1.60/0.55 % (652004)Termination reason: Refutation
% 1.60/0.55 % (652004)Time elapsed: 0.042 s
% 1.60/0.55 % (652004)Peak memory usage: 12 MB
% 1.60/0.55 % (652004)Instructions burned: 46 (million)
% 1.60/0.55 % (651974)Success in time 0.309 s
% 1.60/0.55 % Vampire exiting
%------------------------------------------------------------------------------