%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM925^2 : TPTP v9.3.1. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 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:19:38 AM UTC 2026
% Result : Theorem 1.69s 0.63s
% Output : Refutation 1.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 35 ( 30 unt; 0 typ; 0 def)
% Number of atoms : 56 ( 35 equ; 0 cnn)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 141 ( 15 ~; 4 |; 0 &; 121 @)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 65 ( 62 usr; 13 con; 0-4 aty)
% Number of variables : 27 ( 0 ^; 27 !; 0 ?; 27 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
int: $tType ).
thf(type_def_6,type,
nat: $tType ).
thf(type_def_7,type,
real: $tType ).
thf(type_def_8,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
one_one_int: int ).
thf(func_def_1,type,
one_one_nat: nat ).
thf(func_def_2,type,
one_one_real: real ).
thf(func_def_3,type,
plus_plus_int: int > int > int ).
thf(func_def_4,type,
plus_plus_nat: nat > nat > nat ).
thf(func_def_5,type,
plus_plus_real: real > real > real ).
thf(func_def_6,type,
times_times_int: int > int > int ).
thf(func_def_7,type,
zero_zero_int: int ).
thf(func_def_8,type,
zero_zero_nat: nat ).
thf(func_def_9,type,
zero_zero_real: real ).
thf(func_def_10,type,
if_nat: $o > nat > nat > nat ).
thf(func_def_11,type,
bit0: int > int ).
thf(func_def_12,type,
bit1: int > int ).
thf(func_def_13,type,
pls: int ).
thf(func_def_14,type,
number_number_of_int: int > int ).
thf(func_def_15,type,
number_number_of_nat: int > nat ).
thf(func_def_16,type,
number267125858f_real: int > real ).
thf(func_def_17,type,
succ: int > int ).
thf(func_def_18,type,
semiri1621563631at_int: nat > int ).
thf(func_def_19,type,
semiri984289939at_nat: nat > nat ).
thf(func_def_20,type,
semiri132038758t_real: nat > real ).
thf(func_def_21,type,
sqrt: real > real ).
thf(func_def_22,type,
ord_less_int: int > int > $o ).
thf(func_def_23,type,
ord_less_nat: nat > nat > $o ).
thf(func_def_24,type,
ord_less_real: real > real > $o ).
thf(func_def_25,type,
ord_less_eq_int: int > int > $o ).
thf(func_def_26,type,
ord_less_eq_nat: nat > nat > $o ).
thf(func_def_27,type,
ord_less_eq_real: real > real > $o ).
thf(func_def_28,type,
power_power_int: int > nat > int ).
thf(func_def_29,type,
power_power_nat: nat > nat > nat ).
thf(func_def_30,type,
power_power_real: real > nat > real ).
thf(func_def_31,type,
m1: int ).
thf(func_def_32,type,
n: nat ).
thf(func_def_33,type,
t: int ).
thf(func_def_34,type,
tn: nat ).
thf(func_def_38,type,
sK0: int > ( int > $o ) > int ).
thf(func_def_39,type,
sK1: int > nat ).
thf(func_def_40,type,
sK2: nat > nat > nat ).
thf(func_def_41,type,
sK3: nat > real > real ).
thf(func_def_42,type,
sK4: nat > real > real ).
thf(func_def_43,type,
sK5: ( int > $o ) > int ).
thf(func_def_44,type,
sK6: ( int > $o ) > nat ).
thf(func_def_45,type,
sK7: ( int > $o ) > nat ).
thf(func_def_46,type,
sK8: ( int > $o ) > int ).
thf(func_def_47,type,
sK9: int > int > nat ).
thf(func_def_48,type,
sK10: int > nat ).
thf(func_def_49,type,
sK11: int > nat ).
thf(func_def_50,type,
sK12: nat > nat > nat ).
thf(func_def_51,type,
sK13: ( nat > $o ) > nat > nat ).
thf(func_def_52,type,
sK14: int > nat ).
thf(func_def_53,type,
sK15: ( nat > nat ) > nat ).
thf(func_def_54,type,
sK16: ( nat > nat ) > nat ).
thf(func_def_55,type,
sK17: int > ( int > $o ) > int ).
thf(func_def_56,type,
sK18: ( nat > $o ) > nat > nat ).
thf(func_def_57,type,
sK19: ( nat > nat ) > nat ).
thf(func_def_58,type,
sK20: ( nat > nat ) > nat ).
thf(func_def_59,type,
sK21: real > real > real ).
thf(func_def_60,type,
vNOT: $o > $o ).
thf(func_def_62,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_63,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_64,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(f84,axiom,
! [X0: nat] :
~ ( ord_less_int @ ( semiri1621563631at_int @ X0 ) @ zero_zero_int ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_83_int__less__0__conv) ).
thf(f99,axiom,
pls = zero_zero_int,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_98_Pls__def) ).
thf(f177,axiom,
! [X0: int] :
( ( number_number_of_int @ X0 )
= X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_176_number__of__is__id) ).
thf(f232,axiom,
! [X0: nat,X1: int] :
( ( X1 != zero_zero_int )
=> ( ( power_power_int @ X1 @ X0 )
!= zero_zero_int ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_231_field__power__not__zero) ).
thf(f271,axiom,
! [X0: int] : ( ord_less_int @ X0 @ ( plus_plus_int @ X0 @ one_one_int ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_270_less__add__one) ).
thf(f574,axiom,
! [X0: int] :
( ( succ @ X0 )
= ( plus_plus_int @ X0 @ one_one_int ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_573_succ__def) ).
thf(f584,axiom,
! [X0: int] :
( ( number_number_of_int @ ( succ @ X0 ) )
= ( plus_plus_int @ one_one_int @ ( number_number_of_int @ X0 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_583_number__of__succ) ).
thf(f703,conjecture,
( ( power_power_int @ ( plus_plus_int @ one_one_int @ ( semiri1621563631at_int @ n ) ) @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) )
!= zero_zero_int ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
thf(f704,negated_conjecture,
~ ( ( ( power_power_int @ ( plus_plus_int @ one_one_int @ ( semiri1621563631at_int @ n ) ) @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) )
!= zero_zero_int ) ),
inference(negated_conjecture,[status(cth)],[f703]) ).
thf(f765,plain,
! [X0: nat] :
~ ( ord_less_int @ ( semiri1621563631at_int @ X0 ) @ zero_zero_int ),
inference(rectify,[],[f84]) ).
thf(f766,plain,
! [X0: nat] :
( ( ord_less_int @ ( semiri1621563631at_int @ X0 ) @ zero_zero_int )
!= $true ),
inference(fool_elimination,[],[f765]) ).
thf(f943,plain,
! [X0: int] : ( ord_less_int @ X0 @ ( plus_plus_int @ X0 @ one_one_int ) ),
inference(rectify,[],[f271]) ).
thf(f944,plain,
! [X0: int] :
( ( ord_less_int @ X0 @ ( plus_plus_int @ X0 @ one_one_int ) )
= $true ),
inference(fool_elimination,[],[f943]) ).
thf(f1625,plain,
! [X0: nat] :
( ( ord_less_int @ ( semiri1621563631at_int @ X0 ) @ zero_zero_int )
!= $true ),
inference(flattening,[],[f766]) ).
thf(f1664,plain,
( zero_zero_int
= ( power_power_int @ ( plus_plus_int @ one_one_int @ ( semiri1621563631at_int @ n ) ) @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) ),
inference(flattening,[],[f704]) ).
thf(f1713,plain,
! [X0: nat,X1: int] :
( ( ( power_power_int @ X1 @ X0 )
!= zero_zero_int )
| ( zero_zero_int = X1 ) ),
inference(ennf_transformation,[],[f232]) ).
thf(f2338,plain,
! [X0: nat] :
( ( ord_less_int @ ( semiri1621563631at_int @ X0 ) @ zero_zero_int )
!= $true ),
inference(cnf_transformation,[],[f1625]) ).
thf(f2357,plain,
zero_zero_int = pls,
inference(cnf_transformation,[],[f99]) ).
thf(f2454,plain,
! [X0: int] :
( ( number_number_of_int @ X0 )
= X0 ),
inference(cnf_transformation,[],[f177]) ).
thf(f2539,plain,
! [X0: nat,X1: int] :
( ( zero_zero_int
!= ( power_power_int @ X1 @ X0 ) )
| ( zero_zero_int = X1 ) ),
inference(cnf_transformation,[],[f1713]) ).
thf(f2578,plain,
! [X0: int] :
( ( ord_less_int @ X0 @ ( plus_plus_int @ X0 @ one_one_int ) )
= $true ),
inference(cnf_transformation,[],[f944]) ).
thf(f2937,plain,
! [X0: int] :
( ( plus_plus_int @ X0 @ one_one_int )
= ( succ @ X0 ) ),
inference(cnf_transformation,[],[f574]) ).
thf(f2947,plain,
! [X0: int] :
( ( plus_plus_int @ one_one_int @ ( number_number_of_int @ X0 ) )
= ( number_number_of_int @ ( succ @ X0 ) ) ),
inference(cnf_transformation,[],[f584]) ).
thf(f3114,plain,
( zero_zero_int
= ( power_power_int @ ( plus_plus_int @ one_one_int @ ( semiri1621563631at_int @ n ) ) @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) ),
inference(cnf_transformation,[],[f1664]) ).
thf(f3137,plain,
! [X0: nat] :
( $true
!= ( ord_less_int @ ( semiri1621563631at_int @ X0 ) @ pls ) ),
inference(definition_unfolding,[],[f2338,f2357]) ).
thf(f3167,plain,
! [X0: nat,X1: int] :
( ( pls
!= ( power_power_int @ X1 @ X0 ) )
| ( pls = X1 ) ),
inference(definition_unfolding,[],[f2539,f2357,f2357]) ).
thf(f3274,plain,
( pls
= ( power_power_int @ ( plus_plus_int @ one_one_int @ ( semiri1621563631at_int @ n ) ) @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) ),
inference(definition_unfolding,[],[f3114,f2357]) ).
thf(f3786,plain,
( ( pls != pls )
| ( ( plus_plus_int @ one_one_int @ ( semiri1621563631at_int @ n ) )
= pls ) ),
inference(constrained_superposition,[],[f3167,f3274]) ).
thf(f3789,plain,
( ( plus_plus_int @ one_one_int @ ( semiri1621563631at_int @ n ) )
= pls ),
inference(trivial_inequality_removal,[],[f3786]) ).
thf(f3905,plain,
! [X0: int] :
( $true
= ( ord_less_int @ X0 @ ( succ @ X0 ) ) ),
inference(forward_demodulation,[],[f2578,f2937]) ).
thf(f4311,plain,
! [X0: int] :
( ( plus_plus_int @ one_one_int @ ( number_number_of_int @ X0 ) )
= ( succ @ X0 ) ),
inference(forward_demodulation,[],[f2947,f2454]) ).
thf(f4312,plain,
! [X0: int] :
( ( plus_plus_int @ one_one_int @ X0 )
= ( succ @ X0 ) ),
inference(forward_demodulation,[],[f4311,f2454]) ).
thf(f4318,plain,
( pls
= ( succ @ ( semiri1621563631at_int @ n ) ) ),
inference(constrained_superposition,[],[f4312,f3789]) ).
thf(f4330,plain,
( $true
= ( ord_less_int @ ( semiri1621563631at_int @ n ) @ pls ) ),
inference(constrained_superposition,[],[f3905,f4318]) ).
thf(f4332,plain,
$false,
inference(forward_subsumption_resolution,[],[f4330,f3137]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM925^2 : TPTP v9.3.1. Released v5.3.0.
% 0.00/0.08 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.24/0.27 % Computer : n004.cluster.edu
% 0.24/0.27 % Model : x86_64 x86_64
% 0.24/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.24/0.27 % Memory : 8046.5625MB
% 0.24/0.27 % OS : Linux 6.8.0-71-generic
% 0.24/0.27 % CPULimit : 300
% 0.24/0.27 % WCLimit : 300
% 0.24/0.27 % DateTime : Tue Sep 29 13:04:52 UTC 2026
% 0.24/0.28 % CPUTime :
% 0.24/0.28 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.24/0.32 Running first-order model finding
% 0.24/0.32 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
% 1.69/0.62 % (1248428)Will run a generic schedule for satisfiability detection.
% 1.69/0.62 % (1248437)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3224335729:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.69/0.62 % (1248439)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3693046849:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.69/0.62 % (1248434)% WARNING: option uhcvi not known.
% 1.69/0.62 % (1248433)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3122465383_2999 on theBenchmark for (2999ds/0Mi)
% 1.69/0.62 % (1248434)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1435144756:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.69/0.62 % (1248436)dis+10_1_sil=32000:sp=arity:random_seed=491045531:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.69/0.62 % (1248435)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=185401053:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.69/0.62 % (1248438)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1167507923:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 1.69/0.62 % (1248437)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 1.69/0.62 % (1248437)Instruction limit reached!
% 1.69/0.62 % (1248437)------------------------------
% 1.69/0.62 % (1248437)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.69/0.62 % (1248437)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.69/0.62 % (1248437)CaDiCaL version: 2.1.3
% 1.69/0.62 % (1248437)Termination reason: Instruction limit
% 1.69/0.62 % (1248437)Termination phase: Property scanning
% 1.69/0.62 % (1248437)Time elapsed: 0.048 s
% 1.69/0.62 % (1248437)Peak memory usage: 11 MB
% 1.69/0.62 % (1248437)Instructions burned: 118 (million)
% 1.69/0.62 % (1248434)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 1.69/0.62 % (1248447)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3188526172:i=714:nm=2_2998 on theBenchmark for (2998ds/714Mi)
% 1.69/0.62 % Exception at run slice level
% 1.69/0.62 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 1.69/0.62 % (1248436)Instruction limit reached!
% 1.69/0.62 % (1248436)------------------------------
% 1.69/0.62 % (1248436)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.69/0.62 % (1248436)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.69/0.62 % (1248436)CaDiCaL version: 2.1.3
% 1.69/0.62 % (1248436)Termination reason: Instruction limit
% 1.69/0.62 % (1248436)Termination phase: Property scanning
% 1.69/0.62 % (1248436)Time elapsed: 0.081 s
% 1.69/0.62 % (1248436)Peak memory usage: 11 MB
% 1.69/0.62 % (1248436)Instructions burned: 103 (million)
% 1.69/0.62 % (1248449)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3450835761:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 1.69/0.62 % (1248434)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 1.69/0.62 % (1248438)Instruction limit reached!
% 1.69/0.62 % (1248438)------------------------------
% 1.69/0.62 % (1248438)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.69/0.62 % (1248438)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.69/0.62 % (1248438)CaDiCaL version: 2.1.3
% 1.69/0.62 % (1248438)Termination reason: Instruction limit
% 1.69/0.62 % (1248438)Termination phase: Saturation
% 1.69/0.62 % (1248438)Time elapsed: 0.104 s
% 1.69/0.62 % (1248438)Peak memory usage: 13 MB
% 1.69/0.62 % (1248438)Instructions burned: 132 (million)
% 1.69/0.62 % (1248439)Instruction limit reached!
% 1.69/0.62 % (1248439)------------------------------
% 1.69/0.62 % (1248439)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.69/0.62 % (1248439)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.69/0.62 % (1248439)CaDiCaL version: 2.1.3
% 1.69/0.62 % (1248439)Termination reason: Instruction limit
% 1.69/0.62 % (1248439)Termination phase: Saturation
% 1.69/0.62 % (1248439)Time elapsed: 0.115 s
% 1.69/0.62 % (1248439)Peak memory usage: 13 MB
% 1.69/0.62 % (1248439)Instructions burned: 159 (million)
% 1.69/0.62 % Exception at run slice level
% 1.69/0.62 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 1.69/0.62 % (1248450)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=1423438145:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 1.69/0.63 % (1248452)ott-21_1_sil=16000:fs=off:random_seed=1619510875:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 1.69/0.63 % (1248453)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=2389895515:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 1.69/0.63 % (1248454)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=898415126:fmbsr=1.3:i=865:ins=25_2998 on theBenchmark for (2998ds/865Mi)
% 1.69/0.63 % (1248449)Instruction limit reached!
% 1.69/0.63 % (1248449)------------------------------
% 1.69/0.63 % (1248449)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.69/0.63 % (1248449)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.69/0.63 % (1248449)CaDiCaL version: 2.1.3
% 1.69/0.63 % (1248449)Termination reason: Instruction limit
% 1.69/0.63 % (1248449)Termination phase: Saturation
% 1.69/0.63 % (1248449)Time elapsed: 0.060 s
% 1.69/0.63 % (1248449)Peak memory usage: 13 MB
% 1.69/0.63 % (1248449)Instructions burned: 131 (million)
% 1.69/0.63 % (1248450)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 1.69/0.63 % (1248459)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=468982806:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 1.69/0.63 % (1248434) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1248428-1248434"...
% 1.69/0.63 % (1248434)...printing done.
% 1.69/0.63 % (1248434)Refutation found. Thanks to Tanya!
% 1.69/0.63 % SZS status Theorem for theBenchmark
% 1.69/0.63 % SZS output start Proof for theBenchmark
% See solution above
% 1.69/0.63 % (1248434)------------------------------
% 1.69/0.63 % (1248434)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.69/0.63 % (1248434)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.69/0.63 % (1248434)CaDiCaL version: 2.1.3
% 1.69/0.63 % (1248434)Termination reason: Refutation
% 1.69/0.63 % (1248434)Time elapsed: 0.207 s
% 1.69/0.63 % (1248434)Peak memory usage: 15 MB
% 1.69/0.63 % (1248434)Instructions burned: 246 (million)
% 1.69/0.63 % (1248428)Success in time 0.294 s
% 1.69/0.63 % Vampire exiting
%------------------------------------------------------------------------------