%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : COM003_1 : TPTP v9.3.1. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n010.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:38:59 AM UTC 2026
% Result : Theorem 2.99s 1.05s
% Output : Refutation 3.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 27
% Syntax : Number of formulae : 170 ( 19 unt; 0 typ; 22 def)
% Number of atoms : 582 ( 0 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 745 ( 333 ~; 297 |; 67 &)
% ( 20 <=>; 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 : 27 ( 26 usr; 23 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-1 aty)
% Number of variables : 208 ( 0 sgn 175 !; 33 ?; 208 :)
% 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/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/benchmark/theBenchmark.p',p4) ).
tff(f5,conjecture,
~ ? [X0: algorithm] :
! [X1: program,X2: input] : decides(X0,X1,X2),
file('/export/starexec/sandbox2/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] :
( halts2(X3,X4)
| halts3(X0,X3,X4)
| ~ decides(algorithm_of(X0),X1,X2) ),
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] :
( ~ outputs(X0,good)
| ~ outputs(X0,bad)
| ~ halts2(X0,as_input(sK7(X0))) )
| ~ 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] :
( ~ outputs(X0,good)
| ~ outputs(X0,bad)
| ~ halts3(X0,sK5(X0),as_input(sK5(X0))) )
| ~ 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] :
( outputs(X0,bad)
| ~ decides(algorithm_of(X0),X1,X2) )
| ~ 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] :
( outputs(X0,good)
| ~ decides(algorithm_of(X0),X1,X2) )
| ~ 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(f148,plain,
( $false
| ~ spl10_22 ),
inference(resolution,[],[f139,f51]) ).
tff(f149,plain,
~ spl10_22,
inference(avatar_contradiction_clause,[],[f148]) ).
tff(f153,plain,
! [X2: input,X3: program,X0: program,X1: program,X4: input] :
( halts3(X0,X3,X4)
| ~ decides(algorithm_of(X0),X1,X2) ),
inference(forward_subsumption_resolution,[],[f35,f33]) ).
tff(f159,plain,
( ~ halts2(sK8,as_input(sK8))
| ~ spl10_5 ),
inference(factoring,[],[f72]) ).
tff(f160,plain,
( halts2(sK8,as_input(sK8))
| ~ spl10_4
| ~ spl10_5 ),
inference(resolution,[],[f159,f68]) ).
tff(f162,plain,
( $false
| ~ spl10_4
| ~ spl10_5 ),
inference(forward_subsumption_resolution,[],[f160,f159]) ).
tff(f163,plain,
( ~ spl10_4
| ~ spl10_5 ),
inference(avatar_contradiction_clause,[],[f162]) ).
tff(f164,plain,
( ! [X1: program] : halts2(sK6,as_input(X1))
| ~ spl10_11
| ~ spl10_14 ),
inference(forward_subsumption_resolution,[],[f109,f97]) ).
tff(f166,plain,
( ~ outputs(sK6,bad)
| ~ halts2(sK6,as_input(sK7(sK6)))
| ~ spl10_8
| ~ spl10_13 ),
inference(resolution,[],[f84,f105]) ).
tff(f167,plain,
( ~ halts2(sK6,as_input(sK7(sK6)))
| ~ spl10_8
| ~ spl10_10
| ~ spl10_13 ),
inference(forward_subsumption_resolution,[],[f166,f93]) ).
tff(f169,plain,
( $false
| ~ spl10_8
| ~ spl10_10
| ~ spl10_11
| ~ spl10_13
| ~ spl10_14 ),
inference(forward_subsumption_resolution,[],[f167,f164]) ).
tff(f170,plain,
( ~ spl10_8
| ~ spl10_10
| ~ spl10_11
| ~ spl10_13
| ~ spl10_14 ),
inference(avatar_contradiction_clause,[],[f169]) ).
tff(f173,plain,
( $false
| ~ spl10_11
| ~ spl10_12
| ~ spl10_14 ),
inference(resolution,[],[f101,f164]) ).
tff(f175,plain,
( ~ spl10_11
| ~ spl10_12
| ~ spl10_14 ),
inference(avatar_contradiction_clause,[],[f173]) ).
tff(f177,plain,
( ! [X2: input,X0: program,X1: program] :
( ~ outputs(X0,bad)
| ~ halts3(X0,sK5(X0),as_input(sK5(X0)))
| ~ decides(algorithm_of(X0),X1,X2) )
| ~ spl10_17
| ~ spl10_21 ),
inference(resolution,[],[f121,f135]) ).
tff(f178,plain,
( ! [X2: input,X0: program,X1: program] :
( ~ halts3(X0,sK5(X0),as_input(sK5(X0)))
| ~ decides(algorithm_of(X0),X1,X2) )
| ~ spl10_17
| ~ spl10_19
| ~ spl10_21 ),
inference(forward_subsumption_resolution,[],[f177,f128]) ).
tff(f179,plain,
( ! [X2: input,X0: program,X1: program] : ~ decides(algorithm_of(X0),X1,X2)
| ~ spl10_17
| ~ spl10_19
| ~ spl10_21 ),
inference(forward_subsumption_resolution,[],[f178,f153]) ).
tff(f180,plain,
( $false
| ~ spl10_17
| ~ spl10_19
| ~ spl10_21
| ~ spl10_23 ),
inference(resolution,[],[f179,f142]) ).
tff(f181,plain,
( ~ spl10_17
| ~ spl10_19
| ~ spl10_21
| ~ spl10_23 ),
inference(avatar_contradiction_clause,[],[f180]) ).
tff(f200,plain,
( ! [X0: program] :
( ~ halts2(sK7(X0),as_input(sK7(X0)))
| ~ outputs(X0,good) )
| ~ spl10_7
| ~ spl10_18 ),
inference(forward_subsumption_resolution,[],[f80,f125]) ).
tff(f201,plain,
( ! [X0: program] : ~ outputs(X0,good)
| ~ spl10_7
| ~ spl10_18 ),
inference(forward_subsumption_resolution,[],[f200,f125]) ).
tff(f202,plain,
( ! [X2: input,X0: program,X1: program] : ~ decides(algorithm_of(X0),X1,X2)
| ~ spl10_7
| ~ spl10_18
| ~ spl10_21 ),
inference(resolution,[],[f201,f135]) ).
tff(f203,plain,
( $false
| ~ spl10_7
| ~ spl10_18
| ~ spl10_21
| ~ spl10_23 ),
inference(resolution,[],[f202,f142]) ).
tff(f204,plain,
( ~ spl10_7
| ~ spl10_18
| ~ spl10_21
| ~ spl10_23 ),
inference(avatar_contradiction_clause,[],[f203]) ).
tff(f206,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(f207,plain,
( ! [X2: input,X0: program,X1: program] :
( ~ outputs(X0,bad)
| ~ decides(algorithm_of(X0),X1,X2) )
| ~ spl10_15
| ~ spl10_20 ),
inference(resolution,[],[f206,f153]) ).
tff(f208,plain,
( ! [X2: input,X0: program,X1: program] : ~ decides(algorithm_of(X0),X1,X2)
| ~ spl10_15
| ~ spl10_19
| ~ spl10_20 ),
inference(forward_subsumption_resolution,[],[f207,f128]) ).
tff(f209,plain,
( $false
| ~ spl10_15
| ~ spl10_19
| ~ spl10_20
| ~ spl10_23 ),
inference(resolution,[],[f208,f142]) ).
tff(f210,plain,
( ~ spl10_15
| ~ spl10_19
| ~ spl10_20
| ~ spl10_23 ),
inference(avatar_contradiction_clause,[],[f209]) ).
tff(f222,plain,
( ! [X0: program] :
( ~ outputs(X0,good)
| ~ halts2(X0,as_input(sK7(X0))) )
| ~ spl10_2
| ~ spl10_7 ),
inference(forward_subsumption_resolution,[],[f80,f60]) ).
tff(f224,plain,
( ~ halts2(sK6,as_input(sK7(sK6)))
| ~ spl10_2
| ~ spl10_7
| ~ spl10_13 ),
inference(resolution,[],[f222,f105]) ).
tff(f225,plain,
( $false
| ~ spl10_2
| ~ spl10_7
| ~ spl10_11
| ~ spl10_13
| ~ spl10_14 ),
inference(forward_subsumption_resolution,[],[f224,f164]) ).
tff(f226,plain,
( ~ spl10_2
| ~ spl10_7
| ~ spl10_11
| ~ spl10_13
| ~ spl10_14 ),
inference(avatar_contradiction_clause,[],[f225]) ).
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(s19,plain,
~ spl10_22,
inference(sat_conversion,[],[f149]) ).
cnf(s22,plain,
( ~ spl10_4
| ~ spl10_5 ),
inference(sat_conversion,[],[f163]) ).
cnf(s23,plain,
( ~ spl10_8
| ~ spl10_10
| ~ spl10_11
| ~ spl10_13
| ~ spl10_14 ),
inference(sat_conversion,[],[f170]) ).
cnf(s24,plain,
( ~ spl10_11
| ~ spl10_12
| ~ spl10_14 ),
inference(sat_conversion,[],[f175]) ).
cnf(s25,plain,
( ~ spl10_17
| ~ spl10_19
| ~ spl10_21
| ~ spl10_23 ),
inference(sat_conversion,[],[f181]) ).
cnf(s30,plain,
( ~ spl10_7
| ~ spl10_18
| ~ spl10_21
| ~ spl10_23 ),
inference(sat_conversion,[],[f204]) ).
cnf(s31,plain,
( ~ spl10_15
| ~ spl10_19
| ~ spl10_20
| ~ spl10_23 ),
inference(sat_conversion,[],[f210]) ).
cnf(s33,plain,
( ~ spl10_2
| ~ spl10_7
| ~ spl10_11
| ~ spl10_13
| ~ spl10_14 ),
inference(sat_conversion,[],[f226]) ).
cnf(s34,plain,
spl10_23,
inference(rat,[],[s16,s19]) ).
cnf(s35,plain,
spl10_1,
inference(rat,[],[s22,s2,s3]) ).
cnf(s36,plain,
spl10_8,
inference(rat,[],[s6,s35]) ).
cnf(s37,plain,
spl10_7,
inference(rat,[],[s5,s35]) ).
cnf(s39,plain,
( spl10_9
| spl10_2 ),
inference(rat,[],[s9,s23,s24,s7,s8,s10,s36]) ).
cnf(s40,plain,
( ~ spl10_21
| ~ spl10_17 ),
inference(rat,[],[s14,s30,s25,s34,s37]) ).
cnf(s41,plain,
~ spl10_9,
inference(rat,[],[s14,s31,s17,s15,s40,s11,s13,s34]) ).
cnf(s42,plain,
spl10_14,
inference(rat,[],[s10,s41]) ).
cnf(s43,plain,
spl10_11,
inference(rat,[],[s8,s41]) ).
cnf(s44,plain,
spl10_2,
inference(rat,[],[s39,s41]) ).
cnf(s45,plain,
~ spl10_12,
inference(rat,[],[s24,s43,s42]) ).
cnf(s47,plain,
~ spl10_13,
inference(rat,[],[s33,s42,s44,s37,s43]) ).
cnf(s49,plain,
$false,
inference(rat,[],[s9,s41,s45,s47]) ).
tff(f227,plain,
$false,
inference(avatar_sat_refutation,[],[s49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : COM003_1 : TPTP v9.3.1. Released v5.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.19 % Computer : n010.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Mon Sep 28 21:44:09 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.23 Running first-order theorem proving
% 0.08/0.23 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.99/1.05 % (2389379)Detected formulas, will run a generic FOF schedule.
% 2.99/1.05 % (2389455)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2513099808:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.99/1.05 % (2389455)Refutation not found, incomplete strategy
% 2.99/1.05 % (2389455)------------------------------
% 2.99/1.05 % (2389455)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.99/1.05 % (2389455)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.99/1.05 % (2389455)CaDiCaL version: 2.1.3
% 2.99/1.05 % (2389455)Termination reason: Refutation not found, incomplete strategy
% 2.99/1.05 % (2389455)Time elapsed: 0.0000 s
% 2.99/1.05 % (2389455)Peak memory usage: 86 MB
% 2.99/1.05 % (2389452)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=2098208984:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.99/1.05 % (2389453)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=1074575311:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.99/1.05 % (2389454)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=229721374:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.99/1.05 % (2389458)dis-21_1_sil=8000:lcm=predicate:random_seed=821258940: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.99/1.05 % (2389456)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1038153911:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.99/1.05 % (2389457)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2415730273:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.99/1.05 % (2389456)Refutation not found, incomplete strategy
% 2.99/1.05 % (2389456)------------------------------
% 2.99/1.05 % (2389456)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.99/1.05 % (2389456)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.99/1.05 % (2389456)CaDiCaL version: 2.1.3
% 2.99/1.05 % (2389456)Termination reason: Refutation not found, incomplete strategy
% 2.99/1.05 % (2389456)Time elapsed: 0.0000 s
% 2.99/1.05 % (2389456)Peak memory usage: 86 MB
% 2.99/1.05 % (2389457)First to succeed.
% 2.99/1.05 % (2389458)Also succeeded, but the first one will report.
% 2.99/1.05 % (2389457)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2389379"
% 2.99/1.05 % (2389455)------------------------------
% 2.99/1.05 % (2389455)------------------------------
% 2.99/1.05 % (2389457)Refutation found. Thanks to Tanya!
% 2.99/1.05 % SZS status Theorem for theBenchmark
% 2.99/1.05 % SZS output start Proof for theBenchmark
% See solution above
% 3.35/1.24 % (2389457)------------------------------
% 3.35/1.24 % (2389457)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.35/1.24 % (2389457)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.35/1.24 % (2389457)CaDiCaL version: 2.1.3
% 3.35/1.24 % (2389457)Termination reason: Refutation
% 3.35/1.24 % (2389457)Time elapsed: 0.007 s
% 3.35/1.24 % (2389457)Peak memory usage: 89 MB
% 3.35/1.24 % (2389457)Instructions burned: 8 (million)
% 3.35/1.24 % (2389457)------------------------------
% 3.35/1.24 % (2389457)------------------------------
% 3.35/1.24 % (2389379)Success in time 0.378 s
% 3.35/1.24 % Vampire exiting
%------------------------------------------------------------------------------