%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL330-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n016.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 11:58:22 AM UTC 2026
% Result : Unsatisfiable 10.28s 17.39s
% Output : Refutation 10.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 35
% Syntax : Number of formulae : 188 ( 99 unt; 24 def)
% Number of atoms : 300 ( 30 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 218 ( 106 ~; 101 |; 0 &)
% ( 11 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 10 ( 2 avg)
% Number of predicates : 15 ( 13 usr; 12 prp; 0-2 aty)
% Number of functors : 20 ( 20 usr; 15 con; 0-2 aty)
% Number of variables : 101 ( 0 sgn 101 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : axiom(implies(or(X0,X0),X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_2) ).
fof(f2,axiom,
! [X0,X1] : axiom(implies(X0,or(X1,X0))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_3) ).
fof(f3,axiom,
! [X0,X1] : axiom(implies(or(X0,X1),or(X1,X0))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_4) ).
fof(f4,axiom,
! [X2,X0,X1] : axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_5) ).
fof(f5,axiom,
! [X2,X0,X1] : axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_6) ).
fof(f6,axiom,
! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',implies_definition) ).
fof(f7,axiom,
! [X0] :
( ~ axiom(X0)
| theorem(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_1) ).
fof(f8,axiom,
! [X0,X1] :
( theorem(X0)
| ~ theorem(implies(X1,X0))
| ~ theorem(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_2) ).
fof(f9,axiom,
! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-1.ax',and_defn) ).
fof(f10,axiom,
! [X0,X1] : equivalent(X0,X1) = and(implies(X0,X1),implies(X1,X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-2.ax',equivalent_defn) ).
fof(f11,negated_conjecture,
~ theorem(equivalent(or(p,q),implies(implies(p,q),q))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f12,plain,
! [X0,X1] : equivalent(X0,X1) = not(or(not(or(not(X0),X1)),not(or(not(X1),X0)))),
inference(definition_unfolding,[],[f10,f9,f6,f6]) ).
fof(f13,plain,
! [X0] : axiom(or(not(or(X0,X0)),X0)),
inference(definition_unfolding,[],[f1,f6]) ).
fof(f14,plain,
! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
inference(definition_unfolding,[],[f2,f6]) ).
fof(f15,plain,
! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(definition_unfolding,[],[f3,f6]) ).
fof(f16,plain,
! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(definition_unfolding,[],[f4,f6]) ).
fof(f17,plain,
! [X2,X0,X1] : axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(definition_unfolding,[],[f5,f6,f6,f6]) ).
fof(f18,plain,
! [X0,X1] :
( ~ theorem(or(not(X1),X0))
| theorem(X0)
| ~ theorem(X1) ),
inference(definition_unfolding,[],[f8,f6]) ).
fof(f19,plain,
~ theorem(not(or(not(or(not(or(p,q)),or(not(or(not(p),q)),q))),not(or(not(or(not(or(not(p),q)),q)),or(p,q)))))),
inference(definition_unfolding,[],[f11,f12,f6,f6]) ).
fof(f20,definition,
sF0 = or(p,q),
introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).
fof(f21,plain,
or(p,q) = sF0,
inference(reorient_equations,[],[f20]) ).
fof(f22,definition,
sF1 = not(sF0),
introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).
fof(f23,plain,
not(sF0) = sF1,
inference(reorient_equations,[],[f22]) ).
fof(f24,definition,
sF2 = not(p),
introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).
fof(f25,plain,
not(p) = sF2,
inference(reorient_equations,[],[f24]) ).
fof(f26,definition,
sF3 = or(sF2,q),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
fof(f27,plain,
or(sF2,q) = sF3,
inference(reorient_equations,[],[f26]) ).
fof(f28,definition,
sF4 = not(sF3),
introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).
fof(f29,plain,
not(sF3) = sF4,
inference(reorient_equations,[],[f28]) ).
fof(f30,definition,
sF5 = or(sF4,q),
introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).
fof(f31,plain,
or(sF4,q) = sF5,
inference(reorient_equations,[],[f30]) ).
fof(f32,definition,
sF6 = or(sF1,sF5),
introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).
fof(f33,plain,
or(sF1,sF5) = sF6,
inference(reorient_equations,[],[f32]) ).
fof(f34,definition,
sF7 = not(sF6),
introduced(definition,[new_symbols(definition,[sF7])],[function_definition]) ).
fof(f35,plain,
not(sF6) = sF7,
inference(reorient_equations,[],[f34]) ).
fof(f36,definition,
sF8 = not(sF5),
introduced(definition,[new_symbols(definition,[sF8])],[function_definition]) ).
fof(f37,plain,
not(sF5) = sF8,
inference(reorient_equations,[],[f36]) ).
fof(f38,definition,
sF9 = or(sF8,sF0),
introduced(definition,[new_symbols(definition,[sF9])],[function_definition]) ).
fof(f39,plain,
or(sF8,sF0) = sF9,
inference(reorient_equations,[],[f38]) ).
fof(f40,definition,
sF10 = not(sF9),
introduced(definition,[new_symbols(definition,[sF10])],[function_definition]) ).
fof(f41,plain,
not(sF9) = sF10,
inference(reorient_equations,[],[f40]) ).
fof(f42,definition,
sF11 = or(sF7,sF10),
introduced(definition,[new_symbols(definition,[sF11])],[function_definition]) ).
fof(f43,plain,
or(sF7,sF10) = sF11,
inference(reorient_equations,[],[f42]) ).
fof(f44,definition,
sF12 = not(sF11),
introduced(definition,[new_symbols(definition,[sF12])],[function_definition]) ).
fof(f45,plain,
not(sF11) = sF12,
inference(reorient_equations,[],[f44]) ).
fof(f46,plain,
~ theorem(sF12),
inference(definition_folding,[],[f19,f45,f43,f41,f39,f21,f37,f31,f29,f27,f25,f35,f33,f31,f29,f27,f25,f23,f21]) ).
fof(f47,plain,
~ theorem(not(sF11)),
inference(superposition,[],[f46,f45]) ).
fof(f48,plain,
! [X0] : theorem(or(not(or(X0,X0)),X0)),
inference(resolution,[],[f13,f7]) ).
fof(f49,plain,
! [X0,X1] : theorem(or(not(X0),or(X1,X0))),
inference(resolution,[],[f14,f7]) ).
fof(f52,plain,
! [X0] : axiom(or(sF4,or(X0,sF3))),
inference(superposition,[],[f14,f29]) ).
fof(f65,plain,
! [X0,X1] : theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(resolution,[],[f15,f7]) ).
fof(f66,plain,
axiom(or(not(sF0),or(q,p))),
inference(superposition,[],[f15,f21]) ).
fof(f72,plain,
axiom(or(not(or(q,p)),sF0)),
inference(superposition,[],[f15,f21]) ).
fof(f82,plain,
axiom(or(sF1,or(q,p))),
inference(forward_demodulation,[],[f66,f23]) ).
fof(f91,definition,
( spl13_1
<=> theorem(sF9) ),
introduced(definition,[new_symbols(definition,[spl13_1])],[avatar_definition]) ).
fof(f92,plain,
( theorem(sF9)
| ~ spl13_1 ),
inference(avatar_component_clause,[],[f91]) ).
fof(f93,plain,
( ~ theorem(sF9)
| spl13_1 ),
inference(avatar_component_clause,[],[f91]) ).
fof(f99,definition,
( spl13_3
<=> theorem(sF6) ),
introduced(definition,[new_symbols(definition,[spl13_3])],[avatar_definition]) ).
fof(f100,plain,
( theorem(sF6)
| ~ spl13_3 ),
inference(avatar_component_clause,[],[f99]) ).
fof(f101,plain,
( ~ theorem(sF6)
| spl13_3 ),
inference(avatar_component_clause,[],[f99]) ).
fof(f138,plain,
! [X2,X0,X1] : theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(resolution,[],[f16,f7]) ).
fof(f139,plain,
! [X0] : axiom(or(not(or(X0,sF0)),or(p,or(X0,q)))),
inference(superposition,[],[f16,f21]) ).
fof(f140,plain,
! [X0] : axiom(or(not(or(X0,sF3)),or(sF2,or(X0,q)))),
inference(superposition,[],[f16,f27]) ).
fof(f147,plain,
! [X0] : axiom(or(not(or(sF4,or(X0,q))),or(X0,sF5))),
inference(superposition,[],[f16,f31]) ).
fof(f151,plain,
! [X2,X0,X1] : theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(resolution,[],[f17,f7]) ).
fof(f163,plain,
! [X0] : axiom(or(not(or(not(sF10),X0)),or(not(sF11),or(sF7,X0)))),
inference(superposition,[],[f17,f43]) ).
fof(f164,plain,
! [X0] : axiom(or(not(or(not(X0),q)),or(not(or(p,X0)),sF0))),
inference(superposition,[],[f17,f21]) ).
fof(f168,plain,
! [X0] : axiom(or(not(or(not(X0),sF5)),or(not(or(sF1,X0)),sF6))),
inference(superposition,[],[f17,f33]) ).
fof(f187,plain,
! [X0] : theorem(or(sF4,or(X0,sF3))),
inference(resolution,[],[f52,f7]) ).
fof(f207,plain,
theorem(or(sF1,or(q,p))),
inference(resolution,[],[f82,f7]) ).
fof(f208,plain,
! [X0] :
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(resolution,[],[f48,f18]) ).
fof(f209,plain,
! [X0,X1] :
( theorem(or(X0,X1))
| ~ theorem(X1) ),
inference(resolution,[],[f49,f18]) ).
fof(f226,plain,
theorem(or(not(or(q,p)),sF0)),
inference(resolution,[],[f72,f7]) ).
fof(f233,plain,
! [X0,X1] :
( ~ theorem(or(X1,X0))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f65,f18]) ).
fof(f254,plain,
axiom(or(not(or(sF2,sF0)),or(p,sF3))),
inference(superposition,[],[f139,f27]) ).
fof(f260,plain,
axiom(or(not(or(sF4,sF3)),or(sF2,sF5))),
inference(superposition,[],[f140,f31]) ).
fof(f301,plain,
! [X0] : theorem(or(not(or(sF4,or(X0,q))),or(X0,sF5))),
inference(resolution,[],[f147,f7]) ).
fof(f335,plain,
! [X2,X0,X1] :
( ~ theorem(or(X1,or(X0,X2)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f138,f18]) ).
fof(f349,plain,
! [X0] : theorem(or(not(or(not(sF10),X0)),or(not(sF11),or(sF7,X0)))),
inference(resolution,[],[f163,f7]) ).
fof(f354,plain,
axiom(or(not(or(sF4,q)),or(not(or(p,sF3)),sF0))),
inference(superposition,[],[f164,f29]) ).
fof(f360,plain,
axiom(or(not(sF5),or(not(or(p,sF3)),sF0))),
inference(forward_demodulation,[],[f354,f31]) ).
fof(f362,plain,
axiom(or(sF8,or(not(or(p,sF3)),sF0))),
inference(forward_demodulation,[],[f360,f37]) ).
fof(f405,plain,
! [X0,X1] :
( theorem(or(X0,X1))
| ~ theorem(X0) ),
inference(resolution,[],[f233,f209]) ).
fof(f440,plain,
! [X0] : theorem(or(not(or(not(X0),sF5)),or(not(or(sF1,X0)),sF6))),
inference(resolution,[],[f168,f7]) ).
fof(f602,plain,
! [X2,X0,X1] :
( theorem(or(not(or(X0,X1)),or(X0,X2)))
| ~ theorem(or(not(X1),X2)) ),
inference(resolution,[],[f151,f18]) ).
fof(f646,plain,
theorem(or(not(or(sF2,sF0)),or(p,sF3))),
inference(resolution,[],[f254,f7]) ).
fof(f655,plain,
theorem(or(not(or(sF4,sF3)),or(sF2,sF5))),
inference(resolution,[],[f260,f7]) ).
fof(f692,plain,
theorem(or(sF8,or(not(or(p,sF3)),sF0))),
inference(resolution,[],[f362,f7]) ).
fof(f749,plain,
( theorem(or(p,sF3))
| ~ theorem(or(sF2,sF0)) ),
inference(resolution,[],[f646,f18]) ).
fof(f752,definition,
( spl13_18
<=> theorem(or(sF2,sF0)) ),
introduced(definition,[new_symbols(definition,[spl13_18])],[avatar_definition]) ).
fof(f754,plain,
( ~ theorem(or(sF2,sF0))
| spl13_18 ),
inference(avatar_component_clause,[],[f752]) ).
fof(f756,definition,
( spl13_19
<=> theorem(or(p,sF3)) ),
introduced(definition,[new_symbols(definition,[spl13_19])],[avatar_definition]) ).
fof(f758,plain,
( theorem(or(p,sF3))
| ~ spl13_19 ),
inference(avatar_component_clause,[],[f756]) ).
fof(f759,plain,
( ~ spl13_18
| spl13_19 ),
inference(avatar_split_clause,[],[f749,f756,f752]) ).
fof(f796,plain,
! [X0] :
( ~ theorem(or(sF4,or(X0,q)))
| theorem(or(X0,sF5)) ),
inference(resolution,[],[f301,f18]) ).
fof(f812,plain,
( theorem(or(sF2,sF5))
| ~ theorem(or(sF4,sF3)) ),
inference(resolution,[],[f655,f18]) ).
fof(f815,definition,
( spl13_22
<=> theorem(or(sF4,sF3)) ),
introduced(definition,[new_symbols(definition,[spl13_22])],[avatar_definition]) ).
fof(f817,plain,
( ~ theorem(or(sF4,sF3))
| spl13_22 ),
inference(avatar_component_clause,[],[f815]) ).
fof(f819,definition,
( spl13_23
<=> theorem(or(sF2,sF5)) ),
introduced(definition,[new_symbols(definition,[spl13_23])],[avatar_definition]) ).
fof(f821,plain,
( theorem(or(sF2,sF5))
| ~ spl13_23 ),
inference(avatar_component_clause,[],[f819]) ).
fof(f822,plain,
( ~ spl13_22
| spl13_23 ),
inference(avatar_split_clause,[],[f812,f819,f815]) ).
fof(f890,plain,
! [X2,X0,X1] :
( theorem(or(X0,or(X1,X2)))
| ~ theorem(or(X0,X2)) ),
inference(resolution,[],[f335,f209]) ).
fof(f891,plain,
! [X0,X1] : theorem(or(X0,or(not(X1),X1))),
inference(resolution,[],[f335,f49]) ).
fof(f927,plain,
theorem(or(q,or(sF1,p))),
inference(resolution,[],[f335,f207]) ).
fof(f929,plain,
! [X0] : theorem(or(X0,or(sF4,sF3))),
inference(resolution,[],[f335,f187]) ).
fof(f987,plain,
theorem(or(sF4,sF3)),
inference(resolution,[],[f929,f208]) ).
fof(f991,plain,
( $false
| spl13_22 ),
inference(forward_subsumption_resolution,[],[f987,f817]) ).
fof(f992,plain,
spl13_22,
inference(avatar_contradiction_clause,[],[f991]) ).
fof(f1064,plain,
! [X0] :
( theorem(or(not(sF11),or(sF7,X0)))
| ~ theorem(or(not(sF10),X0)) ),
inference(resolution,[],[f349,f18]) ).
fof(f1131,plain,
! [X0] :
( theorem(or(not(or(sF1,X0)),sF6))
| ~ theorem(or(not(X0),sF5)) ),
inference(resolution,[],[f440,f18]) ).
fof(f1220,plain,
! [X0] : theorem(or(not(X0),X0)),
inference(resolution,[],[f891,f208]) ).
fof(f1230,definition,
( spl13_30
<=> ! [X0] : theorem(or(not(X0),X0)) ),
introduced(definition,[new_symbols(definition,[spl13_30])],[avatar_definition]) ).
fof(f1231,plain,
( ! [X0] : theorem(or(not(X0),X0))
| ~ spl13_30 ),
inference(avatar_component_clause,[],[f1230]) ).
fof(f1233,plain,
spl13_30,
inference(avatar_split_clause,[],[f1220,f1230]) ).
fof(f1245,plain,
( ! [X0] : theorem(or(X0,not(X0)))
| ~ spl13_30 ),
inference(resolution,[],[f1231,f233]) ).
fof(f1263,plain,
( ! [X0] :
( theorem(not(not(X0)))
| ~ theorem(X0) )
| ~ spl13_30 ),
inference(resolution,[],[f1245,f18]) ).
fof(f1270,plain,
! [X2,X0,X1] :
( ~ theorem(or(not(X0),X1))
| theorem(or(X2,X1))
| ~ theorem(or(X2,X0)) ),
inference(resolution,[],[f602,f18]) ).
fof(f1297,plain,
( theorem(not(sF7))
| ~ theorem(sF6)
| ~ spl13_30 ),
inference(superposition,[],[f1263,f35]) ).
fof(f1298,plain,
( theorem(not(sF10))
| ~ theorem(sF9)
| ~ spl13_30 ),
inference(superposition,[],[f1263,f41]) ).
fof(f1324,plain,
theorem(or(not(or(p,sF3)),or(sF8,sF0))),
inference(resolution,[],[f692,f335]) ).
fof(f1326,plain,
theorem(or(not(or(p,sF3)),sF9)),
inference(forward_demodulation,[],[f1324,f39]) ).
fof(f1327,plain,
( theorem(sF9)
| ~ theorem(or(p,sF3)) ),
inference(resolution,[],[f1326,f18]) ).
fof(f1509,plain,
! [X0] :
( ~ theorem(or(X0,q))
| theorem(or(X0,sF5)) ),
inference(resolution,[],[f796,f209]) ).
fof(f1604,plain,
! [X0,X1] :
( ~ theorem(or(or(X0,X1),X1))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f890,f208]) ).
fof(f2609,plain,
! [X0,X1] :
( ~ theorem(or(X0,or(X1,X1)))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f1270,f48]) ).
fof(f2648,plain,
! [X0] :
( ~ theorem(or(X0,or(q,p)))
| theorem(or(X0,sF0)) ),
inference(resolution,[],[f1270,f226]) ).
fof(f2665,plain,
! [X0,X1] :
( ~ theorem(or(X0,or(sF1,X1)))
| theorem(or(X0,sF6))
| ~ theorem(or(not(X1),sF5)) ),
inference(resolution,[],[f1270,f1131]) ).
fof(f2727,plain,
! [X2,X0,X1] :
( ~ theorem(or(X0,X2))
| theorem(or(X0,X1))
| ~ theorem(not(X2)) ),
inference(resolution,[],[f1270,f405]) ).
fof(f3967,plain,
( ~ theorem(or(sF6,sF5))
| theorem(sF6) ),
inference(superposition,[],[f1604,f33]) ).
fof(f4579,plain,
( theorem(or(not(sF11),sF7))
| ~ theorem(or(not(sF10),sF7)) ),
inference(resolution,[],[f2609,f1064]) ).
fof(f4607,definition,
( spl13_61
<=> theorem(or(not(sF10),sF7)) ),
introduced(definition,[new_symbols(definition,[spl13_61])],[avatar_definition]) ).
fof(f4609,plain,
( ~ theorem(or(not(sF10),sF7))
| spl13_61 ),
inference(avatar_component_clause,[],[f4607]) ).
fof(f4611,definition,
( spl13_62
<=> theorem(or(not(sF11),sF7)) ),
introduced(definition,[new_symbols(definition,[spl13_62])],[avatar_definition]) ).
fof(f4613,plain,
( theorem(or(not(sF11),sF7))
| ~ spl13_62 ),
inference(avatar_component_clause,[],[f4611]) ).
fof(f4614,plain,
( ~ spl13_61
| spl13_62 ),
inference(avatar_split_clause,[],[f4579,f4611,f4607]) ).
fof(f4631,plain,
theorem(or(not(p),sF0)),
inference(resolution,[],[f2648,f49]) ).
fof(f4666,plain,
theorem(or(sF2,sF0)),
inference(forward_demodulation,[],[f4631,f25]) ).
fof(f4667,plain,
( $false
| spl13_18 ),
inference(forward_subsumption_resolution,[],[f4666,f754]) ).
fof(f4668,plain,
spl13_18,
inference(avatar_contradiction_clause,[],[f4667]) ).
fof(f4669,plain,
( ~ theorem(or(p,sF3))
| spl13_1 ),
inference(forward_subsumption_resolution,[],[f1327,f93]) ).
fof(f4675,plain,
( $false
| spl13_1
| ~ spl13_19 ),
inference(forward_subsumption_resolution,[],[f4669,f758]) ).
fof(f4676,plain,
( spl13_1
| ~ spl13_19 ),
inference(avatar_contradiction_clause,[],[f4675]) ).
fof(f4679,plain,
( theorem(not(sF10))
| ~ spl13_1
| ~ spl13_30 ),
inference(forward_subsumption_resolution,[],[f1298,f92]) ).
fof(f5014,plain,
( ~ theorem(not(sF10))
| spl13_61 ),
inference(resolution,[],[f4609,f405]) ).
fof(f5016,plain,
( $false
| ~ spl13_1
| ~ spl13_30
| spl13_61 ),
inference(forward_subsumption_resolution,[],[f5014,f4679]) ).
fof(f5017,plain,
( ~ spl13_1
| ~ spl13_30
| spl13_61 ),
inference(avatar_contradiction_clause,[],[f5016]) ).
fof(f6404,plain,
( ! [X0] :
( theorem(or(not(sF11),X0))
| ~ theorem(not(sF7)) )
| ~ spl13_62 ),
inference(resolution,[],[f2727,f4613]) ).
fof(f7033,definition,
( spl13_210
<=> theorem(not(sF7)) ),
introduced(definition,[new_symbols(definition,[spl13_210])],[avatar_definition]) ).
fof(f7035,plain,
( ~ theorem(not(sF7))
| spl13_210 ),
inference(avatar_component_clause,[],[f7033]) ).
fof(f7491,definition,
( spl13_299
<=> ! [X0] : theorem(or(not(sF11),X0)) ),
introduced(definition,[new_symbols(definition,[spl13_299])],[avatar_definition]) ).
fof(f7492,plain,
( ! [X0] : theorem(or(not(sF11),X0))
| ~ spl13_299 ),
inference(avatar_component_clause,[],[f7491]) ).
fof(f7493,plain,
( ~ spl13_210
| spl13_299
| ~ spl13_62 ),
inference(avatar_split_clause,[],[f6404,f4611,f7491,f7033]) ).
fof(f8644,plain,
( ~ theorem(sF6)
| ~ spl13_30
| spl13_210 ),
inference(forward_subsumption_resolution,[],[f1297,f7035]) ).
fof(f8756,plain,
( $false
| ~ spl13_3
| ~ spl13_30
| spl13_210 ),
inference(forward_subsumption_resolution,[],[f8644,f100]) ).
fof(f8757,plain,
( ~ spl13_3
| ~ spl13_30
| spl13_210 ),
inference(avatar_contradiction_clause,[],[f8756]) ).
fof(f9096,plain,
( ~ theorem(or(sF6,sF5))
| spl13_3 ),
inference(forward_subsumption_resolution,[],[f3967,f101]) ).
fof(f10441,plain,
( theorem(not(sF11))
| ~ spl13_299 ),
inference(resolution,[],[f7492,f208]) ).
fof(f10462,plain,
( $false
| ~ spl13_299 ),
inference(forward_subsumption_resolution,[],[f10441,f47]) ).
fof(f10463,plain,
~ spl13_299,
inference(avatar_contradiction_clause,[],[f10462]) ).
fof(f18471,plain,
( theorem(or(q,sF6))
| ~ theorem(or(not(p),sF5)) ),
inference(resolution,[],[f2665,f927]) ).
fof(f18523,plain,
( ~ theorem(or(sF2,sF5))
| theorem(or(q,sF6)) ),
inference(forward_demodulation,[],[f18471,f25]) ).
fof(f18552,plain,
( theorem(or(q,sF6))
| ~ spl13_23 ),
inference(forward_subsumption_resolution,[],[f18523,f821]) ).
fof(f18564,plain,
( theorem(or(sF6,q))
| ~ spl13_23 ),
inference(resolution,[],[f18552,f233]) ).
fof(f18617,plain,
( theorem(or(sF6,sF5))
| ~ spl13_23 ),
inference(resolution,[],[f18564,f1509]) ).
fof(f18624,plain,
( $false
| spl13_3
| ~ spl13_23 ),
inference(forward_subsumption_resolution,[],[f18617,f9096]) ).
fof(f18625,plain,
( spl13_3
| ~ spl13_23 ),
inference(avatar_contradiction_clause,[],[f18624]) ).
cnf(s33,plain,
( ~ spl13_18
| spl13_19 ),
inference(sat_conversion,[],[f759]) ).
cnf(s36,plain,
( ~ spl13_22
| spl13_23 ),
inference(sat_conversion,[],[f822]) ).
cnf(s43,plain,
spl13_22,
inference(sat_conversion,[],[f992]) ).
cnf(s52,plain,
spl13_30,
inference(sat_conversion,[],[f1233]) ).
cnf(s68,plain,
( ~ spl13_61
| spl13_62 ),
inference(sat_conversion,[],[f4614]) ).
cnf(s72,plain,
spl13_18,
inference(sat_conversion,[],[f4668]) ).
cnf(s73,plain,
( spl13_1
| ~ spl13_19 ),
inference(sat_conversion,[],[f4676]) ).
cnf(s88,plain,
( ~ spl13_1
| ~ spl13_30
| spl13_61 ),
inference(sat_conversion,[],[f5017]) ).
cnf(s310,plain,
( ~ spl13_62
| ~ spl13_210
| spl13_299 ),
inference(sat_conversion,[],[f7493]) ).
cnf(s589,plain,
( ~ spl13_3
| ~ spl13_30
| spl13_210 ),
inference(sat_conversion,[],[f8757]) ).
cnf(s792,plain,
~ spl13_299,
inference(sat_conversion,[],[f10463]) ).
cnf(s985,plain,
( spl13_3
| ~ spl13_23 ),
inference(sat_conversion,[],[f18625]) ).
cnf(s991,plain,
( ~ spl13_62
| ~ spl13_210 ),
inference(rat,[],[s310,s792]) ).
cnf(s994,plain,
spl13_23,
inference(rat,[],[s36,s43]) ).
cnf(s995,plain,
spl13_3,
inference(rat,[],[s985,s994]) ).
cnf(s996,plain,
spl13_210,
inference(rat,[],[s589,s52,s995]) ).
cnf(s1008,plain,
~ spl13_62,
inference(rat,[],[s991,s996]) ).
cnf(s1012,plain,
~ spl13_61,
inference(rat,[],[s68,s1008]) ).
cnf(s1014,plain,
~ spl13_1,
inference(rat,[],[s88,s52,s1012]) ).
cnf(s1015,plain,
~ spl13_19,
inference(rat,[],[s73,s1014]) ).
cnf(s1016,plain,
$false,
inference(rat,[],[s33,s1015,s72]) ).
fof(f18626,plain,
$false,
inference(avatar_sat_refutation,[],[s1016]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL330-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/0.42 % Computer : n016.cluster.edu
% 0.13/0.42 % Model : x86_64 x86_64
% 0.13/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.42 % Memory : 8046.5625MB
% 0.13/0.42 % OS : Linux 6.8.0-71-generic
% 0.11/15.79 % CPULimit : 300
% 0.11/15.79 % WCLimit : 300
% 0.11/15.79 % DateTime : Sun Sep 27 15:35:18 UTC 2026
% 0.11/15.79 % CPUTime :
% 0.11/15.79 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.51/15.85 Running first-order model finding
% 0.51/15.85 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 10.28/17.39 % (1107257)Will run a generic schedule for satisfiability detection.
% 10.28/17.39 % (1107264)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=663424459:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 10.28/17.39 % (1107263)% WARNING: option uhcvi not known.
% 10.28/17.39 % (1107265)dis+10_1_sil=32000:sp=arity:random_seed=452599254:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 10.28/17.39 % (1107263)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1633998959:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 10.28/17.39 % (1107262)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=671275252_2999 on theBenchmark for (2999ds/0Mi)
% 10.28/17.39 % (1107266)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3503130224:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 10.28/17.39 % (1107268)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4147276173:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 10.28/17.39 % (1107267)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2541670356:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 10.28/17.39 % TRYING [1]
% 10.28/17.39 % TRYING [2]
% 10.28/17.39 % TRYING [3]
% 10.28/17.39 % TRYING [4]
% 10.28/17.39 % (1107266)Instruction limit reached!
% 10.28/17.39 % (1107266)------------------------------
% 10.28/17.39 % (1107266)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 10.28/17.39 % (1107266)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.28/17.39 % (1107266)CaDiCaL version: 2.1.3
% 10.28/17.39 % (1107266)Termination reason: Instruction limit
% 10.28/17.39 % (1107266)Termination phase: Saturation
% 10.28/17.39 % (1107266)Time elapsed: 0.090 s
% 10.28/17.39 % (1107266)Peak memory usage: 11 MB
% 10.28/17.39 % (1107266)Instructions burned: 120 (million)
% 10.28/17.39 % (1107265)Instruction limit reached!
% 10.28/17.39 % (1107265)------------------------------
% 10.28/17.39 % (1107265)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 10.28/17.39 % (1107265)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.28/17.39 % (1107265)CaDiCaL version: 2.1.3
% 10.28/17.39 % (1107265)Termination reason: Instruction limit
% 10.28/17.39 % (1107265)Termination phase: Saturation
% 10.28/17.39 % (1107265)Time elapsed: 0.099 s
% 10.28/17.39 % (1107265)Peak memory usage: 12 MB
% 10.28/17.39 % (1107265)Instructions burned: 103 (million)
% 10.28/17.39 % (1107276)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3286979062:i=714:nm=2_2998 on theBenchmark for (2998ds/714Mi)
% 10.28/17.39 % TRYING [1]
% 10.28/17.39 % TRYING [2]
% 10.28/17.39 % TRYING [3]
% 10.28/17.39 % (1107277)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=444032371:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 10.28/17.39 % (1107268)Instruction limit reached!
% 10.28/17.39 % (1107268)------------------------------
% 10.28/17.39 % (1107268)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 10.28/17.39 % (1107268)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.28/17.39 % (1107268)CaDiCaL version: 2.1.3
% 10.28/17.39 % (1107268)Termination reason: Instruction limit
% 10.28/17.39 % (1107268)Termination phase: Saturation
% 10.28/17.39 % (1107268)Time elapsed: 0.140 s
% 10.28/17.39 % (1107268)Peak memory usage: 12 MB
% 10.28/17.39 % (1107268)Instructions burned: 159 (million)
% 10.28/17.39 % (1107267)Instruction limit reached!
% 10.28/17.39 % (1107267)------------------------------
% 10.28/17.39 % (1107267)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 10.28/17.39 % (1107267)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.28/17.39 % (1107267)CaDiCaL version: 2.1.3
% 10.28/17.39 % (1107267)Termination reason: Instruction limit
% 10.28/17.39 % (1107267)Termination phase: Saturation
% 10.28/17.39 % (1107267)Time elapsed: 0.145 s
% 10.28/17.39 % (1107267)Peak memory usage: 14 MB
% 10.28/17.39 % (1107267)Instructions burned: 131 (million)
% 10.28/17.39 % TRYING [4]
% 10.28/17.39 % (1107280)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=2043557013:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 10.28/17.39 % (1107281)ott-21_1_sil=16000:fs=off:random_seed=2956389102:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 10.28/17.39 % (1107277)Instruction limit reached!
% 10.28/17.39 % (1107277)------------------------------
% 10.28/17.39 % (1107277)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 10.28/17.39 % (1107277)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.28/17.39 % (1107277)CaDiCaL version: 2.1.3
% 10.28/17.39 % (1107277)Termination reason: Instruction limit
% 10.28/17.39 % (1107277)Termination phase: Saturation
% 10.28/17.39 % (1107277)Time elapsed: 0.125 s
% 10.28/17.39 % (1107277)Peak memory usage: 12 MB
% 10.28/17.39 % (1107277)Instructions burned: 131 (million)
% 10.28/17.39 % (1107284)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=2461500620:i=477:bd=all_2996 on theBenchmark for (2996ds/477Mi)
% 10.28/17.39 % TRYING [5]
% 10.28/17.39 % (1107281)Instruction limit reached!
% 10.28/17.39 % (1107281)------------------------------
% 10.28/17.39 % (1107281)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 10.28/17.39 % (1107281)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.28/17.39 % (1107281)CaDiCaL version: 2.1.3
% 10.28/17.39 % (1107281)Termination reason: Instruction limit
% 10.28/17.39 % (1107281)Termination phase: Saturation
% 10.28/17.39 % (1107281)Time elapsed: 0.160 s
% 10.28/17.39 % (1107281)Peak memory usage: 12 MB
% 10.28/17.39 % (1107281)Instructions burned: 181 (million)
% 10.28/17.39 % (1107286)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=4175264042:fmbsr=1.3:i=865:ins=25_2995 on theBenchmark for (2995ds/865Mi)
% 10.28/17.39 % TRYING [1]
% 10.28/17.39 % TRYING [2]
% 10.28/17.39 % TRYING [3]
% 10.28/17.39 % TRYING [4]
% 10.28/17.39 % TRYING [5]
% 10.28/17.39 % TRYING [5]
% 10.28/17.39 % (1107276)Instruction limit reached!
% 10.28/17.39 % (1107276)------------------------------
% 10.28/17.39 % (1107276)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 10.28/17.39 % (1107276)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.28/17.39 % (1107276)CaDiCaL version: 2.1.3
% 10.28/17.39 % (1107276)Termination reason: Instruction limit
% 10.28/17.39 % (1107276)Termination phase: Finite model building SAT solving
% 10.28/17.39 % (1107276)Time elapsed: 0.617 s
% 10.28/17.39 % (1107276)Peak memory usage: 16 MB
% 10.28/17.39 % (1107276)Instructions burned: 715 (million)
% 10.28/17.39 % (1107284)Instruction limit reached!
% 10.28/17.39 % (1107284)------------------------------
% 10.28/17.39 % (1107284)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 10.28/17.39 % (1107284)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.28/17.39 % (1107284)CaDiCaL version: 2.1.3
% 10.28/17.39 % (1107284)Termination reason: Instruction limit
% 10.28/17.39 % (1107284)Termination phase: Saturation
% 10.28/17.39 % (1107284)Time elapsed: 0.440 s
% 10.28/17.39 % (1107284)Peak memory usage: 12 MB
% 10.28/17.39 % (1107284)Instructions burned: 477 (million)
% 10.28/17.39 % (1107288)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=238731382:i=1179_2991 on theBenchmark for (2991ds/1179Mi)
% 10.28/17.39 % (1107289)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=3200284133:i=889:ins=1_2991 on theBenchmark for (2991ds/889Mi)
% 10.28/17.39 % (1107280)Instruction limit reached!
% 10.28/17.39 % (1107280)------------------------------
% 10.28/17.39 % (1107280)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 10.28/17.39 % (1107280)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.28/17.39 % (1107280)CaDiCaL version: 2.1.3
% 10.28/17.39 % (1107280)Termination reason: Instruction limit
% 10.28/17.39 % (1107280)Termination phase: Saturation
% 10.28/17.39 % (1107280)Time elapsed: 0.667 s
% 10.28/17.39 % (1107280)Peak memory usage: 17 MB
% 10.28/17.39 % (1107280)Instructions burned: 684 (million)
% 10.28/17.39 % TRYING [14]
% 10.28/17.39 % (1107292)ott+1_16_sil=32000:plsq=on:plsqc=2:sas=cadical:avsql=on:sp=reverse_frequency:plsqr=128,1:bsr=unit_only:rp=on:newcnf=on:random_seed=3087306571:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2990 on theBenchmark for (2990ds/692Mi)
% 10.28/17.39 % (1107286)Instruction limit reached!
% 10.28/17.39 % (1107286)------------------------------
% 10.28/17.39 % (1107286)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 10.28/17.39 % (1107286)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.28/17.39 % (1107286)CaDiCaL version: 2.1.3
% 10.28/17.39 % (1107286)Termination reason: Instruction limit
% 10.28/17.39 % (1107286)Termination phase: Finite model building SAT solving
% 10.28/17.39 % (1107286)Time elapsed: 0.707 s
% 10.28/17.39 % (1107286)Peak memory usage: 13 MB
% 10.28/17.39 % (1107286)Instructions burned: 865 (million)
% 10.28/17.39 % (1107294)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=1373570549:i=879:kws=inv_precedence:fsr=off_2988 on theBenchmark for (2988ds/879Mi)
% 10.28/17.39 % (1107289)Instruction limit reached!
% 10.28/17.39 % (1107289)------------------------------
% 10.28/17.39 % (1107289)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 10.28/17.39 % (1107289)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.28/17.39 % (1107289)CaDiCaL version: 2.1.3
% 10.28/17.39 % (1107289)Termination reason: Instruction limit
% 10.28/17.39 % (1107289)Termination phase: Finite model building constraint generation
% 10.28/17.39 % (1107289)Time elapsed: 0.613 s
% 10.28/17.39 % (1107289)Peak memory usage: 69 MB
% 10.28/17.39 % (1107289)Instructions burned: 890 (million)
% 10.28/17.39 % (1107292)Instruction limit reached!
% 10.28/17.39 % (1107292)------------------------------
% 10.28/17.39 % (1107292)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 10.28/17.39 % (1107292)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.28/17.39 % (1107292)CaDiCaL version: 2.1.3
% 10.28/17.39 % (1107292)Termination reason: Instruction limit
% 10.28/17.39 % (1107292)Termination phase: Saturation
% 10.28/17.39 % (1107292)Time elapsed: 0.550 s
% 10.28/17.39 % (1107292)Peak memory usage: 27 MB
% 10.28/17.39 % (1107292)Instructions burned: 692 (million)
% 10.28/17.39 % (1107288) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1107257-1107288"...
% 10.28/17.39 % (1107288)...printing done.
% 10.28/17.39 % (1107296)fmb+10_1_sil=64000:random_seed=800923049:i=22061:nm=2:gsp=on_2985 on theBenchmark for (2985ds/22061Mi)
% 10.28/17.39 % (1107288)Refutation found. Thanks to Tanya!
% 10.28/17.39 % SZS status Unsatisfiable for theBenchmark
% 10.28/17.39 % SZS output start Proof for theBenchmark
% See solution above
% 10.28/17.39 % (1107288)------------------------------
% 10.28/17.39 % (1107288)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 10.28/17.39 % (1107288)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.28/17.39 % (1107288)CaDiCaL version: 2.1.3
% 10.28/17.39 % (1107288)Termination reason: Refutation
% 10.28/17.39 % (1107288)Time elapsed: 0.671 s
% 10.28/17.39 % (1107288)Peak memory usage: 21 MB
% 10.28/17.39 % (1107288)Instructions burned: 680 (million)
% 10.28/17.39 % (1107257)Success in time 1.527 s
% 10.28/17.39 % Vampire exiting
%------------------------------------------------------------------------------