%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC325+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/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 01:05:33 PM UTC 2026
% Result : Theorem 0.10s 0.27s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 14
% Syntax : Number of formulae : 90 ( 16 unt; 9 def)
% Number of atoms : 323 ( 100 equ)
% Maximal formula atoms : 17 ( 3 avg)
% Number of connectives : 401 ( 168 ~; 152 |; 50 &)
% ( 13 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 14 ( 12 usr; 10 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 63 ( 0 sgn 47 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(f16,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ssList(cons(X1,X0)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(f83,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( nil = app(X0,X1)
<=> ( nil = X1
& nil = X0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax83) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& app(X4,X5) = X1
& app(X5,X4) = X0 ) )
| ( nil != X2
& nil = X3 )
| ( ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ( app(cons(X6,nil),X7) != X2
| app(X7,cons(X6,nil)) != X3 ) ) )
& neq(X3,nil) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& app(X4,X5) = X1
& app(X5,X4) = X0 ) )
| ( nil != X2
& nil = X3 )
| ( ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ( app(cons(X6,nil),X7) != X2
| app(X7,cons(X6,nil)) != X3 ) ) )
& neq(X3,nil) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f118,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f119,plain,
! [X0] :
( ! [X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f200,plain,
! [X0] :
( ! [X1] :
( ( nil = app(X0,X1)
<=> ( nil = X1
& nil = X0 ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f83]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ~ ssList(X5)
| app(X4,X5) != X1
| app(X5,X4) != X0 ) )
& ( nil = X2
| nil != X3 )
& ( ? [X6] :
( ? [X7] :
( app(cons(X6,nil),X7) = X2
& app(X7,cons(X6,nil)) = X3
& ssList(X7) )
& ssItem(X6) )
| ~ neq(X3,nil) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ~ ssList(X5)
| app(X4,X5) != X1
| app(X5,X4) != X0 ) )
& ( nil = X2
| nil != X3 )
& ( ? [X6] :
( ? [X7] :
( app(cons(X6,nil),X7) = X2
& app(X7,cons(X6,nil)) = X3
& ssList(X7) )
& ssItem(X6) )
| ~ neq(X3,nil) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f273,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f118]) ).
fof(f292,plain,
! [X0] :
( ! [X1] :
( ( ( nil = app(X0,X1)
| nil != X1
| nil != X0 )
& ( ( nil = X1
& nil = X0 )
| nil != app(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f200]) ).
fof(f293,plain,
! [X0] :
( ! [X1] :
( ( ( nil = app(X0,X1)
| nil != X1
| nil != X0 )
& ( ( nil = X1
& nil = X0 )
| nil != app(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(flattening,[],[f292]) ).
fof(f296,plain,
( sK54 = sK56
& sK53 = sK55
& ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ~ ssList(X5)
| app(X4,X5) != sK54
| app(X5,X4) != sK53 ) )
& ( nil = sK55
| nil != sK56 )
& ( ( sK55 = app(cons(sK57,nil),sK58)
& sK56 = app(sK58,cons(sK57,nil))
& ssList(sK58)
& ssItem(sK57) )
| ~ neq(sK56,nil) )
& ssList(sK56)
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56,sK57,sK58]),skolemize(X0,sK53),skolemize(X1,sK54),skolemize(X2,sK55),skolemize(X3,sK56),skolemize(X6,sK57),skolemize(X7,sK58)],[f222]) ).
fof(f387,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f273]) ).
fof(f388,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f119]) ).
fof(f389,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f481,plain,
! [X0,X1] :
( nil = app(X0,X1)
| nil != X1
| nil != X0
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f293]) ).
fof(f499,plain,
ssList(sK56),
inference(cnf_transformation,[],[f296]) ).
fof(f500,plain,
( ssItem(sK57)
| ~ neq(sK56,nil) ),
inference(cnf_transformation,[],[f296]) ).
fof(f501,plain,
( ssList(sK58)
| ~ neq(sK56,nil) ),
inference(cnf_transformation,[],[f296]) ).
fof(f502,plain,
( sK56 = app(sK58,cons(sK57,nil))
| ~ neq(sK56,nil) ),
inference(cnf_transformation,[],[f296]) ).
fof(f503,plain,
( sK55 = app(cons(sK57,nil),sK58)
| ~ neq(sK56,nil) ),
inference(cnf_transformation,[],[f296]) ).
fof(f504,plain,
( nil = sK55
| nil != sK56 ),
inference(cnf_transformation,[],[f296]) ).
fof(f505,plain,
! [X4,X5] :
( ~ ssList(X4)
| ~ ssList(X5)
| app(X4,X5) != sK54
| app(X5,X4) != sK53 ),
inference(cnf_transformation,[],[f296]) ).
fof(f506,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f296]) ).
fof(f507,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f296]) ).
fof(f508,plain,
! [X4,X5] :
( app(X5,X4) != sK55
| ~ ssList(X5)
| app(X4,X5) != sK56
| ~ ssList(X4) ),
inference(definition_unfolding,[],[f505,f507,f506]) ).
fof(f535,plain,
! [X0] :
( nil = app(X0,nil)
| nil != X0
| ~ ssList(nil)
| ~ ssList(X0) ),
inference(equality_resolution,[],[f481]) ).
fof(f536,plain,
( nil = app(nil,nil)
| ~ ssList(nil)
| ~ ssList(nil) ),
inference(equality_resolution,[],[f535]) ).
fof(f539,plain,
( nil = app(nil,nil)
| ~ ssList(nil) ),
inference(duplicate_literal_removal,[],[f536]) ).
fof(f546,definition,
( spl59_1
<=> neq(sK56,nil) ),
introduced(definition,[new_symbols(definition,[spl59_1])],[avatar_definition]) ).
fof(f548,plain,
( ~ neq(sK56,nil)
| spl59_1 ),
inference(avatar_component_clause,[],[f546]) ).
fof(f550,definition,
( spl59_2
<=> ssItem(sK57) ),
introduced(definition,[new_symbols(definition,[spl59_2])],[avatar_definition]) ).
fof(f552,plain,
( ssItem(sK57)
| ~ spl59_2 ),
inference(avatar_component_clause,[],[f550]) ).
fof(f553,plain,
( ~ spl59_1
| spl59_2 ),
inference(avatar_split_clause,[],[f500,f550,f546]) ).
fof(f555,definition,
( spl59_3
<=> ssList(sK58) ),
introduced(definition,[new_symbols(definition,[spl59_3])],[avatar_definition]) ).
fof(f557,plain,
( ssList(sK58)
| ~ spl59_3 ),
inference(avatar_component_clause,[],[f555]) ).
fof(f558,plain,
( ~ spl59_1
| spl59_3 ),
inference(avatar_split_clause,[],[f501,f555,f546]) ).
fof(f560,definition,
( spl59_4
<=> sK56 = app(sK58,cons(sK57,nil)) ),
introduced(definition,[new_symbols(definition,[spl59_4])],[avatar_definition]) ).
fof(f562,plain,
( sK56 = app(sK58,cons(sK57,nil))
| ~ spl59_4 ),
inference(avatar_component_clause,[],[f560]) ).
fof(f563,plain,
( ~ spl59_1
| spl59_4 ),
inference(avatar_split_clause,[],[f502,f560,f546]) ).
fof(f565,definition,
( spl59_5
<=> sK55 = app(cons(sK57,nil),sK58) ),
introduced(definition,[new_symbols(definition,[spl59_5])],[avatar_definition]) ).
fof(f567,plain,
( sK55 = app(cons(sK57,nil),sK58)
| ~ spl59_5 ),
inference(avatar_component_clause,[],[f565]) ).
fof(f568,plain,
( ~ spl59_1
| spl59_5 ),
inference(avatar_split_clause,[],[f503,f565,f546]) ).
fof(f570,definition,
( spl59_6
<=> nil = sK56 ),
introduced(definition,[new_symbols(definition,[spl59_6])],[avatar_definition]) ).
fof(f574,definition,
( spl59_7
<=> nil = sK55 ),
introduced(definition,[new_symbols(definition,[spl59_7])],[avatar_definition]) ).
fof(f577,plain,
( ~ spl59_6
| spl59_7 ),
inference(avatar_split_clause,[],[f504,f574,f570]) ).
fof(f579,definition,
( spl59_8
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl59_8])],[avatar_definition]) ).
fof(f580,plain,
( ssList(nil)
| ~ spl59_8 ),
inference(avatar_component_clause,[],[f579]) ).
fof(f583,definition,
( spl59_9
<=> nil = app(nil,nil) ),
introduced(definition,[new_symbols(definition,[spl59_9])],[avatar_definition]) ).
fof(f585,plain,
( nil = app(nil,nil)
| ~ spl59_9 ),
inference(avatar_component_clause,[],[f583]) ).
fof(f586,plain,
( ~ spl59_8
| spl59_9 ),
inference(avatar_split_clause,[],[f539,f583,f579]) ).
fof(f612,plain,
spl59_8,
inference(avatar_split_clause,[],[f389,f579]) ).
fof(f649,plain,
( nil != sK55
| ~ ssList(nil)
| nil != sK56
| ~ ssList(nil)
| ~ spl59_9 ),
inference(superposition,[],[f508,f585]) ).
fof(f650,plain,
( nil != sK55
| ~ ssList(nil)
| nil != sK56
| ~ spl59_9 ),
inference(duplicate_literal_removal,[],[f649]) ).
fof(f1008,plain,
( nil = sK56
| ~ ssList(nil)
| ~ ssList(sK56)
| spl59_1 ),
inference(resolution,[],[f387,f548]) ).
fof(f1017,plain,
( nil != sK55
| nil != sK56
| ~ spl59_8
| ~ spl59_9 ),
inference(forward_subsumption_resolution,[],[f650,f580]) ).
fof(f1018,plain,
( nil = sK56
| ~ ssList(sK56)
| spl59_1
| ~ spl59_8 ),
inference(forward_subsumption_resolution,[],[f1008,f580]) ).
fof(f1019,plain,
( ~ spl59_6
| ~ spl59_7
| ~ spl59_8
| ~ spl59_9 ),
inference(avatar_split_clause,[],[f1017,f583,f579,f574,f570]) ).
fof(f1020,plain,
( nil = sK56
| spl59_1
| ~ spl59_8 ),
inference(forward_subsumption_resolution,[],[f1018,f499]) ).
fof(f1021,plain,
( spl59_6
| spl59_1
| ~ spl59_8 ),
inference(avatar_split_clause,[],[f1020,f579,f546,f570]) ).
fof(f1187,plain,
( sK55 != sK55
| ~ ssList(cons(sK57,nil))
| sK56 != app(sK58,cons(sK57,nil))
| ~ ssList(sK58)
| ~ spl59_5 ),
inference(superposition,[],[f508,f567]) ).
fof(f1188,plain,
( ~ ssList(cons(sK57,nil))
| sK56 != app(sK58,cons(sK57,nil))
| ~ ssList(sK58)
| ~ spl59_5 ),
inference(trivial_inequality_removal,[],[f1187]) ).
fof(f1189,plain,
( ~ ssList(cons(sK57,nil))
| ~ ssList(sK58)
| ~ spl59_4
| ~ spl59_5 ),
inference(forward_subsumption_resolution,[],[f1188,f562]) ).
fof(f1190,plain,
( ~ ssList(cons(sK57,nil))
| ~ spl59_3
| ~ spl59_4
| ~ spl59_5 ),
inference(forward_subsumption_resolution,[],[f1189,f557]) ).
fof(f1300,plain,
( ~ ssItem(sK57)
| ~ ssList(nil)
| ~ spl59_3
| ~ spl59_4
| ~ spl59_5 ),
inference(resolution,[],[f1190,f388]) ).
fof(f1301,plain,
( ~ ssList(nil)
| ~ spl59_2
| ~ spl59_3
| ~ spl59_4
| ~ spl59_5 ),
inference(forward_subsumption_resolution,[],[f1300,f552]) ).
fof(f1302,plain,
( $false
| ~ spl59_2
| ~ spl59_3
| ~ spl59_4
| ~ spl59_5
| ~ spl59_8 ),
inference(forward_subsumption_resolution,[],[f1301,f580]) ).
fof(f1303,plain,
( ~ spl59_2
| ~ spl59_3
| ~ spl59_4
| ~ spl59_5
| ~ spl59_8 ),
inference(avatar_contradiction_clause,[],[f1302]) ).
cnf(s1,plain,
( ~ spl59_1
| spl59_2 ),
inference(sat_conversion,[],[f553]) ).
cnf(s2,plain,
( ~ spl59_1
| spl59_3 ),
inference(sat_conversion,[],[f558]) ).
cnf(s3,plain,
( ~ spl59_1
| spl59_4 ),
inference(sat_conversion,[],[f563]) ).
cnf(s4,plain,
( ~ spl59_1
| spl59_5 ),
inference(sat_conversion,[],[f568]) ).
cnf(s5,plain,
( ~ spl59_6
| spl59_7 ),
inference(sat_conversion,[],[f577]) ).
cnf(s6,plain,
( ~ spl59_8
| spl59_9 ),
inference(sat_conversion,[],[f586]) ).
cnf(s14,plain,
spl59_8,
inference(sat_conversion,[],[f612]) ).
cnf(s31,plain,
( ~ spl59_6
| ~ spl59_7
| ~ spl59_8
| ~ spl59_9 ),
inference(sat_conversion,[],[f1019]) ).
cnf(s32,plain,
( spl59_1
| spl59_6
| ~ spl59_8 ),
inference(sat_conversion,[],[f1021]) ).
cnf(s55,plain,
( ~ spl59_2
| ~ spl59_3
| ~ spl59_4
| ~ spl59_5
| ~ spl59_8 ),
inference(sat_conversion,[],[f1303]) ).
cnf(s59,plain,
spl59_9,
inference(rat,[],[s6,s14]) ).
cnf(s60,plain,
~ spl59_6,
inference(rat,[],[s5,s31,s14,s59]) ).
cnf(s61,plain,
spl59_1,
inference(rat,[],[s32,s14,s60]) ).
cnf(s62,plain,
spl59_5,
inference(rat,[],[s4,s61]) ).
cnf(s63,plain,
spl59_4,
inference(rat,[],[s3,s61]) ).
cnf(s64,plain,
spl59_3,
inference(rat,[],[s2,s61]) ).
cnf(s65,plain,
spl59_2,
inference(rat,[],[s1,s61]) ).
cnf(s66,plain,
$false,
inference(rat,[],[s55,s14,s62,s63,s64,s65]) ).
fof(f1304,plain,
$false,
inference(avatar_sat_refutation,[],[s66]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC325+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.17 % Computer : n010.cluster.edu
% 0.10/0.17 % Model : x86_64 x86_64
% 0.10/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.17 % Memory : 8046.5625MB
% 0.10/0.17 % OS : Linux 6.8.0-71-generic
% 0.10/0.18 % CPULimit : 300
% 0.10/0.18 % WCLimit : 300
% 0.10/0.18 % DateTime : Mon Sep 28 09:05:47 UTC 2026
% 0.10/0.18 % CPUTime :
% 0.10/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.21 Running first-order model finding
% 0.10/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.10/0.27 % (1788498)Will run a generic schedule for satisfiability detection.
% 0.10/0.27 % (1788507)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=166064461:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.10/0.27 % (1788504)% WARNING: option uhcvi not known.
% 0.10/0.27 % (1788503)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1224508453_2999 on theBenchmark for (2999ds/0Mi)
% 0.10/0.27 % (1788505)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3026685220:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.10/0.27 % (1788504)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1078213487:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.10/0.27 % (1788506)dis+10_1_sil=32000:sp=arity:random_seed=905295285:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.10/0.27 % (1788508)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1687945849:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.10/0.27 % (1788509)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1122743207:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.10/0.27 % TRYING [1]
% 0.10/0.27 % TRYING [2]
% 0.10/0.27 % (1788506) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1788498-1788506"...
% 0.10/0.27 % (1788504) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1788498-1788504"...
% 0.10/0.27 % TRYING [3]
% 0.10/0.27 % (1788509) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1788498-1788509"...
% 0.10/0.27 % (1788506)...printing done.
% 0.10/0.27 % (1788504)...printing done.
% 0.10/0.27 % (1788506)Refutation found. Thanks to Tanya!
% 0.10/0.27 % SZS status Theorem for theBenchmark
% 0.10/0.27 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.27 % (1788506)------------------------------
% 0.10/0.27 % (1788506)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.27 % (1788506)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.27 % (1788506)CaDiCaL version: 2.1.3
% 0.10/0.27 % (1788506)Termination reason: Refutation
% 0.10/0.27 % (1788506)Time elapsed: 0.021 s
% 0.10/0.27 % (1788506)Peak memory usage: 13 MB
% 0.10/0.27 % (1788506)Instructions burned: 32 (million)
% 0.10/0.27 % (1788498)Success in time 0.057 s
% 0.10/0.27 % Vampire exiting
%------------------------------------------------------------------------------