%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : COM003_1 : TPTP v9.3.1. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n026.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:40:05 AM UTC 2026
% Result : Theorem 0.18s 0.27s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 29
% Syntax : Number of formulae : 180 ( 19 unt; 0 typ; 24 def)
% Number of atoms : 598 ( 0 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 750 ( 332 ~; 301 |; 67 &)
% ( 22 <=>; 28 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 5 ( 4 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 29 ( 28 usr; 25 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-1 aty)
% Number of variables : 195 ( 0 sgn 162 !; 33 ?; 195 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
program: $tType ).
tff(type_def_6,type,
algorithm: $tType ).
tff(type_def_7,type,
input: $tType ).
tff(type_def_8,type,
output: $tType ).
tff(func_def_0,type,
bad: output ).
tff(func_def_1,type,
good: output ).
tff(func_def_2,type,
algorithm_of: program > algorithm ).
tff(func_def_3,type,
as_input: program > input ).
tff(func_def_4,type,
sK2: program ).
tff(func_def_5,type,
sK3: algorithm > program ).
tff(func_def_6,type,
sK4: algorithm > input ).
tff(func_def_7,type,
sK5: program > program ).
tff(func_def_8,type,
sK6: program ).
tff(func_def_9,type,
sK7: program > program ).
tff(func_def_10,type,
sK8: program ).
tff(func_def_11,type,
sK9: algorithm ).
tff(pred_def_1,type,
decides: ( algorithm * program * input ) > $o ).
tff(pred_def_2,type,
halts2: ( program * input ) > $o ).
tff(pred_def_3,type,
halts3: ( program * program * input ) > $o ).
tff(pred_def_4,type,
outputs: ( program * output ) > $o ).
tff(f1,axiom,
( ? [X0: algorithm] :
! [X1: program,X2: input] : decides(X0,X1,X2)
=> ? [X3: program] :
! [X1: program,X2: input] : decides(algorithm_of(X3),X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p1) ).
tff(f2,axiom,
! [X0: program,X1: program,X2: input] :
( decides(algorithm_of(X0),X1,X2)
=> ! [X1: program,X2: input] :
( ( halts2(X1,X2)
=> ( halts3(X0,X1,X2)
& outputs(X0,good) ) )
& ( ~ halts2(X1,X2)
=> ( halts3(X0,X1,X2)
& outputs(X0,bad) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p2) ).
tff(f3,axiom,
( ? [X0: program] :
! [X1: program] :
( ( halts2(X1,as_input(X1))
=> ( halts3(X0,X1,as_input(X1))
& outputs(X0,good) ) )
& ( ~ halts2(X1,as_input(X1))
=> ( halts3(X0,X1,as_input(X1))
& outputs(X0,bad) ) ) )
=> ? [X2: program] :
! [X1: program] :
( ( halts2(X1,as_input(X1))
=> ( halts2(X2,as_input(X1))
& outputs(X2,good) ) )
& ( ~ halts2(X1,as_input(X1))
=> ( halts2(X2,as_input(X1))
& outputs(X2,bad) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p3) ).
tff(f4,axiom,
( ? [X0: program] :
! [X1: program] :
( ( halts2(X1,as_input(X1))
=> ( halts2(X0,as_input(X1))
& outputs(X0,good) ) )
& ( ~ halts2(X1,as_input(X1))
=> ( halts2(X0,as_input(X1))
& outputs(X0,bad) ) ) )
=> ? [X2: program] :
! [X1: program] :
( ( halts2(X1,as_input(X1))
=> ~ halts2(X2,as_input(X1)) )
& ( ~ halts2(X1,as_input(X1))
=> ( halts2(X2,as_input(X1))
& outputs(X2,bad) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p4) ).
tff(f5,conjecture,
~ ? [X0: algorithm] :
! [X1: program,X2: input] : decides(X0,X1,X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
tff(f6,negated_conjecture,
~ ~ ? [X0: algorithm] :
! [X1: program,X2: input] : decides(X0,X1,X2),
inference(negated_conjecture,[status(cth)],[f5]) ).
tff(f7,plain,
( ? [X0: algorithm] :
! [X1: program,X2: input] : decides(X0,X1,X2)
=> ? [X3: program] :
! [X4: program,X5: input] : decides(algorithm_of(X3),X4,X5) ),
inference(rectify,[],[f1]) ).
tff(f8,plain,
! [X0: program,X1: program,X2: input] :
( decides(algorithm_of(X0),X1,X2)
=> ! [X3: program,X4: input] :
( ( halts2(X3,X4)
=> ( halts3(X0,X3,X4)
& outputs(X0,good) ) )
& ( ~ halts2(X3,X4)
=> ( halts3(X0,X3,X4)
& outputs(X0,bad) ) ) ) ),
inference(rectify,[],[f2]) ).
tff(f9,plain,
( ? [X0: program] :
! [X1: program] :
( ( halts2(X1,as_input(X1))
=> ( halts3(X0,X1,as_input(X1))
& outputs(X0,good) ) )
& ( ~ halts2(X1,as_input(X1))
=> ( halts3(X0,X1,as_input(X1))
& outputs(X0,bad) ) ) )
=> ? [X2: program] :
! [X3: program] :
( ( halts2(X3,as_input(X3))
=> ( halts2(X2,as_input(X3))
& outputs(X2,good) ) )
& ( ~ halts2(X3,as_input(X3))
=> ( halts2(X2,as_input(X3))
& outputs(X2,bad) ) ) ) ),
inference(rectify,[],[f3]) ).
tff(f10,plain,
( ? [X0: program] :
! [X1: program] :
( ( halts2(X1,as_input(X1))
=> ( halts2(X0,as_input(X1))
& outputs(X0,good) ) )
& ( ~ halts2(X1,as_input(X1))
=> ( halts2(X0,as_input(X1))
& outputs(X0,bad) ) ) )
=> ? [X2: program] :
! [X3: program] :
( ( halts2(X3,as_input(X3))
=> ~ halts2(X2,as_input(X3)) )
& ( ~ halts2(X3,as_input(X3))
=> ( halts2(X2,as_input(X3))
& outputs(X2,bad) ) ) ) ),
inference(rectify,[],[f4]) ).
tff(f11,plain,
? [X0: algorithm] :
! [X1: program,X2: input] : decides(X0,X1,X2),
inference(flattening,[],[f6]) ).
tff(f12,plain,
( ? [X3: program] :
! [X4: program,X5: input] : decides(algorithm_of(X3),X4,X5)
| ! [X0: algorithm] :
? [X1: program,X2: input] : ~ decides(X0,X1,X2) ),
inference(ennf_transformation,[],[f7]) ).
tff(f13,plain,
! [X0: program,X1: program,X2: input] :
( ! [X3: program,X4: input] :
( ( ( halts3(X0,X3,X4)
& outputs(X0,good) )
| ~ halts2(X3,X4) )
& ( ( halts3(X0,X3,X4)
& outputs(X0,bad) )
| halts2(X3,X4) ) )
| ~ decides(algorithm_of(X0),X1,X2) ),
inference(ennf_transformation,[],[f8]) ).
tff(f14,plain,
( ? [X2: program] :
! [X3: program] :
( ( ( halts2(X2,as_input(X3))
& outputs(X2,good) )
| ~ halts2(X3,as_input(X3)) )
& ( ( halts2(X2,as_input(X3))
& outputs(X2,bad) )
| halts2(X3,as_input(X3)) ) )
| ! [X0: program] :
? [X1: program] :
( ( ( ~ halts3(X0,X1,as_input(X1))
| ~ outputs(X0,good) )
& halts2(X1,as_input(X1)) )
| ( ( ~ halts3(X0,X1,as_input(X1))
| ~ outputs(X0,bad) )
& ~ halts2(X1,as_input(X1)) ) ) ),
inference(ennf_transformation,[],[f9]) ).
tff(f15,plain,
( ? [X2: program] :
! [X3: program] :
( ( ~ halts2(X2,as_input(X3))
| ~ halts2(X3,as_input(X3)) )
& ( ( halts2(X2,as_input(X3))
& outputs(X2,bad) )
| halts2(X3,as_input(X3)) ) )
| ! [X0: program] :
? [X1: program] :
( ( ( ~ halts2(X0,as_input(X1))
| ~ outputs(X0,good) )
& halts2(X1,as_input(X1)) )
| ( ( ~ halts2(X0,as_input(X1))
| ~ outputs(X0,bad) )
& ~ halts2(X1,as_input(X1)) ) ) ),
inference(ennf_transformation,[],[f10]) ).
tff(f16,definition,
( ! [X0: program] :
? [X1: program] :
( ( ( ~ halts3(X0,X1,as_input(X1))
| ~ outputs(X0,good) )
& halts2(X1,as_input(X1)) )
| ( ( ~ halts3(X0,X1,as_input(X1))
| ~ outputs(X0,bad) )
& ~ halts2(X1,as_input(X1)) ) )
| ~ sP0 ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
tff(f17,plain,
( ? [X2: program] :
! [X3: program] :
( ( ( halts2(X2,as_input(X3))
& outputs(X2,good) )
| ~ halts2(X3,as_input(X3)) )
& ( ( halts2(X2,as_input(X3))
& outputs(X2,bad) )
| halts2(X3,as_input(X3)) ) )
| sP0 ),
inference(definition_folding,[],[f14,f16]) ).
tff(f18,definition,
( ! [X0: program] :
? [X1: program] :
( ( ( ~ halts2(X0,as_input(X1))
| ~ outputs(X0,good) )
& halts2(X1,as_input(X1)) )
| ( ( ~ halts2(X0,as_input(X1))
| ~ outputs(X0,bad) )
& ~ halts2(X1,as_input(X1)) ) )
| ~ sP1 ),
introduced(definition,[new_symbols(definition,[sP1])],[predicate_definition_introduction]) ).
tff(f19,plain,
( ? [X2: program] :
! [X3: program] :
( ( ~ halts2(X2,as_input(X3))
| ~ halts2(X3,as_input(X3)) )
& ( ( halts2(X2,as_input(X3))
& outputs(X2,bad) )
| halts2(X3,as_input(X3)) ) )
| sP1 ),
inference(definition_folding,[],[f15,f18]) ).
tff(f20,plain,
( ? [X0: program] :
! [X1: program,X2: input] : decides(algorithm_of(X0),X1,X2)
| ! [X3: algorithm] :
? [X4: program,X5: input] : ~ decides(X3,X4,X5) ),
inference(rectify,[],[f12]) ).
tff(f21,plain,
( ! [X1: program,X2: input] : decides(algorithm_of(sK2),X1,X2)
| ! [X3: algorithm] : ~ decides(X3,sK3(X3),sK4(X3)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3,sK4]),skolemize(X0,sK2),skolemize(X4,sK3(X3)),skolemize(X5,sK4(X3))],[f20]) ).
tff(f22,plain,
( ! [X0: program] :
? [X1: program] :
( ( ( ~ halts3(X0,X1,as_input(X1))
| ~ outputs(X0,good) )
& halts2(X1,as_input(X1)) )
| ( ( ~ halts3(X0,X1,as_input(X1))
| ~ outputs(X0,bad) )
& ~ halts2(X1,as_input(X1)) ) )
| ~ sP0 ),
inference(nnf_transformation,[],[f16]) ).
tff(f23,plain,
( ! [X0: program] :
( ( ( ~ halts3(X0,sK5(X0),as_input(sK5(X0)))
| ~ outputs(X0,good) )
& halts2(sK5(X0),as_input(sK5(X0))) )
| ( ( ~ halts3(X0,sK5(X0),as_input(sK5(X0)))
| ~ outputs(X0,bad) )
& ~ halts2(sK5(X0),as_input(sK5(X0))) ) )
| ~ sP0 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(X1,sK5(X0))],[f22]) ).
tff(f24,plain,
( ? [X0: program] :
! [X1: program] :
( ( ( halts2(X0,as_input(X1))
& outputs(X0,good) )
| ~ halts2(X1,as_input(X1)) )
& ( ( halts2(X0,as_input(X1))
& outputs(X0,bad) )
| halts2(X1,as_input(X1)) ) )
| sP0 ),
inference(rectify,[],[f17]) ).
tff(f25,plain,
( ! [X1: program] :
( ( ( halts2(sK6,as_input(X1))
& outputs(sK6,good) )
| ~ halts2(X1,as_input(X1)) )
& ( ( halts2(sK6,as_input(X1))
& outputs(sK6,bad) )
| halts2(X1,as_input(X1)) ) )
| sP0 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6]),skolemize(X0,sK6)],[f24]) ).
tff(f26,plain,
( ! [X0: program] :
? [X1: program] :
( ( ( ~ halts2(X0,as_input(X1))
| ~ outputs(X0,good) )
& halts2(X1,as_input(X1)) )
| ( ( ~ halts2(X0,as_input(X1))
| ~ outputs(X0,bad) )
& ~ halts2(X1,as_input(X1)) ) )
| ~ sP1 ),
inference(nnf_transformation,[],[f18]) ).
tff(f27,plain,
( ! [X0: program] :
( ( ( ~ halts2(X0,as_input(sK7(X0)))
| ~ outputs(X0,good) )
& halts2(sK7(X0),as_input(sK7(X0))) )
| ( ( ~ halts2(X0,as_input(sK7(X0)))
| ~ outputs(X0,bad) )
& ~ halts2(sK7(X0),as_input(sK7(X0))) ) )
| ~ sP1 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK7]),skolemize(X1,sK7(X0))],[f26]) ).
tff(f28,plain,
( ? [X0: program] :
! [X1: program] :
( ( ~ halts2(X0,as_input(X1))
| ~ halts2(X1,as_input(X1)) )
& ( ( halts2(X0,as_input(X1))
& outputs(X0,bad) )
| halts2(X1,as_input(X1)) ) )
| sP1 ),
inference(rectify,[],[f19]) ).
tff(f29,plain,
( ! [X1: program] :
( ( ~ halts2(sK8,as_input(X1))
| ~ halts2(X1,as_input(X1)) )
& ( ( halts2(sK8,as_input(X1))
& outputs(sK8,bad) )
| halts2(X1,as_input(X1)) ) )
| sP1 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8]),skolemize(X0,sK8)],[f28]) ).
tff(f30,plain,
! [X1: program,X2: input] : decides(sK9,X1,X2),
inference(skolemize,[status(esa),new_symbols(skolem,[sK9]),skolemize(X0,sK9)],[f11]) ).
tff(f31,plain,
! [X2: input,X3: algorithm,X1: program] :
( decides(algorithm_of(sK2),X1,X2)
| ~ decides(X3,sK3(X3),sK4(X3)) ),
inference(cnf_transformation,[],[f21]) ).
tff(f32,plain,
! [X2: input,X3: program,X0: program,X1: program,X4: input] :
( outputs(X0,bad)
| halts2(X3,X4)
| ~ decides(algorithm_of(X0),X1,X2) ),
inference(cnf_transformation,[],[f13]) ).
tff(f33,plain,
! [X2: input,X3: program,X0: program,X1: program,X4: input] :
( ~ decides(algorithm_of(X0),X1,X2)
| halts2(X3,X4)
| halts3(X0,X3,X4) ),
inference(cnf_transformation,[],[f13]) ).
tff(f34,plain,
! [X2: input,X3: program,X0: program,X1: program,X4: input] :
( outputs(X0,good)
| ~ halts2(X3,X4)
| ~ decides(algorithm_of(X0),X1,X2) ),
inference(cnf_transformation,[],[f13]) ).
tff(f35,plain,
! [X2: input,X3: program,X0: program,X1: program,X4: input] :
( halts3(X0,X3,X4)
| ~ halts2(X3,X4)
| ~ decides(algorithm_of(X0),X1,X2) ),
inference(cnf_transformation,[],[f13]) ).
tff(f37,plain,
! [X0: program] :
( halts2(sK5(X0),as_input(sK5(X0)))
| ~ halts3(X0,sK5(X0),as_input(sK5(X0)))
| ~ outputs(X0,bad)
| ~ sP0 ),
inference(cnf_transformation,[],[f23]) ).
tff(f39,plain,
! [X0: program] :
( ~ halts3(X0,sK5(X0),as_input(sK5(X0)))
| ~ outputs(X0,good)
| ~ halts3(X0,sK5(X0),as_input(sK5(X0)))
| ~ outputs(X0,bad)
| ~ sP0 ),
inference(cnf_transformation,[],[f23]) ).
tff(f40,plain,
! [X1: program] :
( outputs(sK6,bad)
| halts2(X1,as_input(X1))
| sP0 ),
inference(cnf_transformation,[],[f25]) ).
tff(f41,plain,
! [X1: program] :
( halts2(sK6,as_input(X1))
| halts2(X1,as_input(X1))
| sP0 ),
inference(cnf_transformation,[],[f25]) ).
tff(f42,plain,
! [X1: program] :
( outputs(sK6,good)
| ~ halts2(X1,as_input(X1))
| sP0 ),
inference(cnf_transformation,[],[f25]) ).
tff(f43,plain,
! [X1: program] :
( halts2(sK6,as_input(X1))
| ~ halts2(X1,as_input(X1))
| sP0 ),
inference(cnf_transformation,[],[f25]) ).
tff(f46,plain,
! [X0: program] :
( ~ halts2(X0,as_input(sK7(X0)))
| ~ outputs(X0,good)
| ~ halts2(sK7(X0),as_input(sK7(X0)))
| ~ sP1 ),
inference(cnf_transformation,[],[f27]) ).
tff(f47,plain,
! [X0: program] :
( ~ halts2(X0,as_input(sK7(X0)))
| ~ outputs(X0,good)
| ~ halts2(X0,as_input(sK7(X0)))
| ~ outputs(X0,bad)
| ~ sP1 ),
inference(cnf_transformation,[],[f27]) ).
tff(f49,plain,
! [X1: program] :
( halts2(sK8,as_input(X1))
| halts2(X1,as_input(X1))
| sP1 ),
inference(cnf_transformation,[],[f29]) ).
tff(f50,plain,
! [X1: program] :
( ~ halts2(sK8,as_input(X1))
| ~ halts2(X1,as_input(X1))
| sP1 ),
inference(cnf_transformation,[],[f29]) ).
tff(f51,plain,
! [X2: input,X1: program] : decides(sK9,X1,X2),
inference(cnf_transformation,[],[f30]) ).
tff(f52,plain,
! [X0: program] :
( ~ halts2(X0,as_input(sK7(X0)))
| ~ outputs(X0,good)
| ~ outputs(X0,bad)
| ~ sP1 ),
inference(duplicate_literal_removal,[],[f47]) ).
tff(f53,plain,
! [X0: program] :
( ~ halts3(X0,sK5(X0),as_input(sK5(X0)))
| ~ outputs(X0,good)
| ~ outputs(X0,bad)
| ~ sP0 ),
inference(duplicate_literal_removal,[],[f39]) ).
tff(f55,definition,
( spl10_1
<=> sP1 ),
introduced(definition,[new_symbols(definition,[spl10_1])],[avatar_definition]) ).
tff(f59,definition,
( spl10_2
<=> ! [X1: program] : halts2(X1,as_input(X1)) ),
introduced(definition,[new_symbols(definition,[spl10_2])],[avatar_definition]) ).
tff(f60,plain,
( ! [X1: program] : halts2(X1,as_input(X1))
| ~ spl10_2 ),
inference(avatar_component_clause,[],[f59]) ).
tff(f67,definition,
( spl10_4
<=> ! [X1: program] :
( halts2(sK8,as_input(X1))
| halts2(X1,as_input(X1)) ) ),
introduced(definition,[new_symbols(definition,[spl10_4])],[avatar_definition]) ).
tff(f68,plain,
( ! [X1: program] :
( halts2(sK8,as_input(X1))
| halts2(X1,as_input(X1)) )
| ~ spl10_4 ),
inference(avatar_component_clause,[],[f67]) ).
tff(f69,plain,
( spl10_1
| spl10_4 ),
inference(avatar_split_clause,[],[f49,f67,f55]) ).
tff(f71,definition,
( spl10_5
<=> ! [X1: program] :
( ~ halts2(sK8,as_input(X1))
| ~ halts2(X1,as_input(X1)) ) ),
introduced(definition,[new_symbols(definition,[spl10_5])],[avatar_definition]) ).
tff(f72,plain,
( ! [X1: program] :
( ~ halts2(sK8,as_input(X1))
| ~ halts2(X1,as_input(X1)) )
| ~ spl10_5 ),
inference(avatar_component_clause,[],[f71]) ).
tff(f73,plain,
( spl10_1
| spl10_5 ),
inference(avatar_split_clause,[],[f50,f71,f55]) ).
tff(f79,definition,
( spl10_7
<=> ! [X0: program] :
( ~ halts2(X0,as_input(sK7(X0)))
| ~ halts2(sK7(X0),as_input(sK7(X0)))
| ~ outputs(X0,good) ) ),
introduced(definition,[new_symbols(definition,[spl10_7])],[avatar_definition]) ).
tff(f80,plain,
( ! [X0: program] :
( ~ halts2(X0,as_input(sK7(X0)))
| ~ halts2(sK7(X0),as_input(sK7(X0)))
| ~ outputs(X0,good) )
| ~ spl10_7 ),
inference(avatar_component_clause,[],[f79]) ).
tff(f81,plain,
( ~ spl10_1
| spl10_7 ),
inference(avatar_split_clause,[],[f46,f79,f55]) ).
tff(f83,definition,
( spl10_8
<=> ! [X0: program] :
( ~ halts2(X0,as_input(sK7(X0)))
| ~ outputs(X0,bad)
| ~ outputs(X0,good) ) ),
introduced(definition,[new_symbols(definition,[spl10_8])],[avatar_definition]) ).
tff(f84,plain,
( ! [X0: program] :
( ~ halts2(X0,as_input(sK7(X0)))
| ~ outputs(X0,bad)
| ~ outputs(X0,good) )
| ~ spl10_8 ),
inference(avatar_component_clause,[],[f83]) ).
tff(f85,plain,
( ~ spl10_1
| spl10_8 ),
inference(avatar_split_clause,[],[f52,f83,f55]) ).
tff(f87,definition,
( spl10_9
<=> sP0 ),
introduced(definition,[new_symbols(definition,[spl10_9])],[avatar_definition]) ).
tff(f91,definition,
( spl10_10
<=> outputs(sK6,bad) ),
introduced(definition,[new_symbols(definition,[spl10_10])],[avatar_definition]) ).
tff(f93,plain,
( outputs(sK6,bad)
| ~ spl10_10 ),
inference(avatar_component_clause,[],[f91]) ).
tff(f94,plain,
( spl10_9
| spl10_2
| spl10_10 ),
inference(avatar_split_clause,[],[f40,f91,f59,f87]) ).
tff(f96,definition,
( spl10_11
<=> ! [X1: program] :
( halts2(sK6,as_input(X1))
| halts2(X1,as_input(X1)) ) ),
introduced(definition,[new_symbols(definition,[spl10_11])],[avatar_definition]) ).
tff(f97,plain,
( ! [X1: program] :
( halts2(sK6,as_input(X1))
| halts2(X1,as_input(X1)) )
| ~ spl10_11 ),
inference(avatar_component_clause,[],[f96]) ).
tff(f98,plain,
( spl10_9
| spl10_11 ),
inference(avatar_split_clause,[],[f41,f96,f87]) ).
tff(f100,definition,
( spl10_12
<=> ! [X1: program] : ~ halts2(X1,as_input(X1)) ),
introduced(definition,[new_symbols(definition,[spl10_12])],[avatar_definition]) ).
tff(f101,plain,
( ! [X1: program] : ~ halts2(X1,as_input(X1))
| ~ spl10_12 ),
inference(avatar_component_clause,[],[f100]) ).
tff(f103,definition,
( spl10_13
<=> outputs(sK6,good) ),
introduced(definition,[new_symbols(definition,[spl10_13])],[avatar_definition]) ).
tff(f105,plain,
( outputs(sK6,good)
| ~ spl10_13 ),
inference(avatar_component_clause,[],[f103]) ).
tff(f106,plain,
( spl10_9
| spl10_12
| spl10_13 ),
inference(avatar_split_clause,[],[f42,f103,f100,f87]) ).
tff(f108,definition,
( spl10_14
<=> ! [X1: program] :
( halts2(sK6,as_input(X1))
| ~ halts2(X1,as_input(X1)) ) ),
introduced(definition,[new_symbols(definition,[spl10_14])],[avatar_definition]) ).
tff(f109,plain,
( ! [X1: program] :
( halts2(sK6,as_input(X1))
| ~ halts2(X1,as_input(X1)) )
| ~ spl10_14 ),
inference(avatar_component_clause,[],[f108]) ).
tff(f110,plain,
( spl10_9
| spl10_14 ),
inference(avatar_split_clause,[],[f43,f108,f87]) ).
tff(f112,definition,
( spl10_15
<=> ! [X0: program] :
( halts2(sK5(X0),as_input(sK5(X0)))
| ~ outputs(X0,bad)
| ~ halts3(X0,sK5(X0),as_input(sK5(X0))) ) ),
introduced(definition,[new_symbols(definition,[spl10_15])],[avatar_definition]) ).
tff(f113,plain,
( ! [X0: program] :
( halts2(sK5(X0),as_input(sK5(X0)))
| ~ outputs(X0,bad)
| ~ halts3(X0,sK5(X0),as_input(sK5(X0))) )
| ~ spl10_15 ),
inference(avatar_component_clause,[],[f112]) ).
tff(f114,plain,
( ~ spl10_9
| spl10_15 ),
inference(avatar_split_clause,[],[f37,f112,f87]) ).
tff(f120,definition,
( spl10_17
<=> ! [X0: program] :
( ~ halts3(X0,sK5(X0),as_input(sK5(X0)))
| ~ outputs(X0,bad)
| ~ outputs(X0,good) ) ),
introduced(definition,[new_symbols(definition,[spl10_17])],[avatar_definition]) ).
tff(f121,plain,
( ! [X0: program] :
( ~ halts3(X0,sK5(X0),as_input(sK5(X0)))
| ~ outputs(X0,bad)
| ~ outputs(X0,good) )
| ~ spl10_17 ),
inference(avatar_component_clause,[],[f120]) ).
tff(f122,plain,
( ~ spl10_9
| spl10_17 ),
inference(avatar_split_clause,[],[f53,f120,f87]) ).
tff(f124,definition,
( spl10_18
<=> ! [X4: input,X3: program] : halts2(X3,X4) ),
introduced(definition,[new_symbols(definition,[spl10_18])],[avatar_definition]) ).
tff(f125,plain,
( ! [X3: program,X4: input] : halts2(X3,X4)
| ~ spl10_18 ),
inference(avatar_component_clause,[],[f124]) ).
tff(f127,definition,
( spl10_19
<=> ! [X2: input,X0: program,X1: program] :
( outputs(X0,bad)
| ~ decides(algorithm_of(X0),X1,X2) ) ),
introduced(definition,[new_symbols(definition,[spl10_19])],[avatar_definition]) ).
tff(f128,plain,
( ! [X2: input,X0: program,X1: program] :
( ~ decides(algorithm_of(X0),X1,X2)
| outputs(X0,bad) )
| ~ spl10_19 ),
inference(avatar_component_clause,[],[f127]) ).
tff(f129,plain,
( spl10_18
| spl10_19 ),
inference(avatar_split_clause,[],[f32,f127,f124]) ).
tff(f131,definition,
( spl10_20
<=> ! [X4: input,X3: program] : ~ halts2(X3,X4) ),
introduced(definition,[new_symbols(definition,[spl10_20])],[avatar_definition]) ).
tff(f132,plain,
( ! [X3: program,X4: input] : ~ halts2(X3,X4)
| ~ spl10_20 ),
inference(avatar_component_clause,[],[f131]) ).
tff(f134,definition,
( spl10_21
<=> ! [X2: input,X0: program,X1: program] :
( outputs(X0,good)
| ~ decides(algorithm_of(X0),X1,X2) ) ),
introduced(definition,[new_symbols(definition,[spl10_21])],[avatar_definition]) ).
tff(f135,plain,
( ! [X2: input,X0: program,X1: program] :
( ~ decides(algorithm_of(X0),X1,X2)
| outputs(X0,good) )
| ~ spl10_21 ),
inference(avatar_component_clause,[],[f134]) ).
tff(f136,plain,
( spl10_20
| spl10_21 ),
inference(avatar_split_clause,[],[f34,f134,f131]) ).
tff(f138,definition,
( spl10_22
<=> ! [X3: algorithm] : ~ decides(X3,sK3(X3),sK4(X3)) ),
introduced(definition,[new_symbols(definition,[spl10_22])],[avatar_definition]) ).
tff(f139,plain,
( ! [X3: algorithm] : ~ decides(X3,sK3(X3),sK4(X3))
| ~ spl10_22 ),
inference(avatar_component_clause,[],[f138]) ).
tff(f141,definition,
( spl10_23
<=> ! [X2: input,X1: program] : decides(algorithm_of(sK2),X1,X2) ),
introduced(definition,[new_symbols(definition,[spl10_23])],[avatar_definition]) ).
tff(f142,plain,
( ! [X2: input,X1: program] : decides(algorithm_of(sK2),X1,X2)
| ~ spl10_23 ),
inference(avatar_component_clause,[],[f141]) ).
tff(f143,plain,
( spl10_22
| spl10_23 ),
inference(avatar_split_clause,[],[f31,f141,f138]) ).
tff(f144,plain,
( $false
| ~ spl10_18
| ~ spl10_20 ),
inference(forward_subsumption_resolution,[],[f132,f125]) ).
tff(f145,plain,
( ~ spl10_18
| ~ spl10_20 ),
inference(avatar_contradiction_clause,[],[f144]) ).
tff(f150,plain,
( $false
| ~ spl10_22 ),
inference(resolution,[],[f139,f51]) ).
tff(f151,plain,
~ spl10_22,
inference(avatar_contradiction_clause,[],[f150]) ).
tff(f155,plain,
( ! [X0: program] :
( ~ halts2(X0,as_input(sK7(X0)))
| ~ outputs(X0,good) )
| ~ spl10_2
| ~ spl10_7 ),
inference(forward_subsumption_resolution,[],[f80,f60]) ).
tff(f156,plain,
( ! [X1: program] : halts2(sK6,as_input(X1))
| ~ spl10_2
| ~ spl10_14 ),
inference(forward_subsumption_resolution,[],[f109,f60]) ).
tff(f157,plain,
( outputs(sK2,bad)
| ~ spl10_19
| ~ spl10_23 ),
inference(resolution,[],[f128,f142]) ).
tff(f158,plain,
( outputs(sK2,good)
| ~ spl10_21
| ~ spl10_23 ),
inference(resolution,[],[f135,f142]) ).
tff(f159,plain,
( ~ outputs(sK6,good)
| ~ spl10_2
| ~ spl10_7
| ~ spl10_14 ),
inference(resolution,[],[f155,f156]) ).
tff(f160,plain,
( $false
| ~ spl10_2
| ~ spl10_7
| ~ spl10_13
| ~ spl10_14 ),
inference(forward_subsumption_resolution,[],[f159,f105]) ).
tff(f161,plain,
( ~ spl10_2
| ~ spl10_7
| ~ spl10_13
| ~ spl10_14 ),
inference(avatar_contradiction_clause,[],[f160]) ).
tff(f163,plain,
( ! [X0: program,X1: input] :
( halts3(sK2,X0,X1)
| halts2(X0,X1) )
| ~ spl10_23 ),
inference(resolution,[],[f33,f142]) ).
tff(f165,plain,
! [X2: input,X3: program,X0: program,X1: program,X4: input] :
( ~ decides(algorithm_of(X0),X1,X2)
| halts3(X0,X3,X4) ),
inference(forward_subsumption_resolution,[],[f35,f33]) ).
tff(f166,plain,
( ! [X0: program,X1: input] : halts3(sK2,X0,X1)
| ~ spl10_23 ),
inference(resolution,[],[f165,f142]) ).
tff(f170,plain,
( halts2(sK8,as_input(sK8))
| ~ spl10_4 ),
inference(factoring,[],[f68]) ).
tff(f172,plain,
( ! [X1: program] : halts2(sK6,as_input(X1))
| ~ spl10_11
| ~ spl10_14 ),
inference(forward_subsumption_resolution,[],[f109,f97]) ).
tff(f173,plain,
( ~ outputs(sK6,bad)
| ~ outputs(sK6,good)
| ~ spl10_8
| ~ spl10_11
| ~ spl10_14 ),
inference(resolution,[],[f84,f172]) ).
tff(f174,plain,
( ~ outputs(sK6,good)
| ~ spl10_8
| ~ spl10_10
| ~ spl10_11
| ~ spl10_14 ),
inference(forward_subsumption_resolution,[],[f173,f93]) ).
tff(f177,plain,
( ~ spl10_13
| ~ spl10_8
| ~ spl10_10
| ~ spl10_11
| ~ spl10_14 ),
inference(avatar_split_clause,[],[f174,f108,f96,f91,f83,f103]) ).
tff(f180,plain,
( $false
| ~ spl10_11
| ~ spl10_12
| ~ spl10_14 ),
inference(resolution,[],[f101,f172]) ).
tff(f185,plain,
( ~ spl10_11
| ~ spl10_12
| ~ spl10_14 ),
inference(avatar_contradiction_clause,[],[f180]) ).
tff(f188,plain,
( ~ halts2(sK8,as_input(sK8))
| ~ spl10_4
| ~ spl10_5 ),
inference(resolution,[],[f72,f170]) ).
tff(f189,plain,
( $false
| ~ spl10_4
| ~ spl10_5 ),
inference(forward_subsumption_resolution,[],[f188,f170]) ).
tff(f190,plain,
( ~ spl10_4
| ~ spl10_5 ),
inference(avatar_contradiction_clause,[],[f189]) ).
tff(f193,plain,
( ~ outputs(sK2,bad)
| ~ outputs(sK2,good)
| ~ spl10_17
| ~ spl10_23 ),
inference(resolution,[],[f121,f166]) ).
tff(f196,plain,
( ~ outputs(sK2,good)
| ~ spl10_17
| ~ spl10_19
| ~ spl10_23 ),
inference(forward_subsumption_resolution,[],[f193,f157]) ).
tff(f198,plain,
( $false
| ~ spl10_17
| ~ spl10_19
| ~ spl10_21
| ~ spl10_23 ),
inference(forward_subsumption_resolution,[],[f196,f158]) ).
tff(f199,plain,
( ~ spl10_17
| ~ spl10_19
| ~ spl10_21
| ~ spl10_23 ),
inference(avatar_contradiction_clause,[],[f198]) ).
tff(f207,definition,
( spl10_25
<=> outputs(sK2,bad) ),
introduced(definition,[new_symbols(definition,[spl10_25])],[avatar_definition]) ).
tff(f208,plain,
( outputs(sK2,bad)
| ~ spl10_25 ),
inference(avatar_component_clause,[],[f207]) ).
tff(f216,plain,
( spl10_25
| ~ spl10_19
| ~ spl10_23 ),
inference(avatar_split_clause,[],[f157,f141,f127,f207]) ).
tff(f218,definition,
( spl10_26
<=> outputs(sK2,good) ),
introduced(definition,[new_symbols(definition,[spl10_26])],[avatar_definition]) ).
tff(f219,plain,
( outputs(sK2,good)
| ~ spl10_26 ),
inference(avatar_component_clause,[],[f218]) ).
tff(f234,plain,
( ! [X0: program] :
( ~ halts3(X0,sK5(X0),as_input(sK5(X0)))
| ~ outputs(X0,bad) )
| ~ spl10_15
| ~ spl10_20 ),
inference(forward_subsumption_resolution,[],[f113,f132]) ).
tff(f236,plain,
( ~ outputs(sK2,bad)
| halts2(sK5(sK2),as_input(sK5(sK2)))
| ~ spl10_15
| ~ spl10_20
| ~ spl10_23 ),
inference(resolution,[],[f234,f163]) ).
tff(f237,plain,
( halts2(sK5(sK2),as_input(sK5(sK2)))
| ~ spl10_15
| ~ spl10_20
| ~ spl10_23
| ~ spl10_25 ),
inference(forward_subsumption_resolution,[],[f236,f208]) ).
tff(f240,plain,
( $false
| ~ spl10_15
| ~ spl10_20
| ~ spl10_23
| ~ spl10_25 ),
inference(forward_subsumption_resolution,[],[f237,f132]) ).
tff(f241,plain,
( ~ spl10_15
| ~ spl10_20
| ~ spl10_23
| ~ spl10_25 ),
inference(avatar_contradiction_clause,[],[f240]) ).
tff(f245,plain,
( spl10_26
| ~ spl10_21
| ~ spl10_23 ),
inference(avatar_split_clause,[],[f158,f141,f134,f218]) ).
tff(f249,plain,
( ! [X0: program] :
( ~ halts2(sK7(X0),as_input(sK7(X0)))
| ~ outputs(X0,good) )
| ~ spl10_7
| ~ spl10_18 ),
inference(forward_subsumption_resolution,[],[f80,f125]) ).
tff(f250,plain,
( ! [X0: program] : ~ outputs(X0,good)
| ~ spl10_7
| ~ spl10_18 ),
inference(forward_subsumption_resolution,[],[f249,f125]) ).
tff(f251,plain,
( $false
| ~ spl10_7
| ~ spl10_18
| ~ spl10_26 ),
inference(resolution,[],[f250,f219]) ).
tff(f252,plain,
( ~ spl10_7
| ~ spl10_18
| ~ spl10_26 ),
inference(avatar_contradiction_clause,[],[f251]) ).
cnf(s2,plain,
( spl10_1
| spl10_4 ),
inference(sat_conversion,[],[f69]) ).
cnf(s3,plain,
( spl10_1
| spl10_5 ),
inference(sat_conversion,[],[f73]) ).
cnf(s5,plain,
( ~ spl10_1
| spl10_7 ),
inference(sat_conversion,[],[f81]) ).
cnf(s6,plain,
( ~ spl10_1
| spl10_8 ),
inference(sat_conversion,[],[f85]) ).
cnf(s7,plain,
( spl10_2
| spl10_9
| spl10_10 ),
inference(sat_conversion,[],[f94]) ).
cnf(s8,plain,
( spl10_9
| spl10_11 ),
inference(sat_conversion,[],[f98]) ).
cnf(s9,plain,
( spl10_9
| spl10_12
| spl10_13 ),
inference(sat_conversion,[],[f106]) ).
cnf(s10,plain,
( spl10_9
| spl10_14 ),
inference(sat_conversion,[],[f110]) ).
cnf(s11,plain,
( ~ spl10_9
| spl10_15 ),
inference(sat_conversion,[],[f114]) ).
cnf(s13,plain,
( ~ spl10_9
| spl10_17 ),
inference(sat_conversion,[],[f122]) ).
cnf(s14,plain,
( spl10_18
| spl10_19 ),
inference(sat_conversion,[],[f129]) ).
cnf(s15,plain,
( spl10_20
| spl10_21 ),
inference(sat_conversion,[],[f136]) ).
cnf(s16,plain,
( spl10_22
| spl10_23 ),
inference(sat_conversion,[],[f143]) ).
cnf(s17,plain,
( ~ spl10_18
| ~ spl10_20 ),
inference(sat_conversion,[],[f145]) ).
cnf(s20,plain,
~ spl10_22,
inference(sat_conversion,[],[f151]) ).
cnf(s22,plain,
( ~ spl10_2
| ~ spl10_7
| ~ spl10_13
| ~ spl10_14 ),
inference(sat_conversion,[],[f161]) ).
cnf(s25,plain,
( ~ spl10_8
| ~ spl10_10
| ~ spl10_11
| ~ spl10_13
| ~ spl10_14 ),
inference(sat_conversion,[],[f177]) ).
cnf(s28,plain,
( ~ spl10_11
| ~ spl10_12
| ~ spl10_14 ),
inference(sat_conversion,[],[f185]) ).
cnf(s29,plain,
( ~ spl10_4
| ~ spl10_5 ),
inference(sat_conversion,[],[f190]) ).
cnf(s32,plain,
( ~ spl10_17
| ~ spl10_19
| ~ spl10_21
| ~ spl10_23 ),
inference(sat_conversion,[],[f199]) ).
cnf(s36,plain,
( ~ spl10_19
| ~ spl10_23
| spl10_25 ),
inference(sat_conversion,[],[f216]) ).
cnf(s46,plain,
( ~ spl10_15
| ~ spl10_20
| ~ spl10_23
| ~ spl10_25 ),
inference(sat_conversion,[],[f241]) ).
cnf(s50,plain,
( ~ spl10_21
| ~ spl10_23
| spl10_26 ),
inference(sat_conversion,[],[f245]) ).
cnf(s52,plain,
( ~ spl10_7
| ~ spl10_18
| ~ spl10_26 ),
inference(sat_conversion,[],[f252]) ).
cnf(s53,plain,
spl10_23,
inference(rat,[],[s16,s20]) ).
cnf(s54,plain,
spl10_1,
inference(rat,[],[s29,s2,s3]) ).
cnf(s55,plain,
spl10_8,
inference(rat,[],[s6,s54]) ).
cnf(s56,plain,
spl10_7,
inference(rat,[],[s5,s54]) ).
cnf(s58,plain,
( spl10_9
| spl10_2 ),
inference(rat,[],[s9,s25,s28,s7,s8,s10,s55]) ).
cnf(s59,plain,
( ~ spl10_21
| ~ spl10_17 ),
inference(rat,[],[s14,s52,s32,s50,s56,s53]) ).
cnf(s60,plain,
~ spl10_9,
inference(rat,[],[s36,s14,s46,s17,s15,s59,s11,s13,s53]) ).
cnf(s61,plain,
spl10_14,
inference(rat,[],[s10,s60]) ).
cnf(s62,plain,
spl10_11,
inference(rat,[],[s8,s60]) ).
cnf(s63,plain,
spl10_2,
inference(rat,[],[s58,s60]) ).
cnf(s64,plain,
~ spl10_12,
inference(rat,[],[s28,s62,s61]) ).
cnf(s67,plain,
~ spl10_13,
inference(rat,[],[s22,s61,s56,s63]) ).
cnf(s68,plain,
$false,
inference(rat,[],[s9,s60,s64,s67]) ).
tff(f253,plain,
$false,
inference(avatar_sat_refutation,[],[s68]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COM003_1 : TPTP v9.3.1. Released v5.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.19 % Computer : n026.cluster.edu
% 0.07/0.19 % Model : x86_64 x86_64
% 0.07/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.19 % Memory : 8046.5625MB
% 0.07/0.19 % OS : Linux 6.8.0-71-generic
% 0.07/0.19 % CPULimit : 300
% 0.07/0.19 % WCLimit : 300
% 0.07/0.19 % DateTime : Mon Sep 28 21:46:33 UTC 2026
% 0.07/0.19 % CPUTime :
% 0.07/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.22 Running first-order model finding
% 0.07/0.22 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
% 0.18/0.27 % (111372)Will run a generic schedule for satisfiability detection.
% 0.18/0.27 % (111377)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2675914081_2999 on theBenchmark for (2999ds/0Mi)
% 0.18/0.27 % TRYING [1]
% 0.18/0.27 % TRYING [2]
% 0.18/0.27 % (111378)% WARNING: option uhcvi not known.
% 0.18/0.27 % TRYING [3]
% 0.18/0.27 % (111379)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=649053916:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.18/0.27 % (111378)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=208869949:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.18/0.27 % (111380)dis+10_1_sil=32000:sp=arity:random_seed=2005910355:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.18/0.27 % (111381)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1085429504:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.18/0.27 % (111383)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3917776355:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.18/0.27 % (111382)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2185090008:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.18/0.27 % TRYING [4]
% 0.18/0.27 % (111380) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-111372-111380"...
% 0.18/0.27 % (111382) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-111372-111382"...
% 0.18/0.27 % (111378) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-111372-111378"...
% 0.18/0.27 % (111381) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-111372-111381"...
% 0.18/0.27 % (111383) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-111372-111383"...
% 0.18/0.27 % (111379) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-111372-111379"...
% 0.18/0.27 % (111380)...printing done.
% 0.18/0.27 % (111382)...printing done.
% 0.18/0.27 % (111378)...printing done.
% 0.18/0.27 % (111381)...printing done.
% 0.18/0.27 % (111380)Refutation found. Thanks to Tanya!
% 0.18/0.27 % SZS status Theorem for theBenchmark
% 0.18/0.27 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.27 % (111380)------------------------------
% 0.18/0.27 % (111380)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.27 % (111380)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.27 % (111380)CaDiCaL version: 2.1.3
% 0.18/0.27 % (111380)Termination reason: Refutation
% 0.18/0.27 % (111380)Time elapsed: 0.006 s
% 0.18/0.27 % (111380)Peak memory usage: 12 MB
% 0.18/0.27 % (111380)Instructions burned: 7 (million)
% 0.18/0.27 % (111372)Success in time 0.039 s
% 0.18/0.27 % Vampire exiting
%------------------------------------------------------------------------------