%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SET640^3 : TPTP v9.3.1. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n002.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:23:26 AM UTC 2026
% Result : Theorem 0.13s 0.27s
% Output : Refutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 3
% Syntax : Number of formulae : 25 ( 18 unt; 0 typ; 0 def)
% Number of atoms : 128 ( 25 equ; 0 cnn)
% Maximal formula atoms : 5 ( 5 avg)
% Number of connectives : 152 ( 8 ~; 1 |; 13 &; 106 @)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 50 ( 50 >; 0 *; 0 +; 0 <<)
% Number of symbols : 58 ( 54 usr; 5 con; 0-4 aty)
% ( 10 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 72 ( 58 ^; 12 !; 2 ?; 72 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
in: $i > ( $i > $o ) > $o ).
thf(func_def_2,type,
is_a: $i > ( $i > $o ) > $o ).
thf(func_def_3,type,
emptyset: $i > $o ).
thf(func_def_4,type,
unord_pair: $i > $i > $i > $o ).
thf(func_def_5,type,
singleton: $i > $i > $o ).
thf(func_def_6,type,
union: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_7,type,
excl_union: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_8,type,
intersection: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_9,type,
setminus: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_10,type,
complement: ( $i > $o ) > $i > $o ).
thf(func_def_11,type,
disjoint: ( $i > $o ) > ( $i > $o ) > $o ).
thf(func_def_12,type,
subset: ( $i > $o ) > ( $i > $o ) > $o ).
thf(func_def_13,type,
meets: ( $i > $o ) > ( $i > $o ) > $o ).
thf(func_def_14,type,
misses: ( $i > $o ) > ( $i > $o ) > $o ).
thf(func_def_15,type,
cartesian_product: ( $i > $o ) > ( $i > $o ) > $i > $i > $o ).
thf(func_def_16,type,
pair_rel: $i > $i > $i > $i > $o ).
thf(func_def_17,type,
id_rel: ( $i > $o ) > $i > $i > $o ).
thf(func_def_18,type,
sub_rel: ( $i > $i > $o ) > ( $i > $i > $o ) > $o ).
thf(func_def_19,type,
is_rel_on: ( $i > $i > $o ) > ( $i > $o ) > ( $i > $o ) > $o ).
thf(func_def_20,type,
restrict_rel_domain: ( $i > $i > $o ) > ( $i > $o ) > $i > $i > $o ).
thf(func_def_21,type,
rel_diagonal: $i > $i > $o ).
thf(func_def_22,type,
rel_composition: ( $i > $i > $o ) > ( $i > $i > $o ) > $i > $i > $o ).
thf(func_def_23,type,
reflexive: ( $i > $i > $o ) > $o ).
thf(func_def_24,type,
irreflexive: ( $i > $i > $o ) > $o ).
thf(func_def_25,type,
symmetric: ( $i > $i > $o ) > $o ).
thf(func_def_26,type,
transitive: ( $i > $i > $o ) > $o ).
thf(func_def_27,type,
equiv_rel: ( $i > $i > $o ) > $o ).
thf(func_def_28,type,
rel_codomain: ( $i > $i > $o ) > $i > $o ).
thf(func_def_29,type,
rel_domain: ( $i > $i > $o ) > $i > $o ).
thf(func_def_30,type,
rel_inverse: ( $i > $i > $o ) > $i > $i > $o ).
thf(func_def_31,type,
equiv_classes: ( $i > $i > $o ) > ( $i > $o ) > $o ).
thf(func_def_32,type,
restrict_rel_codomain: ( $i > $i > $o ) > ( $i > $o ) > $i > $i > $o ).
thf(func_def_33,type,
rel_field: ( $i > $i > $o ) > $i > $o ).
thf(func_def_34,type,
well_founded: ( $i > $i > $o ) > $o ).
thf(func_def_35,type,
upwards_well_founded: ( $i > $i > $o ) > $o ).
thf(func_def_36,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_37,type,
vIMP: $o > $o > $o ).
thf(func_def_38,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_39,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_40,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_41,type,
vAND: $o > $o > $o ).
thf(func_def_42,type,
db4:
!>[X0: $tType] : X0 ).
thf(func_def_43,type,
vNOT: $o > $o ).
thf(func_def_44,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_45,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_46,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_47,type,
vOR: $o > $o > $o ).
thf(func_def_48,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_51,type,
vIFF: $o > $o > $o ).
thf(func_def_52,type,
sK0: $i > $i > $o ).
thf(func_def_53,type,
sK1: $i > $i > $o ).
thf(f15,axiom,
( cartesian_product
= ( ^ [X0: $i > $o,X1: $i > $o,X2: $i,X3: $i] :
( ( X1 @ X3 )
& ( X0 @ X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET008^2.ax',cartesian_product) ).
thf(f18,axiom,
( sub_rel
= ( ^ [X0: $i > $i > $o,X1: $i > $i > $o] :
! [X2: $i,X3: $i] :
( ( X0 @ X2 @ X3 )
=> ( X1 @ X2 @ X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET008^2.ax',sub_rel) ).
thf(f36,conjecture,
! [X1: $i > $i > $o,X0: $i > $i > $o] :
( ( sub_rel @ X0 @ X1 )
=> ( sub_rel @ X0
@ ( cartesian_product
@ ^ [X2: $i] : $true
@ ^ [X2: $i] : $true ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm) ).
thf(f37,negated_conjecture,
~ ! [X1: $i > $i > $o,X0: $i > $i > $o] :
( ( sub_rel @ X0 @ X1 )
=> ( sub_rel @ X0
@ ( cartesian_product
@ ^ [X2: $i] : $true
@ ^ [X2: $i] : $true ) ) ),
inference(negated_conjecture,[status(cth)],[f36]) ).
thf(f69,plain,
( sub_rel
= ( ^ [X0: $i > $i > $o,X1: $i > $i > $o] :
! [X2: $i,X3: $i] :
( ( X0 @ X2 @ X3 )
=> ( X1 @ X2 @ X3 ) ) ) ),
inference(rectify,[],[f18]) ).
thf(f70,plain,
( sub_rel
= ( ^ [Y0: $i > $i > $o,Y1: $i > $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( !! @ $i
@ ^ [Y3: $i] :
( ( Y0 @ Y3 @ Y2 )
=> ( Y1 @ Y3 @ Y2 ) ) ) ) ) ),
inference(fool_elimination,[],[f69]) ).
thf(f78,plain,
~ ! [X0: $i > $i > $o,X1: $i > $i > $o] :
( ( sub_rel @ X1 @ X0 )
=> ( sub_rel @ X1
@ ( cartesian_product
@ ^ [X2: $i] : $true
@ ^ [X3: $i] : $true ) ) ),
inference(rectify,[],[f37]) ).
thf(f79,plain,
~ ! [X0: $i > $i > $o,X1: $i > $i > $o] :
( ( $true
= ( sub_rel @ X1 @ X0 ) )
=> ( $true
= ( sub_rel @ X1
@ ( cartesian_product
@ ^ [Y0: $i] : $true
@ ^ [Y0: $i] : $true ) ) ) ),
inference(fool_elimination,[],[f78]) ).
thf(f97,plain,
( cartesian_product
= ( ^ [X0: $i > $o,X1: $i > $o,X2: $i,X3: $i] :
( ( X1 @ X3 )
& ( X0 @ X2 ) ) ) ),
inference(rectify,[],[f15]) ).
thf(f98,plain,
( cartesian_product
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i,Y3: $i] :
( ( Y0 @ Y2 )
& ( Y1 @ Y3 ) ) ) ),
inference(fool_elimination,[],[f97]) ).
thf(f101,plain,
? [X0: $i > $i > $o,X1: $i > $i > $o] :
( ( $true
!= ( sub_rel @ X1
@ ( cartesian_product
@ ^ [Y0: $i] : $true
@ ^ [Y0: $i] : $true ) ) )
& ( $true
= ( sub_rel @ X1 @ X0 ) ) ),
inference(ennf_transformation,[],[f79]) ).
thf(f102,plain,
( ( ( sub_rel @ sK1
@ ( cartesian_product
@ ^ [Y0: $i] : $true
@ ^ [Y0: $i] : $true ) )
!= $true )
& ( $true
= ( sub_rel @ sK1 @ sK0 ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f101]) ).
thf(f106,plain,
( sub_rel
= ( ^ [Y0: $i > $i > $o,Y1: $i > $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( !! @ $i
@ ^ [Y3: $i] :
( ( Y0 @ Y3 @ Y2 )
=> ( Y1 @ Y3 @ Y2 ) ) ) ) ) ),
inference(cnf_transformation,[],[f70]) ).
thf(f116,plain,
( ( sub_rel @ sK1
@ ( cartesian_product
@ ^ [Y0: $i] : $true
@ ^ [Y0: $i] : $true ) )
!= $true ),
inference(cnf_transformation,[],[f102]) ).
thf(f122,plain,
( cartesian_product
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i,Y3: $i] :
( ( Y0 @ Y2 )
& ( Y1 @ Y3 ) ) ) ),
inference(cnf_transformation,[],[f98]) ).
thf(f145,plain,
( ( ^ [Y0: $i > $i > $o,Y1: $i > $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( !! @ $i
@ ^ [Y3: $i] :
( ( Y0 @ Y3 @ Y2 )
=> ( Y1 @ Y3 @ Y2 ) ) ) )
@ sK1
@ ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i,Y3: $i] :
( ( Y0 @ Y2 )
& ( Y1 @ Y3 ) )
@ ^ [Y0: $i] : $true
@ ^ [Y0: $i] : $true ) )
!= $true ),
inference(definition_unfolding,[],[f116,f106,f122]) ).
thf(f153,plain,
( $true
!= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( sK1 @ Y1 @ Y0 )
=> ( $true
& $true ) ) ) ) ),
inference(beta-eta_normalization,[],[f145]) ).
thf(f154,plain,
( $false
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( sK1 @ Y1 @ Y0 )
=> ( $true
& $true ) ) )
@ sK2 ) ),
inference(sigma_proxy_clausification,[],[f153]) ).
thf(f155,plain,
( $false
= ( !! @ $i
@ ^ [Y0: $i] :
( ( sK1 @ Y0 @ sK2 )
=> ( $true
& $true ) ) ) ),
inference(beta-eta_normalization,[],[f154]) ).
thf(f156,plain,
( $false
= ( ^ [Y0: $i] :
( ( sK1 @ Y0 @ sK2 )
=> ( $true
& $true ) )
@ sK3 ) ),
inference(sigma_proxy_clausification,[],[f155]) ).
thf(f157,plain,
( $false
= ( ( sK1 @ sK3 @ sK2 )
=> ( $true
& $true ) ) ),
inference(beta-eta_normalization,[],[f156]) ).
thf(f158,plain,
( $false
= ( $true
& $true ) ),
inference(imp_proxy_clausification,[],[f157]) ).
thf(f160,plain,
( ( $false = $true )
| ( $false = $true ) ),
inference(and_proxy_clausification,[],[f158]) ).
thf(f161,plain,
$false = $true,
inference(duplicate_literal_removal,[],[f160]) ).
thf(f162,plain,
$false,
inference(trivial_inequality_removal,[],[f161]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET640^3 : TPTP v9.3.1. Released v3.6.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.18 % Computer : n002.cluster.edu
% 0.13/0.18 % Model : x86_64 x86_64
% 0.13/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.18 % Memory : 8046.5625MB
% 0.13/0.18 % OS : Linux 6.8.0-71-generic
% 0.13/0.18 % CPULimit : 300
% 0.13/0.18 % WCLimit : 300
% 0.13/0.18 % DateTime : Tue Sep 29 13:43:07 UTC 2026
% 0.13/0.18 % CPUTime :
% 0.13/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.22 Running higher-order theorem proving
% 0.13/0.23 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.27 % (1298672)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.13/0.27 % (1298697)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=1732452071:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.13/0.27 % (1298697) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1298672-1298697"...
% 0.13/0.27 % (1298697)...printing done.
% 0.13/0.27 % (1298698)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.13/0.27 % (1298698)WARNING Broken Constraint: if sine_to_age_tolerance(5) has been set then sine_to_age(off) is equal to on or sine_to_pred_levels(off) is not equal to off or sine_level_split_queue(off) is equal to on
% 0.13/0.27 % (1298697)Refutation found. Thanks to Tanya!
% 0.13/0.27 % SZS status Theorem for theBenchmark
% 0.13/0.27 % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.27 % (1298697)------------------------------
% 0.13/0.27 % (1298697)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.13/0.27 % (1298697)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.13/0.27 % (1298697)CaDiCaL version: 2.1.3
% 0.13/0.27 % (1298697)Termination reason: Refutation
% 0.13/0.27 % (1298697)Time elapsed: 0.003 s
% 0.13/0.27 % (1298697)Peak memory usage: 12 MB
% 0.13/0.27 % (1298697)Instructions burned: 10 (million)
% 0.13/0.27 % (1298672)Success in time 0.032 s
% 0.13/0.27 % Vampire exiting
%------------------------------------------------------------------------------