↑ Up

Vampire-SAT---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire-SAT---5.0.1
% Problem  : FLD064-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT

% Computer : n009.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 09:49:47 AM UTC 2026

% Result   : Unsatisfiable 2.43s 0.61s
% Output   : Refutation 2.43s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   16
% Syntax   : Number of formulae    :   54 (  18 unt;   3 def)
%            Number of atoms       :  105 (   2 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :  103 (  52   ~;  49   |;   0   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   3 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   33 (   0 sgn  33   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f2,axiom,
    ! [X0] :
      ( equalish(add(additive_identity,X0),X0)
      | ~ defined(X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',existence_of_identity_addition) ).

fof(f3,axiom,
    ! [X0] :
      ( equalish(add(X0,additive_inverse(X0)),additive_identity)
      | ~ defined(X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',existence_of_inverse_addition) ).

fof(f11,axiom,
    defined(additive_identity),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',well_definedness_of_additive_identity) ).

fof(f12,axiom,
    ! [X0] :
      ( defined(additive_inverse(X0))
      | ~ defined(X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',well_definedness_of_additive_inverse) ).

fof(f16,axiom,
    ! [X0,X1] :
      ( ~ less_or_equal(X1,X0)
      | ~ less_or_equal(X0,X1)
      | equalish(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',antisymmetry_of_order_relation) ).

fof(f18,axiom,
    ! [X0,X1] :
      ( less_or_equal(X1,X0)
      | less_or_equal(X0,X1)
      | ~ defined(X0)
      | ~ defined(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',totality_of_order_relation) ).

fof(f19,axiom,
    ! [X2,X0,X1] :
      ( less_or_equal(add(X0,X1),add(X2,X1))
      | ~ defined(X1)
      | ~ less_or_equal(X0,X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',compatibility_of_order_relation_and_addition) ).

fof(f22,axiom,
    ! [X0,X1] :
      ( ~ equalish(X1,X0)
      | equalish(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',symmetry_of_equality) ).

fof(f23,axiom,
    ! [X2,X0,X1] :
      ( ~ equalish(X2,X1)
      | ~ equalish(X0,X2)
      | equalish(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',transitivity_of_equality) ).

fof(f26,axiom,
    ! [X2,X0,X1] :
      ( ~ less_or_equal(X2,X1)
      | less_or_equal(X0,X1)
      | ~ equalish(X2,X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',compatibility_of_equality_and_order_relation) ).

fof(f28,axiom,
    defined(a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_is_defined) ).

fof(f29,negated_conjecture,
    less_or_equal(additive_identity,a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal_2) ).

fof(f30,negated_conjecture,
    ~ less_or_equal(additive_inverse(a),additive_identity),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_less_or_equal_3) ).

fof(f31,definition,
    sF0 = additive_inverse(a),
    introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).

fof(f32,plain,
    additive_inverse(a) = sF0,
    inference(reorient_equations,[],[f31]) ).

fof(f33,plain,
    ~ less_or_equal(sF0,additive_identity),
    inference(definition_folding,[],[f30,f32]) ).

fof(f34,plain,
    ( defined(sF0)
    | ~ defined(a) ),
    inference(superposition,[],[f12,f32]) ).

fof(f35,plain,
    defined(sF0),
    inference(forward_subsumption_resolution,[],[f34,f28]) ).

fof(f40,plain,
    ( equalish(add(a,sF0),additive_identity)
    | ~ defined(a) ),
    inference(superposition,[],[f3,f32]) ).

fof(f41,plain,
    equalish(add(a,sF0),additive_identity),
    inference(forward_subsumption_resolution,[],[f40,f28]) ).

fof(f42,plain,
    equalish(additive_identity,add(a,sF0)),
    inference(resolution,[],[f41,f22]) ).

fof(f64,plain,
    ! [X0] :
      ( ~ equalish(X0,add(a,sF0))
      | equalish(X0,additive_identity) ),
    inference(resolution,[],[f23,f41]) ).

fof(f85,plain,
    ( less_or_equal(additive_identity,sF0)
    | ~ defined(sF0)
    | ~ defined(additive_identity) ),
    inference(resolution,[],[f18,f33]) ).

fof(f91,plain,
    ! [X0] :
      ( less_or_equal(X0,X0)
      | ~ defined(X0)
      | ~ defined(X0) ),
    inference(factoring,[],[f18]) ).

fof(f92,plain,
    ! [X0] :
      ( less_or_equal(X0,X0)
      | ~ defined(X0) ),
    inference(duplicate_literal_removal,[],[f91]) ).

fof(f94,plain,
    ( less_or_equal(additive_identity,sF0)
    | ~ defined(additive_identity) ),
    inference(forward_subsumption_resolution,[],[f85,f35]) ).

fof(f97,plain,
    less_or_equal(additive_identity,sF0),
    inference(forward_subsumption_resolution,[],[f94,f11]) ).

fof(f99,plain,
    ! [X0] :
      ( ~ equalish(additive_identity,X0)
      | less_or_equal(X0,sF0) ),
    inference(resolution,[],[f97,f26]) ).

fof(f149,plain,
    ! [X2,X3,X0,X1] :
      ( ~ equalish(add(X1,X0),X3)
      | ~ less_or_equal(X1,X2)
      | less_or_equal(X3,add(X2,X0))
      | ~ defined(X0) ),
    inference(resolution,[],[f19,f26]) ).

fof(f159,plain,
    less_or_equal(add(a,sF0),sF0),
    inference(resolution,[],[f99,f42]) ).

fof(f170,plain,
    ( ~ less_or_equal(sF0,add(a,sF0))
    | equalish(sF0,add(a,sF0)) ),
    inference(resolution,[],[f159,f16]) ).

fof(f172,definition,
    ( spl1_9
  <=> equalish(sF0,add(a,sF0)) ),
    introduced(definition,[new_symbols(definition,[spl1_9])],[avatar_definition]) ).

fof(f174,plain,
    ( equalish(sF0,add(a,sF0))
    | ~ spl1_9 ),
    inference(avatar_component_clause,[],[f172]) ).

fof(f176,definition,
    ( spl1_10
  <=> less_or_equal(sF0,add(a,sF0)) ),
    introduced(definition,[new_symbols(definition,[spl1_10])],[avatar_definition]) ).

fof(f178,plain,
    ( ~ less_or_equal(sF0,add(a,sF0))
    | spl1_10 ),
    inference(avatar_component_clause,[],[f176]) ).

fof(f179,plain,
    ( spl1_9
    | ~ spl1_10 ),
    inference(avatar_split_clause,[],[f170,f176,f172]) ).

fof(f208,plain,
    ! [X0,X1] :
      ( ~ equalish(X0,X1)
      | less_or_equal(X1,X0)
      | ~ defined(X0) ),
    inference(resolution,[],[f92,f26]) ).

fof(f632,plain,
    ! [X0,X1] :
      ( ~ less_or_equal(additive_identity,X0)
      | less_or_equal(X1,add(X0,X1))
      | ~ defined(X1)
      | ~ defined(X1) ),
    inference(resolution,[],[f149,f2]) ).

fof(f646,plain,
    ! [X0,X1] :
      ( ~ less_or_equal(additive_identity,X0)
      | less_or_equal(X1,add(X0,X1))
      | ~ defined(X1) ),
    inference(duplicate_literal_removal,[],[f632]) ).

fof(f1652,plain,
    ! [X0] :
      ( less_or_equal(X0,add(a,X0))
      | ~ defined(X0) ),
    inference(resolution,[],[f646,f29]) ).

fof(f1709,plain,
    ( ~ defined(sF0)
    | spl1_10 ),
    inference(resolution,[],[f1652,f178]) ).

fof(f1711,plain,
    ( $false
    | spl1_10 ),
    inference(forward_subsumption_resolution,[],[f1709,f35]) ).

fof(f1712,plain,
    spl1_10,
    inference(avatar_contradiction_clause,[],[f1711]) ).

fof(f1736,plain,
    ( equalish(sF0,additive_identity)
    | ~ spl1_9 ),
    inference(resolution,[],[f174,f64]) ).

fof(f1772,plain,
    ( equalish(additive_identity,sF0)
    | ~ spl1_9 ),
    inference(resolution,[],[f1736,f22]) ).

fof(f1805,plain,
    ( less_or_equal(sF0,additive_identity)
    | ~ defined(additive_identity)
    | ~ spl1_9 ),
    inference(resolution,[],[f1772,f208]) ).

fof(f1806,plain,
    ( ~ defined(additive_identity)
    | ~ spl1_9 ),
    inference(forward_subsumption_resolution,[],[f1805,f33]) ).

fof(f1808,plain,
    ( $false
    | ~ spl1_9 ),
    inference(forward_subsumption_resolution,[],[f1806,f11]) ).

fof(f1809,plain,
    ~ spl1_9,
    inference(avatar_contradiction_clause,[],[f1808]) ).

cnf(s5,plain,
    ( spl1_9
    | ~ spl1_10 ),
    inference(sat_conversion,[],[f179]) ).

cnf(s54,plain,
    spl1_10,
    inference(sat_conversion,[],[f1712]) ).

cnf(s55,plain,
    ~ spl1_9,
    inference(sat_conversion,[],[f1809]) ).

cnf(s67,plain,
    $false,
    inference(rat,[],[s5,s54,s55]) ).

fof(f1810,plain,
    $false,
    inference(avatar_sat_refutation,[],[s67]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : FLD064-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.18  % Computer : n009.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 : Tue Sep 29 00:47:45 UTC 2026
% 0.08/0.18  % CPUTime  : 
% 0.08/0.18  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.21  Running first-order model finding
% 0.08/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
% 2.43/0.60  % (3664670)Will run a generic schedule for satisfiability detection.
% 2.43/0.60  % (3664680)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2542694579:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 2.43/0.60  % (3664676)% WARNING: option uhcvi not known.
% 2.43/0.60  % (3664675)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4021553287_2999 on theBenchmark for (2999ds/0Mi)
% 2.43/0.60  % (3664676)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=530946234:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 2.43/0.60  % (3664677)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=894842069:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 2.43/0.60  % (3664678)dis+10_1_sil=32000:sp=arity:random_seed=1263001569:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 2.43/0.60  % (3664679)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4068185160:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 2.43/0.60  % (3664681)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3689433099:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 2.43/0.60  % TRYING [1]
% 2.43/0.60  % TRYING [2]
% 2.43/0.60  % TRYING [3]
% 2.43/0.60  % TRYING [4]
% 2.43/0.60  % TRYING [5]
% 2.43/0.60  % (3664680)Instruction limit reached! 
% 2.43/0.60  % (3664680)------------------------------
% 2.43/0.60  % (3664680)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.43/0.60  % (3664680)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.43/0.60  % (3664680)CaDiCaL version: 2.1.3
% 2.43/0.60  % (3664680)Termination reason: Instruction limit
% 2.43/0.60  % (3664680)Termination phase: Saturation
% 2.43/0.60  % (3664680)Time elapsed: 0.044 s
% 2.43/0.60  % (3664680)Peak memory usage: 15 MB
% 2.43/0.60  % (3664680)Instructions burned: 134 (million)
% 2.43/0.60  % (3664689)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2394504710:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 2.43/0.60  % TRYING [1]
% 2.43/0.60  % TRYING [2]
% 2.43/0.60  % TRYING [3]
% 2.43/0.60  % TRYING [4]
% 2.43/0.60  % (3664678)Instruction limit reached! 
% 2.43/0.60  % (3664678)------------------------------
% 2.43/0.60  % (3664678)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.43/0.61  % (3664678)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.43/0.61  % (3664678)CaDiCaL version: 2.1.3
% 2.43/0.61  % (3664678)Termination reason: Instruction limit
% 2.43/0.61  % (3664678)Termination phase: Saturation
% 2.43/0.61  % (3664678)Time elapsed: 0.064 s
% 2.43/0.61  % (3664678)Peak memory usage: 12 MB
% 2.43/0.61  % (3664678)Instructions burned: 103 (million)
% 2.43/0.61  % (3664679)Instruction limit reached! 
% 2.43/0.61  % (3664679)------------------------------
% 2.43/0.61  % (3664679)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.43/0.61  % (3664679)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.43/0.61  % (3664679)CaDiCaL version: 2.1.3
% 2.43/0.61  % (3664679)Termination reason: Instruction limit
% 2.43/0.61  % (3664679)Termination phase: Saturation
% 2.43/0.61  % (3664679)Time elapsed: 0.065 s
% 2.43/0.61  % (3664679)Peak memory usage: 11 MB
% 2.43/0.61  % (3664679)Instructions burned: 117 (million)
% 2.43/0.61  % (3664691)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=761040625:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 2.43/0.61  % (3664692)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=2681079992:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 2.43/0.61  % TRYING [5]
% 2.43/0.61  % (3664681)Instruction limit reached! 
% 2.43/0.61  % (3664681)------------------------------
% 2.43/0.61  % (3664681)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.43/0.61  % (3664681)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.43/0.61  % (3664681)CaDiCaL version: 2.1.3
% 2.43/0.61  % (3664681)Termination reason: Instruction limit
% 2.43/0.61  % (3664681)Termination phase: Saturation
% 2.43/0.61  % (3664681)Time elapsed: 0.098 s
% 2.43/0.61  % (3664681)Peak memory usage: 14 MB
% 2.43/0.61  % (3664681)Instructions burned: 160 (million)
% 2.43/0.61  % (3664695)ott-21_1_sil=16000:fs=off:random_seed=504978561:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 2.43/0.61  % (3664691)Instruction limit reached! 
% 2.43/0.61  % (3664691)------------------------------
% 2.43/0.61  % (3664691)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.43/0.61  % (3664691)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.43/0.61  % (3664691)CaDiCaL version: 2.1.3
% 2.43/0.61  % (3664691)Termination reason: Instruction limit
% 2.43/0.61  % (3664691)Termination phase: Saturation
% 2.43/0.61  % (3664691)Time elapsed: 0.044 s
% 2.43/0.61  % (3664691)Peak memory usage: 15 MB
% 2.43/0.61  % (3664691)Instructions burned: 133 (million)
% 2.43/0.61  % (3664697)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=1265445725:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 2.43/0.61  % TRYING [6]
% 2.43/0.61  % (3664695)Instruction limit reached! 
% 2.43/0.61  % (3664695)------------------------------
% 2.43/0.61  % (3664695)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.43/0.61  % (3664695)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.43/0.61  % (3664695)CaDiCaL version: 2.1.3
% 2.43/0.61  % (3664695)Termination reason: Instruction limit
% 2.43/0.61  % (3664695)Termination phase: Saturation
% 2.43/0.61  % (3664695)Time elapsed: 0.097 s
% 2.43/0.61  % (3664695)Peak memory usage: 12 MB
% 2.43/0.61  % (3664695)Instructions burned: 182 (million)
% 2.43/0.61  % (3664699)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=1002545280:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 2.43/0.61  % TRYING [1]
% 2.43/0.61  % TRYING [2]
% 2.43/0.61  % TRYING [3]
% 2.43/0.61  % TRYING [4]
% 2.43/0.61  % TRYING [6]
% 2.43/0.61  % TRYING [5]
% 2.43/0.61  % (3664697)Instruction limit reached! 
% 2.43/0.61  % (3664697)------------------------------
% 2.43/0.61  % (3664697)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.43/0.61  % (3664697)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.43/0.61  % (3664697)CaDiCaL version: 2.1.3
% 2.43/0.61  % (3664697)Termination reason: Instruction limit
% 2.43/0.61  % (3664697)Termination phase: Saturation
% 2.43/0.61  % (3664697)Time elapsed: 0.171 s
% 2.43/0.61  % (3664697)Peak memory usage: 15 MB
% 2.43/0.61  % (3664697)Instructions burned: 478 (million)
% 2.43/0.61  % (3664701)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=1351064528:i=1179_2996 on theBenchmark for (2996ds/1179Mi)
% 2.43/0.61  % (3664701) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3664670-3664701"...
% 2.43/0.61  % (3664701)...printing done.
% 2.43/0.61  % (3664701)Refutation found. Thanks to Tanya!
% 2.43/0.61  % SZS status Unsatisfiable for theBenchmark
% 2.43/0.61  % SZS output start Proof for theBenchmark
% See solution above
% 2.43/0.61  % (3664701)------------------------------
% 2.43/0.61  % (3664701)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.43/0.61  % (3664701)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.43/0.61  % (3664701)CaDiCaL version: 2.1.3
% 2.43/0.61  % (3664701)Termination reason: Refutation
% 2.43/0.61  % (3664701)Time elapsed: 0.025 s
% 2.43/0.61  % (3664701)Peak memory usage: 13 MB
% 2.43/0.61  % (3664701)Instructions burned: 66 (million)
% 2.43/0.61  % (3664670)Success in time 0.385 s
% 2.43/0.61  % Vampire exiting
%------------------------------------------------------------------------------