%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU706^2 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n005.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:33:03 AM UTC 2026
% Result : Theorem 0.17s 0.27s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 5
% Syntax : Number of formulae : 61 ( 44 unt; 0 typ; 0 def)
% Number of atoms : 387 ( 142 equ; 0 cnn)
% Maximal formula atoms : 8 ( 6 avg)
% Number of connectives : 341 ( 17 ~; 10 |; 29 &; 217 @)
% ( 0 <=>; 45 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 31 ( 26 usr; 13 con; 0-4 aty)
% ( 19 !!; 4 ??; 0 @@+; 0 @@-)
% Number of variables : 84 ( 34 ^; 44 !; 6 ?; 84 :)
% 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,
setunion: $i > $i ).
thf(func_def_4,type,
uniqinunit: $o ).
thf(func_def_6,type,
in__Cong: $o ).
thf(func_def_7,type,
setadjoin__Cong: $o ).
thf(func_def_8,type,
setunion__Cong: $o ).
thf(func_def_9,type,
setunionsingleton: $o ).
thf(func_def_10,type,
singleton: $i > $o ).
thf(func_def_11,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_12,type,
vIMP: $o > $o > $o ).
thf(func_def_13,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_14,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_15,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_16,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_17,type,
vIFF: $o > $o > $o ).
thf(func_def_18,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_19,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_20,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_21,type,
vAND: $o > $o > $o ).
thf(func_def_26,type,
vNOT: $o > $o ).
thf(f1,axiom,
( uniqinunit
= ( ! [X0: $i,X1: $i] :
( ( in @ X0 @ ( setadjoin @ X1 @ emptyset ) )
=> ( X0 = X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',uniqinunit) ).
thf(f4,axiom,
( setunion__Cong
= ( ! [X0: $i,X1: $i] :
( ( X0 = X1 )
=> ( ( setunion @ X0 )
= ( setunion @ X1 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',setunion__Cong) ).
thf(f5,axiom,
( setunionsingleton
= ( ! [X0: $i] :
( ( setunion @ ( setadjoin @ X0 @ emptyset ) )
= X0 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',setunionsingleton) ).
thf(f6,axiom,
( singleton
= ( ^ [X0: $i] :
? [X1: $i] :
( ( X0
= ( setadjoin @ X1 @ emptyset ) )
& ( in @ X1 @ X0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',singleton) ).
thf(f7,conjecture,
( uniqinunit
=> ( in__Cong
=> ( setadjoin__Cong
=> ( setunion__Cong
=> ( setunionsingleton
=> ! [X0: $i] :
( ( singleton @ X0 )
=> ! [X1: $i] :
( ( in @ X1 @ X0 )
=> ( ( setunion @ X0 )
= X1 ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',theeq) ).
thf(f8,negated_conjecture,
~ ( uniqinunit
=> ( in__Cong
=> ( setadjoin__Cong
=> ( setunion__Cong
=> ( setunionsingleton
=> ! [X0: $i] :
( ( singleton @ X0 )
=> ! [X1: $i] :
( ( in @ X1 @ X0 )
=> ( ( setunion @ X0 )
= X1 ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f7]) ).
thf(f9,plain,
( uniqinunit
= ( ! [X0: $i,X1: $i] :
( ( in @ X0 @ ( setadjoin @ X1 @ emptyset ) )
=> ( X0 = X1 ) ) ) ),
inference(rectify,[],[f1]) ).
thf(f10,plain,
( uniqinunit
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ ( setadjoin @ Y0 @ emptyset ) )
=> ( Y1 = Y0 ) ) ) ) ),
inference(fool_elimination,[],[f9]) ).
thf(f14,plain,
( setunion__Cong
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( Y1 = Y0 )
=> ( ( setunion @ Y1 )
= ( setunion @ Y0 ) ) ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f15,plain,
( setunionsingleton
= ( !! @ $i
@ ^ [Y0: $i] :
( ( setunion @ ( setadjoin @ Y0 @ emptyset ) )
= Y0 ) ) ),
inference(fool_elimination,[],[f5]) ).
thf(f16,plain,
( singleton
= ( ^ [X0: $i] :
? [X1: $i] :
( ( X0
= ( setadjoin @ X1 @ emptyset ) )
& ( in @ X1 @ X0 ) ) ) ),
inference(rectify,[],[f6]) ).
thf(f17,plain,
( singleton
= ( ^ [Y0: $i] :
( ?? @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ Y0 )
& ( ( setadjoin @ Y1 @ emptyset )
= Y0 ) ) ) ) ),
inference(fool_elimination,[],[f16]) ).
thf(f18,plain,
~ ( uniqinunit
=> ( in__Cong
=> ( setadjoin__Cong
=> ( setunion__Cong
=> ( setunionsingleton
=> ! [X0: $i] :
( ( singleton @ X0 )
=> ! [X1: $i] :
( ( in @ X1 @ X0 )
=> ( ( setunion @ X0 )
= X1 ) ) ) ) ) ) ) ),
inference(rectify,[],[f8]) ).
thf(f19,plain,
~ ( ( uniqinunit = $true )
=> ( ( in__Cong = $true )
=> ( ( setadjoin__Cong = $true )
=> ( ( setunion__Cong = $true )
=> ( ( setunionsingleton = $true )
=> ! [X0: $i] :
( ( ( singleton @ X0 )
= $true )
=> ! [X1: $i] :
( ( ( in @ X1 @ X0 )
= $true )
=> ( ( setunion @ X0 )
= X1 ) ) ) ) ) ) ) ),
inference(fool_elimination,[],[f18]) ).
thf(f20,plain,
( ? [X0: $i] :
( ? [X1: $i] :
( ( ( setunion @ X0 )
!= X1 )
& ( ( in @ X1 @ X0 )
= $true ) )
& ( ( singleton @ X0 )
= $true ) )
& ( setunionsingleton = $true )
& ( setunion__Cong = $true )
& ( setadjoin__Cong = $true )
& ( in__Cong = $true )
& ( uniqinunit = $true ) ),
inference(ennf_transformation,[],[f19]) ).
thf(f21,plain,
( ? [X0: $i] :
( ? [X1: $i] :
( ( ( setunion @ X0 )
!= X1 )
& ( ( in @ X1 @ X0 )
= $true ) )
& ( ( singleton @ X0 )
= $true ) )
& ( setunionsingleton = $true )
& ( setunion__Cong = $true )
& ( setadjoin__Cong = $true )
& ( in__Cong = $true )
& ( uniqinunit = $true ) ),
inference(flattening,[],[f20]) ).
thf(f22,plain,
( ( sK1
!= ( setunion @ sK0 ) )
& ( $true
= ( in @ sK1 @ sK0 ) )
& ( $true
= ( singleton @ sK0 ) )
& ( setunionsingleton = $true )
& ( setunion__Cong = $true )
& ( setadjoin__Cong = $true )
& ( in__Cong = $true )
& ( uniqinunit = $true ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f21]) ).
thf(f23,plain,
( uniqinunit
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ ( setadjoin @ Y0 @ emptyset ) )
=> ( Y1 = Y0 ) ) ) ) ),
inference(cnf_transformation,[],[f10]) ).
thf(f26,plain,
( setunion__Cong
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( Y1 = Y0 )
=> ( ( setunion @ Y1 )
= ( setunion @ Y0 ) ) ) ) ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f27,plain,
( setunionsingleton
= ( !! @ $i
@ ^ [Y0: $i] :
( ( setunion @ ( setadjoin @ Y0 @ emptyset ) )
= Y0 ) ) ),
inference(cnf_transformation,[],[f15]) ).
thf(f28,plain,
( singleton
= ( ^ [Y0: $i] :
( ?? @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ Y0 )
& ( ( setadjoin @ Y1 @ emptyset )
= Y0 ) ) ) ) ),
inference(cnf_transformation,[],[f17]) ).
thf(f29,plain,
uniqinunit = $true,
inference(cnf_transformation,[],[f22]) ).
thf(f32,plain,
setunion__Cong = $true,
inference(cnf_transformation,[],[f22]) ).
thf(f33,plain,
setunionsingleton = $true,
inference(cnf_transformation,[],[f22]) ).
thf(f34,plain,
( $true
= ( singleton @ sK0 ) ),
inference(cnf_transformation,[],[f22]) ).
thf(f35,plain,
( $true
= ( in @ sK1 @ sK0 ) ),
inference(cnf_transformation,[],[f22]) ).
thf(f36,plain,
( sK1
!= ( setunion @ sK0 ) ),
inference(cnf_transformation,[],[f22]) ).
thf(f39,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ ( setadjoin @ Y0 @ emptyset ) )
=> ( Y1 = Y0 ) ) ) )
= $true ),
inference(definition_unfolding,[],[f23,f29]) ).
thf(f42,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( Y1 = Y0 )
=> ( ( setunion @ Y1 )
= ( setunion @ Y0 ) ) ) ) )
= $true ),
inference(definition_unfolding,[],[f26,f32]) ).
thf(f43,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( ( setunion @ ( setadjoin @ Y0 @ emptyset ) )
= Y0 ) )
= $true ),
inference(definition_unfolding,[],[f27,f33]) ).
thf(f44,plain,
( $true
= ( ^ [Y0: $i] :
( ?? @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ Y0 )
& ( ( setadjoin @ Y1 @ emptyset )
= Y0 ) ) )
@ sK0 ) ),
inference(definition_unfolding,[],[f34,f28]) ).
thf(f45,plain,
( $true
= ( ?? @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ sK0 )
& ( ( setadjoin @ Y0 @ emptyset )
= sK0 ) ) ) ),
inference(beta-eta_normalization,[],[f44]) ).
thf(f46,plain,
( $true
= ( ^ [Y0: $i] :
( ( in @ Y0 @ sK0 )
& ( ( setadjoin @ Y0 @ emptyset )
= sK0 ) )
@ sK2 ) ),
inference(sigma_proxy_clausification,[],[f45]) ).
thf(f47,plain,
( $true
= ( ( in @ sK2 @ sK0 )
& ( ( setadjoin @ sK2 @ emptyset )
= sK0 ) ) ),
inference(beta-eta_normalization,[],[f46]) ).
thf(f48,plain,
( $true
= ( ( setadjoin @ sK2 @ emptyset )
= sK0 ) ),
inference(and_proxy_clausification,[],[f47]) ).
thf(f50,plain,
( sK0
= ( setadjoin @ sK2 @ emptyset ) ),
inference(equality_proxy_clausification,[],[f48]) ).
thf(f51,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( setunion @ ( setadjoin @ Y0 @ emptyset ) )
= Y0 )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f43]) ).
thf(f52,plain,
! [X1: $i] :
( $true
= ( ( setunion @ ( setadjoin @ X1 @ emptyset ) )
= X1 ) ),
inference(beta-eta_normalization,[],[f51]) ).
thf(f53,plain,
! [X1: $i] :
( ( setunion @ ( setadjoin @ X1 @ emptyset ) )
= X1 ),
inference(equality_proxy_clausification,[],[f52]) ).
thf(f54,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( Y1 = Y0 )
=> ( ( setunion @ Y1 )
= ( setunion @ Y0 ) ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f42]) ).
thf(f55,plain,
! [X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( Y0 = X1 )
=> ( ( setunion @ Y0 )
= ( setunion @ X1 ) ) ) ) ),
inference(beta-eta_normalization,[],[f54]) ).
thf(f56,plain,
! [X2: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( Y0 = X1 )
=> ( ( setunion @ Y0 )
= ( setunion @ X1 ) ) )
@ X2 ) ),
inference(pi_proxy_clausification,[],[f55]) ).
thf(f57,plain,
! [X2: $i,X1: $i] :
( $true
= ( ( X2 = X1 )
=> ( ( setunion @ X2 )
= ( setunion @ X1 ) ) ) ),
inference(beta-eta_normalization,[],[f56]) ).
thf(f58,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( X2 = X1 ) )
| ( $true
= ( ( setunion @ X2 )
= ( setunion @ X1 ) ) ) ),
inference(imp_proxy_clausification,[],[f57]) ).
thf(f59,plain,
! [X2: $i,X1: $i] :
( ( X1 != X2 )
| ( $true
= ( ( setunion @ X2 )
= ( setunion @ X1 ) ) ) ),
inference(equality_proxy_clausification,[],[f58]) ).
thf(f60,plain,
! [X2: $i,X1: $i] :
( ( ( setunion @ X1 )
= ( setunion @ X2 ) )
| ( X1 != X2 ) ),
inference(equality_proxy_clausification,[],[f59]) ).
thf(f89,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ ( setadjoin @ Y0 @ emptyset ) )
=> ( Y1 = Y0 ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f39]) ).
thf(f90,plain,
! [X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ ( setadjoin @ X1 @ emptyset ) )
=> ( Y0 = X1 ) ) ) ),
inference(beta-eta_normalization,[],[f89]) ).
thf(f91,plain,
! [X2: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( in @ Y0 @ ( setadjoin @ X1 @ emptyset ) )
=> ( Y0 = X1 ) )
@ X2 ) ),
inference(pi_proxy_clausification,[],[f90]) ).
thf(f92,plain,
! [X2: $i,X1: $i] :
( $true
= ( ( in @ X2 @ ( setadjoin @ X1 @ emptyset ) )
=> ( X2 = X1 ) ) ),
inference(beta-eta_normalization,[],[f91]) ).
thf(f93,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( in @ X2 @ ( setadjoin @ X1 @ emptyset ) ) )
| ( $true
= ( X2 = X1 ) ) ),
inference(imp_proxy_clausification,[],[f92]) ).
thf(f94,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( in @ X2 @ ( setadjoin @ X1 @ emptyset ) ) )
| ( X1 = X2 ) ),
inference(equality_proxy_clausification,[],[f93]) ).
thf(f100,plain,
! [X0: $i] :
( ( ( setunion @ X0 )
!= sK1 )
| ( sK0 != X0 ) ),
inference(constrained_superposition,[],[f36,f60]) ).
thf(f112,plain,
! [X0: $i] :
( ( ( setadjoin @ X0 @ emptyset )
!= sK0 )
| ( sK1 != X0 ) ),
inference(constrained_superposition,[],[f100,f53]) ).
thf(f117,plain,
( ( sK0 != sK0 )
| ( sK1 != sK2 ) ),
inference(constrained_superposition,[],[f112,f50]) ).
thf(f118,plain,
sK1 != sK2,
inference(trivial_inequality_removal,[],[f117]) ).
thf(f156,plain,
! [X0: $i] :
( ( $false
= ( in @ X0 @ sK0 ) )
| ( sK2 = X0 ) ),
inference(constrained_superposition,[],[f94,f50]) ).
thf(f160,plain,
! [X0: $i] :
( ( sK1 != X0 )
| ( $false
= ( in @ X0 @ sK0 ) ) ),
inference(constrained_superposition,[],[f118,f156]) ).
thf(f164,plain,
( ( in @ sK1 @ sK0 )
= $false ),
inference(equality_resolution,[],[f160]) ).
thf(f166,plain,
$true = $false,
inference(constrained_superposition,[],[f35,f164]) ).
thf(f167,plain,
$false,
inference(trivial_inequality_removal,[],[f166]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU706^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.19 % Computer : n005.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 14:12:46 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.21 Running first-order model finding
% 0.08/0.21 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.27 % (1726650)Will run a generic schedule for satisfiability detection.
% 0.17/0.27 % (1726655)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1404052589_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.27 % Exception at run slice level
% 0.17/0.27 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.17/0.27 % (1726656)% WARNING: option uhcvi not known.
% 0.17/0.27 % (1726656)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=233955451:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.27 % (1726657)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2165515109:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.27 % (1726658)dis+10_1_sil=32000:sp=arity:random_seed=2269793151:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.27 % (1726659)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=252156403:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.27 % (1726661)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1835568833:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/0.27 % (1726656)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.17/0.27 % (1726659)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.17/0.27 % (1726656)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.17/0.27 % (1726663)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2875816092:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.17/0.27 % (1726661) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1726650-1726661"...
% 0.17/0.27 % Exception at run slice level
% 0.17/0.27 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.17/0.27 % (1726658) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1726650-1726658"...
% 0.17/0.27 % (1726656) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1726650-1726656"...
% 0.17/0.27 % (1726661)...printing done.
% 0.17/0.27 % (1726658)...printing done.
% 0.17/0.27 % (1726661)Refutation found. Thanks to Tanya!
% 0.17/0.27 % SZS status Theorem for theBenchmark
% 0.17/0.27 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.27 % (1726661)------------------------------
% 0.17/0.27 % (1726661)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.27 % (1726661)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.27 % (1726661)CaDiCaL version: 2.1.3
% 0.17/0.27 % (1726661)Termination reason: Refutation
% 0.17/0.27 % (1726661)Time elapsed: 0.009 s
% 0.17/0.27 % (1726661)Peak memory usage: 12 MB
% 0.17/0.27 % (1726661)Instructions burned: 13 (million)
% 0.17/0.27 % (1726650)Success in time 0.046 s
% 0.17/0.27 % Vampire exiting
%------------------------------------------------------------------------------