%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM924+1 : 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 : n010.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 : Tue Sep 29 12:26:05 PM UTC 2026
% Result : Theorem 0.35s 0.50s
% Output : Refutation 0.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 15
% Syntax : Number of formulae : 79 ( 45 unt; 2 def)
% Number of atoms : 123 ( 29 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 86 ( 42 ~; 34 |; 3 &)
% ( 5 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-2 aty)
% Number of variables : 36 ( 0 sgn 36 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
ord_less_int(times_times_int(plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),t),times_times_int(plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),zero_zero_int)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_2__096_I4_A_K_Am_A_L_A1_J_A_K_At_A_060_A_I4_A_K_Am_A_L_A1_J_A_K_A0_096) ).
fof(f4,axiom,
plus_plus_int(power_power_int(s,number_number_of_nat(bit0(bit1(pls)))),one_one_int) = times_times_int(plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),t),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_3_t) ).
fof(f24,axiom,
! [X0] : ord_less_eq_int(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_23_zle__refl) ).
fof(f25,axiom,
! [X0] : number_number_of_int(X0) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_24_number__of__is__id) ).
fof(f26,axiom,
! [X0,X1] : times_times_int(X0,X1) = times_times_int(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_25_zmult__commute) ).
fof(f33,axiom,
! [X0,X1] :
( ord_less_eq_int(X0,X1)
=> ( ord_less_eq_int(X1,X0)
=> X0 = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_32_zle__antisym) ).
fof(f64,axiom,
! [X0] :
( ord_less_eq_int(number_number_of_int(X0),one_one_int)
<=> ord_less_eq_int(X0,bit1(pls)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_63_le__special_I4_J) ).
fof(f67,axiom,
! [X0] : times_times_int(pls,X0) = pls,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_66_mult__Pls) ).
fof(f76,axiom,
! [X0] :
( ord_less_int(pls,bit1(X0))
<=> ord_less_eq_int(pls,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_75_rel__simps_I5_J) ).
fof(f82,axiom,
! [X0] :
( ord_less_eq_int(one_one_int,X0)
<=> ord_less_int(zero_zero_int,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_81_int__one__le__iff__zero__less) ).
fof(f105,axiom,
! [X0,X1] : plus_plus_int(X0,X1) = plus_plus_int(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_104_zadd__commute) ).
fof(f106,axiom,
zero_zero_int = number_number_of_int(pls),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_105_zero__is__num__zero) ).
fof(f107,conjecture,
ord_less_int(plus_plus_int(power_power_int(s,number_number_of_nat(bit0(bit1(pls)))),one_one_int),zero_zero_int),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
fof(f108,negated_conjecture,
~ ord_less_int(plus_plus_int(power_power_int(s,number_number_of_nat(bit0(bit1(pls)))),one_one_int),zero_zero_int),
inference(negated_conjecture,[status(cth)],[f107]) ).
fof(f109,plain,
~ ord_less_int(plus_plus_int(power_power_int(s,number_number_of_nat(bit0(bit1(pls)))),one_one_int),zero_zero_int),
inference(flattening,[],[f108]) ).
fof(f116,plain,
! [X0,X1] :
( X0 = X1
| ~ ord_less_eq_int(X1,X0)
| ~ ord_less_eq_int(X0,X1) ),
inference(ennf_transformation,[],[f33]) ).
fof(f117,plain,
! [X0,X1] :
( X0 = X1
| ~ ord_less_eq_int(X1,X0)
| ~ ord_less_eq_int(X0,X1) ),
inference(flattening,[],[f116]) ).
fof(f162,plain,
! [X0] :
( ( ord_less_eq_int(number_number_of_int(X0),one_one_int)
| ~ ord_less_eq_int(X0,bit1(pls)) )
& ( ord_less_eq_int(X0,bit1(pls))
| ~ ord_less_eq_int(number_number_of_int(X0),one_one_int) ) ),
inference(nnf_transformation,[],[f64]) ).
fof(f166,plain,
! [X0] :
( ( ord_less_int(pls,bit1(X0))
| ~ ord_less_eq_int(pls,X0) )
& ( ord_less_eq_int(pls,X0)
| ~ ord_less_int(pls,bit1(X0)) ) ),
inference(nnf_transformation,[],[f76]) ).
fof(f173,plain,
! [X0] :
( ( ord_less_eq_int(one_one_int,X0)
| ~ ord_less_int(zero_zero_int,X0) )
& ( ord_less_int(zero_zero_int,X0)
| ~ ord_less_eq_int(one_one_int,X0) ) ),
inference(nnf_transformation,[],[f82]) ).
fof(f185,plain,
ord_less_int(times_times_int(plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),t),times_times_int(plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),zero_zero_int)),
inference(cnf_transformation,[],[f3]) ).
fof(f186,plain,
times_times_int(plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),t) = plus_plus_int(power_power_int(s,number_number_of_nat(bit0(bit1(pls)))),one_one_int),
inference(cnf_transformation,[],[f4]) ).
fof(f210,plain,
! [X0] : ord_less_eq_int(X0,X0),
inference(cnf_transformation,[],[f24]) ).
fof(f211,plain,
! [X0] : number_number_of_int(X0) = X0,
inference(cnf_transformation,[],[f25]) ).
fof(f212,plain,
! [X0,X1] : times_times_int(X0,X1) = times_times_int(X1,X0),
inference(cnf_transformation,[],[f26]) ).
fof(f221,plain,
! [X0,X1] :
( ~ ord_less_eq_int(X1,X0)
| X0 = X1
| ~ ord_less_eq_int(X0,X1) ),
inference(cnf_transformation,[],[f117]) ).
fof(f273,plain,
! [X0] :
( ord_less_eq_int(number_number_of_int(X0),one_one_int)
| ~ ord_less_eq_int(X0,bit1(pls)) ),
inference(cnf_transformation,[],[f162]) ).
fof(f277,plain,
! [X0] : pls = times_times_int(pls,X0),
inference(cnf_transformation,[],[f67]) ).
fof(f289,plain,
! [X0] :
( ord_less_int(pls,bit1(X0))
| ~ ord_less_eq_int(pls,X0) ),
inference(cnf_transformation,[],[f166]) ).
fof(f303,plain,
! [X0] :
( ~ ord_less_int(zero_zero_int,X0)
| ord_less_eq_int(one_one_int,X0) ),
inference(cnf_transformation,[],[f173]) ).
fof(f337,plain,
! [X0,X1] : plus_plus_int(X0,X1) = plus_plus_int(X1,X0),
inference(cnf_transformation,[],[f105]) ).
fof(f338,plain,
zero_zero_int = number_number_of_int(pls),
inference(cnf_transformation,[],[f106]) ).
fof(f339,plain,
~ ord_less_int(plus_plus_int(power_power_int(s,number_number_of_nat(bit0(bit1(pls)))),one_one_int),zero_zero_int),
inference(cnf_transformation,[],[f109]) ).
fof(f367,plain,
zero_zero_int = pls,
inference(forward_demodulation,[],[f338,f211]) ).
fof(f370,plain,
! [X0] : zero_zero_int = times_times_int(zero_zero_int,X0),
inference(forward_demodulation,[],[f277,f367]) ).
fof(f433,plain,
! [X0] :
( ord_less_int(zero_zero_int,bit1(X0))
| ~ ord_less_eq_int(pls,X0) ),
inference(forward_demodulation,[],[f289,f367]) ).
fof(f434,plain,
! [X0] :
( ord_less_int(zero_zero_int,bit1(X0))
| ~ ord_less_eq_int(zero_zero_int,X0) ),
inference(forward_demodulation,[],[f433,f367]) ).
fof(f437,plain,
~ ord_less_int(plus_plus_int(one_one_int,power_power_int(s,number_number_of_nat(bit0(bit1(pls))))),zero_zero_int),
inference(superposition,[],[f339,f337]) ).
fof(f439,plain,
~ ord_less_int(plus_plus_int(one_one_int,power_power_int(s,number_number_of_nat(bit0(bit1(zero_zero_int))))),zero_zero_int),
inference(forward_demodulation,[],[f437,f367]) ).
fof(f464,definition,
( spl1_5
<=> ord_less_int(zero_zero_int,bit1(zero_zero_int)) ),
introduced(definition,[new_symbols(definition,[spl1_5])],[avatar_definition]) ).
fof(f465,plain,
( ~ ord_less_int(zero_zero_int,bit1(zero_zero_int))
| spl1_5 ),
inference(avatar_component_clause,[],[f464]) ).
fof(f466,plain,
( ord_less_int(zero_zero_int,bit1(zero_zero_int))
| ~ spl1_5 ),
inference(avatar_component_clause,[],[f464]) ).
fof(f497,plain,
( ~ ord_less_eq_int(zero_zero_int,zero_zero_int)
| spl1_5 ),
inference(resolution,[],[f434,f465]) ).
fof(f501,plain,
( $false
| spl1_5 ),
inference(forward_subsumption_resolution,[],[f497,f210]) ).
fof(f502,plain,
spl1_5,
inference(avatar_contradiction_clause,[],[f501]) ).
fof(f507,plain,
( ord_less_eq_int(one_one_int,bit1(zero_zero_int))
| ~ spl1_5 ),
inference(resolution,[],[f466,f303]) ).
fof(f558,plain,
! [X0] :
( ord_less_eq_int(X0,one_one_int)
| ~ ord_less_eq_int(X0,bit1(pls)) ),
inference(forward_demodulation,[],[f273,f211]) ).
fof(f559,plain,
! [X0] :
( ~ ord_less_eq_int(X0,bit1(zero_zero_int))
| ord_less_eq_int(X0,one_one_int) ),
inference(forward_demodulation,[],[f558,f367]) ).
fof(f561,plain,
ord_less_eq_int(bit1(zero_zero_int),one_one_int),
inference(resolution,[],[f559,f210]) ).
fof(f851,plain,
( one_one_int = bit1(zero_zero_int)
| ~ ord_less_eq_int(one_one_int,bit1(zero_zero_int)) ),
inference(resolution,[],[f221,f561]) ).
fof(f860,plain,
( one_one_int = bit1(zero_zero_int)
| ~ spl1_5 ),
inference(forward_subsumption_resolution,[],[f851,f507]) ).
fof(f928,definition,
( spl1_20
<=> one_one_int = bit1(zero_zero_int) ),
introduced(definition,[new_symbols(definition,[spl1_20])],[avatar_definition]) ).
fof(f930,plain,
( one_one_int = bit1(zero_zero_int)
| ~ spl1_20 ),
inference(avatar_component_clause,[],[f928]) ).
fof(f969,plain,
( spl1_20
| ~ spl1_5 ),
inference(avatar_split_clause,[],[f860,f464,f928]) ).
fof(f984,plain,
( ~ ord_less_int(plus_plus_int(one_one_int,power_power_int(s,number_number_of_nat(bit0(one_one_int)))),zero_zero_int)
| ~ spl1_20 ),
inference(superposition,[],[f439,f930]) ).
fof(f2284,plain,
times_times_int(plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),t) = plus_plus_int(one_one_int,power_power_int(s,number_number_of_nat(bit0(bit1(pls))))),
inference(forward_demodulation,[],[f186,f337]) ).
fof(f2285,plain,
plus_plus_int(one_one_int,power_power_int(s,number_number_of_nat(bit0(bit1(zero_zero_int))))) = times_times_int(plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(zero_zero_int)))),m),one_one_int),t),
inference(forward_demodulation,[],[f2284,f367]) ).
fof(f2286,plain,
plus_plus_int(one_one_int,power_power_int(s,number_number_of_nat(bit0(bit1(zero_zero_int))))) = times_times_int(t,plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(zero_zero_int)))),m),one_one_int)),
inference(forward_demodulation,[],[f2285,f212]) ).
fof(f2287,plain,
plus_plus_int(one_one_int,power_power_int(s,number_number_of_nat(bit0(bit1(zero_zero_int))))) = times_times_int(t,plus_plus_int(one_one_int,times_times_int(number_number_of_int(bit0(bit0(bit1(zero_zero_int)))),m))),
inference(forward_demodulation,[],[f2286,f337]) ).
fof(f2288,plain,
plus_plus_int(one_one_int,power_power_int(s,number_number_of_nat(bit0(bit1(zero_zero_int))))) = times_times_int(t,plus_plus_int(one_one_int,times_times_int(m,number_number_of_int(bit0(bit0(bit1(zero_zero_int))))))),
inference(forward_demodulation,[],[f2287,f212]) ).
fof(f2289,plain,
plus_plus_int(one_one_int,power_power_int(s,number_number_of_nat(bit0(bit1(zero_zero_int))))) = times_times_int(t,plus_plus_int(one_one_int,times_times_int(m,bit0(bit0(bit1(zero_zero_int)))))),
inference(forward_demodulation,[],[f2288,f211]) ).
fof(f2290,plain,
( plus_plus_int(one_one_int,power_power_int(s,number_number_of_nat(bit0(one_one_int)))) = times_times_int(t,plus_plus_int(one_one_int,times_times_int(m,bit0(bit0(one_one_int)))))
| ~ spl1_20 ),
inference(forward_demodulation,[],[f2289,f930]) ).
fof(f2334,plain,
ord_less_int(times_times_int(plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),t),times_times_int(zero_zero_int,plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int))),
inference(forward_demodulation,[],[f185,f212]) ).
fof(f2335,plain,
ord_less_int(times_times_int(plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),t),zero_zero_int),
inference(forward_demodulation,[],[f2334,f370]) ).
fof(f2336,plain,
ord_less_int(times_times_int(t,plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int)),zero_zero_int),
inference(forward_demodulation,[],[f2335,f212]) ).
fof(f2337,plain,
ord_less_int(times_times_int(t,plus_plus_int(one_one_int,times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m))),zero_zero_int),
inference(forward_demodulation,[],[f2336,f337]) ).
fof(f2338,plain,
ord_less_int(times_times_int(t,plus_plus_int(one_one_int,times_times_int(m,number_number_of_int(bit0(bit0(bit1(pls))))))),zero_zero_int),
inference(forward_demodulation,[],[f2337,f212]) ).
fof(f2339,plain,
ord_less_int(times_times_int(t,plus_plus_int(one_one_int,times_times_int(m,bit0(bit0(bit1(pls)))))),zero_zero_int),
inference(forward_demodulation,[],[f2338,f211]) ).
fof(f2340,plain,
ord_less_int(times_times_int(t,plus_plus_int(one_one_int,times_times_int(m,bit0(bit0(bit1(zero_zero_int)))))),zero_zero_int),
inference(forward_demodulation,[],[f2339,f367]) ).
fof(f2341,plain,
( ord_less_int(times_times_int(t,plus_plus_int(one_one_int,times_times_int(m,bit0(bit0(one_one_int))))),zero_zero_int)
| ~ spl1_20 ),
inference(forward_demodulation,[],[f2340,f930]) ).
fof(f2366,plain,
( ord_less_int(plus_plus_int(one_one_int,power_power_int(s,number_number_of_nat(bit0(one_one_int)))),zero_zero_int)
| ~ spl1_20 ),
inference(superposition,[],[f2341,f2290]) ).
fof(f2376,plain,
( $false
| ~ spl1_20 ),
inference(forward_subsumption_resolution,[],[f2366,f984]) ).
fof(f2377,plain,
~ spl1_20,
inference(avatar_contradiction_clause,[],[f2376]) ).
cnf(s5,plain,
spl1_5,
inference(sat_conversion,[],[f502]) ).
cnf(s18,plain,
( ~ spl1_5
| spl1_20 ),
inference(sat_conversion,[],[f969]) ).
cnf(s116,plain,
~ spl1_20,
inference(sat_conversion,[],[f2377]) ).
cnf(s117,plain,
~ spl1_5,
inference(rat,[],[s18,s116]) ).
cnf(s119,plain,
$false,
inference(rat,[],[s5,s117]) ).
fof(f2380,plain,
$false,
inference(avatar_sat_refutation,[],[s119]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM924+1 : TPTP v9.3.1. Released v5.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.37 % Computer : n010.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Sun Sep 27 21:41:17 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.40 Running first-order model finding
% 0.09/0.40 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
% 0.35/0.50 % (1334296)Will run a generic schedule for satisfiability detection.
% 0.35/0.50 % (1334305)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3158025739:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.35/0.50 % (1334302)% WARNING: option uhcvi not known.
% 0.35/0.50 % (1334301)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=679081742_2999 on theBenchmark for (2999ds/0Mi)
% 0.35/0.50 % (1334303)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=589360552:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.35/0.50 % (1334304)dis+10_1_sil=32000:sp=arity:random_seed=3121607566:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.35/0.50 % (1334306)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3106243693:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.35/0.50 % (1334307)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2533515792:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.35/0.50 % (1334302)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1314613876:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.35/0.50 % TRYING [1]
% 0.35/0.50 % TRYING [2]
% 0.35/0.50 % TRYING [3]
% 0.35/0.50 % (1334305)Instruction limit reached!
% 0.35/0.50 % (1334305)------------------------------
% 0.35/0.50 % (1334305)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.35/0.50 % (1334305)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.35/0.50 % (1334305)CaDiCaL version: 2.1.3
% 0.35/0.50 % (1334305)Termination reason: Instruction limit
% 0.35/0.50 % (1334305)Termination phase: Saturation
% 0.35/0.50 % (1334305)Time elapsed: 0.039 s
% 0.35/0.50 % (1334305)Peak memory usage: 13 MB
% 0.35/0.50 % (1334305)Instructions burned: 116 (million)
% 0.35/0.50 % (1334315)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2889888851:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.35/0.50 % TRYING [4]
% 0.35/0.50 % (1334304) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1334296-1334304"...
% 0.35/0.50 % TRYING [1]
% 0.35/0.50 % (1334304)...printing done.
% 0.35/0.50 % TRYING [2]
% 0.35/0.50 % (1334304)Refutation found. Thanks to Tanya!
% 0.35/0.50 % SZS status Theorem for theBenchmark
% 0.35/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.35/0.50 % (1334304)------------------------------
% 0.35/0.50 % (1334304)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.35/0.50 % (1334304)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.35/0.50 % (1334304)CaDiCaL version: 2.1.3
% 0.35/0.50 % (1334304)Termination reason: Refutation
% 0.35/0.50 % (1334304)Time elapsed: 0.049 s
% 0.35/0.50 % (1334304)Peak memory usage: 13 MB
% 0.35/0.50 % (1334304)Instructions burned: 76 (million)
% 0.35/0.50 % (1334296)Success in time 0.086 s
% 0.35/0.50 % Vampire exiting
%------------------------------------------------------------------------------