%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SYN415+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n018.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:50:32 PM UTC 2026
% Result : Theorem 3.10s 1.09s
% Output : Refutation 3.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 13
% Syntax : Number of formulae : 86 ( 8 unt; 12 def)
% Number of atoms : 287 ( 41 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 337 ( 136 ~; 143 |; 37 &)
% ( 14 <=>; 4 =>; 0 <=; 3 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 15 ( 13 usr; 13 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 80 ( 0 sgn 57 !; 23 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ( ? [X0] : f(X0)
& ! [X1,X2] :
( ( f(X1)
& f(X2) )
=> X1 = X2 ) )
<=> ? [X3] :
( f(X3)
& ! [X4] :
( f(X4)
=> X3 = X4 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',kalish317) ).
fof(f2,negated_conjecture,
~ ( ( ? [X0] : f(X0)
& ! [X1,X2] :
( ( f(X1)
& f(X2) )
=> X1 = X2 ) )
<=> ? [X3] :
( f(X3)
& ! [X4] :
( f(X4)
=> X3 = X4 ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
( ( ? [X0] : f(X0)
& ! [X1,X2] :
( X1 = X2
| ~ f(X1)
| ~ f(X2) ) )
<~> ? [X3] :
( f(X3)
& ! [X4] :
( X3 = X4
| ~ f(X4) ) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f4,plain,
( ( ? [X0] : f(X0)
& ! [X1,X2] :
( X1 = X2
| ~ f(X1)
| ~ f(X2) ) )
<~> ? [X3] :
( f(X3)
& ! [X4] :
( X3 = X4
| ~ f(X4) ) ) ),
inference(flattening,[],[f3]) ).
fof(f5,definition,
( sP0
<=> ( ? [X0] : f(X0)
& ! [X1,X2] :
( X1 = X2
| ~ f(X1)
| ~ f(X2) ) ) ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f6,plain,
( sP0
<~> ? [X3] :
( f(X3)
& ! [X4] :
( X3 = X4
| ~ f(X4) ) ) ),
inference(definition_folding,[],[f4,f5]) ).
fof(f7,plain,
( ( sP0
| ! [X0] : ~ f(X0)
| ? [X1,X2] :
( X1 != X2
& f(X1)
& f(X2) ) )
& ( ( ? [X0] : f(X0)
& ! [X1,X2] :
( X1 = X2
| ~ f(X1)
| ~ f(X2) ) )
| ~ sP0 ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f8,plain,
( ( sP0
| ! [X0] : ~ f(X0)
| ? [X1,X2] :
( X1 != X2
& f(X1)
& f(X2) ) )
& ( ( ? [X0] : f(X0)
& ! [X1,X2] :
( X1 = X2
| ~ f(X1)
| ~ f(X2) ) )
| ~ sP0 ) ),
inference(flattening,[],[f7]) ).
fof(f9,plain,
( ( sP0
| ! [X0] : ~ f(X0)
| ? [X1,X2] :
( X1 != X2
& f(X1)
& f(X2) ) )
& ( ( ? [X3] : f(X3)
& ! [X4,X5] :
( X4 = X5
| ~ f(X4)
| ~ f(X5) ) )
| ~ sP0 ) ),
inference(rectify,[],[f8]) ).
fof(f10,plain,
( ( sP0
| ! [X0] : ~ f(X0)
| ( sK1 != sK2
& f(sK1)
& f(sK2) ) )
& ( ( f(sK3)
& ! [X4,X5] :
( X4 = X5
| ~ f(X4)
| ~ f(X5) ) )
| ~ sP0 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2,sK3]),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f9]) ).
fof(f11,plain,
( ( ! [X3] :
( ~ f(X3)
| ? [X4] :
( X3 != X4
& f(X4) ) )
| ~ sP0 )
& ( ? [X3] :
( f(X3)
& ! [X4] :
( X3 = X4
| ~ f(X4) ) )
| sP0 ) ),
inference(nnf_transformation,[],[f6]) ).
fof(f12,plain,
( ( ! [X0] :
( ~ f(X0)
| ? [X1] :
( X0 != X1
& f(X1) ) )
| ~ sP0 )
& ( ? [X2] :
( f(X2)
& ! [X3] :
( X2 = X3
| ~ f(X3) ) )
| sP0 ) ),
inference(rectify,[],[f11]) ).
fof(f13,plain,
( ( ! [X0] :
( ~ f(X0)
| ( sK4(X0) != X0
& f(sK4(X0)) ) )
| ~ sP0 )
& ( ( f(sK5)
& ! [X3] :
( sK5 = X3
| ~ f(X3) ) )
| sP0 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4,sK5]),skolemize(X1,sK4(X0)),skolemize(X2,sK5)],[f12]) ).
fof(f14,plain,
! [X4,X5] :
( X4 = X5
| ~ f(X4)
| ~ f(X5)
| ~ sP0 ),
inference(cnf_transformation,[],[f10]) ).
fof(f15,plain,
( f(sK3)
| ~ sP0 ),
inference(cnf_transformation,[],[f10]) ).
fof(f16,plain,
! [X0] :
( sP0
| ~ f(X0)
| f(sK2) ),
inference(cnf_transformation,[],[f10]) ).
fof(f17,plain,
! [X0] :
( sP0
| ~ f(X0)
| f(sK1) ),
inference(cnf_transformation,[],[f10]) ).
fof(f18,plain,
! [X0] :
( sP0
| ~ f(X0)
| sK1 != sK2 ),
inference(cnf_transformation,[],[f10]) ).
fof(f19,plain,
! [X3] :
( sK5 = X3
| ~ f(X3)
| sP0 ),
inference(cnf_transformation,[],[f13]) ).
fof(f20,plain,
( f(sK5)
| sP0 ),
inference(cnf_transformation,[],[f13]) ).
fof(f21,plain,
! [X0] :
( ~ f(X0)
| f(sK4(X0))
| ~ sP0 ),
inference(cnf_transformation,[],[f13]) ).
fof(f22,plain,
! [X0] :
( ~ f(X0)
| sK4(X0) != X0
| ~ sP0 ),
inference(cnf_transformation,[],[f13]) ).
fof(f24,definition,
( spl6_1
<=> sP0 ),
introduced(definition,[new_symbols(definition,[spl6_1])],[avatar_definition]) ).
fof(f28,definition,
( spl6_2
<=> ! [X3] :
( sK5 = X3
| ~ f(X3) ) ),
introduced(definition,[new_symbols(definition,[spl6_2])],[avatar_definition]) ).
fof(f29,plain,
( ! [X3] :
( ~ f(X3)
| sK5 = X3 )
| ~ spl6_2 ),
inference(avatar_component_clause,[],[f28]) ).
fof(f30,plain,
( spl6_1
| spl6_2 ),
inference(avatar_split_clause,[],[f19,f28,f24]) ).
fof(f32,definition,
( spl6_3
<=> f(sK5) ),
introduced(definition,[new_symbols(definition,[spl6_3])],[avatar_definition]) ).
fof(f34,plain,
( f(sK5)
| ~ spl6_3 ),
inference(avatar_component_clause,[],[f32]) ).
fof(f35,plain,
( spl6_1
| spl6_3 ),
inference(avatar_split_clause,[],[f20,f32,f24]) ).
fof(f37,definition,
( spl6_4
<=> ! [X0] :
( ~ f(X0)
| f(sK4(X0)) ) ),
introduced(definition,[new_symbols(definition,[spl6_4])],[avatar_definition]) ).
fof(f38,plain,
( ! [X0] :
( f(sK4(X0))
| ~ f(X0) )
| ~ spl6_4 ),
inference(avatar_component_clause,[],[f37]) ).
fof(f39,plain,
( ~ spl6_1
| spl6_4 ),
inference(avatar_split_clause,[],[f21,f37,f24]) ).
fof(f41,definition,
( spl6_5
<=> ! [X0] :
( ~ f(X0)
| sK4(X0) != X0 ) ),
introduced(definition,[new_symbols(definition,[spl6_5])],[avatar_definition]) ).
fof(f42,plain,
( ! [X0] :
( sK4(X0) != X0
| ~ f(X0) )
| ~ spl6_5 ),
inference(avatar_component_clause,[],[f41]) ).
fof(f43,plain,
( ~ spl6_1
| spl6_5 ),
inference(avatar_split_clause,[],[f22,f41,f24]) ).
fof(f45,definition,
( spl6_6
<=> ! [X4,X5] :
( X4 = X5
| ~ f(X5)
| ~ f(X4) ) ),
introduced(definition,[new_symbols(definition,[spl6_6])],[avatar_definition]) ).
fof(f46,plain,
( ! [X4,X5] :
( ~ f(X5)
| X4 = X5
| ~ f(X4) )
| ~ spl6_6 ),
inference(avatar_component_clause,[],[f45]) ).
fof(f47,plain,
( ~ spl6_1
| spl6_6 ),
inference(avatar_split_clause,[],[f14,f45,f24]) ).
fof(f49,definition,
( spl6_7
<=> f(sK3) ),
introduced(definition,[new_symbols(definition,[spl6_7])],[avatar_definition]) ).
fof(f51,plain,
( f(sK3)
| ~ spl6_7 ),
inference(avatar_component_clause,[],[f49]) ).
fof(f52,plain,
( ~ spl6_1
| spl6_7 ),
inference(avatar_split_clause,[],[f15,f49,f24]) ).
fof(f54,definition,
( spl6_8
<=> f(sK2) ),
introduced(definition,[new_symbols(definition,[spl6_8])],[avatar_definition]) ).
fof(f56,plain,
( f(sK2)
| ~ spl6_8 ),
inference(avatar_component_clause,[],[f54]) ).
fof(f58,definition,
( spl6_9
<=> ! [X0] : ~ f(X0) ),
introduced(definition,[new_symbols(definition,[spl6_9])],[avatar_definition]) ).
fof(f59,plain,
( ! [X0] : ~ f(X0)
| ~ spl6_9 ),
inference(avatar_component_clause,[],[f58]) ).
fof(f60,plain,
( spl6_8
| spl6_9
| spl6_1 ),
inference(avatar_split_clause,[],[f16,f24,f58,f54]) ).
fof(f62,definition,
( spl6_10
<=> f(sK1) ),
introduced(definition,[new_symbols(definition,[spl6_10])],[avatar_definition]) ).
fof(f64,plain,
( f(sK1)
| ~ spl6_10 ),
inference(avatar_component_clause,[],[f62]) ).
fof(f65,plain,
( spl6_10
| spl6_9
| spl6_1 ),
inference(avatar_split_clause,[],[f17,f24,f58,f62]) ).
fof(f67,definition,
( spl6_11
<=> sK1 = sK2 ),
introduced(definition,[new_symbols(definition,[spl6_11])],[avatar_definition]) ).
fof(f69,plain,
( sK1 != sK2
| spl6_11 ),
inference(avatar_component_clause,[],[f67]) ).
fof(f70,plain,
( ~ spl6_11
| spl6_9
| spl6_1 ),
inference(avatar_split_clause,[],[f18,f24,f58,f67]) ).
fof(f72,plain,
( $false
| ~ spl6_3
| ~ spl6_9 ),
inference(resolution,[],[f59,f34]) ).
fof(f73,plain,
( ~ spl6_3
| ~ spl6_9 ),
inference(avatar_contradiction_clause,[],[f72]) ).
fof(f74,plain,
( sK2 = sK5
| ~ spl6_2
| ~ spl6_8 ),
inference(resolution,[],[f56,f29]) ).
fof(f75,plain,
( sK1 = sK5
| ~ spl6_2
| ~ spl6_10 ),
inference(resolution,[],[f64,f29]) ).
fof(f77,plain,
( sK1 = sK2
| ~ spl6_2
| ~ spl6_8
| ~ spl6_10 ),
inference(superposition,[],[f75,f74]) ).
fof(f82,plain,
( $false
| ~ spl6_2
| ~ spl6_8
| ~ spl6_10
| spl6_11 ),
inference(forward_subsumption_resolution,[],[f77,f69]) ).
fof(f83,plain,
( ~ spl6_2
| ~ spl6_8
| ~ spl6_10
| spl6_11 ),
inference(avatar_contradiction_clause,[],[f82]) ).
fof(f101,plain,
( ! [X0,X1] :
( ~ f(X0)
| sK4(X1) = X0
| ~ f(X1) )
| ~ spl6_4
| ~ spl6_6 ),
inference(resolution,[],[f46,f38]) ).
fof(f107,plain,
( ! [X0] :
( ~ f(X0)
| sK4(X0) = X0 )
| ~ spl6_4
| ~ spl6_6 ),
inference(factoring,[],[f101]) ).
fof(f108,plain,
( ! [X0] : ~ f(X0)
| ~ spl6_4
| ~ spl6_5
| ~ spl6_6 ),
inference(forward_subsumption_resolution,[],[f107,f42]) ).
fof(f109,plain,
( spl6_9
| ~ spl6_4
| ~ spl6_5
| ~ spl6_6 ),
inference(avatar_split_clause,[],[f108,f45,f41,f37,f58]) ).
fof(f112,plain,
( $false
| ~ spl6_7
| ~ spl6_9 ),
inference(resolution,[],[f59,f51]) ).
fof(f114,plain,
( ~ spl6_7
| ~ spl6_9 ),
inference(avatar_contradiction_clause,[],[f112]) ).
cnf(s1,plain,
( spl6_1
| spl6_2 ),
inference(sat_conversion,[],[f30]) ).
cnf(s2,plain,
( spl6_1
| spl6_3 ),
inference(sat_conversion,[],[f35]) ).
cnf(s3,plain,
( ~ spl6_1
| spl6_4 ),
inference(sat_conversion,[],[f39]) ).
cnf(s4,plain,
( ~ spl6_1
| spl6_5 ),
inference(sat_conversion,[],[f43]) ).
cnf(s5,plain,
( ~ spl6_1
| spl6_6 ),
inference(sat_conversion,[],[f47]) ).
cnf(s6,plain,
( ~ spl6_1
| spl6_7 ),
inference(sat_conversion,[],[f52]) ).
cnf(s7,plain,
( spl6_1
| spl6_8
| spl6_9 ),
inference(sat_conversion,[],[f60]) ).
cnf(s8,plain,
( spl6_1
| spl6_9
| spl6_10 ),
inference(sat_conversion,[],[f65]) ).
cnf(s9,plain,
( spl6_1
| spl6_9
| ~ spl6_11 ),
inference(sat_conversion,[],[f70]) ).
cnf(s10,plain,
( ~ spl6_3
| ~ spl6_9 ),
inference(sat_conversion,[],[f73]) ).
cnf(s12,plain,
( ~ spl6_2
| ~ spl6_8
| ~ spl6_10
| spl6_11 ),
inference(sat_conversion,[],[f83]) ).
cnf(s16,plain,
( ~ spl6_4
| ~ spl6_5
| ~ spl6_6
| spl6_9 ),
inference(sat_conversion,[],[f109]) ).
cnf(s17,plain,
( ~ spl6_7
| ~ spl6_9 ),
inference(sat_conversion,[],[f114]) ).
cnf(s18,plain,
spl6_1,
inference(rat,[],[s12,s7,s8,s9,s10,s1,s2]) ).
cnf(s19,plain,
spl6_7,
inference(rat,[],[s6,s18]) ).
cnf(s20,plain,
spl6_6,
inference(rat,[],[s5,s18]) ).
cnf(s21,plain,
spl6_5,
inference(rat,[],[s4,s18]) ).
cnf(s22,plain,
spl6_4,
inference(rat,[],[s3,s18]) ).
cnf(s23,plain,
~ spl6_9,
inference(rat,[],[s17,s19]) ).
cnf(s24,plain,
$false,
inference(rat,[],[s16,s23,s20,s21,s22]) ).
fof(f115,plain,
$false,
inference(avatar_sat_refutation,[],[s24]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN415+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.18 % Computer : n018.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % OS : Linux 6.8.0-71-generic
% 0.08/0.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Mon Sep 28 15:56:55 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.22 Running first-order theorem proving
% 0.08/0.22 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
% 3.10/1.09 % (3505264)Detected formulas, will run a generic FOF schedule.
% 3.10/1.09 % (3505273)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=4010372974:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.10/1.09 % (3505273)Refutation not found, incomplete strategy
% 3.10/1.09 % (3505273)------------------------------
% 3.10/1.09 % (3505273)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.10/1.09 % (3505273)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.10/1.09 % (3505273)CaDiCaL version: 2.1.3
% 3.10/1.09 % (3505273)Termination reason: Refutation not found, incomplete strategy
% 3.10/1.09 % (3505273)Time elapsed: 0.001 s
% 3.10/1.09 % (3505273)Peak memory usage: 88 MB
% 3.10/1.09 % (3505270)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=2297290288:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.10/1.09 % (3505269)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=2384908735:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.10/1.09 % (3505274)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3838870015:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.10/1.09 % (3505275)dis-21_1_sil=8000:lcm=predicate:random_seed=3487007649: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)
% 3.10/1.09 % (3505271)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=1067433021:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.10/1.09 % (3505272)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1306938051:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.10/1.09 % (3505275)Refutation not found, incomplete strategy
% 3.10/1.09 % (3505275)------------------------------
% 3.10/1.09 % (3505275)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.10/1.09 % (3505275)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.10/1.09 % (3505275)CaDiCaL version: 2.1.3
% 3.10/1.09 % (3505275)Termination reason: Refutation not found, incomplete strategy
% 3.10/1.09 % (3505275)Time elapsed: 0.002 s
% 3.10/1.09 % (3505275)Peak memory usage: 88 MB
% 3.10/1.09 % (3505272)Refutation not found, incomplete strategy
% 3.10/1.09 % (3505272)------------------------------
% 3.10/1.09 % (3505272)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.10/1.09 % (3505272)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.10/1.09 % (3505272)CaDiCaL version: 2.1.3
% 3.10/1.09 % (3505272)Termination reason: Refutation not found, incomplete strategy
% 3.10/1.09 % (3505272)Time elapsed: 0.002 s
% 3.10/1.09 % (3505272)Peak memory usage: 88 MB
% 3.10/1.09 % (3505274)First to succeed.
% 3.10/1.09 % (3505274)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3505264"
% 3.10/1.09 % (3505273)------------------------------
% 3.10/1.09 % (3505273)------------------------------
% 3.10/1.09 % (3505283)lrs+10_1_sil=8000:sp=occurrence:random_seed=1673474732:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 3.10/1.09 % (3505283)Also succeeded, but the first one will report.
% 3.10/1.09 % (3505272)------------------------------
% 3.10/1.09 % (3505272)------------------------------
% 3.10/1.09 % (3505275)------------------------------
% 3.10/1.09 % (3505275)------------------------------
% 3.10/1.09 % (3505274)Refutation found. Thanks to Tanya!
% 3.10/1.09 % SZS status Theorem for theBenchmark
% 3.10/1.09 % SZS output start Proof for theBenchmark
% See solution above
% 3.67/1.29 % (3505274)------------------------------
% 3.67/1.29 % (3505274)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.67/1.29 % (3505274)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.67/1.29 % (3505274)CaDiCaL version: 2.1.3
% 3.67/1.29 % (3505274)Termination reason: Refutation
% 3.67/1.29 % (3505274)Time elapsed: 0.004 s
% 3.67/1.29 % (3505274)Peak memory usage: 89 MB
% 3.67/1.29 % (3505274)Instructions burned: 3 (million)
% 3.67/1.29 % (3505274)------------------------------
% 3.67/1.29 % (3505274)------------------------------
% 3.67/1.29 % (3505264)Success in time 0.43 s
% 3.67/1.29 % Vampire exiting
%------------------------------------------------------------------------------