%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SET651^3 : TPTP v9.3.1. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n012.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:27 AM UTC 2026
% Result : Theorem 0.08s 0.17s
% Output : Refutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 5
% Syntax : Number of formulae : 44 ( 34 unt; 0 typ; 0 def)
% Number of atoms : 225 ( 47 equ; 0 cnn)
% Maximal formula atoms : 7 ( 5 avg)
% Number of connectives : 252 ( 8 ~; 4 |; 13 &; 184 @)
% ( 0 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 60 ( 60 >; 0 *; 0 +; 0 <<)
% Number of symbols : 59 ( 54 usr; 6 con; 0-4 aty)
% ( 14 !!; 7 ??; 0 @@+; 0 @@-)
% Number of variables : 96 ( 78 ^; 15 !; 3 ?; 96 :)
% 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,
a: $i > $o ).
thf(func_def_37,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_38,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_39,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_40,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_41,type,
vNOT: $o > $o ).
thf(func_def_42,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_43,type,
vAND: $o > $o > $o ).
thf(func_def_44,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_45,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_46,type,
vOR: $o > $o > $o ).
thf(func_def_47,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_48,type,
vIMP: $o > $o > $o ).
thf(func_def_49,type,
vIFF: $o > $o > $o ).
thf(func_def_50,type,
db4:
!>[X0: $tType] : X0 ).
thf(func_def_53,type,
sK0: $i > $i > $o ).
thf(f12,axiom,
( ( ^ [X0: $i > $o,X1: $i > $o] :
! [X2: $i] :
( ( X0 @ X2 )
=> ( X1 @ X2 ) ) )
= subset ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET008^0.ax',subset) ).
thf(f15,axiom,
( ( ^ [X0: $i > $o,X1: $i > $o,X2: $i,X3: $i] :
( ( X1 @ X3 )
& ( X0 @ X2 ) ) )
= cartesian_product ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET008^2.ax',cartesian_product) ).
thf(f18,axiom,
( ( ^ [X0: $i > $i > $o,X1: $i > $i > $o] :
! [X3: $i,X2: $i] :
( ( X0 @ X2 @ X3 )
=> ( X1 @ X2 @ X3 ) ) )
= sub_rel ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET008^2.ax',sub_rel) ).
thf(f29,axiom,
( rel_domain
= ( ^ [X0: $i > $i > $o,X1: $i] :
? [X2: $i] : ( X0 @ X1 @ X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET008^2.ax',rel_domain) ).
thf(f36,conjecture,
! [X0: $i > $i > $o] :
( ( subset @ ( rel_domain @ X0 ) @ a )
=> ( sub_rel @ X0
@ ( cartesian_product @ a
@ ^ [X1: $i] : $true ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm) ).
thf(f37,negated_conjecture,
~ ! [X0: $i > $i > $o] :
( ( subset @ ( rel_domain @ X0 ) @ a )
=> ( sub_rel @ X0
@ ( cartesian_product @ a
@ ^ [X1: $i] : $true ) ) ),
inference(negated_conjecture,[status(cth)],[f36]) ).
thf(f50,plain,
( ( ^ [X0: $i > $o,X1: $i > $o] :
! [X2: $i] :
( ( X0 @ X2 )
=> ( X1 @ X2 ) ) )
= subset ),
inference(rectify,[],[f12]) ).
thf(f51,plain,
( subset
= ( ^ [Y0: $i > $o,Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( Y0 @ Y2 )
=> ( Y1 @ Y2 ) ) ) ) ),
inference(fool_elimination,[],[f50]) ).
thf(f54,plain,
( ( ^ [X0: $i > $o,X1: $i > $o,X2: $i,X3: $i] :
( ( X1 @ X3 )
& ( X0 @ X2 ) ) )
= cartesian_product ),
inference(rectify,[],[f15]) ).
thf(f55,plain,
( cartesian_product
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i,Y3: $i] :
( ( Y0 @ Y2 )
& ( Y1 @ Y3 ) ) ) ),
inference(fool_elimination,[],[f54]) ).
thf(f66,plain,
( ( ^ [X0: $i > $i > $o,X1: $i > $i > $o] :
! [X2: $i,X3: $i] :
( ( X0 @ X3 @ X2 )
=> ( X1 @ X3 @ X2 ) ) )
= sub_rel ),
inference(rectify,[],[f18]) ).
thf(f67,plain,
( sub_rel
= ( ^ [Y0: $i > $i > $o,Y1: $i > $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( !! @ $i
@ ^ [Y3: $i] :
( ( Y0 @ Y2 @ Y3 )
=> ( Y1 @ Y2 @ Y3 ) ) ) ) ) ),
inference(fool_elimination,[],[f66]) ).
thf(f78,plain,
~ ! [X0: $i > $i > $o] :
( ( subset @ ( rel_domain @ X0 ) @ a )
=> ( sub_rel @ X0
@ ( cartesian_product @ a
@ ^ [X1: $i] : $true ) ) ),
inference(rectify,[],[f37]) ).
thf(f79,plain,
~ ! [X0: $i > $i > $o] :
( ( ( subset @ ( rel_domain @ X0 ) @ a )
= $true )
=> ( $true
= ( sub_rel @ X0
@ ( cartesian_product @ a
@ ^ [Y0: $i] : $true ) ) ) ),
inference(fool_elimination,[],[f78]) ).
thf(f91,plain,
( rel_domain
= ( ^ [X0: $i > $i > $o,X1: $i] :
? [X2: $i] : ( X0 @ X1 @ X2 ) ) ),
inference(rectify,[],[f29]) ).
thf(f92,plain,
( rel_domain
= ( ^ [Y0: $i > $i > $o,Y1: $i] :
( ?? @ $i
@ ^ [Y2: $i] : ( Y0 @ Y1 @ Y2 ) ) ) ),
inference(fool_elimination,[],[f91]) ).
thf(f101,plain,
? [X0: $i > $i > $o] :
( ( $true
!= ( sub_rel @ X0
@ ( cartesian_product @ a
@ ^ [Y0: $i] : $true ) ) )
& ( ( subset @ ( rel_domain @ X0 ) @ a )
= $true ) ),
inference(ennf_transformation,[],[f79]) ).
thf(f102,plain,
( ( $true
!= ( sub_rel @ sK0
@ ( cartesian_product @ a
@ ^ [Y0: $i] : $true ) ) )
& ( ( subset @ ( rel_domain @ sK0 ) @ a )
= $true ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f101]) ).
thf(f105,plain,
( ( subset @ ( rel_domain @ sK0 ) @ a )
= $true ),
inference(cnf_transformation,[],[f102]) ).
thf(f106,plain,
( $true
!= ( sub_rel @ sK0
@ ( cartesian_product @ a
@ ^ [Y0: $i] : $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,[],[f55]) ).
thf(f130,plain,
( subset
= ( ^ [Y0: $i > $o,Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( Y0 @ Y2 )
=> ( Y1 @ Y2 ) ) ) ) ),
inference(cnf_transformation,[],[f51]) ).
thf(f133,plain,
( sub_rel
= ( ^ [Y0: $i > $i > $o,Y1: $i > $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( !! @ $i
@ ^ [Y3: $i] :
( ( Y0 @ Y2 @ Y3 )
=> ( Y1 @ Y2 @ Y3 ) ) ) ) ) ),
inference(cnf_transformation,[],[f67]) ).
thf(f138,plain,
( rel_domain
= ( ^ [Y0: $i > $i > $o,Y1: $i] :
( ?? @ $i
@ ^ [Y2: $i] : ( Y0 @ Y1 @ Y2 ) ) ) ),
inference(cnf_transformation,[],[f92]) ).
thf(f145,plain,
( $true
!= ( ^ [Y0: $i > $i > $o,Y1: $i > $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( !! @ $i
@ ^ [Y3: $i] :
( ( Y0 @ Y2 @ Y3 )
=> ( Y1 @ Y2 @ Y3 ) ) ) )
@ sK0
@ ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i,Y3: $i] :
( ( Y0 @ Y2 )
& ( Y1 @ Y3 ) )
@ a
@ ^ [Y0: $i] : $true ) ) ),
inference(definition_unfolding,[],[f106,f133,f122]) ).
thf(f146,plain,
( ( ^ [Y0: $i > $o,Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( Y0 @ Y2 )
=> ( Y1 @ Y2 ) ) )
@ ( ^ [Y0: $i > $i > $o,Y1: $i] :
( ?? @ $i
@ ^ [Y2: $i] : ( Y0 @ Y1 @ Y2 ) )
@ sK0 )
@ a )
= $true ),
inference(definition_unfolding,[],[f105,f130,f138]) ).
thf(f147,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( sK0 @ Y0 @ Y1 )
=> ( ( a @ Y0 )
& $true ) ) ) )
!= $true ),
inference(beta-eta_normalization,[],[f145]) ).
thf(f148,plain,
( $false
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( sK0 @ Y0 @ Y1 )
=> ( ( a @ Y0 )
& $true ) ) )
@ sK1 ) ),
inference(sigma_proxy_clausification,[],[f147]) ).
thf(f149,plain,
( $false
= ( !! @ $i
@ ^ [Y0: $i] :
( ( sK0 @ sK1 @ Y0 )
=> ( ( a @ sK1 )
& $true ) ) ) ),
inference(beta-eta_normalization,[],[f148]) ).
thf(f150,plain,
( $false
= ( ^ [Y0: $i] :
( ( sK0 @ sK1 @ Y0 )
=> ( ( a @ sK1 )
& $true ) )
@ sK2 ) ),
inference(sigma_proxy_clausification,[],[f149]) ).
thf(f151,plain,
( $false
= ( ( sK0 @ sK1 @ sK2 )
=> ( ( a @ sK1 )
& $true ) ) ),
inference(beta-eta_normalization,[],[f150]) ).
thf(f152,plain,
( $false
= ( ( a @ sK1 )
& $true ) ),
inference(imp_proxy_clausification,[],[f151]) ).
thf(f153,plain,
( $true
= ( sK0 @ sK1 @ sK2 ) ),
inference(imp_proxy_clausification,[],[f151]) ).
thf(f154,plain,
( ( ( a @ sK1 )
= $false )
| ( $false = $true ) ),
inference(and_proxy_clausification,[],[f152]) ).
thf(f155,plain,
( ( a @ sK1 )
= $false ),
inference(trivial_inequality_removal,[],[f154]) ).
thf(f156,plain,
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( ?? @ $i @ ( sK0 @ Y0 ) )
=> ( a @ Y0 ) ) ) ),
inference(beta-eta_normalization,[],[f146]) ).
thf(f157,plain,
! [X1: $i] :
( ( ^ [Y0: $i] :
( ( ?? @ $i @ ( sK0 @ Y0 ) )
=> ( a @ Y0 ) )
@ X1 )
= $true ),
inference(pi_proxy_clausification,[],[f156]) ).
thf(f158,plain,
! [X1: $i] :
( $true
= ( ( ?? @ $i @ ( sK0 @ X1 ) )
=> ( a @ X1 ) ) ),
inference(beta-eta_normalization,[],[f157]) ).
thf(f159,plain,
! [X1: $i] :
( ( $true
= ( a @ X1 ) )
| ( $false
= ( ?? @ $i @ ( sK0 @ X1 ) ) ) ),
inference(imp_proxy_clausification,[],[f158]) ).
thf(f160,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( sK0 @ X1 @ X2 ) )
| ( $true
= ( a @ X1 ) ) ),
inference(pi_proxy_clausification,[],[f159]) ).
thf(f162,plain,
( ( $false = $true )
| ( ( a @ sK1 )
= $true ) ),
inference(constrained_superposition,[],[f160,f153]) ).
thf(f163,plain,
( ( a @ sK1 )
= $true ),
inference(trivial_inequality_removal,[],[f162]) ).
thf(f165,plain,
$false = $true,
inference(forward_demodulation,[],[f163,f155]) ).
thf(f166,plain,
$false,
inference(trivial_inequality_removal,[],[f165]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SET651^3 : TPTP v9.3.1. Released v3.6.0.
% 0.00/0.03 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.00/0.10 % Computer : n012.cluster.edu
% 0.00/0.10 % Model : x86_64 x86_64
% 0.00/0.10 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.00/0.10 % Memory : 8046.5625MB
% 0.00/0.10 % OS : Linux 6.8.0-71-generic
% 0.00/0.10 % CPULimit : 300
% 0.00/0.10 % WCLimit : 300
% 0.00/0.10 % DateTime : Tue Sep 29 13:40:04 UTC 2026
% 0.00/0.10 % CPUTime :
% 0.00/0.10 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.12 Running higher-order theorem proving
% 0.08/0.13 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.17 % (115451)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.08/0.17 % (115462)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.08/0.17 % (115462)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.08/0.17 % (115456)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=3520547442:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.08/0.17 % (115458)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=2420592172:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.08/0.17 % (115457)lrs+10_16_si=on:nwc=1.5:random_seed=4096412669:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.08/0.17 % (115461)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=1250938083:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.08/0.17 % (115460)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=2472705871:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.08/0.17 % (115459)dis+1002_4:1_sfv=off:to=lpo:plsq=on:fde=none:e2e=on:si=on:spb=non_intro:acc=on:uwa=off:fd=preordered:foolp=on:s2agt=32:slsqc=1:slsq=on:random_seed=1366960918:hsq=on:hsqr=16,1:s2a=on:i=634:add=on:nm=16:nicw=on:rtra=on:gtg=position:ss=included:ixr=off:c=on:inj=on:ntd=on:rawr=on_2999 on theBenchmark for (2999ds/634Mi)
% 0.08/0.17 % (115462)dis+1002_8_to=kbo:sil=128000:tgt=full:drc=off:si=on:sp=const_max:lma=off:spb=non_intro:cbe=off:uwa=interpreted_only:random_seed=1807440188:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.08/0.17 % (115458)Instruction limit reached!
% 0.08/0.17 % (115458)------------------------------
% 0.08/0.17 % (115458)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.17 % (115458)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.17 % (115458)CaDiCaL version: 2.1.3
% 0.08/0.17 % (115458)Termination reason: Instruction limit
% 0.08/0.17 % (115458)Termination phase: Property scanning
% 0.08/0.17 % (115458)Time elapsed: 0.001 s
% 0.08/0.17 % (115458)Peak memory usage: 10 MB
% 0.08/0.17 % (115458)Instructions burned: 3 (million)
% 0.08/0.17 % (115456) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-115451-115456"...
% 0.08/0.17 % (115457) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-115451-115457"...
% 0.08/0.17 % (115461) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-115451-115461"...
% 0.08/0.17 % (115462) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-115451-115462"...
% 0.08/0.17 % (115456)...printing done.
% 0.08/0.17 % (115457)...printing done.
% 0.08/0.17 % (115461)...printing done.
% 0.08/0.17 % (115456)Refutation found. Thanks to Tanya!
% 0.08/0.17 % SZS status Theorem for theBenchmark
% 0.08/0.17 % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.17 % (115456)------------------------------
% 0.08/0.17 % (115456)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.17 % (115456)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.17 % (115456)CaDiCaL version: 2.1.3
% 0.08/0.17 % (115456)Termination reason: Refutation
% 0.08/0.17 % (115456)Time elapsed: 0.003 s
% 0.08/0.17 % (115456)Peak memory usage: 12 MB
% 0.08/0.17 % (115456)Instructions burned: 11 (million)
% 0.08/0.17 % (115451)Success in time 0.039 s
% 0.08/0.17 % Vampire exiting
%------------------------------------------------------------------------------