%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SET614^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 : n004.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:22 AM UTC 2026
% Result : Theorem 0.22s 0.28s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 6
% Syntax : Number of formulae : 68 ( 29 unt; 0 typ; 3 def)
% Number of atoms : 506 ( 99 equ; 0 cnn)
% Maximal formula atoms : 6 ( 7 avg)
% Number of connectives : 417 ( 75 ~; 78 |; 38 &; 223 @)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 39 ( 39 >; 0 *; 0 +; 0 <<)
% Number of symbols : 36 ( 33 usr; 6 con; 0-4 aty)
% Number of variables : 59 ( 0 sgn 9 !; 6 ?; 59 :)
% 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,
vOR: $o > $o > $o ).
thf(func_def_16,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_17,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_18,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_19,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_20,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_21,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_22,type,
vAND: $o > $o > $o ).
thf(func_def_23,type,
vNOT: $o > $o ).
thf(func_def_24,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_25,type,
vIMP: $o > $o > $o ).
thf(func_def_28,type,
sK0: $i > $o ).
thf(func_def_29,type,
sK1: $i > $o ).
thf(func_def_30,type,
sK2: $i > $o ).
thf(f6,axiom,
( union
= ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( X0 @ X2 )
| ( X1 @ X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET008^0.ax',union) ).
thf(f9,axiom,
( setminus
= ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( X0 @ X2 )
& ~ ( X1 @ X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET008^0.ax',setminus) ).
thf(f15,conjecture,
! [X0: $i > $o,X2: $i > $o,X1: $i > $o] :
( ( setminus @ ( setminus @ X0 @ X1 ) @ X2 )
= ( setminus @ X0 @ ( union @ X1 @ X2 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm) ).
thf(f16,negated_conjecture,
~ ! [X0: $i > $o,X2: $i > $o,X1: $i > $o] :
( ( setminus @ ( setminus @ X0 @ X1 ) @ X2 )
= ( setminus @ X0 @ ( union @ X1 @ X2 ) ) ),
inference(negated_conjecture,[status(cth)],[f15]) ).
thf(f18,plain,
( union
= ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( X0 @ X2 )
| ( X1 @ X2 ) ) ) ),
inference(rectify,[],[f6]) ).
thf(f19,plain,
( union
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y1 @ Y2 )
| ( Y0 @ Y2 ) ) ) ),
inference(fool_elimination,[],[f18]) ).
thf(f35,plain,
( setminus
= ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( X0 @ X2 )
& ~ ( X1 @ X2 ) ) ) ),
inference(rectify,[],[f9]) ).
thf(f36,plain,
( setminus
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ~ ( Y1 @ Y2 )
& ( Y0 @ Y2 ) ) ) ),
inference(fool_elimination,[],[f35]) ).
thf(f39,plain,
~ ! [X2: $i > $o,X0: $i > $o,X1: $i > $o] :
( ( setminus @ ( setminus @ X0 @ X2 ) @ X1 )
= ( setminus @ X0 @ ( union @ X2 @ X1 ) ) ),
inference(rectify,[],[f16]) ).
thf(f40,plain,
? [X2: $i > $o,X1: $i > $o,X0: $i > $o] :
( ( setminus @ ( setminus @ X0 @ X2 ) @ X1 )
!= ( setminus @ X0 @ ( union @ X2 @ X1 ) ) ),
inference(ennf_transformation,[],[f39]) ).
thf(f41,plain,
? [X0: $i > $o,X1: $i > $o,X2: $i > $o] :
( ( setminus @ X2 @ ( union @ X0 @ X1 ) )
!= ( setminus @ ( setminus @ X2 @ X0 ) @ X1 ) ),
inference(rectify,[],[f40]) ).
thf(f42,plain,
( ( setminus @ ( setminus @ sK2 @ sK0 ) @ sK1 )
!= ( setminus @ sK2 @ ( union @ sK0 @ sK1 ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f41]) ).
thf(f47,plain,
( ( setminus @ ( setminus @ sK2 @ sK0 ) @ sK1 )
!= ( setminus @ sK2 @ ( union @ sK0 @ sK1 ) ) ),
inference(cnf_transformation,[],[f42]) ).
thf(f50,plain,
( setminus
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ~ ( Y1 @ Y2 )
& ( Y0 @ Y2 ) ) ) ),
inference(cnf_transformation,[],[f36]) ).
thf(f51,plain,
( union
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y1 @ Y2 )
| ( Y0 @ Y2 ) ) ) ),
inference(cnf_transformation,[],[f19]) ).
thf(f61,plain,
( ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ~ ( Y1 @ Y2 )
& ( Y0 @ Y2 ) )
@ sK2
@ ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y1 @ Y2 )
| ( Y0 @ Y2 ) )
@ sK0
@ sK1 ) )
!= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ~ ( Y1 @ Y2 )
& ( Y0 @ Y2 ) )
@ ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ~ ( Y1 @ Y2 )
& ( Y0 @ Y2 ) )
@ sK2
@ sK0 )
@ sK1 ) ),
inference(definition_unfolding,[],[f47,f50,f50,f50,f51]) ).
thf(f62,plain,
( ( ^ [Y0: $i] :
( ~ ( ( sK1 @ Y0 )
| ( sK0 @ Y0 ) )
& ( sK2 @ Y0 ) ) )
!= ( ^ [Y0: $i] :
( ~ ( sK1 @ Y0 )
& ~ ( sK0 @ Y0 )
& ( sK2 @ Y0 ) ) ) ),
inference(beta-eta_normalization,[],[f61]) ).
thf(f63,plain,
( ( ^ [Y0: $i] :
( ~ ( sK1 @ Y0 )
& ~ ( sK0 @ Y0 )
& ( sK2 @ Y0 ) )
@ sK3 )
!= ( ^ [Y0: $i] :
( ~ ( ( sK1 @ Y0 )
| ( sK0 @ Y0 ) )
& ( sK2 @ Y0 ) )
@ sK3 ) ),
inference(negative_extensionality,[],[f62]) ).
thf(f64,plain,
( ( $true
= ( ^ [Y0: $i] :
( ~ ( ( sK1 @ Y0 )
| ( sK0 @ Y0 ) )
& ( sK2 @ Y0 ) )
@ sK3 ) )
| ( $true
= ( ^ [Y0: $i] :
( ~ ( sK1 @ Y0 )
& ~ ( sK0 @ Y0 )
& ( sK2 @ Y0 ) )
@ sK3 ) ) ),
inference(xor_proxy_clausification,[],[f63]) ).
thf(f65,plain,
( ( $false
= ( ^ [Y0: $i] :
( ~ ( sK1 @ Y0 )
& ~ ( sK0 @ Y0 )
& ( sK2 @ Y0 ) )
@ sK3 ) )
| ( $false
= ( ^ [Y0: $i] :
( ~ ( ( sK1 @ Y0 )
| ( sK0 @ Y0 ) )
& ( sK2 @ Y0 ) )
@ sK3 ) ) ),
inference(xor_proxy_clausification,[],[f63]) ).
thf(f66,plain,
( ( $false
= ( ~ ( ( sK1 @ sK3 )
| ( sK0 @ sK3 ) )
& ( sK2 @ sK3 ) ) )
| ( $false
= ( ~ ( sK1 @ sK3 )
& ~ ( sK0 @ sK3 )
& ( sK2 @ sK3 ) ) ) ),
inference(beta-eta_normalization,[],[f65]) ).
thf(f67,plain,
( ( $false
= ( sK2 @ sK3 ) )
| ( ( ~ ( ( sK1 @ sK3 )
| ( sK0 @ sK3 ) ) )
= $false )
| ( $false
= ( ~ ( sK1 @ sK3 )
& ~ ( sK0 @ sK3 )
& ( sK2 @ sK3 ) ) ) ),
inference(and_proxy_clausification,[],[f66]) ).
thf(f68,plain,
( ( $false
= ( ~ ( sK1 @ sK3 )
& ~ ( sK0 @ sK3 )
& ( sK2 @ sK3 ) ) )
| ( $true
= ( ( sK1 @ sK3 )
| ( sK0 @ sK3 ) ) )
| ( $false
= ( sK2 @ sK3 ) ) ),
inference(not_proxy_clausification,[],[f67]) ).
thf(f69,plain,
( ( $true
= ( ( sK1 @ sK3 )
| ( sK0 @ sK3 ) ) )
| ( $false
= ( ~ ( sK0 @ sK3 )
& ( sK2 @ sK3 ) ) )
| ( $false
= ( ~ ( sK1 @ sK3 ) ) )
| ( $false
= ( sK2 @ sK3 ) ) ),
inference(and_proxy_clausification,[],[f68]) ).
thf(f70,plain,
( ( $false
= ( ~ ( sK1 @ sK3 ) ) )
| ( $true
= ( sK0 @ sK3 ) )
| ( $false
= ( ~ ( sK0 @ sK3 )
& ( sK2 @ sK3 ) ) )
| ( $false
= ( sK2 @ sK3 ) )
| ( $true
= ( sK1 @ sK3 ) ) ),
inference(or_proxy_clausification,[],[f69]) ).
thf(f71,plain,
( ( $true
= ( sK0 @ sK3 ) )
| ( $true
= ( sK1 @ sK3 ) )
| ( $true
= ( sK1 @ sK3 ) )
| ( $false
= ( ~ ( sK0 @ sK3 )
& ( sK2 @ sK3 ) ) )
| ( $false
= ( sK2 @ sK3 ) ) ),
inference(not_proxy_clausification,[],[f70]) ).
thf(f72,plain,
( ( $true
= ( sK1 @ sK3 ) )
| ( $false
= ( sK2 @ sK3 ) )
| ( $true
= ( sK0 @ sK3 ) )
| ( $false
= ( ~ ( sK0 @ sK3 ) ) )
| ( $true
= ( sK1 @ sK3 ) )
| ( $false
= ( sK2 @ sK3 ) ) ),
inference(and_proxy_clausification,[],[f71]) ).
thf(f73,plain,
( ( $true
= ( sK1 @ sK3 ) )
| ( $false
= ( sK2 @ sK3 ) )
| ( $true
= ( sK0 @ sK3 ) )
| ( $true
= ( sK1 @ sK3 ) )
| ( $true
= ( sK0 @ sK3 ) )
| ( $false
= ( sK2 @ sK3 ) ) ),
inference(not_proxy_clausification,[],[f72]) ).
thf(f74,plain,
( ( $true
= ( sK1 @ sK3 ) )
| ( $false
= ( sK2 @ sK3 ) )
| ( $true
= ( sK0 @ sK3 ) ) ),
inference(duplicate_literal_removal,[],[f73]) ).
thf(f75,plain,
( ( $true
= ( ~ ( ( sK1 @ sK3 )
| ( sK0 @ sK3 ) )
& ( sK2 @ sK3 ) ) )
| ( ( ~ ( sK1 @ sK3 )
& ~ ( sK0 @ sK3 )
& ( sK2 @ sK3 ) )
= $true ) ),
inference(beta-eta_normalization,[],[f64]) ).
thf(f76,plain,
( ( $true
= ( sK2 @ sK3 ) )
| ( ( ~ ( sK1 @ sK3 )
& ~ ( sK0 @ sK3 )
& ( sK2 @ sK3 ) )
= $true ) ),
inference(and_proxy_clausification,[],[f75]) ).
thf(f77,plain,
( ( ( ~ ( sK1 @ sK3 )
& ~ ( sK0 @ sK3 )
& ( sK2 @ sK3 ) )
= $true )
| ( ( ~ ( ( sK1 @ sK3 )
| ( sK0 @ sK3 ) ) )
= $true ) ),
inference(and_proxy_clausification,[],[f75]) ).
thf(f78,plain,
( ( $true
= ( ~ ( sK0 @ sK3 )
& ( sK2 @ sK3 ) ) )
| ( ( ~ ( ( sK1 @ sK3 )
| ( sK0 @ sK3 ) ) )
= $true ) ),
inference(and_proxy_clausification,[],[f77]) ).
thf(f79,plain,
( ( ( ~ ( ( sK1 @ sK3 )
| ( sK0 @ sK3 ) ) )
= $true )
| ( $true
= ( ~ ( sK1 @ sK3 ) ) ) ),
inference(and_proxy_clausification,[],[f77]) ).
thf(f80,plain,
( ( $false
= ( ( sK1 @ sK3 )
| ( sK0 @ sK3 ) ) )
| ( $true
= ( ~ ( sK1 @ sK3 ) ) ) ),
inference(not_proxy_clausification,[],[f79]) ).
thf(f82,plain,
( ( $true
= ( ~ ( sK1 @ sK3 ) ) )
| ( $false
= ( sK1 @ sK3 ) ) ),
inference(or_proxy_clausification,[],[f80]) ).
thf(f83,plain,
( ( $false
= ( sK1 @ sK3 ) )
| ( $false
= ( sK1 @ sK3 ) ) ),
inference(not_proxy_clausification,[],[f82]) ).
thf(f84,plain,
( $false
= ( sK1 @ sK3 ) ),
inference(duplicate_literal_removal,[],[f83]) ).
thf(f87,plain,
( ( ( ~ ( sK0 @ sK3 ) )
= $true )
| ( ( ~ ( ( sK1 @ sK3 )
| ( sK0 @ sK3 ) ) )
= $true ) ),
inference(and_proxy_clausification,[],[f78]) ).
thf(f88,plain,
( ( $false
= ( sK0 @ sK3 ) )
| ( ( ~ ( ( sK1 @ sK3 )
| ( sK0 @ sK3 ) ) )
= $true ) ),
inference(not_proxy_clausification,[],[f87]) ).
thf(f89,plain,
( ( $false
= ( ( sK1 @ sK3 )
| ( sK0 @ sK3 ) ) )
| ( $false
= ( sK0 @ sK3 ) ) ),
inference(not_proxy_clausification,[],[f88]) ).
thf(f90,plain,
( ( $false
= ( sK0 @ sK3 ) )
| ( $false
= ( sK0 @ sK3 ) ) ),
inference(or_proxy_clausification,[],[f89]) ).
thf(f92,plain,
( $false
= ( sK0 @ sK3 ) ),
inference(duplicate_literal_removal,[],[f90]) ).
thf(f96,plain,
( ( $true
= ( ~ ( sK0 @ sK3 )
& ( sK2 @ sK3 ) ) )
| ( $true
= ( sK2 @ sK3 ) ) ),
inference(and_proxy_clausification,[],[f76]) ).
thf(f99,plain,
( ( $true
= ( sK2 @ sK3 ) )
| ( $true
= ( sK2 @ sK3 ) ) ),
inference(and_proxy_clausification,[],[f96]) ).
thf(f102,plain,
( $true
= ( sK2 @ sK3 ) ),
inference(duplicate_literal_removal,[],[f99]) ).
thf(f104,definition,
( spl4_1
<=> ( $false
= ( sK2 @ sK3 ) ) ),
introduced(definition,[new_symbols(definition,[spl4_1])],[avatar_definition]) ).
thf(f105,plain,
( ( $false
= ( sK2 @ sK3 ) )
| ~ spl4_1 ),
inference(avatar_component_clause,[],[f104]) ).
thf(f107,definition,
( spl4_2
<=> ( $true
= ( sK1 @ sK3 ) ) ),
introduced(definition,[new_symbols(definition,[spl4_2])],[avatar_definition]) ).
thf(f108,plain,
( ( $true
= ( sK1 @ sK3 ) )
| ~ spl4_2 ),
inference(avatar_component_clause,[],[f107]) ).
thf(f110,definition,
( spl4_3
<=> ( $true
= ( sK0 @ sK3 ) ) ),
introduced(definition,[new_symbols(definition,[spl4_3])],[avatar_definition]) ).
thf(f111,plain,
( ( $true
= ( sK0 @ sK3 ) )
| ~ spl4_3 ),
inference(avatar_component_clause,[],[f110]) ).
thf(f112,plain,
( spl4_1
| spl4_2
| spl4_3 ),
inference(avatar_split_clause,[],[f74,f110,f107,f104]) ).
thf(f113,plain,
( ( $false = $true )
| ~ spl4_2 ),
inference(forward_demodulation,[],[f108,f84]) ).
thf(f114,plain,
( $false
| ~ spl4_2 ),
inference(trivial_inequality_removal,[],[f113]) ).
thf(f115,plain,
~ spl4_2,
inference(avatar_contradiction_clause,[],[f114]) ).
thf(f116,plain,
( ( $false = $true )
| ~ spl4_3 ),
inference(forward_demodulation,[],[f111,f92]) ).
thf(f117,plain,
( $false
| ~ spl4_3 ),
inference(trivial_inequality_removal,[],[f116]) ).
thf(f118,plain,
~ spl4_3,
inference(avatar_contradiction_clause,[],[f117]) ).
thf(f119,plain,
( ( $false = $true )
| ~ spl4_1 ),
inference(backward_demodulation,[],[f102,f105]) ).
thf(f120,plain,
( $false
| ~ spl4_1 ),
inference(trivial_inequality_removal,[],[f119]) ).
thf(f121,plain,
~ spl4_1,
inference(avatar_contradiction_clause,[],[f120]) ).
cnf(s1,plain,
( spl4_1
| spl4_2
| spl4_3 ),
inference(sat_conversion,[],[f112]) ).
cnf(s2,plain,
~ spl4_2,
inference(sat_conversion,[],[f115]) ).
cnf(s3,plain,
~ spl4_3,
inference(sat_conversion,[],[f118]) ).
cnf(s4,plain,
~ spl4_1,
inference(sat_conversion,[],[f121]) ).
cnf(s5,plain,
$false,
inference(rat,[],[s1,s3,s2,s4]) ).
thf(f122,plain,
$false,
inference(avatar_sat_refutation,[],[s5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET614^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.09/0.19 % Computer : n004.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Tue Sep 29 13:39:07 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.23 Running higher-order theorem proving
% 0.09/0.24 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.22/0.28 % (1294577)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.22/0.28 % (1294587)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=1057405480:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.22/0.28 % (1294587) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1294577-1294587"...
% 0.22/0.28 % (1294588)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.22/0.28 % (1294588)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.22/0.28 % (1294587)...printing done.
% 0.22/0.28 % (1294587)Refutation found. Thanks to Tanya!
% 0.22/0.28 % SZS status Theorem for theBenchmark
% 0.22/0.28 % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.28 % (1294587)------------------------------
% 0.22/0.28 % (1294587)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.28 % (1294587)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.28 % (1294587)CaDiCaL version: 2.1.3
% 0.22/0.28 % (1294587)Termination reason: Refutation
% 0.22/0.28 % (1294587)Time elapsed: 0.003 s
% 0.22/0.28 % (1294587)Peak memory usage: 13 MB
% 0.22/0.28 % (1294587)Instructions burned: 7 (million)
% 0.22/0.28 % (1294577)Success in time 0.037 s
% 0.22/0.28 % Vampire exiting
%------------------------------------------------------------------------------