%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWV031+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 : n016.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 01:07:57 PM UTC 2026
% Result : Theorem 2.47s 0.84s
% Output : Refutation 3.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 3
% Syntax : Number of formulae : 69 ( 10 unt; 1 def)
% Number of atoms : 395 ( 88 equ)
% Maximal formula atoms : 25 ( 5 avg)
% Number of connectives : 541 ( 215 ~; 205 |; 106 &)
% ( 0 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 6 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 19 ( 19 usr; 14 con; 0-3 aty)
% Number of variables : 72 ( 58 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f17,axiom,
! [X0,X1,X2,X3,X4,X5,X6] :
( ( leq(X1,X0)
& leq(X0,X2)
& leq(X4,X3)
& leq(X3,X5) )
=> a_select3(tptp_const_array2(dim(X1,X2),dim(X4,X5),X6),X0,X3) = X6 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',const_array2_select) ).
fof(f53,conjecture,
( ( init = init
& leq(n0,pv9)
& leq(n0,pv10)
& leq(pv9,minus(n410,n1))
& leq(pv10,minus(n330,n1))
& ! [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 ) )
=> ( init = init
& a_select3(tptp_const_array2(dim(n0,minus(n410,n1)),dim(n0,minus(n330,n1)),init),pv9,pv10) = init
& leq(n0,pv9)
& leq(pv9,minus(n410,n1))
& ! [X3] :
( ( leq(n0,X3)
& leq(X3,n2) )
=> ! [X4] :
( ( leq(n0,X4)
& leq(X4,n3) )
=> a_select3(simplex7_init,X4,X3) = init ) )
& ! [X5] :
( ( leq(n0,X5)
& leq(X5,n3) )
=> a_select2(s_values7_init,X5) = init ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',gauss_init_0037) ).
fof(f54,negated_conjecture,
~ ( ( init = init
& leq(n0,pv9)
& leq(n0,pv10)
& leq(pv9,minus(n410,n1))
& leq(pv10,minus(n330,n1))
& ! [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 ) )
=> ( init = init
& a_select3(tptp_const_array2(dim(n0,minus(n410,n1)),dim(n0,minus(n330,n1)),init),pv9,pv10) = init
& leq(n0,pv9)
& leq(pv9,minus(n410,n1))
& ! [X3] :
( ( leq(n0,X3)
& leq(X3,n2) )
=> ! [X4] :
( ( leq(n0,X4)
& leq(X4,n3) )
=> a_select3(simplex7_init,X4,X3) = init ) )
& ! [X5] :
( ( leq(n0,X5)
& leq(X5,n3) )
=> a_select2(s_values7_init,X5) = init ) ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f102,plain,
( ( init != init
| init != a_select3(tptp_const_array2(dim(n0,minus(n410,n1)),dim(n0,minus(n330,n1)),init),pv9,pv10)
| ~ leq(n0,pv9)
| ~ leq(pv9,minus(n410,n1))
| ? [X3] :
( ? [X4] :
( init != a_select3(simplex7_init,X4,X3)
& leq(n0,X4)
& leq(X4,n3) )
& leq(n0,X3)
& leq(X3,n2) )
| ? [X5] :
( init != a_select2(s_values7_init,X5)
& leq(n0,X5)
& leq(X5,n3) ) )
& init = init
& leq(n0,pv9)
& leq(n0,pv10)
& leq(pv9,minus(n410,n1))
& leq(pv10,minus(n330,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) ) ),
inference(ennf_transformation,[],[f54]) ).
fof(f103,plain,
( ( init != init
| init != a_select3(tptp_const_array2(dim(n0,minus(n410,n1)),dim(n0,minus(n330,n1)),init),pv9,pv10)
| ~ leq(n0,pv9)
| ~ leq(pv9,minus(n410,n1))
| ? [X3] :
( ? [X4] :
( init != a_select3(simplex7_init,X4,X3)
& leq(n0,X4)
& leq(X4,n3) )
& leq(n0,X3)
& leq(X3,n2) )
| ? [X5] :
( init != a_select2(s_values7_init,X5)
& leq(n0,X5)
& leq(X5,n3) ) )
& init = init
& leq(n0,pv9)
& leq(n0,pv10)
& leq(pv9,minus(n410,n1))
& leq(pv10,minus(n330,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) ) ),
inference(flattening,[],[f102]) ).
fof(f111,plain,
! [X0,X1,X2,X3,X4,X5,X6] :
( a_select3(tptp_const_array2(dim(X1,X2),dim(X4,X5),X6),X0,X3) = X6
| ~ leq(X1,X0)
| ~ leq(X0,X2)
| ~ leq(X4,X3)
| ~ leq(X3,X5) ),
inference(ennf_transformation,[],[f17]) ).
fof(f112,plain,
! [X0,X1,X2,X3,X4,X5,X6] :
( a_select3(tptp_const_array2(dim(X1,X2),dim(X4,X5),X6),X0,X3) = X6
| ~ leq(X1,X0)
| ~ leq(X0,X2)
| ~ leq(X4,X3)
| ~ leq(X3,X5) ),
inference(flattening,[],[f111]) ).
fof(f128,definition,
( ? [X3] :
( ? [X4] :
( init != a_select3(simplex7_init,X4,X3)
& leq(n0,X4)
& leq(X4,n3) )
& leq(n0,X3)
& leq(X3,n2) )
| ~ sP0 ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f129,plain,
( ( init != init
| init != a_select3(tptp_const_array2(dim(n0,minus(n410,n1)),dim(n0,minus(n330,n1)),init),pv9,pv10)
| ~ leq(n0,pv9)
| ~ leq(pv9,minus(n410,n1))
| sP0
| ? [X5] :
( init != a_select2(s_values7_init,X5)
& leq(n0,X5)
& leq(X5,n3) ) )
& init = init
& leq(n0,pv9)
& leq(n0,pv10)
& leq(pv9,minus(n410,n1))
& leq(pv10,minus(n330,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) ) ),
inference(definition_folding,[],[f103,f128]) ).
fof(f130,plain,
( ? [X3] :
( ? [X4] :
( init != a_select3(simplex7_init,X4,X3)
& leq(n0,X4)
& leq(X4,n3) )
& leq(n0,X3)
& leq(X3,n2) )
| ~ sP0 ),
inference(nnf_transformation,[],[f128]) ).
fof(f131,plain,
( ? [X0] :
( ? [X1] :
( init != a_select3(simplex7_init,X1,X0)
& leq(n0,X1)
& leq(X1,n3) )
& leq(n0,X0)
& leq(X0,n2) )
| ~ sP0 ),
inference(rectify,[],[f130]) ).
fof(f132,plain,
( ( init != a_select3(simplex7_init,sK2,sK1)
& leq(n0,sK2)
& leq(sK2,n3)
& leq(n0,sK1)
& leq(sK1,n2) )
| ~ sP0 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2]),skolemize(X0,sK1),skolemize(X1,sK2)],[f131]) ).
fof(f133,plain,
( ( init != init
| init != a_select3(tptp_const_array2(dim(n0,minus(n410,n1)),dim(n0,minus(n330,n1)),init),pv9,pv10)
| ~ leq(n0,pv9)
| ~ leq(pv9,minus(n410,n1))
| sP0
| ? [X0] :
( init != a_select2(s_values7_init,X0)
& leq(n0,X0)
& leq(X0,n3) ) )
& init = init
& leq(n0,pv9)
& leq(n0,pv10)
& leq(pv9,minus(n410,n1))
& leq(pv10,minus(n330,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) ) ),
inference(rectify,[],[f129]) ).
fof(f134,plain,
( ( init != init
| init != a_select3(tptp_const_array2(dim(n0,minus(n410,n1)),dim(n0,minus(n330,n1)),init),pv9,pv10)
| ~ leq(n0,pv9)
| ~ leq(pv9,minus(n410,n1))
| sP0
| ( init != a_select2(s_values7_init,sK3)
& leq(n0,sK3)
& leq(sK3,n3) ) )
& init = init
& leq(n0,pv9)
& leq(n0,pv10)
& leq(pv9,minus(n410,n1))
& leq(pv10,minus(n330,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) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(X0,sK3)],[f133]) ).
fof(f138,plain,
( leq(sK1,n2)
| ~ sP0 ),
inference(cnf_transformation,[],[f132]) ).
fof(f139,plain,
( leq(n0,sK1)
| ~ sP0 ),
inference(cnf_transformation,[],[f132]) ).
fof(f140,plain,
( leq(sK2,n3)
| ~ sP0 ),
inference(cnf_transformation,[],[f132]) ).
fof(f141,plain,
( leq(n0,sK2)
| ~ sP0 ),
inference(cnf_transformation,[],[f132]) ).
fof(f142,plain,
( init != a_select3(simplex7_init,sK2,sK1)
| ~ sP0 ),
inference(cnf_transformation,[],[f132]) ).
fof(f143,plain,
! [X3] :
( init = a_select2(s_values7_init,X3)
| ~ leq(n0,X3)
| ~ leq(X3,n3) ),
inference(cnf_transformation,[],[f134]) ).
fof(f144,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,[],[f134]) ).
fof(f145,plain,
leq(pv10,minus(n330,n1)),
inference(cnf_transformation,[],[f134]) ).
fof(f146,plain,
leq(pv9,minus(n410,n1)),
inference(cnf_transformation,[],[f134]) ).
fof(f147,plain,
leq(n0,pv10),
inference(cnf_transformation,[],[f134]) ).
fof(f148,plain,
leq(n0,pv9),
inference(cnf_transformation,[],[f134]) ).
fof(f150,plain,
( init != init
| init != a_select3(tptp_const_array2(dim(n0,minus(n410,n1)),dim(n0,minus(n330,n1)),init),pv9,pv10)
| ~ leq(n0,pv9)
| ~ leq(pv9,minus(n410,n1))
| sP0
| leq(sK3,n3) ),
inference(cnf_transformation,[],[f134]) ).
fof(f151,plain,
( init != init
| init != a_select3(tptp_const_array2(dim(n0,minus(n410,n1)),dim(n0,minus(n330,n1)),init),pv9,pv10)
| ~ leq(n0,pv9)
| ~ leq(pv9,minus(n410,n1))
| sP0
| leq(n0,sK3) ),
inference(cnf_transformation,[],[f134]) ).
fof(f152,plain,
( init != init
| init != a_select3(tptp_const_array2(dim(n0,minus(n410,n1)),dim(n0,minus(n330,n1)),init),pv9,pv10)
| ~ leq(n0,pv9)
| ~ leq(pv9,minus(n410,n1))
| sP0
| init != a_select2(s_values7_init,sK3) ),
inference(cnf_transformation,[],[f134]) ).
fof(f158,plain,
! [X2,X3,X0,X1,X6,X4,X5] :
( a_select3(tptp_const_array2(dim(X1,X2),dim(X4,X5),X6),X0,X3) = X6
| ~ leq(X1,X0)
| ~ leq(X0,X2)
| ~ leq(X4,X3)
| ~ leq(X3,X5) ),
inference(cnf_transformation,[],[f112]) ).
fof(f226,plain,
( init != a_select3(tptp_const_array2(dim(n0,minus(n410,n1)),dim(n0,minus(n330,n1)),init),pv9,pv10)
| ~ leq(n0,pv9)
| ~ leq(pv9,minus(n410,n1))
| sP0
| leq(sK3,n3) ),
inference(trivial_inequality_removal,[],[f150]) ).
fof(f227,plain,
( init != a_select3(tptp_const_array2(dim(n0,minus(n410,n1)),dim(n0,minus(n330,n1)),init),pv9,pv10)
| ~ leq(n0,pv9)
| ~ leq(pv9,minus(n410,n1))
| sP0
| leq(n0,sK3) ),
inference(trivial_inequality_removal,[],[f151]) ).
fof(f228,plain,
( init != a_select3(tptp_const_array2(dim(n0,minus(n410,n1)),dim(n0,minus(n330,n1)),init),pv9,pv10)
| ~ leq(n0,pv9)
| ~ leq(pv9,minus(n410,n1))
| sP0
| init != a_select2(s_values7_init,sK3) ),
inference(trivial_inequality_removal,[],[f152]) ).
fof(f229,plain,
( init != a_select3(tptp_const_array2(dim(n0,minus(n410,n1)),dim(n0,minus(n330,n1)),init),pv9,pv10)
| ~ leq(pv9,minus(n410,n1))
| sP0
| leq(sK3,n3) ),
inference(forward_subsumption_resolution,[],[f226,f148]) ).
fof(f230,plain,
( init != a_select3(tptp_const_array2(dim(n0,minus(n410,n1)),dim(n0,minus(n330,n1)),init),pv9,pv10)
| sP0
| leq(sK3,n3) ),
inference(forward_subsumption_resolution,[],[f229,f146]) ).
fof(f231,plain,
( init != a_select3(tptp_const_array2(dim(n0,minus(n410,n1)),dim(n0,minus(n330,n1)),init),pv9,pv10)
| ~ leq(pv9,minus(n410,n1))
| sP0
| leq(n0,sK3) ),
inference(forward_subsumption_resolution,[],[f227,f148]) ).
fof(f232,plain,
( init != a_select3(tptp_const_array2(dim(n0,minus(n410,n1)),dim(n0,minus(n330,n1)),init),pv9,pv10)
| sP0
| leq(n0,sK3) ),
inference(forward_subsumption_resolution,[],[f231,f146]) ).
fof(f233,plain,
( init != a_select3(tptp_const_array2(dim(n0,minus(n410,n1)),dim(n0,minus(n330,n1)),init),pv9,pv10)
| ~ leq(pv9,minus(n410,n1))
| sP0
| init != a_select2(s_values7_init,sK3) ),
inference(forward_subsumption_resolution,[],[f228,f148]) ).
fof(f234,plain,
( init != a_select3(tptp_const_array2(dim(n0,minus(n410,n1)),dim(n0,minus(n330,n1)),init),pv9,pv10)
| sP0
| init != a_select2(s_values7_init,sK3) ),
inference(forward_subsumption_resolution,[],[f233,f146]) ).
fof(f250,plain,
( init != init
| ~ sP0
| ~ leq(n0,sK2)
| ~ leq(sK2,n3)
| ~ leq(n0,sK1)
| ~ leq(sK1,n2) ),
inference(superposition,[],[f142,f144]) ).
fof(f251,plain,
( ~ sP0
| ~ leq(n0,sK2)
| ~ leq(sK2,n3)
| ~ leq(n0,sK1)
| ~ leq(sK1,n2) ),
inference(trivial_inequality_removal,[],[f250]) ).
fof(f252,plain,
( ~ sP0
| ~ leq(sK2,n3)
| ~ leq(n0,sK1)
| ~ leq(sK1,n2) ),
inference(forward_subsumption_resolution,[],[f251,f141]) ).
fof(f253,plain,
( ~ sP0
| ~ leq(n0,sK1)
| ~ leq(sK1,n2) ),
inference(forward_subsumption_resolution,[],[f252,f140]) ).
fof(f254,plain,
( ~ sP0
| ~ leq(sK1,n2) ),
inference(forward_subsumption_resolution,[],[f253,f139]) ).
fof(f255,plain,
~ sP0,
inference(forward_subsumption_resolution,[],[f254,f138]) ).
fof(f520,plain,
( init != init
| sP0
| init != a_select2(s_values7_init,sK3)
| ~ leq(n0,pv9)
| ~ leq(pv9,minus(n410,n1))
| ~ leq(n0,pv10)
| ~ leq(pv10,minus(n330,n1)) ),
inference(superposition,[],[f234,f158]) ).
fof(f521,plain,
( init != init
| sP0
| leq(n0,sK3)
| ~ leq(n0,pv9)
| ~ leq(pv9,minus(n410,n1))
| ~ leq(n0,pv10)
| ~ leq(pv10,minus(n330,n1)) ),
inference(superposition,[],[f232,f158]) ).
fof(f522,plain,
( init != init
| sP0
| leq(sK3,n3)
| ~ leq(n0,pv9)
| ~ leq(pv9,minus(n410,n1))
| ~ leq(n0,pv10)
| ~ leq(pv10,minus(n330,n1)) ),
inference(superposition,[],[f230,f158]) ).
fof(f523,plain,
( sP0
| leq(sK3,n3)
| ~ leq(n0,pv9)
| ~ leq(pv9,minus(n410,n1))
| ~ leq(n0,pv10)
| ~ leq(pv10,minus(n330,n1)) ),
inference(trivial_inequality_removal,[],[f522]) ).
fof(f524,plain,
( sP0
| leq(n0,sK3)
| ~ leq(n0,pv9)
| ~ leq(pv9,minus(n410,n1))
| ~ leq(n0,pv10)
| ~ leq(pv10,minus(n330,n1)) ),
inference(trivial_inequality_removal,[],[f521]) ).
fof(f525,plain,
( sP0
| init != a_select2(s_values7_init,sK3)
| ~ leq(n0,pv9)
| ~ leq(pv9,minus(n410,n1))
| ~ leq(n0,pv10)
| ~ leq(pv10,minus(n330,n1)) ),
inference(trivial_inequality_removal,[],[f520]) ).
fof(f526,plain,
( leq(sK3,n3)
| ~ leq(n0,pv9)
| ~ leq(pv9,minus(n410,n1))
| ~ leq(n0,pv10)
| ~ leq(pv10,minus(n330,n1)) ),
inference(forward_subsumption_resolution,[],[f523,f255]) ).
fof(f527,plain,
( leq(n0,sK3)
| ~ leq(n0,pv9)
| ~ leq(pv9,minus(n410,n1))
| ~ leq(n0,pv10)
| ~ leq(pv10,minus(n330,n1)) ),
inference(forward_subsumption_resolution,[],[f524,f255]) ).
fof(f528,plain,
( init != a_select2(s_values7_init,sK3)
| ~ leq(n0,pv9)
| ~ leq(pv9,minus(n410,n1))
| ~ leq(n0,pv10)
| ~ leq(pv10,minus(n330,n1)) ),
inference(forward_subsumption_resolution,[],[f525,f255]) ).
fof(f529,plain,
( leq(sK3,n3)
| ~ leq(pv9,minus(n410,n1))
| ~ leq(n0,pv10)
| ~ leq(pv10,minus(n330,n1)) ),
inference(forward_subsumption_resolution,[],[f526,f148]) ).
fof(f530,plain,
( leq(n0,sK3)
| ~ leq(pv9,minus(n410,n1))
| ~ leq(n0,pv10)
| ~ leq(pv10,minus(n330,n1)) ),
inference(forward_subsumption_resolution,[],[f527,f148]) ).
fof(f531,plain,
( init != a_select2(s_values7_init,sK3)
| ~ leq(pv9,minus(n410,n1))
| ~ leq(n0,pv10)
| ~ leq(pv10,minus(n330,n1)) ),
inference(forward_subsumption_resolution,[],[f528,f148]) ).
fof(f532,plain,
( leq(sK3,n3)
| ~ leq(n0,pv10)
| ~ leq(pv10,minus(n330,n1)) ),
inference(forward_subsumption_resolution,[],[f529,f146]) ).
fof(f533,plain,
( leq(n0,sK3)
| ~ leq(n0,pv10)
| ~ leq(pv10,minus(n330,n1)) ),
inference(forward_subsumption_resolution,[],[f530,f146]) ).
fof(f534,plain,
( init != a_select2(s_values7_init,sK3)
| ~ leq(n0,pv10)
| ~ leq(pv10,minus(n330,n1)) ),
inference(forward_subsumption_resolution,[],[f531,f146]) ).
fof(f535,plain,
( leq(sK3,n3)
| ~ leq(pv10,minus(n330,n1)) ),
inference(forward_subsumption_resolution,[],[f532,f147]) ).
fof(f536,plain,
( leq(n0,sK3)
| ~ leq(pv10,minus(n330,n1)) ),
inference(forward_subsumption_resolution,[],[f533,f147]) ).
fof(f537,plain,
( init != a_select2(s_values7_init,sK3)
| ~ leq(pv10,minus(n330,n1)) ),
inference(forward_subsumption_resolution,[],[f534,f147]) ).
fof(f538,plain,
leq(sK3,n3),
inference(forward_subsumption_resolution,[],[f535,f145]) ).
fof(f539,plain,
leq(n0,sK3),
inference(forward_subsumption_resolution,[],[f536,f145]) ).
fof(f540,plain,
init != a_select2(s_values7_init,sK3),
inference(forward_subsumption_resolution,[],[f537,f145]) ).
fof(f548,plain,
( init != init
| ~ leq(n0,sK3)
| ~ leq(sK3,n3) ),
inference(superposition,[],[f540,f143]) ).
fof(f549,plain,
( ~ leq(n0,sK3)
| ~ leq(sK3,n3) ),
inference(trivial_inequality_removal,[],[f548]) ).
fof(f550,plain,
~ leq(sK3,n3),
inference(forward_subsumption_resolution,[],[f549,f539]) ).
fof(f551,plain,
$false,
inference(forward_subsumption_resolution,[],[f550,f538]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV031+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.08/0.18 % Computer : n016.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % OS : Linux 6.8.0-71-generic
% 0.08/0.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Mon Sep 28 09:47:48 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.22 Running first-order theorem proving
% 0.08/0.22 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.47/0.84 % (3520365)Detected formulas, will run a generic FOF schedule.
% 2.47/0.84 % (3520375)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1939182848:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.47/0.84 % (3520372)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=4037539667:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.47/0.84 % (3520370)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=2326123079:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.47/0.84 % (3520371)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=2929425690:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.47/0.84 % (3520374)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2894551949:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.47/0.84 % (3520373)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1073868222:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.47/0.84 % (3520376)dis-21_1_sil=8000:lcm=predicate:random_seed=4180067000: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.47/0.84 % (3520374)First to succeed.
% 2.47/0.84 % (3520374)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3520365"
% 2.47/0.84 % (3520375)Instruction limit reached!
% 2.47/0.84 % (3520375)------------------------------
% 2.47/0.84 % (3520375)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.47/0.84 % (3520375)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.47/0.84 % (3520375)CaDiCaL version: 2.1.3
% 2.47/0.84 % (3520375)Termination reason: Instruction limit
% 2.47/0.84 % (3520375)Termination phase: Saturation
% 2.47/0.84 % (3520375)Time elapsed: 0.050 s
% 2.47/0.84 % (3520375)Peak memory usage: 90 MB
% 2.47/0.84 % (3520375)Instructions burned: 142 (million)
% 2.47/0.84 % (3520373)Instruction limit reached!
% 2.47/0.84 % (3520373)------------------------------
% 2.47/0.84 % (3520373)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.47/0.84 % (3520373)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.47/0.84 % (3520373)CaDiCaL version: 2.1.3
% 2.47/0.84 % (3520373)Termination reason: Instruction limit
% 2.47/0.84 % (3520373)Termination phase: Saturation
% 2.47/0.84 % (3520373)Time elapsed: 0.054 s
% 2.47/0.84 % (3520373)Peak memory usage: 88 MB
% 2.47/0.84 % (3520373)Instructions burned: 110 (million)
% 2.47/0.84 % (3520376)Instruction limit reached!
% 2.47/0.84 % (3520376)------------------------------
% 2.47/0.84 % (3520376)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.47/0.84 % (3520376)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.47/0.84 % (3520376)CaDiCaL version: 2.1.3
% 2.47/0.84 % (3520376)Termination reason: Instruction limit
% 2.47/0.84 % (3520376)Termination phase: Saturation
% 2.47/0.84 % (3520376)Time elapsed: 0.067 s
% 2.47/0.84 % (3520376)Peak memory usage: 88 MB
% 2.47/0.84 % (3520376)Instructions burned: 130 (million)
% 2.47/0.84 % (3520384)lrs+10_1_sil=8000:sp=occurrence:random_seed=3828316555:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 2.47/0.84 % (3520386)lrs+1011_1_sil=32000:sp=occurrence:random_seed=2500160351:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 2.47/0.84 % (3520385)lrs+10_1_sil=32000:urr=on:br=off:random_seed=1610332183:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.47/0.84 % (3520384)Instruction limit reached!
% 2.47/0.84 % (3520384)------------------------------
% 2.47/0.84 % (3520384)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.47/0.84 % (3520384)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.47/0.84 % (3520384)CaDiCaL version: 2.1.3
% 2.47/0.84 % (3520384)Termination reason: Instruction limit
% 2.47/0.84 % (3520384)Termination phase: Saturation
% 2.47/0.84 % (3520384)Time elapsed: 0.098 s
% 2.47/0.84 % (3520384)Peak memory usage: 91 MB
% 2.47/0.84 % (3520384)Instructions burned: 288 (million)
% 2.47/0.84 % (3520374)Refutation found. Thanks to Tanya!
% 2.47/0.84 % SZS status Theorem for theBenchmark
% 2.47/0.84 % SZS output start Proof for theBenchmark
% See solution above
% 3.36/0.95 % (3520374)------------------------------
% 3.36/0.95 % (3520374)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.36/0.95 % (3520374)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.36/0.95 % (3520374)CaDiCaL version: 2.1.3
% 3.36/0.95 % (3520374)Termination reason: Refutation
% 3.36/0.95 % (3520374)Time elapsed: 0.012 s
% 3.36/0.95 % (3520374)Peak memory usage: 88 MB
% 3.36/0.95 % (3520374)Instructions burned: 18 (million)
% 3.36/0.95 % (3520374)------------------------------
% 3.36/0.95 % (3520374)------------------------------
% 3.36/0.95 % (3520365)Success in time 0.429 s
% 3.36/0.95 % Vampire exiting
%------------------------------------------------------------------------------