%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU771^2 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/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:31:16 AM UTC 2026
% Result : Theorem 0.36s 0.42s
% Output : Refutation 0.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 12
% Syntax : Number of formulae : 69 ( 32 unt; 0 typ; 8 def)
% Number of atoms : 285 ( 59 equ; 0 cnn)
% Maximal formula atoms : 3 ( 4 avg)
% Number of connectives : 416 ( 33 ~; 30 |; 2 &; 321 @)
% ( 5 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 60 ( 60 >; 0 *; 0 +; 0 <<)
% Number of symbols : 27 ( 23 usr; 13 con; 0-4 aty)
% ( 21 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 146 ( 0 sgn 32 !; 2 ?; 146 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
subset: $i > $i > $o ).
thf(func_def_1,type,
cartprod: $i > $i > $i ).
thf(func_def_2,type,
breln: $i > $i > $i > $o ).
thf(func_def_4,type,
dpsetconstr: $i > $i > ( $i > $i > $o ) > $i ).
thf(func_def_5,type,
setOfPairsIsBReln: $o ).
thf(func_def_6,type,
breln1: $i > $i > $o ).
thf(func_def_9,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_10,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_11,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_12,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_13,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_15,type,
sK1: $i > $i > $o ).
thf(func_def_16,type,
sF2: $o ).
thf(func_def_18,type,
sF4: $o ).
thf(func_def_21,type,
sK7: $i > $i > $o ).
thf(f1,axiom,
( breln
= ( ^ [X0: $i,X1: $i,X2: $i] : ( subset @ X2 @ ( cartprod @ X0 @ X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',breln) ).
thf(f2,axiom,
! [X2: $i > $i > $o,X1: $i,X0: $i] :
( ( breln @ X0 @ X1
@ ( dpsetconstr @ X0 @ X1
@ ^ [X3: $i,X4: $i] : ( X2 @ X3 @ X4 ) ) )
= setOfPairsIsBReln ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setOfPairsIsBReln) ).
thf(f3,axiom,
( ( ^ [X0: $i,X1: $i] : ( breln @ X0 @ X0 @ X1 ) )
= breln1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',breln1) ).
thf(f4,conjecture,
( setOfPairsIsBReln
=> ! [X0: $i,X1: $i > $i > $o] :
( breln1 @ X0
@ ( dpsetconstr @ X0 @ X0
@ ^ [X2: $i,X3: $i] : ( X1 @ X2 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setOfPairsIsBReln1) ).
thf(f5,negated_conjecture,
~ ( setOfPairsIsBReln
=> ! [X0: $i,X1: $i > $i > $o] :
( breln1 @ X0
@ ( dpsetconstr @ X0 @ X0
@ ^ [X2: $i,X3: $i] : ( X1 @ X2 @ X3 ) ) ) ),
inference(negated_conjecture,[status(cth)],[f4]) ).
thf(f6,plain,
~ ( setOfPairsIsBReln
=> ! [X0: $i,X1: $i > $i > $o] :
( breln1 @ X0
@ ( dpsetconstr @ X0 @ X0
@ ^ [X2: $i,X3: $i] : ( X1 @ X2 @ X3 ) ) ) ),
inference(rectify,[],[f5]) ).
thf(f7,plain,
~ ( ( setOfPairsIsBReln = $true )
=> ! [X1: $i > $i > $o,X0: $i] :
( ( breln1 @ X0
@ ( dpsetconstr @ X0 @ X0
@ ^ [Y0: $i,Y1: $i] : ( X1 @ Y0 @ Y1 ) ) )
= $true ) ),
inference(fool_elimination,[],[f6]) ).
thf(f8,plain,
! [X0: $i > $i > $o,X1: $i,X2: $i] :
( ( breln @ X2 @ X1
@ ( dpsetconstr @ X2 @ X1
@ ^ [X3: $i,X4: $i] : ( X0 @ X3 @ X4 ) ) )
= setOfPairsIsBReln ),
inference(rectify,[],[f2]) ).
thf(f9,plain,
( setOfPairsIsBReln
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ ( $i > $i > $o )
@ ^ [Y2: $i > $i > $o] :
( breln @ Y0 @ Y1
@ ( dpsetconstr @ Y0 @ Y1
@ ^ [Y3: $i,Y4: $i] : ( Y2 @ Y3 @ Y4 ) ) ) ) ) ) ),
inference(fool_elimination,[],[f8]) ).
thf(f10,plain,
( breln1
= ( ^ [Y0: $i,Y1: $i] : ( breln @ Y0 @ Y0 @ Y1 ) ) ),
inference(fool_elimination,[],[f3]) ).
thf(f11,plain,
( breln
= ( ^ [Y0: $i,Y1: $i,Y2: $i] : ( subset @ Y2 @ ( cartprod @ Y0 @ Y1 ) ) ) ),
inference(fool_elimination,[],[f1]) ).
thf(f12,plain,
( ( setOfPairsIsBReln = $true )
& ? [X0: $i,X1: $i > $i > $o] :
( ( breln1 @ X0
@ ( dpsetconstr @ X0 @ X0
@ ^ [Y0: $i,Y1: $i] : ( X1 @ Y0 @ Y1 ) ) )
!= $true ) ),
inference(ennf_transformation,[],[f7]) ).
thf(f13,plain,
( ( setOfPairsIsBReln = $true )
& ( ( breln1 @ sK0
@ ( dpsetconstr @ sK0 @ sK0
@ ^ [Y0: $i,Y1: $i] : ( sK1 @ Y0 @ Y1 ) ) )
!= $true ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f12]) ).
thf(f14,plain,
( breln
= ( ^ [Y0: $i,Y1: $i,Y2: $i] : ( subset @ Y2 @ ( cartprod @ Y0 @ Y1 ) ) ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f15,plain,
( setOfPairsIsBReln
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ ( $i > $i > $o )
@ ^ [Y2: $i > $i > $o] :
( breln @ Y0 @ Y1
@ ( dpsetconstr @ Y0 @ Y1
@ ^ [Y3: $i,Y4: $i] : ( Y2 @ Y3 @ Y4 ) ) ) ) ) ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f16,plain,
( breln1
= ( ^ [Y0: $i,Y1: $i] : ( breln @ Y0 @ Y0 @ Y1 ) ) ),
inference(cnf_transformation,[],[f10]) ).
thf(f17,plain,
( ( breln1 @ sK0
@ ( dpsetconstr @ sK0 @ sK0
@ ^ [Y0: $i,Y1: $i] : ( sK1 @ Y0 @ Y1 ) ) )
!= $true ),
inference(cnf_transformation,[],[f13]) ).
thf(f18,plain,
setOfPairsIsBReln = $true,
inference(cnf_transformation,[],[f13]) ).
thf(f21,plain,
( breln1
= ( ^ [Y0: $i,Y1: $i] :
( ^ [Y2: $i,Y3: $i,Y4: $i] : ( subset @ Y4 @ ( cartprod @ Y2 @ Y3 ) )
@ Y0
@ Y0
@ Y1 ) ) ),
inference(definition_unfolding,[],[f16,f14]) ).
thf(f22,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ ( $i > $i > $o )
@ ^ [Y2: $i > $i > $o] :
( ^ [Y3: $i,Y4: $i,Y5: $i] : ( subset @ Y5 @ ( cartprod @ Y3 @ Y4 ) )
@ Y0
@ Y1
@ ( dpsetconstr @ Y0 @ Y1
@ ^ [Y3: $i,Y4: $i] : ( Y2 @ Y3 @ Y4 ) ) ) ) ) )
= $true ),
inference(definition_unfolding,[],[f15,f18,f14]) ).
thf(f23,plain,
( ( ^ [Y0: $i,Y1: $i] :
( ^ [Y2: $i,Y3: $i,Y4: $i] : ( subset @ Y4 @ ( cartprod @ Y2 @ Y3 ) )
@ Y0
@ Y0
@ Y1 )
@ sK0
@ ( dpsetconstr @ sK0 @ sK0
@ ^ [Y0: $i,Y1: $i] : ( sK1 @ Y0 @ Y1 ) ) )
!= $true ),
inference(definition_unfolding,[],[f17,f21]) ).
thf(f24,definition,
( sF2
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ ( $i > $i > $o )
@ ^ [Y2: $i > $i > $o] :
( ^ [Y3: $i,Y4: $i,Y5: $i] : ( subset @ Y5 @ ( cartprod @ Y3 @ Y4 ) )
@ Y0
@ Y1
@ ( dpsetconstr @ Y0 @ Y1
@ ^ [Y3: $i,Y4: $i] : ( Y2 @ Y3 @ Y4 ) ) ) ) ) ) ),
introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).
thf(f25,plain,
sF2 = $true,
inference(definition_folding,[],[f22,f24]) ).
thf(f26,definition,
( sF3
= ( dpsetconstr @ sK0 @ sK0
@ ^ [Y0: $i,Y1: $i] : ( sK1 @ Y0 @ Y1 ) ) ),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
thf(f27,plain,
( ( dpsetconstr @ sK0 @ sK0
@ ^ [Y0: $i,Y1: $i] : ( sK1 @ Y0 @ Y1 ) )
= sF3 ),
inference(reorient_equations,[],[f26]) ).
thf(f28,definition,
( sF4
= ( ^ [Y0: $i,Y1: $i] :
( ^ [Y2: $i,Y3: $i,Y4: $i] : ( subset @ Y4 @ ( cartprod @ Y2 @ Y3 ) )
@ Y0
@ Y0
@ Y1 )
@ sK0
@ sF3 ) ),
introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).
thf(f29,plain,
( ( ^ [Y0: $i,Y1: $i] :
( ^ [Y2: $i,Y3: $i,Y4: $i] : ( subset @ Y4 @ ( cartprod @ Y2 @ Y3 ) )
@ Y0
@ Y0
@ Y1 )
@ sK0
@ sF3 )
= sF4 ),
inference(reorient_equations,[],[f28]) ).
thf(f30,plain,
$true != sF4,
inference(definition_folding,[],[f23,f29,f27]) ).
thf(f32,plain,
( ( sF2 = $false )
| ( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ ( $i > $i > $o )
@ ^ [Y2: $i > $i > $o] :
( ^ [Y3: $i,Y4: $i,Y5: $i] : ( subset @ Y5 @ ( cartprod @ Y3 @ Y4 ) )
@ Y0
@ Y1
@ ( dpsetconstr @ Y0 @ Y1
@ ^ [Y3: $i,Y4: $i] : ( Y2 @ Y3 @ Y4 ) ) ) ) ) )
= $true ) ),
inference(iff_proxy_clausification,[],[f24]) ).
thf(f33,plain,
! [X1: $i] :
( ( sF2 = $false )
| ( ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ ( $i > $i > $o )
@ ^ [Y2: $i > $i > $o] :
( ^ [Y3: $i,Y4: $i,Y5: $i] : ( subset @ Y5 @ ( cartprod @ Y3 @ Y4 ) )
@ Y0
@ Y1
@ ( dpsetconstr @ Y0 @ Y1
@ ^ [Y3: $i,Y4: $i] : ( Y2 @ Y3 @ Y4 ) ) ) ) )
@ X1 )
= $true ) ),
inference(pi_proxy_clausification,[],[f32]) ).
thf(f34,plain,
! [X1: $i] :
( ( sF2 = $false )
| ( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ ( $i > $i > $o )
@ ^ [Y1: $i > $i > $o] : ( subset @ ( dpsetconstr @ X1 @ Y0 @ Y1 ) @ ( cartprod @ X1 @ Y0 ) ) ) )
= $true ) ),
inference(beta-eta_normalization,[],[f33]) ).
thf(f35,plain,
! [X2: $i,X1: $i] :
( ( ( ^ [Y0: $i] :
( !! @ ( $i > $i > $o )
@ ^ [Y1: $i > $i > $o] : ( subset @ ( dpsetconstr @ X1 @ Y0 @ Y1 ) @ ( cartprod @ X1 @ Y0 ) ) )
@ X2 )
= $true )
| ( sF2 = $false ) ),
inference(pi_proxy_clausification,[],[f34]) ).
thf(f36,plain,
! [X2: $i,X1: $i] :
( ( ( !! @ ( $i > $i > $o )
@ ^ [Y0: $i > $i > $o] : ( subset @ ( dpsetconstr @ X1 @ X2 @ Y0 ) @ ( cartprod @ X1 @ X2 ) ) )
= $true )
| ( sF2 = $false ) ),
inference(beta-eta_normalization,[],[f35]) ).
thf(f37,plain,
! [X2: $i,X3: $i > $i > $o,X1: $i] :
( ( sF2 = $false )
| ( ( ^ [Y0: $i > $i > $o] : ( subset @ ( dpsetconstr @ X1 @ X2 @ Y0 ) @ ( cartprod @ X1 @ X2 ) )
@ X3 )
= $true ) ),
inference(pi_proxy_clausification,[],[f36]) ).
thf(f38,plain,
! [X2: $i,X3: $i > $i > $o,X1: $i] :
( ( ( subset @ ( dpsetconstr @ X1 @ X2 @ X3 ) @ ( cartprod @ X1 @ X2 ) )
= $true )
| ( sF2 = $false ) ),
inference(beta-eta_normalization,[],[f37]) ).
thf(f46,plain,
( ( $false
= ( ^ [Y0: $i,Y1: $i] :
( ^ [Y2: $i,Y3: $i,Y4: $i] : ( subset @ Y4 @ ( cartprod @ Y2 @ Y3 ) )
@ Y0
@ Y0
@ Y1 )
@ sK0
@ sF3 ) )
| ( $true = sF4 ) ),
inference(iff_proxy_clausification,[],[f29]) ).
thf(f47,plain,
( ( $false
= ( subset @ sF3 @ ( cartprod @ sK0 @ sK0 ) ) )
| ( $true = sF4 ) ),
inference(beta-eta_normalization,[],[f46]) ).
thf(f49,plain,
( sF3
= ( dpsetconstr @ sK0 @ sK0 @ sK1 ) ),
inference(beta-eta_normalization,[],[f27]) ).
thf(f51,definition,
( spl8_1
<=> ( sF2 = $false ) ),
introduced(definition,[new_symbols(definition,[spl8_1])],[avatar_definition]) ).
thf(f53,plain,
( ( sF2 = $false )
| ~ spl8_1 ),
inference(avatar_component_clause,[],[f51]) ).
thf(f55,definition,
( spl8_2
<=> ! [X2: $i,X1: $i,X3: $i > $i > $o] :
( ( subset @ ( dpsetconstr @ X1 @ X2 @ X3 ) @ ( cartprod @ X1 @ X2 ) )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl8_2])],[avatar_definition]) ).
thf(f56,plain,
( ! [X2: $i,X3: $i > $i > $o,X1: $i] :
( ( subset @ ( dpsetconstr @ X1 @ X2 @ X3 ) @ ( cartprod @ X1 @ X2 ) )
= $true )
| ~ spl8_2 ),
inference(avatar_component_clause,[],[f55]) ).
thf(f57,plain,
( spl8_1
| spl8_2 ),
inference(avatar_split_clause,[],[f38,f55,f51]) ).
thf(f59,definition,
( spl8_3
<=> ( sF2 = $true ) ),
introduced(definition,[new_symbols(definition,[spl8_3])],[avatar_definition]) ).
thf(f61,plain,
( ( sF2 = $true )
| ~ spl8_3 ),
inference(avatar_component_clause,[],[f59]) ).
thf(f68,definition,
( spl8_5
<=> ( $false
= ( subset @ sF3 @ ( cartprod @ sK0 @ sK0 ) ) ) ),
introduced(definition,[new_symbols(definition,[spl8_5])],[avatar_definition]) ).
thf(f70,plain,
( ( $false
= ( subset @ sF3 @ ( cartprod @ sK0 @ sK0 ) ) )
| ~ spl8_5 ),
inference(avatar_component_clause,[],[f68]) ).
thf(f72,definition,
( spl8_6
<=> ( $true = sF4 ) ),
introduced(definition,[new_symbols(definition,[spl8_6])],[avatar_definition]) ).
thf(f75,plain,
( spl8_5
| spl8_6 ),
inference(avatar_split_clause,[],[f47,f72,f68]) ).
thf(f85,plain,
~ spl8_6,
inference(avatar_split_clause,[],[f30,f72]) ).
thf(f86,plain,
spl8_3,
inference(avatar_split_clause,[],[f25,f59]) ).
thf(f102,plain,
( ( ( subset @ sF3 @ ( cartprod @ sK0 @ sK0 ) )
= $true )
| ~ spl8_2 ),
inference(constrained_superposition,[],[f56,f49]) ).
thf(f103,plain,
( ( $false = $true )
| ~ spl8_2
| ~ spl8_5 ),
inference(forward_demodulation,[],[f102,f70]) ).
thf(f104,plain,
( $false
| ~ spl8_2
| ~ spl8_5 ),
inference(trivial_inequality_removal,[],[f103]) ).
thf(f105,plain,
( ~ spl8_2
| ~ spl8_5 ),
inference(avatar_contradiction_clause,[],[f104]) ).
thf(f106,plain,
( ( $false = $true )
| ~ spl8_1
| ~ spl8_3 ),
inference(forward_demodulation,[],[f53,f61]) ).
thf(f107,plain,
( $false
| ~ spl8_1
| ~ spl8_3 ),
inference(trivial_inequality_removal,[],[f106]) ).
thf(f108,plain,
( ~ spl8_1
| ~ spl8_3 ),
inference(avatar_contradiction_clause,[],[f107]) ).
cnf(s1,plain,
( spl8_1
| spl8_2 ),
inference(sat_conversion,[],[f57]) ).
cnf(s3,plain,
( spl8_5
| spl8_6 ),
inference(sat_conversion,[],[f75]) ).
cnf(s5,plain,
~ spl8_6,
inference(sat_conversion,[],[f85]) ).
cnf(s6,plain,
spl8_3,
inference(sat_conversion,[],[f86]) ).
cnf(s8,plain,
( ~ spl8_2
| ~ spl8_5 ),
inference(sat_conversion,[],[f105]) ).
cnf(s9,plain,
( ~ spl8_1
| ~ spl8_3 ),
inference(sat_conversion,[],[f108]) ).
cnf(s10,plain,
~ spl8_1,
inference(rat,[],[s9,s6]) ).
cnf(s12,plain,
spl8_5,
inference(rat,[],[s3,s5]) ).
cnf(s13,plain,
~ spl8_2,
inference(rat,[],[s8,s12]) ).
cnf(s14,plain,
$false,
inference(rat,[],[s1,s13,s10]) ).
thf(f109,plain,
$false,
inference(avatar_sat_refutation,[],[s14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SEU771^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.09 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.29 % Computer : n002.cluster.edu
% 0.11/0.29 % Model : x86_64 x86_64
% 0.11/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.29 % Memory : 8046.5625MB
% 0.11/0.29 % OS : Linux 6.8.0-71-generic
% 0.11/0.29 % CPULimit : 300
% 0.11/0.29 % WCLimit : 300
% 0.11/0.29 % DateTime : Tue Sep 29 14:26:52 UTC 2026
% 0.11/0.30 % CPUTime :
% 0.11/0.30 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.30/0.35 Running higher-order theorem proving
% 0.30/0.37 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.36/0.42 % (1367741)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.36/0.42 % (1367752)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.36/0.42 % (1367752)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.36/0.42 % (1367752)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=3576653132:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.36/0.42 % (1367752) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1367741-1367752"...
% 0.36/0.42 % (1367752)...printing done.
% 0.36/0.42 % (1367752)Refutation found. Thanks to Tanya!
% 0.36/0.42 % SZS status Theorem for theBenchmark
% 0.36/0.42 % SZS output start Proof for theBenchmark
% See solution above
% 0.36/0.42 % (1367752)------------------------------
% 0.36/0.42 % (1367752)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.36/0.42 % (1367752)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.36/0.42 % (1367752)CaDiCaL version: 2.1.3
% 0.36/0.42 % (1367752)Termination reason: Refutation
% 0.36/0.42 % (1367752)Time elapsed: 0.005 s
% 0.36/0.42 % (1367752)Peak memory usage: 13 MB
% 0.36/0.42 % (1367752)Instructions burned: 6 (million)
% 0.36/0.42 % (1367741)Success in time 0.039 s
% 0.36/0.42 % Vampire exiting
%------------------------------------------------------------------------------