%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWV042+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n011.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 01:07:59 PM UTC 2026
% Result : Theorem 2.92s 1.04s
% Output : Refutation 3.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 6
% Syntax : Number of formulae : 81 ( 11 unt; 2 def)
% Number of atoms : 445 ( 143 equ)
% Maximal formula atoms : 30 ( 5 avg)
% Number of connectives : 546 ( 182 ~; 225 |; 117 &)
% ( 0 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 22 ( 22 usr; 16 con; 0-3 aty)
% Number of variables : 67 ( 48 !; 19 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f30,axiom,
! [X0] : plus(n1,X0) = succ(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',succ_plus_1_l) ).
fof(f39,axiom,
! [X0] : minus(X0,n1) = pred(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pred_minus_1) ).
fof(f40,axiom,
! [X0] : pred(succ(X0)) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pred_succ) ).
fof(f53,conjecture,
( ( ! [X0] :
( ( leq(n0,X0)
& leq(X0,n2) )
=> ! [X1] :
( ( leq(n0,X1)
& leq(X1,n3) )
=> a_select3(simplex7_init,X1,X0) = init ) )
& ! [X2] :
( ( leq(n0,X2)
& leq(X2,n3) )
=> a_select2(s_values7_init,X2) = init )
& ! [X3] :
( ( leq(n0,X3)
& leq(X3,minus(plus(n1,n2),n1)) )
=> a_select2(s_center7_init,X3) = init )
& ( gt(loopcounter,n1)
=> ( pvar1400_init = init
& pvar1401_init = init
& pvar1402_init = init ) ) )
=> ( ! [X4] :
( ( leq(n0,X4)
& leq(X4,n2) )
=> ! [X5] :
( ( leq(n0,X5)
& leq(X5,n3) )
=> a_select3(simplex7_init,X5,X4) = init ) )
& ! [X6] :
( ( leq(n0,X6)
& leq(X6,n3) )
=> a_select2(s_values7_init,X6) = init )
& ! [X7] :
( ( leq(n0,X7)
& leq(X7,n2) )
=> a_select2(s_center7_init,X7) = init )
& ( gt(loopcounter,n1)
=> ( pvar1400_init = init
& pvar1401_init = init
& pvar1402_init = init ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',gauss_init_0081) ).
fof(f54,negated_conjecture,
~ ( ( ! [X0] :
( ( leq(n0,X0)
& leq(X0,n2) )
=> ! [X1] :
( ( leq(n0,X1)
& leq(X1,n3) )
=> a_select3(simplex7_init,X1,X0) = init ) )
& ! [X2] :
( ( leq(n0,X2)
& leq(X2,n3) )
=> a_select2(s_values7_init,X2) = init )
& ! [X3] :
( ( leq(n0,X3)
& leq(X3,minus(plus(n1,n2),n1)) )
=> a_select2(s_center7_init,X3) = init )
& ( gt(loopcounter,n1)
=> ( pvar1400_init = init
& pvar1401_init = init
& pvar1402_init = init ) ) )
=> ( ! [X4] :
( ( leq(n0,X4)
& leq(X4,n2) )
=> ! [X5] :
( ( leq(n0,X5)
& leq(X5,n3) )
=> a_select3(simplex7_init,X5,X4) = init ) )
& ! [X6] :
( ( leq(n0,X6)
& leq(X6,n3) )
=> a_select2(s_values7_init,X6) = init )
& ! [X7] :
( ( leq(n0,X7)
& leq(X7,n2) )
=> a_select2(s_center7_init,X7) = init )
& ( gt(loopcounter,n1)
=> ( pvar1400_init = init
& pvar1401_init = init
& pvar1402_init = init ) ) ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f87,plain,
( ( ? [X4] :
( ? [X5] :
( init != a_select3(simplex7_init,X5,X4)
& leq(n0,X5)
& leq(X5,n3) )
& leq(n0,X4)
& leq(X4,n2) )
| ? [X6] :
( init != a_select2(s_values7_init,X6)
& leq(n0,X6)
& leq(X6,n3) )
| ? [X7] :
( init != a_select2(s_center7_init,X7)
& leq(n0,X7)
& leq(X7,n2) )
| ( ( init != pvar1400_init
| init != pvar1401_init
| init != pvar1402_init )
& gt(loopcounter,n1) ) )
& ! [X0] :
( ! [X1] :
( a_select3(simplex7_init,X1,X0) = init
| ~ leq(n0,X1)
| ~ leq(X1,n3) )
| ~ leq(n0,X0)
| ~ leq(X0,n2) )
& ! [X2] :
( a_select2(s_values7_init,X2) = init
| ~ leq(n0,X2)
| ~ leq(X2,n3) )
& ! [X3] :
( a_select2(s_center7_init,X3) = init
| ~ leq(n0,X3)
| ~ leq(X3,minus(plus(n1,n2),n1)) )
& ( ( pvar1400_init = init
& pvar1401_init = init
& pvar1402_init = init )
| ~ gt(loopcounter,n1) ) ),
inference(ennf_transformation,[],[f54]) ).
fof(f88,plain,
( ( ? [X4] :
( ? [X5] :
( init != a_select3(simplex7_init,X5,X4)
& leq(n0,X5)
& leq(X5,n3) )
& leq(n0,X4)
& leq(X4,n2) )
| ? [X6] :
( init != a_select2(s_values7_init,X6)
& leq(n0,X6)
& leq(X6,n3) )
| ? [X7] :
( init != a_select2(s_center7_init,X7)
& leq(n0,X7)
& leq(X7,n2) )
| ( ( init != pvar1400_init
| init != pvar1401_init
| init != pvar1402_init )
& gt(loopcounter,n1) ) )
& ! [X0] :
( ! [X1] :
( a_select3(simplex7_init,X1,X0) = init
| ~ leq(n0,X1)
| ~ leq(X1,n3) )
| ~ leq(n0,X0)
| ~ leq(X0,n2) )
& ! [X2] :
( a_select2(s_values7_init,X2) = init
| ~ leq(n0,X2)
| ~ leq(X2,n3) )
& ! [X3] :
( a_select2(s_center7_init,X3) = init
| ~ leq(n0,X3)
| ~ leq(X3,minus(plus(n1,n2),n1)) )
& ( ( pvar1400_init = init
& pvar1401_init = init
& pvar1402_init = init )
| ~ gt(loopcounter,n1) ) ),
inference(flattening,[],[f87]) ).
fof(f109,definition,
( ? [X4] :
( ? [X5] :
( init != a_select3(simplex7_init,X5,X4)
& leq(n0,X5)
& leq(X5,n3) )
& leq(n0,X4)
& leq(X4,n2) )
| ~ sP0 ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f110,definition,
( ? [X7] :
( init != a_select2(s_center7_init,X7)
& leq(n0,X7)
& leq(X7,n2) )
| ~ sP1 ),
introduced(definition,[new_symbols(definition,[sP1])],[predicate_definition_introduction]) ).
fof(f111,plain,
( ( sP0
| ? [X6] :
( init != a_select2(s_values7_init,X6)
& leq(n0,X6)
& leq(X6,n3) )
| sP1
| ( ( init != pvar1400_init
| init != pvar1401_init
| init != pvar1402_init )
& gt(loopcounter,n1) ) )
& ! [X0] :
( ! [X1] :
( a_select3(simplex7_init,X1,X0) = init
| ~ leq(n0,X1)
| ~ leq(X1,n3) )
| ~ leq(n0,X0)
| ~ leq(X0,n2) )
& ! [X2] :
( a_select2(s_values7_init,X2) = init
| ~ leq(n0,X2)
| ~ leq(X2,n3) )
& ! [X3] :
( a_select2(s_center7_init,X3) = init
| ~ leq(n0,X3)
| ~ leq(X3,minus(plus(n1,n2),n1)) )
& ( ( pvar1400_init = init
& pvar1401_init = init
& pvar1402_init = init )
| ~ gt(loopcounter,n1) ) ),
inference(definition_folding,[],[f88,f110,f109]) ).
fof(f112,plain,
( ? [X7] :
( init != a_select2(s_center7_init,X7)
& leq(n0,X7)
& leq(X7,n2) )
| ~ sP1 ),
inference(nnf_transformation,[],[f110]) ).
fof(f113,plain,
( ? [X0] :
( init != a_select2(s_center7_init,X0)
& leq(n0,X0)
& leq(X0,n2) )
| ~ sP1 ),
inference(rectify,[],[f112]) ).
fof(f114,plain,
( ( init != a_select2(s_center7_init,sK2)
& leq(n0,sK2)
& leq(sK2,n2) )
| ~ sP1 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X0,sK2)],[f113]) ).
fof(f115,plain,
( ? [X4] :
( ? [X5] :
( init != a_select3(simplex7_init,X5,X4)
& leq(n0,X5)
& leq(X5,n3) )
& leq(n0,X4)
& leq(X4,n2) )
| ~ sP0 ),
inference(nnf_transformation,[],[f109]) ).
fof(f116,plain,
( ? [X0] :
( ? [X1] :
( a_select3(simplex7_init,X1,X0) != init
& leq(n0,X1)
& leq(X1,n3) )
& leq(n0,X0)
& leq(X0,n2) )
| ~ sP0 ),
inference(rectify,[],[f115]) ).
fof(f117,plain,
( ( init != a_select3(simplex7_init,sK4,sK3)
& leq(n0,sK4)
& leq(sK4,n3)
& leq(n0,sK3)
& leq(sK3,n2) )
| ~ sP0 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4]),skolemize(X0,sK3),skolemize(X1,sK4)],[f116]) ).
fof(f118,plain,
( ( sP0
| ? [X0] :
( init != a_select2(s_values7_init,X0)
& leq(n0,X0)
& leq(X0,n3) )
| sP1
| ( ( init != pvar1400_init
| init != pvar1401_init
| init != pvar1402_init )
& gt(loopcounter,n1) ) )
& ! [X1] :
( ! [X2] :
( init = a_select3(simplex7_init,X2,X1)
| ~ leq(n0,X2)
| ~ leq(X2,n3) )
| ~ leq(n0,X1)
| ~ leq(X1,n2) )
& ! [X3] :
( init = a_select2(s_values7_init,X3)
| ~ leq(n0,X3)
| ~ leq(X3,n3) )
& ! [X4] :
( init = a_select2(s_center7_init,X4)
| ~ leq(n0,X4)
| ~ leq(X4,minus(plus(n1,n2),n1)) )
& ( ( pvar1400_init = init
& pvar1401_init = init
& pvar1402_init = init )
| ~ gt(loopcounter,n1) ) ),
inference(rectify,[],[f111]) ).
fof(f119,plain,
( ( sP0
| ( init != a_select2(s_values7_init,sK5)
& leq(n0,sK5)
& leq(sK5,n3) )
| sP1
| ( ( init != pvar1400_init
| init != pvar1401_init
| init != pvar1402_init )
& gt(loopcounter,n1) ) )
& ! [X1] :
( ! [X2] :
( init = a_select3(simplex7_init,X2,X1)
| ~ leq(n0,X2)
| ~ leq(X2,n3) )
| ~ leq(n0,X1)
| ~ leq(X1,n2) )
& ! [X3] :
( init = a_select2(s_values7_init,X3)
| ~ leq(n0,X3)
| ~ leq(X3,n3) )
& ! [X4] :
( init = a_select2(s_center7_init,X4)
| ~ leq(n0,X4)
| ~ leq(X4,minus(plus(n1,n2),n1)) )
& ( ( pvar1400_init = init
& pvar1401_init = init
& pvar1402_init = init )
| ~ gt(loopcounter,n1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(X0,sK5)],[f118]) ).
fof(f123,plain,
( leq(sK2,n2)
| ~ sP1 ),
inference(cnf_transformation,[],[f114]) ).
fof(f124,plain,
( leq(n0,sK2)
| ~ sP1 ),
inference(cnf_transformation,[],[f114]) ).
fof(f125,plain,
( init != a_select2(s_center7_init,sK2)
| ~ sP1 ),
inference(cnf_transformation,[],[f114]) ).
fof(f126,plain,
( leq(sK3,n2)
| ~ sP0 ),
inference(cnf_transformation,[],[f117]) ).
fof(f127,plain,
( leq(n0,sK3)
| ~ sP0 ),
inference(cnf_transformation,[],[f117]) ).
fof(f128,plain,
( leq(sK4,n3)
| ~ sP0 ),
inference(cnf_transformation,[],[f117]) ).
fof(f129,plain,
( leq(n0,sK4)
| ~ sP0 ),
inference(cnf_transformation,[],[f117]) ).
fof(f130,plain,
( init != a_select3(simplex7_init,sK4,sK3)
| ~ sP0 ),
inference(cnf_transformation,[],[f117]) ).
fof(f131,plain,
( ~ gt(loopcounter,n1)
| init = pvar1402_init ),
inference(cnf_transformation,[],[f119]) ).
fof(f132,plain,
( ~ gt(loopcounter,n1)
| init = pvar1401_init ),
inference(cnf_transformation,[],[f119]) ).
fof(f133,plain,
( ~ gt(loopcounter,n1)
| init = pvar1400_init ),
inference(cnf_transformation,[],[f119]) ).
fof(f134,plain,
! [X4] :
( ~ leq(X4,minus(plus(n1,n2),n1))
| ~ leq(n0,X4)
| init = a_select2(s_center7_init,X4) ),
inference(cnf_transformation,[],[f119]) ).
fof(f135,plain,
! [X3] :
( init = a_select2(s_values7_init,X3)
| ~ leq(n0,X3)
| ~ leq(X3,n3) ),
inference(cnf_transformation,[],[f119]) ).
fof(f136,plain,
! [X2,X1] :
( init = a_select3(simplex7_init,X2,X1)
| ~ leq(n0,X2)
| ~ leq(X2,n3)
| ~ leq(n0,X1)
| ~ leq(X1,n2) ),
inference(cnf_transformation,[],[f119]) ).
fof(f137,plain,
( leq(sK5,n3)
| sP0
| sP1
| gt(loopcounter,n1) ),
inference(cnf_transformation,[],[f119]) ).
fof(f138,plain,
( init != pvar1402_init
| leq(sK5,n3)
| sP1
| init != pvar1400_init
| init != pvar1401_init
| sP0 ),
inference(cnf_transformation,[],[f119]) ).
fof(f139,plain,
( leq(n0,sK5)
| sP0
| sP1
| gt(loopcounter,n1) ),
inference(cnf_transformation,[],[f119]) ).
fof(f140,plain,
( sP0
| leq(n0,sK5)
| sP1
| init != pvar1400_init
| init != pvar1401_init
| init != pvar1402_init ),
inference(cnf_transformation,[],[f119]) ).
fof(f141,plain,
( init != a_select2(s_values7_init,sK5)
| sP0
| sP1
| gt(loopcounter,n1) ),
inference(cnf_transformation,[],[f119]) ).
fof(f142,plain,
( sP0
| init != a_select2(s_values7_init,sK5)
| sP1
| init != pvar1400_init
| init != pvar1401_init
| init != pvar1402_init ),
inference(cnf_transformation,[],[f119]) ).
fof(f160,plain,
! [X0] : succ(X0) = plus(n1,X0),
inference(cnf_transformation,[],[f30]) ).
fof(f172,plain,
! [X0] : minus(X0,n1) = pred(X0),
inference(cnf_transformation,[],[f39]) ).
fof(f187,plain,
! [X0] : pred(succ(X0)) = X0,
inference(cnf_transformation,[],[f40]) ).
fof(f209,plain,
! [X0] : minus(plus(n1,X0),n1) = X0,
inference(definition_unfolding,[],[f187,f172,f160]) ).
fof(f212,plain,
( init != init
| sP0
| sP1
| gt(loopcounter,n1)
| ~ leq(n0,sK5)
| ~ leq(sK5,n3) ),
inference(superposition,[],[f141,f135]) ).
fof(f213,plain,
( sP0
| sP1
| gt(loopcounter,n1)
| ~ leq(n0,sK5)
| ~ leq(sK5,n3) ),
inference(trivial_inequality_removal,[],[f212]) ).
fof(f214,plain,
( sP0
| sP1
| gt(loopcounter,n1)
| ~ leq(sK5,n3) ),
inference(forward_subsumption_resolution,[],[f213,f139]) ).
fof(f215,plain,
( gt(loopcounter,n1)
| sP1
| sP0 ),
inference(forward_subsumption_resolution,[],[f214,f137]) ).
fof(f216,plain,
( init = pvar1400_init
| sP0
| sP1 ),
inference(resolution,[],[f215,f133]) ).
fof(f217,plain,
( init = pvar1401_init
| sP0
| sP1 ),
inference(resolution,[],[f215,f132]) ).
fof(f218,plain,
( init = pvar1402_init
| sP0
| sP1 ),
inference(resolution,[],[f215,f131]) ).
fof(f219,plain,
( pvar1400_init != pvar1402_init
| leq(sK5,n3)
| sP1
| pvar1400_init != pvar1400_init
| pvar1400_init != pvar1401_init
| sP0
| sP0
| sP1 ),
inference(superposition,[],[f138,f216]) ).
fof(f220,plain,
( pvar1400_init != pvar1402_init
| leq(sK5,n3)
| sP1
| pvar1400_init != pvar1400_init
| pvar1400_init != pvar1401_init
| sP0 ),
inference(duplicate_literal_removal,[],[f219]) ).
fof(f221,plain,
( pvar1400_init != pvar1402_init
| leq(sK5,n3)
| sP1
| pvar1400_init != pvar1401_init
| sP0 ),
inference(trivial_inequality_removal,[],[f220]) ).
fof(f223,plain,
( pvar1400_init = pvar1401_init
| sP0
| sP1
| sP0
| sP1 ),
inference(superposition,[],[f216,f217]) ).
fof(f227,plain,
( pvar1400_init = pvar1401_init
| sP0
| sP1 ),
inference(duplicate_literal_removal,[],[f223]) ).
fof(f229,plain,
( sP0
| leq(n0,sK5)
| sP1
| init != pvar1401_init
| init != pvar1402_init ),
inference(forward_subsumption_resolution,[],[f140,f216]) ).
fof(f230,plain,
( sP0
| leq(n0,sK5)
| sP1
| init != pvar1402_init ),
inference(forward_subsumption_resolution,[],[f229,f217]) ).
fof(f234,plain,
( pvar1400_init = pvar1402_init
| sP0
| sP1
| sP0
| sP1 ),
inference(superposition,[],[f216,f218]) ).
fof(f238,plain,
( pvar1400_init = pvar1402_init
| sP0
| sP1 ),
inference(duplicate_literal_removal,[],[f234]) ).
fof(f242,plain,
( leq(n0,sK5)
| sP0
| sP1 ),
inference(forward_subsumption_resolution,[],[f230,f218]) ).
fof(f243,plain,
( sP0
| init != a_select2(s_values7_init,sK5)
| sP1
| init != pvar1401_init
| init != pvar1402_init ),
inference(forward_subsumption_resolution,[],[f142,f216]) ).
fof(f244,plain,
( sP0
| init != a_select2(s_values7_init,sK5)
| sP1
| init != pvar1402_init ),
inference(forward_subsumption_resolution,[],[f243,f217]) ).
fof(f245,plain,
( init != a_select2(s_values7_init,sK5)
| sP0
| sP1 ),
inference(forward_subsumption_resolution,[],[f244,f218]) ).
fof(f250,plain,
( init != init
| sP0
| sP1
| ~ leq(n0,sK5)
| ~ leq(sK5,n3) ),
inference(superposition,[],[f245,f135]) ).
fof(f251,plain,
( sP0
| sP1
| ~ leq(n0,sK5)
| ~ leq(sK5,n3) ),
inference(trivial_inequality_removal,[],[f250]) ).
fof(f252,plain,
( ~ leq(sK5,n3)
| sP1
| sP0 ),
inference(forward_subsumption_resolution,[],[f251,f242]) ).
fof(f255,plain,
( leq(sK5,n3)
| sP1
| pvar1400_init != pvar1401_init
| sP0 ),
inference(forward_subsumption_resolution,[],[f221,f238]) ).
fof(f256,plain,
( sP1
| pvar1400_init != pvar1401_init
| sP0 ),
inference(forward_subsumption_resolution,[],[f255,f252]) ).
fof(f257,plain,
( sP1
| sP0 ),
inference(forward_subsumption_resolution,[],[f256,f227]) ).
fof(f262,plain,
( init != init
| ~ sP0
| ~ leq(n0,sK4)
| ~ leq(sK4,n3)
| ~ leq(n0,sK3)
| ~ leq(sK3,n2) ),
inference(superposition,[],[f130,f136]) ).
fof(f263,plain,
( ~ sP0
| ~ leq(n0,sK4)
| ~ leq(sK4,n3)
| ~ leq(n0,sK3)
| ~ leq(sK3,n2) ),
inference(trivial_inequality_removal,[],[f262]) ).
fof(f264,plain,
( ~ sP0
| ~ leq(sK4,n3)
| ~ leq(n0,sK3)
| ~ leq(sK3,n2) ),
inference(forward_subsumption_resolution,[],[f263,f129]) ).
fof(f265,plain,
( ~ sP0
| ~ leq(n0,sK3)
| ~ leq(sK3,n2) ),
inference(forward_subsumption_resolution,[],[f264,f128]) ).
fof(f266,plain,
( ~ sP0
| ~ leq(sK3,n2) ),
inference(forward_subsumption_resolution,[],[f265,f127]) ).
fof(f267,plain,
~ sP0,
inference(forward_subsumption_resolution,[],[f266,f126]) ).
fof(f284,plain,
! [X0] :
( init = a_select2(s_center7_init,X0)
| ~ leq(n0,X0)
| ~ leq(X0,n2) ),
inference(superposition,[],[f134,f209]) ).
fof(f287,plain,
( init != init
| ~ sP1
| ~ leq(n0,sK2)
| ~ leq(sK2,n2) ),
inference(superposition,[],[f125,f284]) ).
fof(f288,plain,
( ~ sP1
| ~ leq(n0,sK2)
| ~ leq(sK2,n2) ),
inference(trivial_inequality_removal,[],[f287]) ).
fof(f289,plain,
( ~ sP1
| ~ leq(sK2,n2) ),
inference(forward_subsumption_resolution,[],[f288,f124]) ).
fof(f290,plain,
~ sP1,
inference(forward_subsumption_resolution,[],[f289,f123]) ).
fof(f291,plain,
sP0,
inference(resolution,[],[f290,f257]) ).
fof(f292,plain,
$false,
inference(forward_subsumption_resolution,[],[f291,f267]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV042+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.16 % Computer : n011.cluster.edu
% 0.10/0.16 % Model : x86_64 x86_64
% 0.10/0.16 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.16 % Memory : 8046.5625MB
% 0.10/0.16 % OS : Linux 6.8.0-71-generic
% 0.10/0.16 % CPULimit : 300
% 0.10/0.16 % WCLimit : 300
% 0.10/0.16 % DateTime : Mon Sep 28 09:44:31 UTC 2026
% 0.10/0.16 % CPUTime :
% 0.10/0.16 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.19 Running first-order theorem proving
% 0.10/0.19 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.92/1.04 % (3283522)Detected formulas, will run a generic FOF schedule.
% 2.92/1.04 % (3283533)dis-21_1_sil=8000:lcm=predicate:random_seed=375952816: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.92/1.04 % (3283532)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1521855608:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.92/1.04 % (3283530)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2359616972:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.92/1.04 % (3283531)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=374318103:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.92/1.04 % (3283527)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=247428952:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.92/1.04 % (3283528)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=983655438:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.92/1.04 % (3283529)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=3258345591:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.92/1.04 % (3283531)First to succeed.
% 2.92/1.04 % (3283531)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3283522"
% 2.92/1.04 % (3283533)Instruction limit reached!
% 2.92/1.04 % (3283533)------------------------------
% 2.92/1.04 % (3283533)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.92/1.04 % (3283533)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.92/1.04 % (3283533)CaDiCaL version: 2.1.3
% 2.92/1.04 % (3283533)Termination reason: Instruction limit
% 2.92/1.04 % (3283533)Termination phase: Saturation
% 2.92/1.04 % (3283533)Time elapsed: 0.043 s
% 2.92/1.04 % (3283533)Peak memory usage: 89 MB
% 2.92/1.04 % (3283533)Instructions burned: 131 (million)
% 2.92/1.04 % (3283530)Instruction limit reached!
% 2.92/1.04 % (3283530)------------------------------
% 2.92/1.04 % (3283530)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.92/1.04 % (3283530)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.92/1.04 % (3283530)CaDiCaL version: 2.1.3
% 2.92/1.04 % (3283530)Termination reason: Instruction limit
% 2.92/1.04 % (3283530)Termination phase: Saturation
% 2.92/1.04 % (3283530)Time elapsed: 0.070 s
% 2.92/1.04 % (3283530)Peak memory usage: 89 MB
% 2.92/1.04 % (3283530)Instructions burned: 110 (million)
% 2.92/1.04 % (3283532)Instruction limit reached!
% 2.92/1.04 % (3283532)------------------------------
% 2.92/1.04 % (3283532)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.92/1.04 % (3283532)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.92/1.04 % (3283532)CaDiCaL version: 2.1.3
% 2.92/1.04 % (3283532)Termination reason: Instruction limit
% 2.92/1.04 % (3283532)Termination phase: Saturation
% 2.92/1.04 % (3283532)Time elapsed: 0.093 s
% 2.92/1.04 % (3283532)Peak memory usage: 90 MB
% 2.92/1.04 % (3283532)Instructions burned: 139 (million)
% 2.92/1.04 % (3283541)lrs+10_1_sil=8000:sp=occurrence:random_seed=3184782995:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 2.92/1.04 % (3283541)Also succeeded, but the first one will report.
% 2.92/1.04 % (3283542)lrs+10_1_sil=32000:urr=on:br=off:random_seed=964190925:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.92/1.04 % (3283543)lrs+1011_1_sil=32000:sp=occurrence:random_seed=3498012905:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 2.92/1.04 % (3283531)Refutation found. Thanks to Tanya!
% 2.92/1.04 % SZS status Theorem for theBenchmark
% 2.92/1.04 % SZS output start Proof for theBenchmark
% See solution above
% 3.58/1.24 % (3283531)------------------------------
% 3.58/1.24 % (3283531)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.58/1.24 % (3283531)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.58/1.24 % (3283531)CaDiCaL version: 2.1.3
% 3.58/1.24 % (3283531)Termination reason: Refutation
% 3.58/1.24 % (3283531)Time elapsed: 0.007 s
% 3.58/1.24 % (3283531)Peak memory usage: 88 MB
% 3.58/1.24 % (3283531)Instructions burned: 9 (million)
% 3.58/1.24 % (3283531)------------------------------
% 3.58/1.24 % (3283531)------------------------------
% 3.58/1.24 % (3283522)Success in time 0.42 s
% 3.58/1.24 % Vampire exiting
%------------------------------------------------------------------------------