%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET646^3 : TPTP v9.3.1. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n010.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:46 AM UTC 2026
% Result : Theorem 0.27s 0.26s
% Output : Refutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 4
% Syntax : Number of formulae : 28 ( 24 unt; 0 typ; 0 def)
% Number of atoms : 153 ( 43 equ; 0 cnn)
% Maximal formula atoms : 5 ( 5 avg)
% Number of connectives : 149 ( 8 ~; 10 |; 11 &; 100 @)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 30 ( 30 >; 0 *; 0 +; 0 <<)
% Number of symbols : 58 ( 54 usr; 7 con; 0-4 aty)
% ( 10 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 88 ( 74 ^; 12 !; 2 ?; 88 :)
% 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,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_37,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_38,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_41,type,
vOR: $o > $o > $o ).
thf(func_def_42,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_43,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_44,type,
vAND: $o > $o > $o ).
thf(func_def_45,type,
vNOT: $o > $o ).
thf(func_def_46,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_47,type,
vIMP: $o > $o > $o ).
thf(func_def_48,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_49,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_50,type,
db4:
!>[X0: $tType] : X0 ).
thf(func_def_51,type,
vIFF: $o > $o > $o ).
thf(f15,axiom,
( cartesian_product
= ( ^ [X0: $i > $o,X1: $i > $o,X2: $i,X3: $i] :
( ( X1 @ X3 )
& ( X0 @ X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET008^2.ax',cartesian_product) ).
thf(f16,axiom,
( pair_rel
= ( ^ [X0: $i,X1: $i,X2: $i,X3: $i] :
( ( X3 = X1 )
| ( X2 = X0 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET008^2.ax',pair_rel) ).
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/sandbox2/benchmark/Axioms/SET008^2.ax',sub_rel) ).
thf(f36,conjecture,
! [X0: $i,X1: $i] :
( sub_rel @ ( pair_rel @ X0 @ X1 )
@ ( cartesian_product
@ ^ [X0: $i] : $true
@ ^ [X0: $i] : $true ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm) ).
thf(f37,negated_conjecture,
~ ! [X0: $i,X1: $i] :
( sub_rel @ ( pair_rel @ X0 @ X1 )
@ ( cartesian_product
@ ^ [X0: $i] : $true
@ ^ [X0: $i] : $true ) ),
inference(negated_conjecture,[status(cth)],[f36]) ).
thf(f60,plain,
( cartesian_product
= ( ^ [X0: $i > $o,X1: $i > $o,X2: $i,X3: $i] :
( ( X1 @ X3 )
& ( X0 @ X2 ) ) ) ),
inference(rectify,[],[f15]) ).
thf(f61,plain,
( cartesian_product
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i,Y3: $i] :
( ( Y0 @ Y2 )
& ( Y1 @ Y3 ) ) ) ),
inference(fool_elimination,[],[f60]) ).
thf(f62,plain,
( pair_rel
= ( ^ [Y0: $i,Y1: $i,Y2: $i,Y3: $i] :
( ( Y0 = Y2 )
| ( Y1 = Y3 ) ) ) ),
inference(fool_elimination,[],[f16]) ).
thf(f65,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(f66,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,[],[f65]) ).
thf(f99,plain,
~ ! [X0: $i,X1: $i] :
( sub_rel @ ( pair_rel @ X0 @ X1 )
@ ( cartesian_product
@ ^ [X2: $i] : $true
@ ^ [X3: $i] : $true ) ),
inference(rectify,[],[f37]) ).
thf(f100,plain,
~ ! [X0: $i,X1: $i] :
( $true
= ( sub_rel @ ( pair_rel @ X0 @ X1 )
@ ( cartesian_product
@ ^ [Y0: $i] : $true
@ ^ [Y0: $i] : $true ) ) ),
inference(fool_elimination,[],[f99]) ).
thf(f101,plain,
? [X0: $i,X1: $i] :
( $true
!= ( sub_rel @ ( pair_rel @ X0 @ X1 )
@ ( cartesian_product
@ ^ [Y0: $i] : $true
@ ^ [Y0: $i] : $true ) ) ),
inference(ennf_transformation,[],[f100]) ).
thf(f102,plain,
( $true
!= ( sub_rel @ ( pair_rel @ sK0 @ sK1 )
@ ( cartesian_product
@ ^ [Y0: $i] : $true
@ ^ [Y0: $i] : $true ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f101]) ).
thf(f117,plain,
( cartesian_product
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i,Y3: $i] :
( ( Y0 @ Y2 )
& ( Y1 @ Y3 ) ) ) ),
inference(cnf_transformation,[],[f61]) ).
thf(f118,plain,
( pair_rel
= ( ^ [Y0: $i,Y1: $i,Y2: $i,Y3: $i] :
( ( Y0 = Y2 )
| ( Y1 = Y3 ) ) ) ),
inference(cnf_transformation,[],[f62]) ).
thf(f120,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,[],[f66]) ).
thf(f138,plain,
( $true
!= ( sub_rel @ ( pair_rel @ sK0 @ sK1 )
@ ( cartesian_product
@ ^ [Y0: $i] : $true
@ ^ [Y0: $i] : $true ) ) ),
inference(cnf_transformation,[],[f102]) ).
thf(f144,plain,
( $true
!= ( ^ [Y0: $i > $i > $o,Y1: $i > $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( !! @ $i
@ ^ [Y3: $i] :
( ( Y0 @ Y3 @ Y2 )
=> ( Y1 @ Y3 @ Y2 ) ) ) )
@ ( ^ [Y0: $i,Y1: $i,Y2: $i,Y3: $i] :
( ( Y0 = Y2 )
| ( Y1 = Y3 ) )
@ sK0
@ sK1 )
@ ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i,Y3: $i] :
( ( Y0 @ Y2 )
& ( Y1 @ Y3 ) )
@ ^ [Y0: $i] : $true
@ ^ [Y0: $i] : $true ) ) ),
inference(definition_unfolding,[],[f138,f120,f118,f117]) ).
thf(f145,plain,
( $true
!= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( ( sK0 = Y1 )
| ( sK1 = Y0 ) )
=> ( $true
& $true ) ) ) ) ),
inference(beta-eta_normalization,[],[f144]) ).
thf(f146,plain,
( $false
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( ( sK0 = Y1 )
| ( sK1 = Y0 ) )
=> ( $true
& $true ) ) )
@ sK2 ) ),
inference(sigma_proxy_clausification,[],[f145]) ).
thf(f147,plain,
( $false
= ( !! @ $i
@ ^ [Y0: $i] :
( ( ( sK0 = Y0 )
| ( sK1 = sK2 ) )
=> ( $true
& $true ) ) ) ),
inference(beta-eta_normalization,[],[f146]) ).
thf(f148,plain,
( $false
= ( ^ [Y0: $i] :
( ( ( sK0 = Y0 )
| ( sK1 = sK2 ) )
=> ( $true
& $true ) )
@ sK3 ) ),
inference(sigma_proxy_clausification,[],[f147]) ).
thf(f149,plain,
( $false
= ( ( ( sK0 = sK3 )
| ( sK1 = sK2 ) )
=> ( $true
& $true ) ) ),
inference(beta-eta_normalization,[],[f148]) ).
thf(f150,plain,
( $false
= ( $true
& $true ) ),
inference(imp_proxy_clausification,[],[f149]) ).
thf(f155,plain,
( ( $false = $true )
| ( $false = $true ) ),
inference(and_proxy_clausification,[],[f150]) ).
thf(f156,plain,
$false = $true,
inference(duplicate_literal_removal,[],[f155]) ).
thf(f157,plain,
$false,
inference(trivial_inequality_removal,[],[f156]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET646^3 : TPTP v9.3.1. Released v3.6.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.19 % Computer : n010.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Tue Sep 29 13:40:48 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.22 Running first-order model finding
% 0.08/0.22 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
% 0.27/0.26 % (2867371)Will run a generic schedule for satisfiability detection.
% 0.27/0.26 % (2867378)% WARNING: option uhcvi not known.
% 0.27/0.26 % (2867384)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1222916077:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.27/0.26 % (2867382)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2382089711:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.27/0.26 % (2867377)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1920982291_2999 on theBenchmark for (2999ds/0Mi)
% 0.27/0.26 % (2867380)dis+10_1_sil=32000:sp=arity:random_seed=435536127:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.27/0.26 % (2867378)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2906338844:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.27/0.26 % (2867381)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2895040035:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.27/0.26 % (2867379)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3945560746:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.27/0.26 % (2867384) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2867371-2867384"...
% 0.27/0.26 % (2867384)...printing done.
% 0.27/0.26 % (2867378)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.27/0.26 % (2867381)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.27/0.26 % (2867384)Refutation found. Thanks to Tanya!
% 0.27/0.26 % SZS status Theorem for theBenchmark
% 0.27/0.26 % SZS output start Proof for theBenchmark
% See solution above
% 0.27/0.26 % (2867384)------------------------------
% 0.27/0.26 % (2867384)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.27/0.26 % (2867384)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.27/0.26 % (2867384)CaDiCaL version: 2.1.3
% 0.27/0.26 % (2867384)Termination reason: Refutation
% 0.27/0.26 % (2867384)Time elapsed: 0.003 s
% 0.27/0.26 % (2867384)Peak memory usage: 12 MB
% 0.27/0.26 % (2867384)Instructions burned: 9 (million)
% 0.27/0.26 % (2867371)Success in time 0.034 s
% 0.27/0.26 % Vampire exiting
%------------------------------------------------------------------------------