%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : ITP006+2 : TPTP v9.3.1. Bugfixed v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n019.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:27:49 AM UTC 2026
% Result : Theorem 5.63s 1.77s
% Output : Refutation 7.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 10
% Syntax : Number of formulae : 69 ( 12 unt; 7 def)
% Number of atoms : 428 ( 8 equ)
% Maximal formula atoms : 38 ( 6 avg)
% Number of connectives : 587 ( 228 ~; 207 |; 84 &)
% ( 26 <=>; 42 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 8 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 3 prp; 0-4 aty)
% Number of functors : 16 ( 16 usr; 6 con; 0-3 aty)
% Number of variables : 209 ( 0 sgn 179 !; 30 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0,X1,X2] :
( mem(X2,arr(X0,X1))
=> ! [X3] :
( mem(X3,X0)
=> mem(ap(X2,X3),X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ap_tp) ).
fof(f40,axiom,
! [X0] :
( ne(X0)
=> ! [X1] :
( ne(X1)
=> ! [X2] :
( mem(X2,arr(X0,X1))
=> ! [X3] :
( mem(X3,arr(X1,bool))
=> ( ( p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS(X0,X1),X2),X3))
<=> ! [X4] :
( mem(X4,X1)
=> ( p(ap(X3,X4))
=> ? [X5] :
( mem(X5,X0)
& p(ap(X3,ap(X2,X5))) ) ) ) )
& ( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL(X0,X1),X2),X3))
<=> ! [X6] :
( mem(X6,X1)
=> ( ~ p(ap(X3,X6))
=> ? [X7] :
( mem(X7,X0)
& ~ p(ap(X3,ap(X2,X7))) ) ) ) )
& ! [X8] :
( mem(X8,arr(X0,X1))
=> ! [X9] :
( mem(X9,arr(X1,bool))
=> ( p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__POINT(X0,X1),X8),X9))
<=> ! [X10] :
( mem(X10,X0)
=> p(ap(X9,ap(X8,X10))) ) ) ) )
& ! [X11] :
( mem(X11,arr(X0,X1))
=> ! [X12] :
( mem(X12,arr(X1,bool))
=> ( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X0,X1),X11),X12))
<=> ! [X13] :
( mem(X13,X0)
=> ~ p(ap(X12,ap(X11,X13))) ) ) ) )
& ! [X14] :
( mem(X14,arr(X0,X1))
=> ! [X15] :
( mem(X15,arr(X1,bool))
=> ( p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__GAP(X0,X1),X14),X15))
<=> ! [X16] :
( mem(X16,X1)
=> ( p(ap(X15,X16))
=> ? [X17] :
( mem(X17,X0)
& X16 = ap(X14,X17) ) ) ) ) ) )
& ! [X18] :
( mem(X18,arr(X0,X1))
=> ! [X19] :
( mem(X19,arr(X1,bool))
=> ( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__GAP(X0,X1),X18),X19))
<=> ! [X20] :
( mem(X20,X1)
=> ( ~ p(ap(X19,X20))
=> ? [X21] :
( mem(X21,X0)
& X20 = ap(X18,X21) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_thm_2EquantHeuristics_2EGUESS__REWRITES) ).
fof(f52,conjecture,
! [X0] :
( ne(X0)
=> ! [X1] :
( ne(X1)
=> ! [X2] :
( mem(X2,arr(X1,X0))
=> ! [X3] :
( mem(X3,arr(X0,bool))
=> ! [X4] :
( mem(X4,arr(X0,bool))
=> ( ! [X5] :
( mem(X5,X0)
=> ( p(ap(X4,X5))
=> p(ap(X3,X5)) ) )
=> ( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X0),X2),X3))
=> p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X0),X2),X4)) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_thm_2EquantHeuristics_2EGUESS__RULES__WEAKEN__FORALL__POINT) ).
fof(f53,negated_conjecture,
~ ! [X0] :
( ne(X0)
=> ! [X1] :
( ne(X1)
=> ! [X2] :
( mem(X2,arr(X1,X0))
=> ! [X3] :
( mem(X3,arr(X0,bool))
=> ! [X4] :
( mem(X4,arr(X0,bool))
=> ( ! [X5] :
( mem(X5,X0)
=> ( p(ap(X4,X5))
=> p(ap(X3,X5)) ) )
=> ( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X0),X2),X3))
=> p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X0),X2),X4)) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f52]) ).
fof(f67,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X0),X2),X4))
& p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X0),X2),X3))
& ! [X5] :
( p(ap(X3,X5))
| ~ p(ap(X4,X5))
| ~ mem(X5,X0) )
& mem(X4,arr(X0,bool)) )
& mem(X3,arr(X0,bool)) )
& mem(X2,arr(X1,X0)) )
& ne(X1) )
& ne(X0) ),
inference(ennf_transformation,[],[f53]) ).
fof(f68,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X0),X2),X4))
& p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X0),X2),X3))
& ! [X5] :
( p(ap(X3,X5))
| ~ p(ap(X4,X5))
| ~ mem(X5,X0) )
& mem(X4,arr(X0,bool)) )
& mem(X3,arr(X0,bool)) )
& mem(X2,arr(X1,X0)) )
& ne(X1) )
& ne(X0) ),
inference(flattening,[],[f67]) ).
fof(f93,plain,
! [X0,X1,X2] :
( ! [X3] :
( mem(ap(X2,X3),X1)
| ~ mem(X3,X0) )
| ~ mem(X2,arr(X0,X1)) ),
inference(ennf_transformation,[],[f4]) ).
fof(f98,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ! [X3] :
( ( ( p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS(X0,X1),X2),X3))
<=> ! [X4] :
( ? [X5] :
( mem(X5,X0)
& p(ap(X3,ap(X2,X5))) )
| ~ p(ap(X3,X4))
| ~ mem(X4,X1) ) )
& ( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL(X0,X1),X2),X3))
<=> ! [X6] :
( ? [X7] :
( mem(X7,X0)
& ~ p(ap(X3,ap(X2,X7))) )
| p(ap(X3,X6))
| ~ mem(X6,X1) ) )
& ! [X8] :
( ! [X9] :
( ( p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__POINT(X0,X1),X8),X9))
<=> ! [X10] :
( p(ap(X9,ap(X8,X10)))
| ~ mem(X10,X0) ) )
| ~ mem(X9,arr(X1,bool)) )
| ~ mem(X8,arr(X0,X1)) )
& ! [X11] :
( ! [X12] :
( ( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X0,X1),X11),X12))
<=> ! [X13] :
( ~ p(ap(X12,ap(X11,X13)))
| ~ mem(X13,X0) ) )
| ~ mem(X12,arr(X1,bool)) )
| ~ mem(X11,arr(X0,X1)) )
& ! [X14] :
( ! [X15] :
( ( p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__GAP(X0,X1),X14),X15))
<=> ! [X16] :
( ? [X17] :
( mem(X17,X0)
& X16 = ap(X14,X17) )
| ~ p(ap(X15,X16))
| ~ mem(X16,X1) ) )
| ~ mem(X15,arr(X1,bool)) )
| ~ mem(X14,arr(X0,X1)) )
& ! [X18] :
( ! [X19] :
( ( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__GAP(X0,X1),X18),X19))
<=> ! [X20] :
( ? [X21] :
( mem(X21,X0)
& X20 = ap(X18,X21) )
| p(ap(X19,X20))
| ~ mem(X20,X1) ) )
| ~ mem(X19,arr(X1,bool)) )
| ~ mem(X18,arr(X0,X1)) ) )
| ~ mem(X3,arr(X1,bool)) )
| ~ mem(X2,arr(X0,X1)) )
| ~ ne(X1) )
| ~ ne(X0) ),
inference(ennf_transformation,[],[f40]) ).
fof(f99,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ! [X3] :
( ( ( p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS(X0,X1),X2),X3))
<=> ! [X4] :
( ? [X5] :
( mem(X5,X0)
& p(ap(X3,ap(X2,X5))) )
| ~ p(ap(X3,X4))
| ~ mem(X4,X1) ) )
& ( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL(X0,X1),X2),X3))
<=> ! [X6] :
( ? [X7] :
( mem(X7,X0)
& ~ p(ap(X3,ap(X2,X7))) )
| p(ap(X3,X6))
| ~ mem(X6,X1) ) )
& ! [X8] :
( ! [X9] :
( ( p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__POINT(X0,X1),X8),X9))
<=> ! [X10] :
( p(ap(X9,ap(X8,X10)))
| ~ mem(X10,X0) ) )
| ~ mem(X9,arr(X1,bool)) )
| ~ mem(X8,arr(X0,X1)) )
& ! [X11] :
( ! [X12] :
( ( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X0,X1),X11),X12))
<=> ! [X13] :
( ~ p(ap(X12,ap(X11,X13)))
| ~ mem(X13,X0) ) )
| ~ mem(X12,arr(X1,bool)) )
| ~ mem(X11,arr(X0,X1)) )
& ! [X14] :
( ! [X15] :
( ( p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__GAP(X0,X1),X14),X15))
<=> ! [X16] :
( ? [X17] :
( mem(X17,X0)
& X16 = ap(X14,X17) )
| ~ p(ap(X15,X16))
| ~ mem(X16,X1) ) )
| ~ mem(X15,arr(X1,bool)) )
| ~ mem(X14,arr(X0,X1)) )
& ! [X18] :
( ! [X19] :
( ( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__GAP(X0,X1),X18),X19))
<=> ! [X20] :
( ? [X21] :
( mem(X21,X0)
& X20 = ap(X18,X21) )
| p(ap(X19,X20))
| ~ mem(X20,X1) ) )
| ~ mem(X19,arr(X1,bool)) )
| ~ mem(X18,arr(X0,X1)) ) )
| ~ mem(X3,arr(X1,bool)) )
| ~ mem(X2,arr(X0,X1)) )
| ~ ne(X1) )
| ~ ne(X0) ),
inference(flattening,[],[f98]) ).
fof(f126,definition,
! [X0,X1] :
( ! [X18] :
( ! [X19] :
( ( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__GAP(X0,X1),X18),X19))
<=> ! [X20] :
( ? [X21] :
( mem(X21,X0)
& X20 = ap(X18,X21) )
| p(ap(X19,X20))
| ~ mem(X20,X1) ) )
| ~ mem(X19,arr(X1,bool)) )
| ~ mem(X18,arr(X0,X1)) )
| ~ sP14(X0,X1) ),
introduced(definition,[new_symbols(definition,[sP14])],[predicate_definition_introduction]) ).
fof(f127,definition,
! [X0,X1] :
( ! [X14] :
( ! [X15] :
( ( p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__GAP(X0,X1),X14),X15))
<=> ! [X16] :
( ? [X17] :
( mem(X17,X0)
& X16 = ap(X14,X17) )
| ~ p(ap(X15,X16))
| ~ mem(X16,X1) ) )
| ~ mem(X15,arr(X1,bool)) )
| ~ mem(X14,arr(X0,X1)) )
| ~ sP15(X0,X1) ),
introduced(definition,[new_symbols(definition,[sP15])],[predicate_definition_introduction]) ).
fof(f128,definition,
! [X0,X2,X3,X1] :
( ( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL(X0,X1),X2),X3))
<=> ! [X6] :
( ? [X7] :
( mem(X7,X0)
& ~ p(ap(X3,ap(X2,X7))) )
| p(ap(X3,X6))
| ~ mem(X6,X1) ) )
| ~ sP16(X0,X2,X3,X1) ),
introduced(definition,[new_symbols(definition,[sP16])],[predicate_definition_introduction]) ).
fof(f129,definition,
! [X0,X2,X3,X1] :
( ( p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS(X0,X1),X2),X3))
<=> ! [X4] :
( ? [X5] :
( mem(X5,X0)
& p(ap(X3,ap(X2,X5))) )
| ~ p(ap(X3,X4))
| ~ mem(X4,X1) ) )
| ~ sP17(X0,X2,X3,X1) ),
introduced(definition,[new_symbols(definition,[sP17])],[predicate_definition_introduction]) ).
fof(f130,definition,
! [X0,X1] :
( ! [X11] :
( ! [X12] :
( ( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X0,X1),X11),X12))
<=> ! [X13] :
( ~ p(ap(X12,ap(X11,X13)))
| ~ mem(X13,X0) ) )
| ~ mem(X12,arr(X1,bool)) )
| ~ mem(X11,arr(X0,X1)) )
| ~ sP18(X0,X1) ),
introduced(definition,[new_symbols(definition,[sP18])],[predicate_definition_introduction]) ).
fof(f131,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ! [X3] :
( ( sP17(X0,X2,X3,X1)
& sP16(X0,X2,X3,X1)
& ! [X8] :
( ! [X9] :
( ( p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__POINT(X0,X1),X8),X9))
<=> ! [X10] :
( p(ap(X9,ap(X8,X10)))
| ~ mem(X10,X0) ) )
| ~ mem(X9,arr(X1,bool)) )
| ~ mem(X8,arr(X0,X1)) )
& sP18(X0,X1)
& sP15(X0,X1)
& sP14(X0,X1) )
| ~ mem(X3,arr(X1,bool)) )
| ~ mem(X2,arr(X0,X1)) )
| ~ ne(X1) )
| ~ ne(X0) ),
inference(definition_folding,[],[f99,f130,f129,f128,f127,f126]) ).
fof(f132,plain,
( ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK20,sK19),sK21),sK23))
& p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK20,sK19),sK21),sK22))
& ! [X5] :
( p(ap(sK22,X5))
| ~ p(ap(sK23,X5))
| ~ mem(X5,sK19) )
& mem(sK23,arr(sK19,bool))
& mem(sK22,arr(sK19,bool))
& mem(sK21,arr(sK20,sK19))
& ne(sK20)
& ne(sK19) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK19,sK20,sK21,sK22,sK23]),skolemize(X0,sK19),skolemize(X1,sK20),skolemize(X2,sK21),skolemize(X3,sK22),skolemize(X4,sK23)],[f68]) ).
fof(f186,plain,
! [X0,X1] :
( ! [X11] :
( ! [X12] :
( ( ( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X0,X1),X11),X12))
| ? [X13] :
( p(ap(X12,ap(X11,X13)))
& mem(X13,X0) ) )
& ( ! [X13] :
( ~ p(ap(X12,ap(X11,X13)))
| ~ mem(X13,X0) )
| ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X0,X1),X11),X12)) ) )
| ~ mem(X12,arr(X1,bool)) )
| ~ mem(X11,arr(X0,X1)) )
| ~ sP18(X0,X1) ),
inference(nnf_transformation,[],[f130]) ).
fof(f187,plain,
! [X0,X1] :
( ! [X2] :
( ! [X3] :
( ( ( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X0,X1),X2),X3))
| ? [X4] :
( p(ap(X3,ap(X2,X4)))
& mem(X4,X0) ) )
& ( ! [X5] :
( ~ p(ap(X3,ap(X2,X5)))
| ~ mem(X5,X0) )
| ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X0,X1),X2),X3)) ) )
| ~ mem(X3,arr(X1,bool)) )
| ~ mem(X2,arr(X0,X1)) )
| ~ sP18(X0,X1) ),
inference(rectify,[],[f186]) ).
fof(f188,plain,
! [X0,X1] :
( ! [X2] :
( ! [X3] :
( ( ( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X0,X1),X2),X3))
| ( p(ap(X3,ap(X2,sK25(X0,X2,X3))))
& mem(sK25(X0,X2,X3),X0) ) )
& ( ! [X5] :
( ~ p(ap(X3,ap(X2,X5)))
| ~ mem(X5,X0) )
| ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X0,X1),X2),X3)) ) )
| ~ mem(X3,arr(X1,bool)) )
| ~ mem(X2,arr(X0,X1)) )
| ~ sP18(X0,X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK25]),skolemize(X4,sK25(X0,X2,X3))],[f187]) ).
fof(f201,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ! [X3] :
( ( sP17(X0,X2,X3,X1)
& sP16(X0,X2,X3,X1)
& ! [X8] :
( ! [X9] :
( ( ( p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__POINT(X0,X1),X8),X9))
| ? [X10] :
( ~ p(ap(X9,ap(X8,X10)))
& mem(X10,X0) ) )
& ( ! [X10] :
( p(ap(X9,ap(X8,X10)))
| ~ mem(X10,X0) )
| ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__POINT(X0,X1),X8),X9)) ) )
| ~ mem(X9,arr(X1,bool)) )
| ~ mem(X8,arr(X0,X1)) )
& sP18(X0,X1)
& sP15(X0,X1)
& sP14(X0,X1) )
| ~ mem(X3,arr(X1,bool)) )
| ~ mem(X2,arr(X0,X1)) )
| ~ ne(X1) )
| ~ ne(X0) ),
inference(nnf_transformation,[],[f131]) ).
fof(f202,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ! [X3] :
( ( sP17(X0,X2,X3,X1)
& sP16(X0,X2,X3,X1)
& ! [X4] :
( ! [X5] :
( ( ( p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__POINT(X0,X1),X4),X5))
| ? [X6] :
( ~ p(ap(X5,ap(X4,X6)))
& mem(X6,X0) ) )
& ( ! [X7] :
( p(ap(X5,ap(X4,X7)))
| ~ mem(X7,X0) )
| ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__POINT(X0,X1),X4),X5)) ) )
| ~ mem(X5,arr(X1,bool)) )
| ~ mem(X4,arr(X0,X1)) )
& sP18(X0,X1)
& sP15(X0,X1)
& sP14(X0,X1) )
| ~ mem(X3,arr(X1,bool)) )
| ~ mem(X2,arr(X0,X1)) )
| ~ ne(X1) )
| ~ ne(X0) ),
inference(rectify,[],[f201]) ).
fof(f203,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ! [X3] :
( ( sP17(X0,X2,X3,X1)
& sP16(X0,X2,X3,X1)
& ! [X4] :
( ! [X5] :
( ( ( p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__POINT(X0,X1),X4),X5))
| ( ~ p(ap(X5,ap(X4,sK34(X0,X4,X5))))
& mem(sK34(X0,X4,X5),X0) ) )
& ( ! [X7] :
( p(ap(X5,ap(X4,X7)))
| ~ mem(X7,X0) )
| ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__POINT(X0,X1),X4),X5)) ) )
| ~ mem(X5,arr(X1,bool)) )
| ~ mem(X4,arr(X0,X1)) )
& sP18(X0,X1)
& sP15(X0,X1)
& sP14(X0,X1) )
| ~ mem(X3,arr(X1,bool)) )
| ~ mem(X2,arr(X0,X1)) )
| ~ ne(X1) )
| ~ ne(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK34]),skolemize(X6,sK34(X0,X4,X5))],[f202]) ).
fof(f205,plain,
ne(sK19),
inference(cnf_transformation,[],[f132]) ).
fof(f206,plain,
ne(sK20),
inference(cnf_transformation,[],[f132]) ).
fof(f207,plain,
mem(sK21,arr(sK20,sK19)),
inference(cnf_transformation,[],[f132]) ).
fof(f208,plain,
mem(sK22,arr(sK19,bool)),
inference(cnf_transformation,[],[f132]) ).
fof(f209,plain,
mem(sK23,arr(sK19,bool)),
inference(cnf_transformation,[],[f132]) ).
fof(f210,plain,
! [X5] :
( p(ap(sK22,X5))
| ~ p(ap(sK23,X5))
| ~ mem(X5,sK19) ),
inference(cnf_transformation,[],[f132]) ).
fof(f211,plain,
p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK20,sK19),sK21),sK22)),
inference(cnf_transformation,[],[f132]) ).
fof(f212,plain,
~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK20,sK19),sK21),sK23)),
inference(cnf_transformation,[],[f132]) ).
fof(f337,plain,
! [X2,X3,X0,X1] :
( mem(ap(X2,X3),X1)
| ~ mem(X3,X0)
| ~ mem(X2,arr(X0,X1)) ),
inference(cnf_transformation,[],[f93]) ).
fof(f342,plain,
! [X2,X3,X0,X1,X5] :
( ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X0,X1),X2),X3))
| ~ mem(X5,X0)
| ~ p(ap(X3,ap(X2,X5)))
| ~ mem(X3,arr(X1,bool))
| ~ mem(X2,arr(X0,X1))
| ~ sP18(X0,X1) ),
inference(cnf_transformation,[],[f188]) ).
fof(f343,plain,
! [X2,X3,X0,X1] :
( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X0,X1),X2),X3))
| mem(sK25(X0,X2,X3),X0)
| ~ mem(X3,arr(X1,bool))
| ~ mem(X2,arr(X0,X1))
| ~ sP18(X0,X1) ),
inference(cnf_transformation,[],[f188]) ).
fof(f344,plain,
! [X2,X3,X0,X1] :
( p(ap(X3,ap(X2,sK25(X0,X2,X3))))
| p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X0,X1),X2),X3))
| ~ mem(X3,arr(X1,bool))
| ~ mem(X2,arr(X0,X1))
| ~ sP18(X0,X1) ),
inference(cnf_transformation,[],[f188]) ).
fof(f367,plain,
! [X2,X3,X0,X1] :
( ~ mem(X3,arr(X1,bool))
| sP18(X0,X1)
| ~ mem(X2,arr(X0,X1))
| ~ ne(X1)
| ~ ne(X0) ),
inference(cnf_transformation,[],[f203]) ).
fof(f392,plain,
! [X0,X1] :
( sP18(X0,sK19)
| ~ mem(X1,arr(X0,sK19))
| ~ ne(sK19)
| ~ ne(X0) ),
inference(resolution,[],[f208,f367]) ).
fof(f393,plain,
! [X0,X1] :
( ~ mem(X1,arr(X0,sK19))
| sP18(X0,sK19)
| ~ ne(X0) ),
inference(forward_subsumption_resolution,[],[f392,f205]) ).
fof(f399,plain,
! [X0] :
( ~ mem(X0,sK20)
| ~ p(ap(sK22,ap(sK21,X0)))
| ~ mem(sK22,arr(sK19,bool))
| ~ mem(sK21,arr(sK20,sK19))
| ~ sP18(sK20,sK19) ),
inference(resolution,[],[f211,f342]) ).
fof(f400,plain,
! [X0] :
( ~ mem(X0,sK20)
| ~ p(ap(sK22,ap(sK21,X0)))
| ~ mem(sK21,arr(sK20,sK19))
| ~ sP18(sK20,sK19) ),
inference(forward_subsumption_resolution,[],[f399,f208]) ).
fof(f401,plain,
! [X0] :
( ~ mem(X0,sK20)
| ~ p(ap(sK22,ap(sK21,X0)))
| ~ sP18(sK20,sK19) ),
inference(forward_subsumption_resolution,[],[f400,f207]) ).
fof(f403,definition,
( spl35_1
<=> sP18(sK20,sK19) ),
introduced(definition,[new_symbols(definition,[spl35_1])],[avatar_definition]) ).
fof(f404,plain,
( sP18(sK20,sK19)
| ~ spl35_1 ),
inference(avatar_component_clause,[],[f403]) ).
fof(f405,plain,
( ~ sP18(sK20,sK19)
| spl35_1 ),
inference(avatar_component_clause,[],[f403]) ).
fof(f407,definition,
( spl35_2
<=> ! [X0] :
( ~ mem(X0,sK20)
| ~ p(ap(sK22,ap(sK21,X0))) ) ),
introduced(definition,[new_symbols(definition,[spl35_2])],[avatar_definition]) ).
fof(f408,plain,
( ! [X0] :
( ~ p(ap(sK22,ap(sK21,X0)))
| ~ mem(X0,sK20) )
| ~ spl35_2 ),
inference(avatar_component_clause,[],[f407]) ).
fof(f409,plain,
( ~ spl35_1
| spl35_2 ),
inference(avatar_split_clause,[],[f401,f407,f403]) ).
fof(f410,plain,
( mem(sK25(sK20,sK21,sK23),sK20)
| ~ mem(sK23,arr(sK19,bool))
| ~ mem(sK21,arr(sK20,sK19))
| ~ sP18(sK20,sK19) ),
inference(resolution,[],[f212,f343]) ).
fof(f412,plain,
( sP18(sK20,sK19)
| ~ ne(sK20) ),
inference(resolution,[],[f393,f207]) ).
fof(f414,plain,
( ~ ne(sK20)
| spl35_1 ),
inference(forward_subsumption_resolution,[],[f412,f405]) ).
fof(f415,plain,
( $false
| spl35_1 ),
inference(forward_subsumption_resolution,[],[f414,f206]) ).
fof(f416,plain,
spl35_1,
inference(avatar_contradiction_clause,[],[f415]) ).
fof(f417,plain,
( mem(sK25(sK20,sK21,sK23),sK20)
| ~ mem(sK21,arr(sK20,sK19))
| ~ sP18(sK20,sK19) ),
inference(forward_subsumption_resolution,[],[f410,f209]) ).
fof(f418,plain,
( mem(sK25(sK20,sK21,sK23),sK20)
| ~ sP18(sK20,sK19) ),
inference(forward_subsumption_resolution,[],[f417,f207]) ).
fof(f419,plain,
( mem(sK25(sK20,sK21,sK23),sK20)
| ~ spl35_1 ),
inference(forward_subsumption_resolution,[],[f418,f404]) ).
fof(f422,plain,
( ! [X0] :
( ~ p(ap(sK23,ap(sK21,X0)))
| ~ mem(X0,sK20)
| ~ mem(ap(sK21,X0),sK19) )
| ~ spl35_2 ),
inference(resolution,[],[f408,f210]) ).
fof(f433,plain,
( ! [X0,X1] :
( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X0,X1),sK21),sK23))
| ~ mem(ap(sK21,sK25(X0,sK21,sK23)),sK19)
| ~ mem(sK25(X0,sK21,sK23),sK20)
| ~ mem(sK23,arr(X1,bool))
| ~ mem(sK21,arr(X0,X1))
| ~ sP18(X0,X1) )
| ~ spl35_2 ),
inference(resolution,[],[f422,f344]) ).
fof(f1382,plain,
( ~ mem(ap(sK21,sK25(sK20,sK21,sK23)),sK19)
| ~ mem(sK25(sK20,sK21,sK23),sK20)
| ~ mem(sK23,arr(sK19,bool))
| ~ mem(sK21,arr(sK20,sK19))
| ~ sP18(sK20,sK19)
| ~ spl35_2 ),
inference(resolution,[],[f433,f212]) ).
fof(f1387,plain,
( ~ mem(sK25(sK20,sK21,sK23),sK20)
| ~ mem(sK23,arr(sK19,bool))
| ~ mem(sK21,arr(sK20,sK19))
| ~ sP18(sK20,sK19)
| ~ spl35_2 ),
inference(forward_subsumption_resolution,[],[f1382,f337]) ).
fof(f1388,plain,
( ~ mem(sK23,arr(sK19,bool))
| ~ mem(sK21,arr(sK20,sK19))
| ~ sP18(sK20,sK19)
| ~ spl35_1
| ~ spl35_2 ),
inference(forward_subsumption_resolution,[],[f1387,f419]) ).
fof(f1389,plain,
( ~ mem(sK21,arr(sK20,sK19))
| ~ sP18(sK20,sK19)
| ~ spl35_1
| ~ spl35_2 ),
inference(forward_subsumption_resolution,[],[f1388,f209]) ).
fof(f1390,plain,
( ~ sP18(sK20,sK19)
| ~ spl35_1
| ~ spl35_2 ),
inference(forward_subsumption_resolution,[],[f1389,f207]) ).
fof(f1391,plain,
( $false
| ~ spl35_1
| ~ spl35_2 ),
inference(forward_subsumption_resolution,[],[f1390,f404]) ).
fof(f1392,plain,
( ~ spl35_1
| ~ spl35_2 ),
inference(avatar_contradiction_clause,[],[f1391]) ).
cnf(s1,plain,
( ~ spl35_1
| spl35_2 ),
inference(sat_conversion,[],[f409]) ).
cnf(s2,plain,
spl35_1,
inference(sat_conversion,[],[f416]) ).
cnf(s7,plain,
( ~ spl35_1
| ~ spl35_2 ),
inference(sat_conversion,[],[f1392]) ).
cnf(s8,plain,
~ spl35_2,
inference(rat,[],[s7,s2]) ).
cnf(s9,plain,
$false,
inference(rat,[],[s1,s8,s2]) ).
fof(f1393,plain,
$false,
inference(avatar_sat_refutation,[],[s9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ITP006+2 : TPTP v9.3.1. Bugfixed v7.5.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n019.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 27 11:52:48 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/0.40 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.63/1.77 % (2947230)Detected formulas, will run a generic FOF schedule.
% 5.63/1.77 % (2947238)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=4109347335:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 5.63/1.77 % (2947238)Refutation not found, incomplete strategy
% 5.63/1.77 % (2947238)------------------------------
% 5.63/1.77 % (2947238)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.63/1.77 % (2947238)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.63/1.77 % (2947238)CaDiCaL version: 2.1.3
% 5.63/1.77 % (2947238)Termination reason: Refutation not found, incomplete strategy
% 5.63/1.77 % (2947238)Time elapsed: 0.004 s
% 5.63/1.77 % (2947238)Peak memory usage: 88 MB
% 5.63/1.77 % (2947238)Instructions burned: 10 (million)
% 5.63/1.77 % (2947235)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=2296813064:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 5.63/1.77 % (2947237)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=2009474490:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 5.63/1.77 % (2947239)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3342888105:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 5.63/1.77 % (2947236)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=108058619:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 5.63/1.77 % (2947241)dis-21_1_sil=8000:lcm=predicate:random_seed=2255979825: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)
% 5.63/1.77 % (2947240)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=4278069524:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 5.63/1.77 % (2947239)Refutation not found, incomplete strategy
% 5.63/1.77 % (2947239)------------------------------
% 5.63/1.77 % (2947239)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.63/1.77 % (2947239)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.63/1.77 % (2947239)CaDiCaL version: 2.1.3
% 5.63/1.77 % (2947239)Termination reason: Refutation not found, incomplete strategy
% 5.63/1.77 % (2947239)Time elapsed: 0.005 s
% 5.63/1.77 % (2947239)Peak memory usage: 88 MB
% 5.63/1.77 % (2947239)Instructions burned: 6 (million)
% 5.63/1.77 % (2947241)Instruction limit reached!
% 5.63/1.77 % (2947241)------------------------------
% 5.63/1.77 % (2947241)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.63/1.77 % (2947241)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.63/1.77 % (2947241)CaDiCaL version: 2.1.3
% 5.63/1.77 % (2947241)Termination reason: Instruction limit
% 5.63/1.77 % (2947241)Termination phase: Saturation
% 5.63/1.77 % (2947241)Time elapsed: 0.077 s
% 5.63/1.77 % (2947241)Peak memory usage: 90 MB
% 5.63/1.77 % (2947241)Instructions burned: 130 (million)
% 5.63/1.77 % (2947240)Instruction limit reached!
% 5.63/1.77 % (2947240)------------------------------
% 5.63/1.77 % (2947240)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.63/1.77 % (2947240)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.63/1.77 % (2947240)CaDiCaL version: 2.1.3
% 5.63/1.77 % (2947240)Termination reason: Instruction limit
% 5.63/1.77 % (2947240)Termination phase: Saturation
% 5.63/1.77 % (2947240)Time elapsed: 0.094 s
% 5.63/1.77 % (2947240)Peak memory usage: 90 MB
% 5.63/1.77 % (2947240)Instructions burned: 140 (million)
% 5.63/1.77 % (2947238)------------------------------
% 5.63/1.77 % (2947238)------------------------------
% 5.63/1.77 % (2947249)lrs+10_1_sil=8000:sp=occurrence:random_seed=3230903264:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 5.63/1.77 % (2947250)lrs+10_1_sil=32000:urr=on:br=off:random_seed=1301924957:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 5.63/1.77 % (2947251)lrs+1011_1_sil=32000:sp=occurrence:random_seed=1249177901:i=325:sd=1:ss=axioms:sgt=32_2996 on theBenchmark for (2996ds/325Mi)
% 5.63/1.77 % (2947239)------------------------------
% 5.63/1.77 % (2947239)------------------------------
% 5.63/1.77 % (2947250)Instruction limit reached!
% 5.63/1.77 % (2947250)------------------------------
% 5.63/1.77 % (2947250)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.63/1.77 % (2947250)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.63/1.77 % (2947250)CaDiCaL version: 2.1.3
% 5.63/1.77 % (2947250)Termination reason: Instruction limit
% 5.63/1.77 % (2947250)Termination phase: Saturation
% 5.63/1.77 % (2947250)Time elapsed: 0.076 s
% 5.63/1.77 % (2947250)Peak memory usage: 92 MB
% 5.63/1.77 % (2947250)Instructions burned: 157 (million)
% 5.63/1.77 % (2947251)Instruction limit reached!
% 5.63/1.77 % (2947251)------------------------------
% 5.63/1.77 % (2947251)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.63/1.77 % (2947251)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.63/1.77 % (2947251)CaDiCaL version: 2.1.3
% 5.63/1.77 % (2947251)Termination reason: Instruction limit
% 5.63/1.77 % (2947251)Termination phase: Saturation
% 5.63/1.77 % (2947251)Time elapsed: 0.112 s
% 5.63/1.77 % (2947251)Peak memory usage: 92 MB
% 5.63/1.77 % (2947251)Instructions burned: 328 (million)
% 5.63/1.77 % (2947249)Instruction limit reached!
% 5.63/1.77 % (2947249)------------------------------
% 5.63/1.77 % (2947249)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.63/1.77 % (2947249)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.63/1.77 % (2947249)CaDiCaL version: 2.1.3
% 5.63/1.77 % (2947249)Termination reason: Instruction limit
% 5.63/1.77 % (2947249)Termination phase: Saturation
% 5.63/1.77 % (2947249)Time elapsed: 0.170 s
% 5.63/1.77 % (2947249)Peak memory usage: 92 MB
% 5.63/1.77 % (2947249)Instructions burned: 286 (million)
% 5.63/1.77 % (2947255)dis+10_5:1_slsqr=1,4:sil=8000:fde=unused:erd=off:urr=full:fd=off:s2agt=8:br=off:slsq=on:random_seed=1924969189:s2a=on:i=248:s2at=1.23:gtg=position_2995 on theBenchmark for (2995ds/248Mi)
% 5.63/1.77 % (2947256)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=744039558:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2995 on theBenchmark for (2995ds/294Mi)
% 5.63/1.77 % (2947257)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=1186381882:i=2350_2994 on theBenchmark for (2994ds/2350Mi)
% 5.63/1.77 % (2947256)First to succeed.
% 5.63/1.77 % (2947256)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2947230"
% 5.63/1.77 % (2947258)dis-1011_32:1_sfv=off:sil=16000:sos=all:erd=off:acc=on:fd=off:flr=on:random_seed=2361370330:cts=off:i=113:fsr=off:ss=included:sgt=4_2994 on theBenchmark for (2994ds/113Mi)
% 5.63/1.77 % (2947255)Instruction limit reached!
% 5.63/1.77 % (2947255)------------------------------
% 5.63/1.77 % (2947255)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.63/1.77 % (2947255)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.63/1.77 % (2947255)CaDiCaL version: 2.1.3
% 5.63/1.77 % (2947255)Termination reason: Instruction limit
% 5.63/1.77 % (2947255)Termination phase: Saturation
% 5.63/1.77 % (2947255)Time elapsed: 0.132 s
% 5.63/1.77 % (2947255)Peak memory usage: 94 MB
% 5.63/1.77 % (2947255)Instructions burned: 250 (million)
% 5.63/1.77 % (2947258)Instruction limit reached!
% 5.63/1.77 % (2947258)------------------------------
% 5.63/1.77 % (2947258)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.63/1.77 % (2947258)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.63/1.77 % (2947258)CaDiCaL version: 2.1.3
% 5.63/1.77 % (2947258)Termination reason: Instruction limit
% 5.63/1.77 % (2947258)Termination phase: Saturation
% 5.63/1.77 % (2947258)Time elapsed: 0.069 s
% 5.63/1.77 % (2947258)Peak memory usage: 91 MB
% 5.63/1.77 % (2947258)Instructions burned: 115 (million)
% 5.63/1.77 % (2947236)Also succeeded, but the first one will report.
% 5.63/1.77 % (2947235)Also succeeded, but the first one will report.
% 5.63/1.77 % (2947263)lrs-1004_1_sil=8000:sp=occurrence:sos=all:erd=off:fs=off:bce=on:random_seed=431068045:i=127:av=off:fsr=off:sup=off_2992 on theBenchmark for (2992ds/127Mi)
% 5.63/1.77 % (2947256)Refutation found. Thanks to Tanya!
% 5.63/1.77 % SZS status Theorem for theBenchmark
% 5.63/1.77 % SZS output start Proof for theBenchmark
% See solution above
% 7.10/1.97 % (2947256)------------------------------
% 7.10/1.97 % (2947256)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.10/1.97 % (2947256)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.10/1.97 % (2947256)CaDiCaL version: 2.1.3
% 7.10/1.97 % (2947256)Termination reason: Refutation
% 7.10/1.97 % (2947256)Time elapsed: 0.029 s
% 7.10/1.97 % (2947256)Peak memory usage: 90 MB
% 7.10/1.97 % (2947256)Instructions burned: 46 (million)
% 7.10/1.97 % (2947256)------------------------------
% 7.10/1.97 % (2947256)------------------------------
% 7.10/1.97 % (2947230)Success in time 0.926 s
% 7.10/1.97 % Vampire exiting
%------------------------------------------------------------------------------