%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU156+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 : n011.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:47:28 PM UTC 2026
% Result : Theorem 2.35s 1.16s
% Output : Refutation 2.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 33
% Number of leaves : 7
% Syntax : Number of formulae : 68 ( 14 unt; 0 def)
% Number of atoms : 165 ( 164 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 145 ( 48 ~; 87 |; 6 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 100 ( 96 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(f2,axiom,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_tarski) ).
fof(f10,axiom,
! [X0,X1,X2,X3] :
~ ( unordered_pair(X0,X1) = unordered_pair(X2,X3)
& X0 != X2
& X0 != X3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t10_zfmisc_1) ).
fof(f11,conjecture,
! [X0,X1,X2,X3] :
( ordered_pair(X0,X1) = ordered_pair(X2,X3)
=> ( X0 = X2
& X1 = X3 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t33_zfmisc_1) ).
fof(f12,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( ordered_pair(X0,X1) = ordered_pair(X2,X3)
=> ( X0 = X2
& X1 = X3 ) ),
inference(negated_conjecture,[status(cth)],[f11]) ).
fof(f13,axiom,
! [X0] : unordered_pair(X0,X0) = singleton(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t69_enumset1) ).
fof(f15,axiom,
! [X0,X1,X2] :
( singleton(X0) = unordered_pair(X1,X2)
=> X0 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t8_zfmisc_1) ).
fof(f16,axiom,
! [X0,X1,X2] :
( singleton(X0) = unordered_pair(X1,X2)
=> X1 = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t9_zfmisc_1) ).
fof(f17,plain,
? [X0,X1,X2,X3] :
( ( X0 != X2
| X1 != X3 )
& ordered_pair(X0,X1) = ordered_pair(X2,X3) ),
inference(ennf_transformation,[],[f12]) ).
fof(f18,plain,
! [X0,X1,X2,X3] :
( unordered_pair(X0,X1) != unordered_pair(X2,X3)
| X0 = X2
| X0 = X3 ),
inference(ennf_transformation,[],[f10]) ).
fof(f19,plain,
! [X0,X1,X2] :
( X1 = X2
| singleton(X0) != unordered_pair(X1,X2) ),
inference(ennf_transformation,[],[f16]) ).
fof(f20,plain,
! [X0,X1,X2] :
( X0 = X1
| singleton(X0) != unordered_pair(X1,X2) ),
inference(ennf_transformation,[],[f15]) ).
fof(f21,plain,
( ( sK0 != sK2
| sK1 != sK3 )
& ordered_pair(sK0,sK1) = ordered_pair(sK2,sK3) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f17]) ).
fof(f24,plain,
ordered_pair(sK0,sK1) = ordered_pair(sK2,sK3),
inference(cnf_transformation,[],[f21]) ).
fof(f25,plain,
( sK1 != sK3
| sK0 != sK2 ),
inference(cnf_transformation,[],[f21]) ).
fof(f27,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
inference(cnf_transformation,[],[f2]) ).
fof(f30,plain,
! [X2,X3,X0,X1] :
( unordered_pair(X0,X1) != unordered_pair(X2,X3)
| X0 = X2
| X0 = X3 ),
inference(cnf_transformation,[],[f18]) ).
fof(f31,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f32,plain,
! [X2,X0,X1] :
( X1 = X2
| singleton(X0) != unordered_pair(X1,X2) ),
inference(cnf_transformation,[],[f19]) ).
fof(f33,plain,
! [X2,X0,X1] :
( X0 = X1
| singleton(X0) != unordered_pair(X1,X2) ),
inference(cnf_transformation,[],[f20]) ).
fof(f34,plain,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
inference(cnf_transformation,[],[f13]) ).
fof(f35,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),unordered_pair(X0,X0)),
inference(definition_unfolding,[],[f27,f34]) ).
fof(f36,plain,
unordered_pair(unordered_pair(sK0,sK1),unordered_pair(sK0,sK0)) = unordered_pair(unordered_pair(sK2,sK3),unordered_pair(sK2,sK2)),
inference(definition_unfolding,[],[f24,f35,f35]) ).
fof(f38,plain,
! [X2,X0,X1] :
( unordered_pair(X0,X0) != unordered_pair(X1,X2)
| X1 = X2 ),
inference(definition_unfolding,[],[f32,f34]) ).
fof(f39,plain,
! [X2,X0,X1] :
( unordered_pair(X0,X0) != unordered_pair(X1,X2)
| X0 = X1 ),
inference(definition_unfolding,[],[f33,f34]) ).
fof(f64,plain,
! [X2,X0,X1] :
( unordered_pair(X0,X1) != unordered_pair(X2,X2)
| X1 = X2 ),
inference(superposition,[],[f39,f31]) ).
fof(f69,plain,
! [X0,X1] :
( unordered_pair(X0,X1) != unordered_pair(unordered_pair(sK0,sK1),unordered_pair(sK0,sK0))
| unordered_pair(sK2,sK3) = X0
| unordered_pair(sK2,sK3) = X1 ),
inference(superposition,[],[f30,f36]) ).
fof(f73,plain,
! [X0,X1] :
( unordered_pair(X0,X1) != unordered_pair(unordered_pair(sK0,sK1),unordered_pair(sK0,sK0))
| unordered_pair(sK2,sK3) = X0
| unordered_pair(sK2,sK2) = X0 ),
inference(superposition,[],[f30,f36]) ).
fof(f78,plain,
! [X0,X1] :
( unordered_pair(X0,X1) != unordered_pair(unordered_pair(sK1,sK0),unordered_pair(sK0,sK0))
| unordered_pair(sK2,sK3) = X0
| unordered_pair(sK2,sK2) = X0 ),
inference(forward_demodulation,[],[f73,f31]) ).
fof(f79,plain,
! [X0,X1] :
( unordered_pair(X0,X1) != unordered_pair(unordered_pair(sK1,sK0),unordered_pair(sK0,sK0))
| unordered_pair(sK2,sK3) = X0
| unordered_pair(sK2,sK3) = X1 ),
inference(forward_demodulation,[],[f69,f31]) ).
fof(f80,plain,
! [X0,X1] :
( unordered_pair(X0,X1) != unordered_pair(unordered_pair(sK1,sK0),unordered_pair(sK0,sK0))
| unordered_pair(sK3,sK2) = X0
| unordered_pair(sK2,sK2) = X0 ),
inference(forward_demodulation,[],[f78,f31]) ).
fof(f81,plain,
! [X0,X1] :
( unordered_pair(sK3,sK2) = X0
| unordered_pair(X0,X1) != unordered_pair(unordered_pair(sK1,sK0),unordered_pair(sK0,sK0))
| unordered_pair(sK2,sK3) = X1 ),
inference(forward_demodulation,[],[f79,f31]) ).
fof(f82,plain,
! [X0,X1] :
( unordered_pair(X0,X1) != unordered_pair(unordered_pair(sK1,sK0),unordered_pair(sK0,sK0))
| unordered_pair(sK3,sK2) = X0
| unordered_pair(sK3,sK2) = X1 ),
inference(forward_demodulation,[],[f81,f31]) ).
fof(f84,plain,
! [X0,X1] :
( unordered_pair(X0,X1) != unordered_pair(unordered_pair(sK1,sK0),unordered_pair(sK0,sK0))
| unordered_pair(sK3,sK2) = X1
| unordered_pair(sK2,sK2) = X1 ),
inference(superposition,[],[f80,f31]) ).
fof(f86,plain,
( unordered_pair(sK3,sK2) = unordered_pair(sK1,sK0)
| unordered_pair(sK2,sK2) = unordered_pair(sK1,sK0) ),
inference(equality_resolution,[],[f80]) ).
fof(f89,plain,
! [X0,X1] :
( unordered_pair(X0,X1) != unordered_pair(sK1,sK0)
| sK3 = X0
| sK3 = X1
| unordered_pair(sK2,sK2) = unordered_pair(sK1,sK0) ),
inference(superposition,[],[f30,f86]) ).
fof(f90,plain,
! [X0,X1] :
( unordered_pair(X0,X1) != unordered_pair(sK1,sK0)
| sK3 = X0
| sK2 = X0
| unordered_pair(sK2,sK2) = unordered_pair(sK1,sK0) ),
inference(superposition,[],[f30,f86]) ).
fof(f97,plain,
( unordered_pair(sK3,sK2) = unordered_pair(sK1,sK0)
| unordered_pair(sK0,sK0) = unordered_pair(sK3,sK2) ),
inference(equality_resolution,[],[f82]) ).
fof(f103,plain,
! [X0] :
( unordered_pair(X0,X0) != unordered_pair(sK1,sK0)
| sK2 = sK3
| unordered_pair(sK0,sK0) = unordered_pair(sK3,sK2) ),
inference(superposition,[],[f38,f97]) ).
fof(f105,plain,
! [X0] :
( unordered_pair(X0,X0) != unordered_pair(sK1,sK0)
| sK2 = sK3 ),
inference(forward_subsumption_resolution,[],[f103,f38]) ).
fof(f137,plain,
! [X0] :
( unordered_pair(X0,X0) != unordered_pair(sK1,sK0)
| sK2 = X0
| unordered_pair(sK2,sK2) = unordered_pair(sK1,sK0) ),
inference(superposition,[],[f64,f86]) ).
fof(f160,plain,
( unordered_pair(sK2,sK2) = unordered_pair(sK1,sK0)
| sK0 = sK3
| sK1 = sK3 ),
inference(equality_resolution,[],[f89]) ).
fof(f183,plain,
( unordered_pair(sK1,sK0) != unordered_pair(sK1,sK0)
| sK2 = sK3
| sK0 = sK3
| sK1 = sK3 ),
inference(superposition,[],[f105,f160]) ).
fof(f184,plain,
( sK2 = sK3
| sK0 = sK3
| sK1 = sK3 ),
inference(trivial_inequality_removal,[],[f183]) ).
fof(f203,plain,
( unordered_pair(sK1,sK0) = unordered_pair(sK3,sK3)
| sK0 = sK3
| sK1 = sK3
| sK0 = sK3
| sK1 = sK3 ),
inference(superposition,[],[f160,f184]) ).
fof(f204,plain,
( unordered_pair(sK1,sK0) = unordered_pair(sK3,sK3)
| sK0 = sK3
| sK1 = sK3 ),
inference(duplicate_literal_removal,[],[f203]) ).
fof(f206,plain,
( sK1 = sK3
| sK0 = sK3 ),
inference(forward_subsumption_resolution,[],[f204,f30]) ).
fof(f215,plain,
( unordered_pair(sK0,sK0) = unordered_pair(sK3,sK2)
| unordered_pair(sK0,sK0) = unordered_pair(sK2,sK2) ),
inference(equality_resolution,[],[f84]) ).
fof(f216,plain,
( sK1 != sK1
| sK0 != sK2
| sK0 = sK3 ),
inference(superposition,[],[f25,f206]) ).
fof(f224,plain,
( sK0 != sK2
| sK0 = sK3 ),
inference(trivial_inequality_removal,[],[f216]) ).
fof(f266,plain,
( unordered_pair(sK3,sK2) != unordered_pair(sK1,sK0)
| sK0 = sK2
| unordered_pair(sK2,sK2) = unordered_pair(sK1,sK0)
| unordered_pair(sK0,sK0) = unordered_pair(sK2,sK2) ),
inference(superposition,[],[f137,f215]) ).
fof(f272,plain,
( sK0 = sK2
| unordered_pair(sK2,sK2) = unordered_pair(sK1,sK0)
| unordered_pair(sK0,sK0) = unordered_pair(sK2,sK2) ),
inference(forward_subsumption_resolution,[],[f266,f86]) ).
fof(f276,plain,
( sK0 = sK2
| unordered_pair(sK2,sK2) = unordered_pair(sK1,sK0) ),
inference(forward_subsumption_resolution,[],[f272,f39]) ).
fof(f277,plain,
sK0 = sK2,
inference(forward_subsumption_resolution,[],[f276,f64]) ).
fof(f289,plain,
( sK0 != sK0
| sK0 = sK3 ),
inference(superposition,[],[f224,f277]) ).
fof(f290,plain,
sK0 = sK3,
inference(trivial_inequality_removal,[],[f289]) ).
fof(f377,plain,
! [X0,X1] :
( unordered_pair(X0,X1) != unordered_pair(sK1,sK3)
| sK3 = X0
| sK2 = X0
| unordered_pair(sK2,sK2) = unordered_pair(sK1,sK0) ),
inference(forward_demodulation,[],[f90,f290]) ).
fof(f378,plain,
! [X0,X1] :
( sK0 = X0
| unordered_pair(X0,X1) != unordered_pair(sK1,sK3)
| sK3 = X0
| unordered_pair(sK2,sK2) = unordered_pair(sK1,sK0) ),
inference(forward_demodulation,[],[f377,f277]) ).
fof(f379,plain,
! [X0,X1] :
( sK3 = X0
| unordered_pair(X0,X1) != unordered_pair(sK1,sK3)
| sK3 = X0
| unordered_pair(sK2,sK2) = unordered_pair(sK1,sK0) ),
inference(forward_demodulation,[],[f378,f290]) ).
fof(f380,plain,
! [X0,X1] :
( sK3 = X0
| unordered_pair(X0,X1) != unordered_pair(sK1,sK3)
| unordered_pair(sK2,sK2) = unordered_pair(sK1,sK0) ),
inference(duplicate_literal_removal,[],[f379]) ).
fof(f381,plain,
! [X0,X1] :
( unordered_pair(sK2,sK2) = unordered_pair(sK1,sK3)
| sK3 = X0
| unordered_pair(X0,X1) != unordered_pair(sK1,sK3) ),
inference(forward_demodulation,[],[f380,f290]) ).
fof(f382,plain,
! [X0,X1] :
( unordered_pair(sK0,sK0) = unordered_pair(sK1,sK3)
| sK3 = X0
| unordered_pair(X0,X1) != unordered_pair(sK1,sK3) ),
inference(forward_demodulation,[],[f381,f277]) ).
fof(f383,plain,
! [X0,X1] :
( unordered_pair(X0,X1) != unordered_pair(sK1,sK3)
| sK3 = X0
| unordered_pair(sK3,sK3) = unordered_pair(sK1,sK3) ),
inference(forward_demodulation,[],[f382,f290]) ).
fof(f393,plain,
( sK1 = sK3
| unordered_pair(sK3,sK3) = unordered_pair(sK1,sK3) ),
inference(equality_resolution,[],[f383]) ).
fof(f394,plain,
sK1 = sK3,
inference(forward_subsumption_resolution,[],[f393,f38]) ).
fof(f403,plain,
( sK1 != sK1
| sK0 != sK2 ),
inference(superposition,[],[f25,f394]) ).
fof(f411,plain,
sK0 != sK2,
inference(trivial_inequality_removal,[],[f403]) ).
fof(f413,plain,
$false,
inference(forward_subsumption_resolution,[],[f411,f277]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU156+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.38 % Computer : n011.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 : Mon Sep 28 03:47:15 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 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
% 2.35/1.16 % (2998700)Detected formulas, will run a generic FOF schedule.
% 2.35/1.16 % (2998709)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1162886651:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.35/1.16 % (2998709)First to succeed.
% 2.35/1.16 % (2998709)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2998700"
% 2.35/1.16 % (2998707)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=1186825478:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.35/1.16 % (2998705)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=2157743082:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.35/1.16 % (2998706)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=3809765425:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.35/1.16 % (2998708)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=4091509079:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.35/1.16 % (2998711)dis-21_1_sil=8000:lcm=predicate:random_seed=3102504289: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.35/1.16 % (2998710)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1197910457:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.35/1.16 % (2998708)Refutation not found, incomplete strategy
% 2.35/1.16 % (2998708)------------------------------
% 2.35/1.16 % (2998708)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.35/1.16 % (2998708)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.35/1.16 % (2998708)CaDiCaL version: 2.1.3
% 2.35/1.16 % (2998708)Termination reason: Refutation not found, incomplete strategy
% 2.35/1.16 % (2998708)Time elapsed: 0.001 s
% 2.35/1.16 % (2998708)Peak memory usage: 88 MB
% 2.35/1.16 % (2998711)Instruction limit reached!
% 2.35/1.16 % (2998711)------------------------------
% 2.35/1.16 % (2998711)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.35/1.16 % (2998711)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.35/1.16 % (2998711)CaDiCaL version: 2.1.3
% 2.35/1.16 % (2998711)Termination reason: Instruction limit
% 2.35/1.16 % (2998711)Termination phase: Saturation
% 2.35/1.16 % (2998711)Time elapsed: 0.069 s
% 2.35/1.16 % (2998711)Peak memory usage: 89 MB
% 2.35/1.16 % (2998711)Instructions burned: 130 (million)
% 2.35/1.16 % (2998710)Instruction limit reached!
% 2.35/1.16 % (2998710)------------------------------
% 2.35/1.16 % (2998710)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.35/1.16 % (2998710)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.35/1.16 % (2998710)CaDiCaL version: 2.1.3
% 2.35/1.16 % (2998710)Termination reason: Instruction limit
% 2.35/1.16 % (2998710)Termination phase: Saturation
% 2.35/1.16 % (2998710)Time elapsed: 0.081 s
% 2.35/1.16 % (2998710)Peak memory usage: 89 MB
% 2.35/1.16 % (2998710)Instructions burned: 141 (million)
% 2.35/1.16 % (2998709)Refutation found. Thanks to Tanya!
% 2.35/1.16 % SZS status Theorem for theBenchmark
% 2.35/1.16 % SZS output start Proof for theBenchmark
% See solution above
% 2.76/1.36 % (2998709)------------------------------
% 2.76/1.36 % (2998709)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.76/1.36 % (2998709)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.76/1.36 % (2998709)CaDiCaL version: 2.1.3
% 2.76/1.36 % (2998709)Termination reason: Refutation
% 2.76/1.36 % (2998709)Time elapsed: 0.007 s
% 2.76/1.36 % (2998709)Peak memory usage: 88 MB
% 2.76/1.36 % (2998709)Instructions burned: 23 (million)
% 2.76/1.36 % (2998709)------------------------------
% 2.76/1.36 % (2998709)------------------------------
% 2.76/1.36 % (2998700)Success in time 0.308 s
% 2.76/1.36 % Vampire exiting
%------------------------------------------------------------------------------