%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU156+3 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n004.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.14s 1.16s
% Output : Refutation 2.75s
% 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(f7,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(f8,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(f9,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( ordered_pair(X0,X1) = ordered_pair(X2,X3)
=> ( X0 = X2
& X1 = X3 ) ),
inference(negated_conjecture,[status(cth)],[f8]) ).
fof(f10,axiom,
! [X0] : unordered_pair(X0,X0) = singleton(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t69_enumset1) ).
fof(f12,axiom,
! [X0,X1,X2] :
( singleton(X0) = unordered_pair(X1,X2)
=> X0 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t8_zfmisc_1) ).
fof(f13,axiom,
! [X0,X1,X2] :
( singleton(X0) = unordered_pair(X1,X2)
=> X1 = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t9_zfmisc_1) ).
fof(f14,plain,
? [X0,X1,X2,X3] :
( ( X0 != X2
| X1 != X3 )
& ordered_pair(X0,X1) = ordered_pair(X2,X3) ),
inference(ennf_transformation,[],[f9]) ).
fof(f15,plain,
! [X0,X1,X2,X3] :
( unordered_pair(X0,X1) != unordered_pair(X2,X3)
| X0 = X2
| X0 = X3 ),
inference(ennf_transformation,[],[f7]) ).
fof(f16,plain,
! [X0,X1,X2] :
( X1 = X2
| singleton(X0) != unordered_pair(X1,X2) ),
inference(ennf_transformation,[],[f13]) ).
fof(f17,plain,
! [X0,X1,X2] :
( X0 = X1
| singleton(X0) != unordered_pair(X1,X2) ),
inference(ennf_transformation,[],[f12]) ).
fof(f18,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)],[f14]) ).
fof(f21,plain,
ordered_pair(sK0,sK1) = ordered_pair(sK2,sK3),
inference(cnf_transformation,[],[f18]) ).
fof(f22,plain,
( sK1 != sK3
| sK0 != sK2 ),
inference(cnf_transformation,[],[f18]) ).
fof(f24,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
inference(cnf_transformation,[],[f2]) ).
fof(f27,plain,
! [X2,X3,X0,X1] :
( unordered_pair(X0,X1) != unordered_pair(X2,X3)
| X0 = X2
| X0 = X3 ),
inference(cnf_transformation,[],[f15]) ).
fof(f28,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f29,plain,
! [X2,X0,X1] :
( X1 = X2
| singleton(X0) != unordered_pair(X1,X2) ),
inference(cnf_transformation,[],[f16]) ).
fof(f30,plain,
! [X2,X0,X1] :
( X0 = X1
| singleton(X0) != unordered_pair(X1,X2) ),
inference(cnf_transformation,[],[f17]) ).
fof(f31,plain,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
inference(cnf_transformation,[],[f10]) ).
fof(f32,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),unordered_pair(X0,X0)),
inference(definition_unfolding,[],[f24,f31]) ).
fof(f33,plain,
unordered_pair(unordered_pair(sK0,sK1),unordered_pair(sK0,sK0)) = unordered_pair(unordered_pair(sK2,sK3),unordered_pair(sK2,sK2)),
inference(definition_unfolding,[],[f21,f32,f32]) ).
fof(f35,plain,
! [X2,X0,X1] :
( unordered_pair(X0,X0) != unordered_pair(X1,X2)
| X1 = X2 ),
inference(definition_unfolding,[],[f29,f31]) ).
fof(f36,plain,
! [X2,X0,X1] :
( unordered_pair(X0,X0) != unordered_pair(X1,X2)
| X0 = X1 ),
inference(definition_unfolding,[],[f30,f31]) ).
fof(f61,plain,
! [X2,X0,X1] :
( unordered_pair(X0,X1) != unordered_pair(X2,X2)
| X1 = X2 ),
inference(superposition,[],[f36,f28]) ).
fof(f66,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,[],[f27,f33]) ).
fof(f70,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,[],[f27,f33]) ).
fof(f75,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,[],[f70,f28]) ).
fof(f76,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,[],[f66,f28]) ).
fof(f77,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,[],[f75,f28]) ).
fof(f78,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,[],[f76,f28]) ).
fof(f79,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,[],[f78,f28]) ).
fof(f81,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,[],[f77,f28]) ).
fof(f83,plain,
( unordered_pair(sK3,sK2) = unordered_pair(sK1,sK0)
| unordered_pair(sK2,sK2) = unordered_pair(sK1,sK0) ),
inference(equality_resolution,[],[f77]) ).
fof(f86,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,[],[f27,f83]) ).
fof(f87,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,[],[f27,f83]) ).
fof(f94,plain,
( unordered_pair(sK3,sK2) = unordered_pair(sK1,sK0)
| unordered_pair(sK0,sK0) = unordered_pair(sK3,sK2) ),
inference(equality_resolution,[],[f79]) ).
fof(f100,plain,
! [X0] :
( unordered_pair(X0,X0) != unordered_pair(sK1,sK0)
| sK2 = sK3
| unordered_pair(sK0,sK0) = unordered_pair(sK3,sK2) ),
inference(superposition,[],[f35,f94]) ).
fof(f102,plain,
! [X0] :
( unordered_pair(X0,X0) != unordered_pair(sK1,sK0)
| sK2 = sK3 ),
inference(forward_subsumption_resolution,[],[f100,f35]) ).
fof(f134,plain,
! [X0] :
( unordered_pair(X0,X0) != unordered_pair(sK1,sK0)
| sK2 = X0
| unordered_pair(sK2,sK2) = unordered_pair(sK1,sK0) ),
inference(superposition,[],[f61,f83]) ).
fof(f157,plain,
( unordered_pair(sK2,sK2) = unordered_pair(sK1,sK0)
| sK0 = sK3
| sK1 = sK3 ),
inference(equality_resolution,[],[f86]) ).
fof(f180,plain,
( unordered_pair(sK1,sK0) != unordered_pair(sK1,sK0)
| sK2 = sK3
| sK0 = sK3
| sK1 = sK3 ),
inference(superposition,[],[f102,f157]) ).
fof(f181,plain,
( sK2 = sK3
| sK0 = sK3
| sK1 = sK3 ),
inference(trivial_inequality_removal,[],[f180]) ).
fof(f200,plain,
( unordered_pair(sK1,sK0) = unordered_pair(sK3,sK3)
| sK0 = sK3
| sK1 = sK3
| sK0 = sK3
| sK1 = sK3 ),
inference(superposition,[],[f157,f181]) ).
fof(f201,plain,
( unordered_pair(sK1,sK0) = unordered_pair(sK3,sK3)
| sK0 = sK3
| sK1 = sK3 ),
inference(duplicate_literal_removal,[],[f200]) ).
fof(f203,plain,
( sK1 = sK3
| sK0 = sK3 ),
inference(forward_subsumption_resolution,[],[f201,f27]) ).
fof(f212,plain,
( unordered_pair(sK0,sK0) = unordered_pair(sK3,sK2)
| unordered_pair(sK0,sK0) = unordered_pair(sK2,sK2) ),
inference(equality_resolution,[],[f81]) ).
fof(f213,plain,
( sK1 != sK1
| sK0 != sK2
| sK0 = sK3 ),
inference(superposition,[],[f22,f203]) ).
fof(f221,plain,
( sK0 != sK2
| sK0 = sK3 ),
inference(trivial_inequality_removal,[],[f213]) ).
fof(f263,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,[],[f134,f212]) ).
fof(f269,plain,
( sK0 = sK2
| unordered_pair(sK2,sK2) = unordered_pair(sK1,sK0)
| unordered_pair(sK0,sK0) = unordered_pair(sK2,sK2) ),
inference(forward_subsumption_resolution,[],[f263,f83]) ).
fof(f273,plain,
( sK0 = sK2
| unordered_pair(sK2,sK2) = unordered_pair(sK1,sK0) ),
inference(forward_subsumption_resolution,[],[f269,f36]) ).
fof(f274,plain,
sK0 = sK2,
inference(forward_subsumption_resolution,[],[f273,f61]) ).
fof(f286,plain,
( sK0 != sK0
| sK0 = sK3 ),
inference(superposition,[],[f221,f274]) ).
fof(f287,plain,
sK0 = sK3,
inference(trivial_inequality_removal,[],[f286]) ).
fof(f374,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,[],[f87,f287]) ).
fof(f375,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,[],[f374,f274]) ).
fof(f376,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,[],[f375,f287]) ).
fof(f377,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,[],[f376]) ).
fof(f378,plain,
! [X0,X1] :
( unordered_pair(sK2,sK2) = unordered_pair(sK1,sK3)
| sK3 = X0
| unordered_pair(X0,X1) != unordered_pair(sK1,sK3) ),
inference(forward_demodulation,[],[f377,f287]) ).
fof(f379,plain,
! [X0,X1] :
( unordered_pair(sK0,sK0) = unordered_pair(sK1,sK3)
| sK3 = X0
| unordered_pair(X0,X1) != unordered_pair(sK1,sK3) ),
inference(forward_demodulation,[],[f378,f274]) ).
fof(f380,plain,
! [X0,X1] :
( unordered_pair(X0,X1) != unordered_pair(sK1,sK3)
| sK3 = X0
| unordered_pair(sK3,sK3) = unordered_pair(sK1,sK3) ),
inference(forward_demodulation,[],[f379,f287]) ).
fof(f390,plain,
( sK1 = sK3
| unordered_pair(sK3,sK3) = unordered_pair(sK1,sK3) ),
inference(equality_resolution,[],[f380]) ).
fof(f391,plain,
sK1 = sK3,
inference(forward_subsumption_resolution,[],[f390,f35]) ).
fof(f400,plain,
( sK1 != sK1
| sK0 != sK2 ),
inference(superposition,[],[f22,f391]) ).
fof(f408,plain,
sK0 != sK2,
inference(trivial_inequality_removal,[],[f400]) ).
fof(f410,plain,
$false,
inference(forward_subsumption_resolution,[],[f408,f274]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU156+3 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.38 % Computer : n004.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:23 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.14/1.16 % (4128385)Detected formulas, will run a generic FOF schedule.
% 2.14/1.16 % (4128394)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1573043846:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.14/1.16 % (4128394)First to succeed.
% 2.14/1.16 % (4128394)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-4128385"
% 2.14/1.16 % (4128390)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=1738986026:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.14/1.16 % (4128392)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=2278761215:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.14/1.16 % (4128396)dis-21_1_sil=8000:lcm=predicate:random_seed=786928995: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.14/1.16 % (4128393)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3193528290:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.14/1.16 % (4128391)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=3902385128:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.14/1.16 % (4128395)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=268015326:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.14/1.16 % (4128393)Refutation not found, incomplete strategy
% 2.14/1.16 % (4128393)------------------------------
% 2.14/1.16 % (4128393)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.14/1.16 % (4128393)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.14/1.16 % (4128393)CaDiCaL version: 2.1.3
% 2.14/1.16 % (4128393)Termination reason: Refutation not found, incomplete strategy
% 2.14/1.16 % (4128393)Time elapsed: 0.001 s
% 2.14/1.16 % (4128393)Peak memory usage: 88 MB
% 2.14/1.16 % (4128396)Instruction limit reached!
% 2.14/1.16 % (4128396)------------------------------
% 2.14/1.16 % (4128396)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.14/1.16 % (4128396)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.14/1.16 % (4128396)CaDiCaL version: 2.1.3
% 2.14/1.16 % (4128396)Termination reason: Instruction limit
% 2.14/1.16 % (4128396)Termination phase: Saturation
% 2.14/1.16 % (4128396)Time elapsed: 0.068 s
% 2.14/1.16 % (4128396)Peak memory usage: 89 MB
% 2.14/1.16 % (4128396)Instructions burned: 130 (million)
% 2.14/1.16 % (4128395)Instruction limit reached!
% 2.14/1.16 % (4128395)------------------------------
% 2.14/1.16 % (4128395)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.14/1.16 % (4128395)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.14/1.16 % (4128395)CaDiCaL version: 2.1.3
% 2.14/1.16 % (4128395)Termination reason: Instruction limit
% 2.14/1.16 % (4128395)Termination phase: Saturation
% 2.14/1.16 % (4128395)Time elapsed: 0.079 s
% 2.14/1.16 % (4128395)Peak memory usage: 89 MB
% 2.14/1.16 % (4128395)Instructions burned: 140 (million)
% 2.14/1.16 % (4128394)Refutation found. Thanks to Tanya!
% 2.14/1.16 % SZS status Theorem for theBenchmark
% 2.14/1.16 % SZS output start Proof for theBenchmark
% See solution above
% 2.75/1.36 % (4128394)------------------------------
% 2.75/1.36 % (4128394)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.75/1.36 % (4128394)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.75/1.36 % (4128394)CaDiCaL version: 2.1.3
% 2.75/1.36 % (4128394)Termination reason: Refutation
% 2.75/1.36 % (4128394)Time elapsed: 0.007 s
% 2.75/1.36 % (4128394)Peak memory usage: 88 MB
% 2.75/1.36 % (4128394)Instructions burned: 23 (million)
% 2.75/1.36 % (4128394)------------------------------
% 2.75/1.36 % (4128394)------------------------------
% 2.75/1.36 % (4128385)Success in time 0.305 s
% 2.75/1.36 % Vampire exiting
%------------------------------------------------------------------------------