%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL499+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 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 11:52:37 AM UTC 2026
% Result : Theorem 2.87s 1.29s
% Output : Refutation 3.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 24
% Syntax : Number of formulae : 98 ( 34 unt; 12 def)
% Number of atoms : 200 ( 12 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 184 ( 82 ~; 76 |; 2 &)
% ( 16 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 21 ( 19 usr; 19 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 65 ( 0 sgn 64 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
( modus_ponens
<=> ! [X0,X1] :
( ( is_a_theorem(X0)
& is_a_theorem(implies(X0,X1)) )
=> is_a_theorem(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',modus_ponens) ).
fof(f16,axiom,
( kn1
<=> ! [X0] : is_a_theorem(implies(X0,and(X0,X0))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',kn1) ).
fof(f22,axiom,
( r1
<=> ! [X0] : is_a_theorem(implies(or(X0,X0),X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',r1) ).
fof(f24,axiom,
( r3
<=> ! [X0,X1] : is_a_theorem(implies(or(X0,X1),or(X1,X0))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',r3) ).
fof(f28,axiom,
( op_and
=> ! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',op_and) ).
fof(f30,axiom,
( op_implies_or
=> ! [X0,X1] : implies(X0,X1) = or(not(X0),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',op_implies_or) ).
fof(f32,axiom,
op_implies_or,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_op_implies_or) ).
fof(f33,axiom,
op_and,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_op_and) ).
fof(f35,axiom,
modus_ponens,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_modus_ponens) ).
fof(f36,axiom,
r1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_r1) ).
fof(f38,axiom,
r3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_r3) ).
fof(f45,conjecture,
kn1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rosser_kn1) ).
fof(f46,negated_conjecture,
~ kn1,
inference(negated_conjecture,[status(cth)],[f45]) ).
fof(f47,plain,
~ kn1,
inference(flattening,[],[f46]) ).
fof(f50,plain,
( r3
=> ! [X0,X1] : is_a_theorem(implies(or(X0,X1),or(X1,X0))) ),
inference(unused_predicate_definition_removal,[],[f24]) ).
fof(f52,plain,
( r1
=> ! [X0] : is_a_theorem(implies(or(X0,X0),X0)) ),
inference(unused_predicate_definition_removal,[],[f22]) ).
fof(f53,plain,
( ! [X0] : is_a_theorem(implies(X0,and(X0,X0)))
=> kn1 ),
inference(unused_predicate_definition_removal,[],[f16]) ).
fof(f55,plain,
( modus_ponens
=> ! [X0,X1] :
( ( is_a_theorem(X0)
& is_a_theorem(implies(X0,X1)) )
=> is_a_theorem(X1) ) ),
inference(unused_predicate_definition_removal,[],[f1]) ).
fof(f56,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) )
| ~ modus_ponens ),
inference(ennf_transformation,[],[f55]) ).
fof(f57,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) )
| ~ modus_ponens ),
inference(flattening,[],[f56]) ).
fof(f59,plain,
( kn1
| ? [X0] : ~ is_a_theorem(implies(X0,and(X0,X0))) ),
inference(ennf_transformation,[],[f53]) ).
fof(f60,plain,
( ! [X0] : is_a_theorem(implies(or(X0,X0),X0))
| ~ r1 ),
inference(ennf_transformation,[],[f52]) ).
fof(f62,plain,
( ! [X0,X1] : is_a_theorem(implies(or(X0,X1),or(X1,X0)))
| ~ r3 ),
inference(ennf_transformation,[],[f50]) ).
fof(f66,plain,
( ! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1)))
| ~ op_and ),
inference(ennf_transformation,[],[f28]) ).
fof(f68,plain,
( ! [X0,X1] : implies(X0,X1) = or(not(X0),X1)
| ~ op_implies_or ),
inference(ennf_transformation,[],[f30]) ).
fof(f70,plain,
( kn1
| ~ is_a_theorem(implies(sK0,and(sK0,sK0))) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f59]) ).
fof(f71,plain,
! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1))
| ~ modus_ponens ),
inference(cnf_transformation,[],[f57]) ).
fof(f73,plain,
( kn1
| ~ is_a_theorem(implies(sK0,and(sK0,sK0))) ),
inference(cnf_transformation,[],[f70]) ).
fof(f74,plain,
! [X0] :
( is_a_theorem(implies(or(X0,X0),X0))
| ~ r1 ),
inference(cnf_transformation,[],[f60]) ).
fof(f76,plain,
! [X0,X1] :
( is_a_theorem(implies(or(X0,X1),or(X1,X0)))
| ~ r3 ),
inference(cnf_transformation,[],[f62]) ).
fof(f80,plain,
! [X0,X1] :
( and(X0,X1) = not(or(not(X0),not(X1)))
| ~ op_and ),
inference(cnf_transformation,[],[f66]) ).
fof(f82,plain,
! [X0,X1] :
( implies(X0,X1) = or(not(X0),X1)
| ~ op_implies_or ),
inference(cnf_transformation,[],[f68]) ).
fof(f84,plain,
op_implies_or,
inference(cnf_transformation,[],[f32]) ).
fof(f85,plain,
op_and,
inference(cnf_transformation,[],[f33]) ).
fof(f87,plain,
modus_ponens,
inference(cnf_transformation,[],[f35]) ).
fof(f88,plain,
r1,
inference(cnf_transformation,[],[f36]) ).
fof(f90,plain,
r3,
inference(cnf_transformation,[],[f38]) ).
fof(f97,plain,
~ kn1,
inference(cnf_transformation,[],[f47]) ).
fof(f107,definition,
( spl1_3
<=> op_implies_or ),
introduced(definition,[new_symbols(definition,[spl1_3])],[avatar_definition]) ).
fof(f111,definition,
( spl1_4
<=> ! [X0,X1] : implies(X0,X1) = or(not(X0),X1) ),
introduced(definition,[new_symbols(definition,[spl1_4])],[avatar_definition]) ).
fof(f112,plain,
( ! [X0,X1] : implies(X0,X1) = or(not(X0),X1)
| ~ spl1_4 ),
inference(avatar_component_clause,[],[f111]) ).
fof(f113,plain,
( ~ spl1_3
| spl1_4 ),
inference(avatar_split_clause,[],[f82,f111,f107]) ).
fof(f123,definition,
( spl1_7
<=> op_and ),
introduced(definition,[new_symbols(definition,[spl1_7])],[avatar_definition]) ).
fof(f127,definition,
( spl1_8
<=> ! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))) ),
introduced(definition,[new_symbols(definition,[spl1_8])],[avatar_definition]) ).
fof(f128,plain,
( ! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1)))
| ~ spl1_8 ),
inference(avatar_component_clause,[],[f127]) ).
fof(f129,plain,
( ~ spl1_7
| spl1_8 ),
inference(avatar_split_clause,[],[f80,f127,f123]) ).
fof(f155,definition,
( spl1_15
<=> r3 ),
introduced(definition,[new_symbols(definition,[spl1_15])],[avatar_definition]) ).
fof(f159,definition,
( spl1_16
<=> ! [X0,X1] : is_a_theorem(implies(or(X0,X1),or(X1,X0))) ),
introduced(definition,[new_symbols(definition,[spl1_16])],[avatar_definition]) ).
fof(f160,plain,
( ! [X0,X1] : is_a_theorem(implies(or(X0,X1),or(X1,X0)))
| ~ spl1_16 ),
inference(avatar_component_clause,[],[f159]) ).
fof(f161,plain,
( ~ spl1_15
| spl1_16 ),
inference(avatar_split_clause,[],[f76,f159,f155]) ).
fof(f171,definition,
( spl1_19
<=> r1 ),
introduced(definition,[new_symbols(definition,[spl1_19])],[avatar_definition]) ).
fof(f175,definition,
( spl1_20
<=> ! [X0] : is_a_theorem(implies(or(X0,X0),X0)) ),
introduced(definition,[new_symbols(definition,[spl1_20])],[avatar_definition]) ).
fof(f176,plain,
( ! [X0] : is_a_theorem(implies(or(X0,X0),X0))
| ~ spl1_20 ),
inference(avatar_component_clause,[],[f175]) ).
fof(f177,plain,
( ~ spl1_19
| spl1_20 ),
inference(avatar_split_clause,[],[f74,f175,f171]) ).
fof(f179,definition,
( spl1_21
<=> is_a_theorem(implies(sK0,and(sK0,sK0))) ),
introduced(definition,[new_symbols(definition,[spl1_21])],[avatar_definition]) ).
fof(f181,plain,
( ~ is_a_theorem(implies(sK0,and(sK0,sK0)))
| spl1_21 ),
inference(avatar_component_clause,[],[f179]) ).
fof(f183,definition,
( spl1_22
<=> kn1 ),
introduced(definition,[new_symbols(definition,[spl1_22])],[avatar_definition]) ).
fof(f186,plain,
( ~ spl1_21
| spl1_22 ),
inference(avatar_split_clause,[],[f73,f183,f179]) ).
fof(f196,definition,
( spl1_25
<=> modus_ponens ),
introduced(definition,[new_symbols(definition,[spl1_25])],[avatar_definition]) ).
fof(f200,definition,
( spl1_26
<=> ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) ) ),
introduced(definition,[new_symbols(definition,[spl1_26])],[avatar_definition]) ).
fof(f201,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) )
| ~ spl1_26 ),
inference(avatar_component_clause,[],[f200]) ).
fof(f202,plain,
( ~ spl1_25
| spl1_26 ),
inference(avatar_split_clause,[],[f71,f200,f196]) ).
fof(f203,plain,
~ spl1_22,
inference(avatar_split_clause,[],[f97,f183]) ).
fof(f206,plain,
spl1_3,
inference(avatar_split_clause,[],[f84,f107]) ).
fof(f209,plain,
( ! [X0,X1] : and(X0,X1) = not(implies(X0,not(X1)))
| ~ spl1_4
| ~ spl1_8 ),
inference(forward_demodulation,[],[f128,f112]) ).
fof(f210,plain,
spl1_7,
inference(avatar_split_clause,[],[f85,f123]) ).
fof(f216,plain,
spl1_25,
inference(avatar_split_clause,[],[f87,f196]) ).
fof(f219,plain,
spl1_19,
inference(avatar_split_clause,[],[f88,f171]) ).
fof(f225,plain,
spl1_15,
inference(avatar_split_clause,[],[f90,f155]) ).
fof(f242,plain,
( ! [X0] : is_a_theorem(implies(implies(X0,not(X0)),not(X0)))
| ~ spl1_4
| ~ spl1_20 ),
inference(superposition,[],[f176,f112]) ).
fof(f244,plain,
( ! [X0,X1] : is_a_theorem(implies(or(X1,not(X0)),implies(X0,X1)))
| ~ spl1_4
| ~ spl1_16 ),
inference(superposition,[],[f160,f112]) ).
fof(f245,plain,
( ! [X0] :
( ~ is_a_theorem(implies(X0,implies(sK0,and(sK0,sK0))))
| ~ is_a_theorem(X0) )
| spl1_21
| ~ spl1_26 ),
inference(resolution,[],[f201,f181]) ).
fof(f254,plain,
( ! [X2,X0,X1] : implies(implies(X0,not(X1)),X2) = or(and(X0,X1),X2)
| ~ spl1_4
| ~ spl1_8 ),
inference(superposition,[],[f112,f209]) ).
fof(f299,plain,
( ~ is_a_theorem(or(and(sK0,sK0),not(sK0)))
| ~ spl1_4
| ~ spl1_16
| spl1_21
| ~ spl1_26 ),
inference(resolution,[],[f245,f244]) ).
fof(f360,plain,
( ! [X0] : is_a_theorem(or(and(X0,X0),not(X0)))
| ~ spl1_4
| ~ spl1_8
| ~ spl1_20 ),
inference(superposition,[],[f242,f254]) ).
fof(f385,plain,
( $false
| ~ spl1_4
| ~ spl1_8
| ~ spl1_16
| ~ spl1_20
| spl1_21
| ~ spl1_26 ),
inference(resolution,[],[f360,f299]) ).
fof(f390,plain,
( ~ spl1_4
| ~ spl1_8
| ~ spl1_16
| ~ spl1_20
| spl1_21
| ~ spl1_26 ),
inference(avatar_contradiction_clause,[],[f385]) ).
cnf(s2,plain,
( ~ spl1_3
| spl1_4 ),
inference(sat_conversion,[],[f113]) ).
cnf(s4,plain,
( ~ spl1_7
| spl1_8 ),
inference(sat_conversion,[],[f129]) ).
cnf(s8,plain,
( ~ spl1_15
| spl1_16 ),
inference(sat_conversion,[],[f161]) ).
cnf(s10,plain,
( ~ spl1_19
| spl1_20 ),
inference(sat_conversion,[],[f177]) ).
cnf(s11,plain,
( ~ spl1_21
| spl1_22 ),
inference(sat_conversion,[],[f186]) ).
cnf(s13,plain,
( ~ spl1_25
| spl1_26 ),
inference(sat_conversion,[],[f202]) ).
cnf(s14,plain,
~ spl1_22,
inference(sat_conversion,[],[f203]) ).
cnf(s16,plain,
spl1_3,
inference(sat_conversion,[],[f206]) ).
cnf(s18,plain,
spl1_7,
inference(sat_conversion,[],[f210]) ).
cnf(s22,plain,
spl1_25,
inference(sat_conversion,[],[f216]) ).
cnf(s24,plain,
spl1_19,
inference(sat_conversion,[],[f219]) ).
cnf(s28,plain,
spl1_15,
inference(sat_conversion,[],[f225]) ).
cnf(s39,plain,
( ~ spl1_4
| ~ spl1_8
| ~ spl1_16
| ~ spl1_20
| spl1_21
| ~ spl1_26 ),
inference(sat_conversion,[],[f390]) ).
cnf(s40,plain,
spl1_26,
inference(rat,[],[s13,s22]) ).
cnf(s42,plain,
~ spl1_21,
inference(rat,[],[s11,s14]) ).
cnf(s43,plain,
spl1_20,
inference(rat,[],[s10,s24]) ).
cnf(s45,plain,
spl1_16,
inference(rat,[],[s8,s28]) ).
cnf(s49,plain,
spl1_8,
inference(rat,[],[s4,s18]) ).
cnf(s50,plain,
~ spl1_4,
inference(rat,[],[s39,s40,s42,s43,s45,s49]) ).
cnf(s52,plain,
$false,
inference(rat,[],[s2,s50,s16]) ).
fof(f391,plain,
$false,
inference(avatar_sat_refutation,[],[s52]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL499+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.38 % Computer : n010.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Sun Sep 27 15:51:32 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.87/1.29 % (1126291)Detected formulas, will run a generic FOF schedule.
% 2.87/1.29 % (1126296)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=1924188892:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.87/1.29 % (1126298)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=2178167142:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.87/1.29 % (1126297)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=725846454:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.87/1.29 % (1126300)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2968406512:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.87/1.29 % (1126299)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2693032955:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.87/1.29 % (1126300)Refutation not found, incomplete strategy
% 2.87/1.29 % (1126300)------------------------------
% 2.87/1.29 % (1126300)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.87/1.29 % (1126300)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.87/1.29 % (1126300)CaDiCaL version: 2.1.3
% 2.87/1.29 % (1126300)Termination reason: Refutation not found, incomplete strategy
% 2.87/1.29 % (1126300)Time elapsed: 0.001 s
% 2.87/1.29 % (1126300)Peak memory usage: 86 MB
% 2.87/1.29 % (1126299)Refutation not found, incomplete strategy
% 2.87/1.29 % (1126299)------------------------------
% 2.87/1.29 % (1126299)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.87/1.29 % (1126299)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.87/1.29 % (1126299)CaDiCaL version: 2.1.3
% 2.87/1.29 % (1126299)Termination reason: Refutation not found, incomplete strategy
% 2.87/1.29 % (1126299)Time elapsed: 0.001 s
% 2.87/1.29 % (1126299)Peak memory usage: 87 MB
% 2.87/1.29 % (1126302)dis-21_1_sil=8000:lcm=predicate:random_seed=2399512377:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 2.87/1.29 % (1126302)Refutation not found, incomplete strategy
% 2.87/1.29 % (1126302)------------------------------
% 2.87/1.29 % (1126302)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.87/1.29 % (1126302)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.87/1.29 % (1126302)CaDiCaL version: 2.1.3
% 2.87/1.29 % (1126302)Termination reason: Refutation not found, incomplete strategy
% 2.87/1.29 % (1126302)Time elapsed: 0.002 s
% 2.87/1.29 % (1126302)Peak memory usage: 88 MB
% 2.87/1.29 % (1126302)Instructions burned: 1 (million)
% 2.87/1.29 % (1126301)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1467022134:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.87/1.29 % (1126301)First to succeed.
% 2.87/1.29 % (1126301)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1126291"
% 2.87/1.29 % (1126299)------------------------------
% 2.87/1.29 % (1126299)------------------------------
% 2.87/1.29 % (1126300)------------------------------
% 2.87/1.29 % (1126300)------------------------------
% 2.87/1.29 % (1126302)------------------------------
% 2.87/1.29 % (1126302)------------------------------
% 2.87/1.29 % (1126301)Refutation found. Thanks to Tanya!
% 2.87/1.29 % SZS status Theorem for theBenchmark
% 2.87/1.29 % SZS output start Proof for theBenchmark
% See solution above
% 3.65/1.48 % (1126301)------------------------------
% 3.65/1.48 % (1126301)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.65/1.48 % (1126301)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.65/1.48 % (1126301)CaDiCaL version: 2.1.3
% 3.65/1.48 % (1126301)Termination reason: Refutation
% 3.65/1.48 % (1126301)Time elapsed: 0.010 s
% 3.65/1.48 % (1126301)Peak memory usage: 89 MB
% 3.65/1.48 % (1126301)Instructions burned: 10 (million)
% 3.65/1.48 % (1126301)------------------------------
% 3.65/1.48 % (1126301)------------------------------
% 3.65/1.48 % (1126291)Success in time 0.435 s
% 3.65/1.48 % Vampire exiting
%------------------------------------------------------------------------------