%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU257+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n019.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:48:02 PM UTC 2026
% Result : Theorem 0.87s 1.14s
% Output : Refutation 2.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 14
% Syntax : Number of formulae : 97 ( 17 unt; 6 def)
% Number of atoms : 266 ( 0 equ)
% Maximal formula atoms : 13 ( 2 avg)
% Number of connectives : 292 ( 123 ~; 121 |; 24 &)
% ( 8 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 14 ( 13 usr; 7 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 64 ( 0 sgn 60 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0] :
( relation(X0)
=> ( well_ordering(X0)
<=> ( reflexive(X0)
& transitive(X0)
& antisymmetric(X0)
& connected(X0)
& well_founded_relation(X0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_wellord1) ).
fof(f4,axiom,
! [X0,X1] :
( relation(X0)
=> relation(relation_restriction(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k2_wellord1) ).
fof(f8,axiom,
! [X0,X1] :
( relation(X1)
=> ( reflexive(X1)
=> reflexive(relation_restriction(X1,X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t22_wellord1) ).
fof(f9,axiom,
! [X0,X1] :
( relation(X1)
=> ( connected(X1)
=> connected(relation_restriction(X1,X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t23_wellord1) ).
fof(f10,axiom,
! [X0,X1] :
( relation(X1)
=> ( transitive(X1)
=> transitive(relation_restriction(X1,X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t24_wellord1) ).
fof(f11,axiom,
! [X0,X1] :
( relation(X1)
=> ( antisymmetric(X1)
=> antisymmetric(relation_restriction(X1,X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t25_wellord1) ).
fof(f12,axiom,
! [X0,X1] :
( relation(X1)
=> ( well_founded_relation(X1)
=> well_founded_relation(relation_restriction(X1,X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t31_wellord1) ).
fof(f13,conjecture,
! [X0,X1] :
( relation(X1)
=> ( well_ordering(X1)
=> well_ordering(relation_restriction(X1,X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t32_wellord1) ).
fof(f14,negated_conjecture,
~ ! [X0,X1] :
( relation(X1)
=> ( well_ordering(X1)
=> well_ordering(relation_restriction(X1,X0)) ) ),
inference(negated_conjecture,[status(cth)],[f13]) ).
fof(f16,plain,
! [X0] :
( ( well_ordering(X0)
<=> ( reflexive(X0)
& transitive(X0)
& antisymmetric(X0)
& connected(X0)
& well_founded_relation(X0) ) )
| ~ relation(X0) ),
inference(ennf_transformation,[],[f2]) ).
fof(f18,plain,
! [X0,X1] :
( relation(relation_restriction(X0,X1))
| ~ relation(X0) ),
inference(ennf_transformation,[],[f4]) ).
fof(f19,plain,
! [X0,X1] :
( reflexive(relation_restriction(X1,X0))
| ~ reflexive(X1)
| ~ relation(X1) ),
inference(ennf_transformation,[],[f8]) ).
fof(f20,plain,
! [X0,X1] :
( reflexive(relation_restriction(X1,X0))
| ~ reflexive(X1)
| ~ relation(X1) ),
inference(flattening,[],[f19]) ).
fof(f21,plain,
! [X0,X1] :
( connected(relation_restriction(X1,X0))
| ~ connected(X1)
| ~ relation(X1) ),
inference(ennf_transformation,[],[f9]) ).
fof(f22,plain,
! [X0,X1] :
( connected(relation_restriction(X1,X0))
| ~ connected(X1)
| ~ relation(X1) ),
inference(flattening,[],[f21]) ).
fof(f23,plain,
! [X0,X1] :
( transitive(relation_restriction(X1,X0))
| ~ transitive(X1)
| ~ relation(X1) ),
inference(ennf_transformation,[],[f10]) ).
fof(f24,plain,
! [X0,X1] :
( transitive(relation_restriction(X1,X0))
| ~ transitive(X1)
| ~ relation(X1) ),
inference(flattening,[],[f23]) ).
fof(f25,plain,
! [X0,X1] :
( antisymmetric(relation_restriction(X1,X0))
| ~ antisymmetric(X1)
| ~ relation(X1) ),
inference(ennf_transformation,[],[f11]) ).
fof(f26,plain,
! [X0,X1] :
( antisymmetric(relation_restriction(X1,X0))
| ~ antisymmetric(X1)
| ~ relation(X1) ),
inference(flattening,[],[f25]) ).
fof(f27,plain,
! [X0,X1] :
( well_founded_relation(relation_restriction(X1,X0))
| ~ well_founded_relation(X1)
| ~ relation(X1) ),
inference(ennf_transformation,[],[f12]) ).
fof(f28,plain,
! [X0,X1] :
( well_founded_relation(relation_restriction(X1,X0))
| ~ well_founded_relation(X1)
| ~ relation(X1) ),
inference(flattening,[],[f27]) ).
fof(f29,plain,
? [X0,X1] :
( ~ well_ordering(relation_restriction(X1,X0))
& well_ordering(X1)
& relation(X1) ),
inference(ennf_transformation,[],[f14]) ).
fof(f30,plain,
? [X0,X1] :
( ~ well_ordering(relation_restriction(X1,X0))
& well_ordering(X1)
& relation(X1) ),
inference(flattening,[],[f29]) ).
fof(f31,plain,
! [X0] :
( ( ( well_ordering(X0)
| ~ reflexive(X0)
| ~ transitive(X0)
| ~ antisymmetric(X0)
| ~ connected(X0)
| ~ well_founded_relation(X0) )
& ( ( reflexive(X0)
& transitive(X0)
& antisymmetric(X0)
& connected(X0)
& well_founded_relation(X0) )
| ~ well_ordering(X0) ) )
| ~ relation(X0) ),
inference(nnf_transformation,[],[f16]) ).
fof(f32,plain,
! [X0] :
( ( ( well_ordering(X0)
| ~ reflexive(X0)
| ~ transitive(X0)
| ~ antisymmetric(X0)
| ~ connected(X0)
| ~ well_founded_relation(X0) )
& ( ( reflexive(X0)
& transitive(X0)
& antisymmetric(X0)
& connected(X0)
& well_founded_relation(X0) )
| ~ well_ordering(X0) ) )
| ~ relation(X0) ),
inference(flattening,[],[f31]) ).
fof(f33,plain,
( ~ well_ordering(relation_restriction(sK1,sK0))
& well_ordering(sK1)
& relation(sK1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f30]) ).
fof(f35,plain,
! [X0] :
( well_founded_relation(X0)
| ~ well_ordering(X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f32]) ).
fof(f36,plain,
! [X0] :
( connected(X0)
| ~ well_ordering(X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f32]) ).
fof(f37,plain,
! [X0] :
( antisymmetric(X0)
| ~ well_ordering(X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f32]) ).
fof(f38,plain,
! [X0] :
( transitive(X0)
| ~ well_ordering(X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f32]) ).
fof(f39,plain,
! [X0] :
( reflexive(X0)
| ~ well_ordering(X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f32]) ).
fof(f40,plain,
! [X0] :
( well_ordering(X0)
| ~ reflexive(X0)
| ~ transitive(X0)
| ~ antisymmetric(X0)
| ~ connected(X0)
| ~ well_founded_relation(X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f32]) ).
fof(f42,plain,
! [X0,X1] :
( relation(relation_restriction(X0,X1))
| ~ relation(X0) ),
inference(cnf_transformation,[],[f18]) ).
fof(f44,plain,
! [X0,X1] :
( reflexive(relation_restriction(X1,X0))
| ~ reflexive(X1)
| ~ relation(X1) ),
inference(cnf_transformation,[],[f20]) ).
fof(f45,plain,
! [X0,X1] :
( connected(relation_restriction(X1,X0))
| ~ connected(X1)
| ~ relation(X1) ),
inference(cnf_transformation,[],[f22]) ).
fof(f46,plain,
! [X0,X1] :
( transitive(relation_restriction(X1,X0))
| ~ transitive(X1)
| ~ relation(X1) ),
inference(cnf_transformation,[],[f24]) ).
fof(f47,plain,
! [X0,X1] :
( antisymmetric(relation_restriction(X1,X0))
| ~ antisymmetric(X1)
| ~ relation(X1) ),
inference(cnf_transformation,[],[f26]) ).
fof(f48,plain,
! [X0,X1] :
( well_founded_relation(relation_restriction(X1,X0))
| ~ well_founded_relation(X1)
| ~ relation(X1) ),
inference(cnf_transformation,[],[f28]) ).
fof(f49,plain,
relation(sK1),
inference(cnf_transformation,[],[f33]) ).
fof(f50,plain,
well_ordering(sK1),
inference(cnf_transformation,[],[f33]) ).
fof(f51,plain,
~ well_ordering(relation_restriction(sK1,sK0)),
inference(cnf_transformation,[],[f33]) ).
fof(f54,plain,
( ~ reflexive(relation_restriction(sK1,sK0))
| ~ transitive(relation_restriction(sK1,sK0))
| ~ antisymmetric(relation_restriction(sK1,sK0))
| ~ connected(relation_restriction(sK1,sK0))
| ~ well_founded_relation(relation_restriction(sK1,sK0))
| ~ relation(relation_restriction(sK1,sK0)) ),
inference(resolution,[],[f40,f51]) ).
fof(f56,definition,
( spl2_1
<=> relation(relation_restriction(sK1,sK0)) ),
introduced(definition,[new_symbols(definition,[spl2_1])],[avatar_definition]) ).
fof(f58,plain,
( ~ relation(relation_restriction(sK1,sK0))
| spl2_1 ),
inference(avatar_component_clause,[],[f56]) ).
fof(f60,definition,
( spl2_2
<=> well_founded_relation(relation_restriction(sK1,sK0)) ),
introduced(definition,[new_symbols(definition,[spl2_2])],[avatar_definition]) ).
fof(f62,plain,
( ~ well_founded_relation(relation_restriction(sK1,sK0))
| spl2_2 ),
inference(avatar_component_clause,[],[f60]) ).
fof(f64,definition,
( spl2_3
<=> connected(relation_restriction(sK1,sK0)) ),
introduced(definition,[new_symbols(definition,[spl2_3])],[avatar_definition]) ).
fof(f66,plain,
( ~ connected(relation_restriction(sK1,sK0))
| spl2_3 ),
inference(avatar_component_clause,[],[f64]) ).
fof(f68,definition,
( spl2_4
<=> antisymmetric(relation_restriction(sK1,sK0)) ),
introduced(definition,[new_symbols(definition,[spl2_4])],[avatar_definition]) ).
fof(f70,plain,
( ~ antisymmetric(relation_restriction(sK1,sK0))
| spl2_4 ),
inference(avatar_component_clause,[],[f68]) ).
fof(f72,definition,
( spl2_5
<=> transitive(relation_restriction(sK1,sK0)) ),
introduced(definition,[new_symbols(definition,[spl2_5])],[avatar_definition]) ).
fof(f74,plain,
( ~ transitive(relation_restriction(sK1,sK0))
| spl2_5 ),
inference(avatar_component_clause,[],[f72]) ).
fof(f76,definition,
( spl2_6
<=> reflexive(relation_restriction(sK1,sK0)) ),
introduced(definition,[new_symbols(definition,[spl2_6])],[avatar_definition]) ).
fof(f78,plain,
( ~ reflexive(relation_restriction(sK1,sK0))
| spl2_6 ),
inference(avatar_component_clause,[],[f76]) ).
fof(f79,plain,
( ~ spl2_1
| ~ spl2_2
| ~ spl2_3
| ~ spl2_4
| ~ spl2_5
| ~ spl2_6 ),
inference(avatar_split_clause,[],[f54,f76,f72,f68,f64,f60,f56]) ).
fof(f80,plain,
( ~ relation(sK1)
| spl2_1 ),
inference(resolution,[],[f58,f42]) ).
fof(f81,plain,
( $false
| spl2_1 ),
inference(forward_subsumption_resolution,[],[f80,f49]) ).
fof(f82,plain,
spl2_1,
inference(avatar_contradiction_clause,[],[f81]) ).
fof(f84,plain,
( ~ well_founded_relation(sK1)
| ~ relation(sK1)
| spl2_2 ),
inference(resolution,[],[f62,f48]) ).
fof(f86,plain,
( ~ well_founded_relation(sK1)
| spl2_2 ),
inference(forward_subsumption_resolution,[],[f84,f49]) ).
fof(f87,plain,
( ~ well_ordering(sK1)
| ~ relation(sK1)
| spl2_2 ),
inference(resolution,[],[f86,f35]) ).
fof(f88,plain,
( ~ relation(sK1)
| spl2_2 ),
inference(forward_subsumption_resolution,[],[f87,f50]) ).
fof(f89,plain,
( $false
| spl2_2 ),
inference(forward_subsumption_resolution,[],[f88,f49]) ).
fof(f90,plain,
spl2_2,
inference(avatar_contradiction_clause,[],[f89]) ).
fof(f91,plain,
( ~ connected(sK1)
| ~ relation(sK1)
| spl2_3 ),
inference(resolution,[],[f66,f45]) ).
fof(f93,plain,
( ~ connected(sK1)
| spl2_3 ),
inference(forward_subsumption_resolution,[],[f91,f49]) ).
fof(f97,plain,
( ~ well_ordering(sK1)
| ~ relation(sK1)
| spl2_3 ),
inference(resolution,[],[f93,f36]) ).
fof(f98,plain,
( ~ relation(sK1)
| spl2_3 ),
inference(forward_subsumption_resolution,[],[f97,f50]) ).
fof(f99,plain,
( $false
| spl2_3 ),
inference(forward_subsumption_resolution,[],[f98,f49]) ).
fof(f100,plain,
spl2_3,
inference(avatar_contradiction_clause,[],[f99]) ).
fof(f101,plain,
( ~ antisymmetric(sK1)
| ~ relation(sK1)
| spl2_4 ),
inference(resolution,[],[f70,f47]) ).
fof(f103,plain,
( ~ antisymmetric(sK1)
| spl2_4 ),
inference(forward_subsumption_resolution,[],[f101,f49]) ).
fof(f104,plain,
( ~ well_ordering(sK1)
| ~ relation(sK1)
| spl2_4 ),
inference(resolution,[],[f103,f37]) ).
fof(f105,plain,
( ~ relation(sK1)
| spl2_4 ),
inference(forward_subsumption_resolution,[],[f104,f50]) ).
fof(f106,plain,
( $false
| spl2_4 ),
inference(forward_subsumption_resolution,[],[f105,f49]) ).
fof(f107,plain,
spl2_4,
inference(avatar_contradiction_clause,[],[f106]) ).
fof(f108,plain,
( ~ transitive(sK1)
| ~ relation(sK1)
| spl2_5 ),
inference(resolution,[],[f74,f46]) ).
fof(f110,plain,
( ~ transitive(sK1)
| spl2_5 ),
inference(forward_subsumption_resolution,[],[f108,f49]) ).
fof(f111,plain,
( ~ well_ordering(sK1)
| ~ relation(sK1)
| spl2_5 ),
inference(resolution,[],[f110,f38]) ).
fof(f112,plain,
( ~ relation(sK1)
| spl2_5 ),
inference(forward_subsumption_resolution,[],[f111,f50]) ).
fof(f113,plain,
( $false
| spl2_5 ),
inference(forward_subsumption_resolution,[],[f112,f49]) ).
fof(f114,plain,
spl2_5,
inference(avatar_contradiction_clause,[],[f113]) ).
fof(f115,plain,
( ~ reflexive(sK1)
| ~ relation(sK1)
| spl2_6 ),
inference(resolution,[],[f78,f44]) ).
fof(f117,plain,
( ~ reflexive(sK1)
| spl2_6 ),
inference(forward_subsumption_resolution,[],[f115,f49]) ).
fof(f118,plain,
( ~ well_ordering(sK1)
| ~ relation(sK1)
| spl2_6 ),
inference(resolution,[],[f117,f39]) ).
fof(f119,plain,
( ~ relation(sK1)
| spl2_6 ),
inference(forward_subsumption_resolution,[],[f118,f50]) ).
fof(f120,plain,
( $false
| spl2_6 ),
inference(forward_subsumption_resolution,[],[f119,f49]) ).
fof(f121,plain,
spl2_6,
inference(avatar_contradiction_clause,[],[f120]) ).
cnf(s1,plain,
( ~ spl2_1
| ~ spl2_2
| ~ spl2_3
| ~ spl2_4
| ~ spl2_5
| ~ spl2_6 ),
inference(sat_conversion,[],[f79]) ).
cnf(s2,plain,
spl2_1,
inference(sat_conversion,[],[f82]) ).
cnf(s3,plain,
spl2_2,
inference(sat_conversion,[],[f90]) ).
cnf(s4,plain,
spl2_3,
inference(sat_conversion,[],[f100]) ).
cnf(s5,plain,
spl2_4,
inference(sat_conversion,[],[f107]) ).
cnf(s6,plain,
spl2_5,
inference(sat_conversion,[],[f114]) ).
cnf(s7,plain,
spl2_6,
inference(sat_conversion,[],[f121]) ).
cnf(s8,plain,
$false,
inference(rat,[],[s1,s7,s6,s5,s4,s3,s2]) ).
fof(f122,plain,
$false,
inference(avatar_sat_refutation,[],[s8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU257+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.39 % Computer : n019.cluster.edu
% 0.11/0.39 % Model : x86_64 x86_64
% 0.11/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.39 % Memory : 8046.5625MB
% 0.11/0.39 % OS : Linux 6.8.0-71-generic
% 0.11/0.39 % CPULimit : 300
% 0.11/0.39 % WCLimit : 300
% 0.11/0.39 % DateTime : Mon Sep 28 04:21:34 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.43 Running first-order theorem proving
% 0.11/0.43 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.87/1.14 % (3655112)Detected formulas, will run a generic FOF schedule.
% 0.87/1.14 % (3655122)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=769110784:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 0.87/1.14 % (3655122)First to succeed.
% 0.87/1.14 % (3655122)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3655112"
% 0.87/1.14 % (3655118)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=438325994:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 0.87/1.14 % (3655120)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1240582339:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 0.87/1.14 % (3655117)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=3332818473:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 0.87/1.14 % (3655119)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=4115627702:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 0.87/1.14 % (3655120)Refutation not found, incomplete strategy
% 0.87/1.14 % (3655120)------------------------------
% 0.87/1.14 % (3655120)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.87/1.14 % (3655120)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.87/1.14 % (3655120)CaDiCaL version: 2.1.3
% 0.87/1.14 % (3655120)Termination reason: Refutation not found, incomplete strategy
% 0.87/1.14 % (3655120)Time elapsed: 0.001 s
% 0.87/1.14 % (3655120)Peak memory usage: 87 MB
% 0.87/1.14 % (3655123)dis-21_1_sil=8000:lcm=predicate:random_seed=244641879: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)
% 0.87/1.14 % (3655123)Also succeeded, but the first one will report.
% 0.87/1.14 % (3655121)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1309288119:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 0.87/1.14 % (3655121)Also succeeded, but the first one will report.
% 0.87/1.14 % (3655122)Refutation found. Thanks to Tanya!
% 0.87/1.14 % SZS status Theorem for theBenchmark
% 0.87/1.14 % SZS output start Proof for theBenchmark
% See solution above
% 2.56/1.34 % (3655122)------------------------------
% 2.56/1.34 % (3655122)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.56/1.34 % (3655122)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.56/1.34 % (3655122)CaDiCaL version: 2.1.3
% 2.56/1.34 % (3655122)Termination reason: Refutation
% 2.56/1.34 % (3655122)Time elapsed: 0.003 s
% 2.56/1.34 % (3655122)Peak memory usage: 90 MB
% 2.56/1.34 % (3655122)Instructions burned: 4 (million)
% 2.56/1.34 % (3655122)------------------------------
% 2.56/1.34 % (3655122)------------------------------
% 2.56/1.34 % (3655112)Success in time 0.275 s
% 2.56/1.34 % Vampire exiting
%------------------------------------------------------------------------------