%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUN071+2 : TPTP v9.3.1. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n011.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:27:03 PM UTC 2026
% Result : Theorem 0.17s 0.50s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 10
% Syntax : Number of formulae : 90 ( 49 unt; 1 def)
% Number of atoms : 202 ( 54 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 194 ( 82 ~; 59 |; 52 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 2 prp; 0-3 aty)
% Number of functors : 17 ( 17 usr; 1 con; 0-2 aty)
% Number of variables : 171 ( 0 sgn 144 !; 27 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
? [X0] :
! [X1] :
( ( ~ r1(X1)
& X1 != X0 )
| ( r1(X1)
& X1 = X0 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_1) ).
fof(f2,axiom,
! [X0] :
? [X1] :
! [X2] :
( ( ~ r2(X0,X2)
& X2 != X1 )
| ( r2(X0,X2)
& X2 = X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_2) ).
fof(f3,axiom,
! [X0,X1] :
? [X2] :
! [X3] :
( ( ~ r3(X0,X1,X3)
& X3 != X2 )
| ( r3(X0,X1,X3)
& X3 = X2 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_3) ).
fof(f4,axiom,
! [X0,X1] :
? [X2] :
! [X3] :
( ( ~ r4(X0,X1,X3)
& X3 != X2 )
| ( r4(X0,X1,X3)
& X3 = X2 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_4) ).
fof(f5,axiom,
! [X0,X1] :
? [X2] :
( ? [X3] :
( ? [X4] :
( r2(X1,X4)
& r3(X0,X4,X3) )
& X3 = X2 )
& ? [X5] :
( r2(X5,X2)
& r3(X0,X1,X5) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_1a) ).
fof(f6,axiom,
! [X0,X1] :
? [X2] :
( ? [X3] :
( ? [X4] :
( r2(X1,X4)
& r4(X0,X4,X3) )
& X3 = X2 )
& ? [X5] :
( r3(X5,X0,X2)
& r4(X0,X1,X5) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_2a) ).
fof(f8,axiom,
! [X0] :
? [X1] :
( ? [X2] :
( r1(X2)
& r3(X0,X2,X1) )
& X1 = X0 ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_4a) ).
fof(f9,axiom,
! [X0] :
? [X1] :
( ? [X2] :
( r1(X2)
& r4(X0,X2,X1) )
& ? [X3] :
( r1(X3)
& X1 = X3 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_5a) ).
fof(f12,conjecture,
? [X0] :
( ? [X1] :
( r4(X1,X1,X0)
& ? [X2] :
( r1(X2)
& r2(X2,X1) ) )
& ? [X3] :
( X0 = X3
& ? [X4] :
( r1(X4)
& r2(X4,X3) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',onetimesoneeqone) ).
fof(f13,negated_conjecture,
~ ? [X0] :
( ? [X1] :
( r4(X1,X1,X0)
& ? [X2] :
( r1(X2)
& r2(X2,X1) ) )
& ? [X3] :
( X0 = X3
& ? [X4] :
( r1(X4)
& r2(X4,X3) ) ) ),
inference(negated_conjecture,[status(cth)],[f12]) ).
fof(f14,plain,
! [X0] :
( ! [X1] :
( ~ r4(X1,X1,X0)
| ! [X2] :
( ~ r1(X2)
| ~ r2(X2,X1) ) )
| ! [X3] :
( X0 != X3
| ! [X4] :
( ~ r1(X4)
| ~ r2(X4,X3) ) ) ),
inference(ennf_transformation,[],[f13]) ).
fof(f15,plain,
! [X1] :
( ( ~ r1(X1)
& sK0 != X1 )
| ( r1(X1)
& sK0 = X1 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f1]) ).
fof(f16,plain,
! [X0,X2] :
( ( ~ r2(X0,X2)
& sK1(X0) != X2 )
| ( r2(X0,X2)
& sK1(X0) = X2 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X1,sK1(X0))],[f2]) ).
fof(f17,plain,
! [X0,X1,X3] :
( ( ~ r3(X0,X1,X3)
& sK2(X0,X1) != X3 )
| ( r3(X0,X1,X3)
& sK2(X0,X1) = X3 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X2,sK2(X0,X1))],[f3]) ).
fof(f18,plain,
! [X0,X1,X3] :
( ( ~ r4(X0,X1,X3)
& sK3(X0,X1) != X3 )
| ( r4(X0,X1,X3)
& sK3(X0,X1) = X3 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(X2,sK3(X0,X1))],[f4]) ).
fof(f19,plain,
! [X0,X1] :
( r2(X1,sK6(X0,X1))
& r3(X0,sK6(X0,X1),sK5(X0,X1))
& sK4(X0,X1) = sK5(X0,X1)
& r2(sK7(X0,X1),sK4(X0,X1))
& r3(X0,X1,sK7(X0,X1)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4,sK5,sK6,sK7]),skolemize(X2,sK4(X0,X1)),skolemize(X3,sK5(X0,X1)),skolemize(X4,sK6(X0,X1)),skolemize(X5,sK7(X0,X1))],[f5]) ).
fof(f20,plain,
! [X0,X1] :
( r2(X1,sK10(X0,X1))
& r4(X0,sK10(X0,X1),sK9(X0,X1))
& sK8(X0,X1) = sK9(X0,X1)
& r3(sK11(X0,X1),X0,sK8(X0,X1))
& r4(X0,X1,sK11(X0,X1)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8,sK9,sK10,sK11]),skolemize(X2,sK8(X0,X1)),skolemize(X3,sK9(X0,X1)),skolemize(X4,sK10(X0,X1)),skolemize(X5,sK11(X0,X1))],[f6]) ).
fof(f21,plain,
! [X0] :
( r1(sK13(X0))
& r3(X0,sK13(X0),sK12(X0))
& sK12(X0) = X0 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK12,sK13]),skolemize(X1,sK12(X0)),skolemize(X2,sK13(X0))],[f8]) ).
fof(f22,plain,
! [X0] :
( r1(sK15(X0))
& r4(X0,sK15(X0),sK14(X0))
& r1(sK16(X0))
& sK14(X0) = sK16(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK14,sK15,sK16]),skolemize(X1,sK14(X0)),skolemize(X2,sK15(X0)),skolemize(X3,sK16(X0))],[f9]) ).
fof(f25,plain,
! [X1] :
( sK0 != X1
| r1(X1) ),
inference(cnf_transformation,[],[f15]) ).
fof(f26,plain,
! [X1] :
( ~ r1(X1)
| sK0 = X1 ),
inference(cnf_transformation,[],[f15]) ).
fof(f29,plain,
! [X2,X0] :
( sK1(X0) != X2
| r2(X0,X2) ),
inference(cnf_transformation,[],[f16]) ).
fof(f30,plain,
! [X2,X0] :
( ~ r2(X0,X2)
| sK1(X0) = X2 ),
inference(cnf_transformation,[],[f16]) ).
fof(f34,plain,
! [X3,X0,X1] :
( ~ r3(X0,X1,X3)
| sK2(X0,X1) = X3 ),
inference(cnf_transformation,[],[f17]) ).
fof(f38,plain,
! [X3,X0,X1] :
( ~ r4(X0,X1,X3)
| sK3(X0,X1) = X3 ),
inference(cnf_transformation,[],[f18]) ).
fof(f40,plain,
! [X0,X1] : r3(X0,X1,sK7(X0,X1)),
inference(cnf_transformation,[],[f19]) ).
fof(f41,plain,
! [X0,X1] : r2(sK7(X0,X1),sK4(X0,X1)),
inference(cnf_transformation,[],[f19]) ).
fof(f42,plain,
! [X0,X1] : sK4(X0,X1) = sK5(X0,X1),
inference(cnf_transformation,[],[f19]) ).
fof(f43,plain,
! [X0,X1] : r3(X0,sK6(X0,X1),sK5(X0,X1)),
inference(cnf_transformation,[],[f19]) ).
fof(f44,plain,
! [X0,X1] : r2(X1,sK6(X0,X1)),
inference(cnf_transformation,[],[f19]) ).
fof(f45,plain,
! [X0,X1] : r4(X0,X1,sK11(X0,X1)),
inference(cnf_transformation,[],[f20]) ).
fof(f46,plain,
! [X0,X1] : r3(sK11(X0,X1),X0,sK8(X0,X1)),
inference(cnf_transformation,[],[f20]) ).
fof(f47,plain,
! [X0,X1] : sK8(X0,X1) = sK9(X0,X1),
inference(cnf_transformation,[],[f20]) ).
fof(f48,plain,
! [X0,X1] : r4(X0,sK10(X0,X1),sK9(X0,X1)),
inference(cnf_transformation,[],[f20]) ).
fof(f49,plain,
! [X0,X1] : r2(X1,sK10(X0,X1)),
inference(cnf_transformation,[],[f20]) ).
fof(f51,plain,
! [X0] : sK12(X0) = X0,
inference(cnf_transformation,[],[f21]) ).
fof(f52,plain,
! [X0] : r3(X0,sK13(X0),sK12(X0)),
inference(cnf_transformation,[],[f21]) ).
fof(f53,plain,
! [X0] : r1(sK13(X0)),
inference(cnf_transformation,[],[f21]) ).
fof(f54,plain,
! [X0] : sK14(X0) = sK16(X0),
inference(cnf_transformation,[],[f22]) ).
fof(f55,plain,
! [X0] : r1(sK16(X0)),
inference(cnf_transformation,[],[f22]) ).
fof(f56,plain,
! [X0] : r4(X0,sK15(X0),sK14(X0)),
inference(cnf_transformation,[],[f22]) ).
fof(f57,plain,
! [X0] : r1(sK15(X0)),
inference(cnf_transformation,[],[f22]) ).
fof(f63,plain,
! [X2,X3,X0,X1,X4] :
( ~ r4(X1,X1,X0)
| ~ r1(X2)
| ~ r2(X2,X1)
| X0 != X3
| ~ r1(X4)
| ~ r2(X4,X3) ),
inference(cnf_transformation,[],[f14]) ).
fof(f64,plain,
! [X0,X1] : r2(sK7(X0,X1),sK5(X0,X1)),
inference(definition_unfolding,[],[f41,f42]) ).
fof(f65,plain,
! [X0,X1] : r3(sK11(X0,X1),X0,sK9(X0,X1)),
inference(definition_unfolding,[],[f46,f47]) ).
fof(f66,plain,
! [X0] : r4(X0,sK15(X0),sK16(X0)),
inference(definition_unfolding,[],[f56,f54]) ).
fof(f67,plain,
r1(sK0),
inference(equality_resolution,[],[f25]) ).
fof(f69,plain,
! [X0] : r2(X0,sK1(X0)),
inference(equality_resolution,[],[f29]) ).
fof(f77,plain,
! [X2,X3,X1,X4] :
( ~ r4(X1,X1,X3)
| ~ r1(X2)
| ~ r2(X2,X1)
| ~ r1(X4)
| ~ r2(X4,X3) ),
inference(equality_resolution,[],[f63]) ).
fof(f79,plain,
! [X0] : sK0 = sK13(X0),
inference(resolution,[],[f26,f53]) ).
fof(f80,plain,
! [X0] : sK0 = sK15(X0),
inference(resolution,[],[f26,f57]) ).
fof(f81,plain,
! [X0] : sK0 = sK16(X0),
inference(resolution,[],[f26,f55]) ).
fof(f89,plain,
! [X0] : r3(X0,sK13(X0),X0),
inference(forward_demodulation,[],[f52,f51]) ).
fof(f90,plain,
! [X0] : r3(X0,sK0,X0),
inference(forward_demodulation,[],[f89,f79]) ).
fof(f91,plain,
! [X0] : r4(X0,sK15(X0),sK0),
inference(forward_demodulation,[],[f66,f81]) ).
fof(f92,plain,
! [X0] : r4(X0,sK0,sK0),
inference(forward_demodulation,[],[f91,f80]) ).
fof(f100,plain,
! [X0,X1] : sK1(X0) = sK6(X1,X0),
inference(resolution,[],[f30,f44]) ).
fof(f101,plain,
! [X0,X1] : sK1(X0) = sK10(X1,X0),
inference(resolution,[],[f30,f49]) ).
fof(f105,plain,
! [X0,X1] : sK5(X0,X1) = sK1(sK7(X0,X1)),
inference(resolution,[],[f64,f30]) ).
fof(f107,plain,
! [X0,X1] : r3(X0,sK1(X1),sK5(X0,X1)),
inference(forward_demodulation,[],[f43,f100]) ).
fof(f110,plain,
! [X0,X1] : r4(X0,sK1(X1),sK9(X0,X1)),
inference(forward_demodulation,[],[f48,f101]) ).
fof(f111,plain,
! [X2,X0,X1] :
( ~ r2(X2,sK9(sK1(X1),X1))
| ~ r2(X0,sK1(X1))
| ~ r1(X2)
| ~ r1(X0) ),
inference(resolution,[],[f110,f77]) ).
fof(f116,plain,
! [X0,X1] : sK2(X0,X1) = sK7(X0,X1),
inference(resolution,[],[f34,f40]) ).
fof(f118,plain,
! [X0] : sK2(X0,sK0) = X0,
inference(resolution,[],[f34,f90]) ).
fof(f119,plain,
! [X0,X1] : sK5(X0,X1) = sK2(X0,sK1(X1)),
inference(resolution,[],[f34,f107]) ).
fof(f120,plain,
! [X0,X1] : sK9(X0,X1) = sK2(sK11(X0,X1),X0),
inference(resolution,[],[f34,f65]) ).
fof(f122,plain,
! [X0,X1] : sK3(X0,X1) = sK11(X0,X1),
inference(resolution,[],[f38,f45]) ).
fof(f124,plain,
! [X0] : sK0 = sK3(X0,sK0),
inference(resolution,[],[f38,f92]) ).
fof(f164,plain,
! [X0,X1] : sK5(X0,X1) = sK1(sK2(X0,X1)),
inference(forward_demodulation,[],[f105,f116]) ).
fof(f196,plain,
! [X0] : sK1(X0) = sK5(X0,sK0),
inference(superposition,[],[f164,f118]) ).
fof(f202,plain,
! [X2,X3,X0,X1] :
( ~ r2(X2,sK9(sK5(X0,X1),sK2(X0,X1)))
| ~ r2(X3,sK5(X0,X1))
| ~ r1(X2)
| ~ r1(X3) ),
inference(superposition,[],[f111,f164]) ).
fof(f211,plain,
! [X2,X0,X1] :
( ~ r2(X1,sK9(sK5(X0,sK0),X0))
| ~ r2(X2,sK5(X0,sK0))
| ~ r1(X1)
| ~ r1(X2) ),
inference(superposition,[],[f202,f118]) ).
fof(f213,plain,
! [X0,X1] : sK9(X0,X1) = sK2(sK3(X0,X1),X0),
inference(forward_demodulation,[],[f120,f122]) ).
fof(f215,plain,
! [X0] : sK9(X0,sK0) = sK2(sK0,X0),
inference(superposition,[],[f213,f124]) ).
fof(f282,plain,
! [X0,X1] :
( ~ r2(X0,sK2(sK0,sK5(sK0,sK0)))
| ~ r2(X1,sK5(sK0,sK0))
| ~ r1(X0)
| ~ r1(X1) ),
inference(superposition,[],[f211,f215]) ).
fof(f283,plain,
! [X0,X1] :
( ~ r2(X0,sK2(sK0,sK1(sK0)))
| ~ r2(X1,sK5(sK0,sK0))
| ~ r1(X0)
| ~ r1(X1) ),
inference(forward_demodulation,[],[f282,f196]) ).
fof(f287,plain,
! [X0,X1] :
( ~ r2(X0,sK5(sK0,sK0))
| ~ r2(X1,sK5(sK0,sK0))
| ~ r1(X0)
| ~ r1(X1) ),
inference(forward_demodulation,[],[f283,f119]) ).
fof(f291,plain,
! [X0,X1] :
( ~ r2(X0,sK1(sK0))
| ~ r2(X1,sK5(sK0,sK0))
| ~ r1(X0)
| ~ r1(X1) ),
inference(forward_demodulation,[],[f287,f196]) ).
fof(f293,definition,
( spl20_2
<=> ! [X1] :
( ~ r2(X1,sK1(sK0))
| ~ r1(X1) ) ),
introduced(definition,[new_symbols(definition,[spl20_2])],[avatar_definition]) ).
fof(f294,plain,
( ! [X1] :
( ~ r2(X1,sK1(sK0))
| ~ r1(X1) )
| ~ spl20_2 ),
inference(avatar_component_clause,[],[f293]) ).
fof(f297,plain,
! [X0,X1] :
( ~ r2(X1,sK1(sK0))
| ~ r2(X0,sK1(sK0))
| ~ r1(X0)
| ~ r1(X1) ),
inference(forward_demodulation,[],[f291,f196]) ).
fof(f299,plain,
( spl20_2
| spl20_2 ),
inference(avatar_split_clause,[],[f297,f293,f293]) ).
fof(f309,plain,
( ~ r1(sK0)
| ~ spl20_2 ),
inference(resolution,[],[f294,f69]) ).
fof(f312,plain,
( $false
| ~ spl20_2 ),
inference(forward_subsumption_resolution,[],[f309,f67]) ).
fof(f313,plain,
~ spl20_2,
inference(avatar_contradiction_clause,[],[f312]) ).
cnf(s5,plain,
( spl20_2
| spl20_2 ),
inference(sat_conversion,[],[f299]) ).
cnf(s6,plain,
spl20_2,
inference(rat,[],[s5]) ).
cnf(s9,plain,
~ spl20_2,
inference(sat_conversion,[],[f313]) ).
cnf(s11,plain,
$false,
inference(rat,[],[s6,s9]) ).
fof(f314,plain,
$false,
inference(avatar_sat_refutation,[],[s11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUN071+2 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.41 % Computer : n011.cluster.edu
% 0.11/0.41 % Model : x86_64 x86_64
% 0.11/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.41 % Memory : 8046.5625MB
% 0.11/0.41 % OS : Linux 6.8.0-71-generic
% 0.11/0.42 % CPULimit : 300
% 0.11/0.42 % WCLimit : 300
% 0.11/0.42 % DateTime : Sun Sep 27 21:57:01 UTC 2026
% 0.11/0.42 % CPUTime :
% 0.11/0.42 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.45 Running first-order model finding
% 0.11/0.45 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.50 % (2796971)Will run a generic schedule for satisfiability detection.
% 0.17/0.50 % (2796980)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2276173839:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.50 % (2796977)% WARNING: option uhcvi not known.
% 0.17/0.50 % (2796976)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2840822803_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.50 % (2796977)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1695258025:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.50 % (2796982)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2809878659:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/0.50 % (2796978)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3919604077:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.50 % (2796979)dis+10_1_sil=32000:sp=arity:random_seed=1284055572:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.50 % (2796981)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=610826221:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.50 % TRYING [1]
% 0.17/0.50 % TRYING [2]
% 0.17/0.50 % TRYING [3]
% 0.17/0.50 % TRYING [4]
% 0.17/0.50 % (2796979) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2796971-2796979"...
% 0.17/0.50 % TRYING [5]
% 0.17/0.50 % (2796979)...printing done.
% 0.17/0.50 % (2796980) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2796971-2796980"...
% 0.17/0.50 % (2796979)Refutation found. Thanks to Tanya!
% 0.17/0.50 % SZS status Theorem for theBenchmark
% 0.17/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.51 % (2796979)------------------------------
% 0.17/0.51 % (2796979)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.51 % (2796979)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.51 % (2796979)CaDiCaL version: 2.1.3
% 0.17/0.51 % (2796979)Termination reason: Refutation
% 0.17/0.51 % (2796979)Time elapsed: 0.010 s
% 0.17/0.51 % (2796979)Peak memory usage: 12 MB
% 0.17/0.51 % (2796979)Instructions burned: 13 (million)
% 0.17/0.51 % (2796971)Success in time 0.044 s
% 0.17/0.51 % Vampire exiting
%------------------------------------------------------------------------------