%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWV407+1 : TPTP v9.3.1. Released 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:09:08 PM UTC 2026
% Result : Theorem 2.95s 1.12s
% Output : Refutation 3.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 24
% Syntax : Number of formulae : 162 ( 21 unt; 11 def)
% Number of atoms : 465 ( 55 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 501 ( 198 ~; 241 |; 34 &)
% ( 15 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 19 ( 17 usr; 10 prp; 0-3 aty)
% Number of functors : 15 ( 15 usr; 6 con; 0-3 aty)
% Number of variables : 227 ( 4 sgn 214 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1,X2] :
( ( less_than(X0,X1)
& less_than(X1,X2) )
=> less_than(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity) ).
fof(f2,axiom,
! [X0,X1] :
( less_than(X0,X1)
| less_than(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',totality) ).
fof(f4,axiom,
! [X0,X1] :
( strictly_less_than(X0,X1)
<=> ( less_than(X0,X1)
& ~ less_than(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',stricly_smaller_definition) ).
fof(f10,axiom,
! [X0,X1] : ~ pair_in_list(create_slb,X0,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax22) ).
fof(f16,axiom,
! [X0] : update_slb(create_slb,X0) = create_slb,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax28) ).
fof(f27,axiom,
! [X0,X1,X2,X3] :
( contains_cpq(triple(X0,X1,X2),X3)
<=> contains_slb(X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax39) ).
fof(f35,axiom,
! [X0,X1,X2,X3] :
( ( X1 != create_slb
& ~ contains_slb(X1,findmin_pqp_res(X0)) )
=> findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax47) ).
fof(f36,axiom,
! [X0,X1,X2,X3] :
( ( X1 != create_slb
& contains_slb(X1,findmin_pqp_res(X0))
& strictly_less_than(findmin_pqp_res(X0),lookup_slb(X1,findmin_pqp_res(X0))) )
=> findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax48) ).
fof(f37,axiom,
! [X0,X1,X2,X3] :
( ( X1 != create_slb
& contains_slb(X1,findmin_pqp_res(X0))
& less_than(lookup_slb(X1,findmin_pqp_res(X0)),findmin_pqp_res(X0)) )
=> findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax49) ).
fof(f39,axiom,
! [X0,X1,X2,X3] :
( X1 != create_slb
=> findmin_cpq_res(triple(X0,X1,X2)) = findmin_pqp_res(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax51) ).
fof(f42,axiom,
! [X0,X1,X2] :
( check_cpq(triple(X0,X1,X2))
<=> ! [X3,X4] :
( pair_in_list(X1,X3,X4)
=> less_than(X4,X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l43_li4142) ).
fof(f43,axiom,
! [X0,X1,X2,X3] :
( ( contains_slb(X1,X3)
& strictly_less_than(X3,findmin_cpq_res(triple(X0,X1,X2))) )
=> ( pair_in_list(update_slb(X1,findmin_pqp_res(X0)),X3,findmin_pqp_res(X0))
| ? [X4] :
( pair_in_list(update_slb(X1,findmin_pqp_res(X0)),X3,X4)
& less_than(findmin_pqp_res(X0),X4) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l43_l44) ).
fof(f44,conjecture,
! [X0,X1,X2] :
( ? [X3] :
( contains_cpq(triple(X0,X1,X2),X3)
& strictly_less_than(X3,findmin_cpq_res(triple(X0,X1,X2))) )
=> ~ check_cpq(findmin_cpq_eff(triple(X0,X1,X2))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l43_co) ).
fof(f45,negated_conjecture,
~ ! [X0,X1,X2] :
( ? [X3] :
( contains_cpq(triple(X0,X1,X2),X3)
& strictly_less_than(X3,findmin_cpq_res(triple(X0,X1,X2))) )
=> ~ check_cpq(findmin_cpq_eff(triple(X0,X1,X2))) ),
inference(negated_conjecture,[status(cth)],[f44]) ).
fof(f48,plain,
! [X0,X1,X2] :
( X1 != create_slb
=> findmin_cpq_res(triple(X0,X1,X2)) = findmin_pqp_res(X0) ),
inference(rectify,[],[f39]) ).
fof(f49,plain,
! [X0,X1,X2] :
( ( X1 != create_slb
& contains_slb(X1,findmin_pqp_res(X0))
& less_than(lookup_slb(X1,findmin_pqp_res(X0)),findmin_pqp_res(X0)) )
=> findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),X2) ),
inference(rectify,[],[f37]) ).
fof(f50,plain,
! [X0,X1,X2] :
( ( X1 != create_slb
& contains_slb(X1,findmin_pqp_res(X0))
& strictly_less_than(findmin_pqp_res(X0),lookup_slb(X1,findmin_pqp_res(X0))) )
=> findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) ),
inference(rectify,[],[f36]) ).
fof(f51,plain,
! [X0,X1,X2] :
( ( X1 != create_slb
& ~ contains_slb(X1,findmin_pqp_res(X0)) )
=> findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) ),
inference(rectify,[],[f35]) ).
fof(f52,plain,
! [X0,X1,X2] :
( check_cpq(triple(X0,X1,X2))
<=> ! [X3,X4] :
( less_than(X4,X3)
| ~ pair_in_list(X1,X3,X4) ) ),
inference(ennf_transformation,[],[f42]) ).
fof(f53,plain,
! [X0,X1,X2,X3] :
( pair_in_list(update_slb(X1,findmin_pqp_res(X0)),X3,findmin_pqp_res(X0))
| ? [X4] :
( pair_in_list(update_slb(X1,findmin_pqp_res(X0)),X3,X4)
& less_than(findmin_pqp_res(X0),X4) )
| ~ contains_slb(X1,X3)
| ~ strictly_less_than(X3,findmin_cpq_res(triple(X0,X1,X2))) ),
inference(ennf_transformation,[],[f43]) ).
fof(f54,plain,
! [X0,X1,X2,X3] :
( pair_in_list(update_slb(X1,findmin_pqp_res(X0)),X3,findmin_pqp_res(X0))
| ? [X4] :
( pair_in_list(update_slb(X1,findmin_pqp_res(X0)),X3,X4)
& less_than(findmin_pqp_res(X0),X4) )
| ~ contains_slb(X1,X3)
| ~ strictly_less_than(X3,findmin_cpq_res(triple(X0,X1,X2))) ),
inference(flattening,[],[f53]) ).
fof(f55,plain,
? [X0,X1,X2] :
( check_cpq(findmin_cpq_eff(triple(X0,X1,X2)))
& ? [X3] :
( contains_cpq(triple(X0,X1,X2),X3)
& strictly_less_than(X3,findmin_cpq_res(triple(X0,X1,X2))) ) ),
inference(ennf_transformation,[],[f45]) ).
fof(f56,plain,
! [X0,X1,X2] :
( less_than(X0,X2)
| ~ less_than(X0,X1)
| ~ less_than(X1,X2) ),
inference(ennf_transformation,[],[f1]) ).
fof(f57,plain,
! [X0,X1,X2] :
( less_than(X0,X2)
| ~ less_than(X0,X1)
| ~ less_than(X1,X2) ),
inference(flattening,[],[f56]) ).
fof(f62,plain,
! [X0,X1,X2] :
( findmin_cpq_res(triple(X0,X1,X2)) = findmin_pqp_res(X0)
| create_slb = X1 ),
inference(ennf_transformation,[],[f48]) ).
fof(f63,plain,
! [X0,X1,X2] :
( findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),X2)
| create_slb = X1
| ~ contains_slb(X1,findmin_pqp_res(X0))
| ~ less_than(lookup_slb(X1,findmin_pqp_res(X0)),findmin_pqp_res(X0)) ),
inference(ennf_transformation,[],[f49]) ).
fof(f64,plain,
! [X0,X1,X2] :
( findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),X2)
| create_slb = X1
| ~ contains_slb(X1,findmin_pqp_res(X0))
| ~ less_than(lookup_slb(X1,findmin_pqp_res(X0)),findmin_pqp_res(X0)) ),
inference(flattening,[],[f63]) ).
fof(f65,plain,
! [X0,X1,X2] :
( findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad)
| create_slb = X1
| ~ contains_slb(X1,findmin_pqp_res(X0))
| ~ strictly_less_than(findmin_pqp_res(X0),lookup_slb(X1,findmin_pqp_res(X0))) ),
inference(ennf_transformation,[],[f50]) ).
fof(f66,plain,
! [X0,X1,X2] :
( findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad)
| create_slb = X1
| ~ contains_slb(X1,findmin_pqp_res(X0))
| ~ strictly_less_than(findmin_pqp_res(X0),lookup_slb(X1,findmin_pqp_res(X0))) ),
inference(flattening,[],[f65]) ).
fof(f67,plain,
! [X0,X1,X2] :
( findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad)
| create_slb = X1
| contains_slb(X1,findmin_pqp_res(X0)) ),
inference(ennf_transformation,[],[f51]) ).
fof(f68,plain,
! [X0,X1,X2] :
( findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad)
| create_slb = X1
| contains_slb(X1,findmin_pqp_res(X0)) ),
inference(flattening,[],[f67]) ).
fof(f69,plain,
! [X0,X1,X2] :
( ( check_cpq(triple(X0,X1,X2))
| ? [X3,X4] :
( ~ less_than(X4,X3)
& pair_in_list(X1,X3,X4) ) )
& ( ! [X3,X4] :
( less_than(X4,X3)
| ~ pair_in_list(X1,X3,X4) )
| ~ check_cpq(triple(X0,X1,X2)) ) ),
inference(nnf_transformation,[],[f52]) ).
fof(f70,plain,
! [X0,X1,X2] :
( ( check_cpq(triple(X0,X1,X2))
| ? [X3,X4] :
( ~ less_than(X4,X3)
& pair_in_list(X1,X3,X4) ) )
& ( ! [X5,X6] :
( less_than(X6,X5)
| ~ pair_in_list(X1,X5,X6) )
| ~ check_cpq(triple(X0,X1,X2)) ) ),
inference(rectify,[],[f69]) ).
fof(f71,plain,
! [X0,X1,X2] :
( ( check_cpq(triple(X0,X1,X2))
| ( ~ less_than(sK1(X1),sK0(X1))
& pair_in_list(X1,sK0(X1),sK1(X1)) ) )
& ( ! [X5,X6] :
( less_than(X6,X5)
| ~ pair_in_list(X1,X5,X6) )
| ~ check_cpq(triple(X0,X1,X2)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X3,sK0(X1)),skolemize(X4,sK1(X1))],[f70]) ).
fof(f72,plain,
! [X0,X1,X2,X3] :
( pair_in_list(update_slb(X1,findmin_pqp_res(X0)),X3,findmin_pqp_res(X0))
| ( pair_in_list(update_slb(X1,findmin_pqp_res(X0)),X3,sK2(X0,X1,X3))
& less_than(findmin_pqp_res(X0),sK2(X0,X1,X3)) )
| ~ contains_slb(X1,X3)
| ~ strictly_less_than(X3,findmin_cpq_res(triple(X0,X1,X2))) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X4,sK2(X0,X1,X3))],[f54]) ).
fof(f73,plain,
( check_cpq(findmin_cpq_eff(triple(sK3,sK4,sK5)))
& contains_cpq(triple(sK3,sK4,sK5),sK6)
& strictly_less_than(sK6,findmin_cpq_res(triple(sK3,sK4,sK5))) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4,sK5,sK6]),skolemize(X0,sK3),skolemize(X1,sK4),skolemize(X2,sK5),skolemize(X3,sK6)],[f55]) ).
fof(f77,plain,
! [X0,X1] :
( ( strictly_less_than(X0,X1)
| ~ less_than(X0,X1)
| less_than(X1,X0) )
& ( ( less_than(X0,X1)
& ~ less_than(X1,X0) )
| ~ strictly_less_than(X0,X1) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f78,plain,
! [X0,X1] :
( ( strictly_less_than(X0,X1)
| ~ less_than(X0,X1)
| less_than(X1,X0) )
& ( ( less_than(X0,X1)
& ~ less_than(X1,X0) )
| ~ strictly_less_than(X0,X1) ) ),
inference(flattening,[],[f77]) ).
fof(f81,plain,
! [X0,X1,X2,X3] :
( ( contains_cpq(triple(X0,X1,X2),X3)
| ~ contains_slb(X1,X3) )
& ( contains_slb(X1,X3)
| ~ contains_cpq(triple(X0,X1,X2),X3) ) ),
inference(nnf_transformation,[],[f27]) ).
fof(f82,plain,
! [X2,X0,X1,X6,X5] :
( less_than(X6,X5)
| ~ pair_in_list(X1,X5,X6)
| ~ check_cpq(triple(X0,X1,X2)) ),
inference(cnf_transformation,[],[f71]) ).
fof(f85,plain,
! [X2,X3,X0,X1] :
( pair_in_list(update_slb(X1,findmin_pqp_res(X0)),X3,findmin_pqp_res(X0))
| less_than(findmin_pqp_res(X0),sK2(X0,X1,X3))
| ~ contains_slb(X1,X3)
| ~ strictly_less_than(X3,findmin_cpq_res(triple(X0,X1,X2))) ),
inference(cnf_transformation,[],[f72]) ).
fof(f86,plain,
! [X2,X3,X0,X1] :
( pair_in_list(update_slb(X1,findmin_pqp_res(X0)),X3,sK2(X0,X1,X3))
| pair_in_list(update_slb(X1,findmin_pqp_res(X0)),X3,findmin_pqp_res(X0))
| ~ contains_slb(X1,X3)
| ~ strictly_less_than(X3,findmin_cpq_res(triple(X0,X1,X2))) ),
inference(cnf_transformation,[],[f72]) ).
fof(f87,plain,
strictly_less_than(sK6,findmin_cpq_res(triple(sK3,sK4,sK5))),
inference(cnf_transformation,[],[f73]) ).
fof(f88,plain,
contains_cpq(triple(sK3,sK4,sK5),sK6),
inference(cnf_transformation,[],[f73]) ).
fof(f89,plain,
check_cpq(findmin_cpq_eff(triple(sK3,sK4,sK5))),
inference(cnf_transformation,[],[f73]) ).
fof(f91,plain,
! [X0,X1] :
( less_than(X1,X0)
| less_than(X0,X1) ),
inference(cnf_transformation,[],[f2]) ).
fof(f92,plain,
! [X2,X0,X1] :
( ~ less_than(X1,X2)
| ~ less_than(X0,X1)
| less_than(X0,X2) ),
inference(cnf_transformation,[],[f57]) ).
fof(f97,plain,
! [X0,X1] : ~ pair_in_list(create_slb,X0,X1),
inference(cnf_transformation,[],[f10]) ).
fof(f103,plain,
! [X0,X1] :
( ~ strictly_less_than(X0,X1)
| ~ less_than(X1,X0) ),
inference(cnf_transformation,[],[f78]) ).
fof(f105,plain,
! [X0,X1] :
( ~ less_than(X0,X1)
| strictly_less_than(X0,X1)
| less_than(X1,X0) ),
inference(cnf_transformation,[],[f78]) ).
fof(f110,plain,
! [X0] : create_slb = update_slb(create_slb,X0),
inference(cnf_transformation,[],[f16]) ).
fof(f111,plain,
! [X2,X0,X1] :
( findmin_pqp_res(X0) = findmin_cpq_res(triple(X0,X1,X2))
| create_slb = X1 ),
inference(cnf_transformation,[],[f62]) ).
fof(f112,plain,
! [X2,X0,X1] :
( findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),X2)
| create_slb = X1
| ~ contains_slb(X1,findmin_pqp_res(X0))
| ~ less_than(lookup_slb(X1,findmin_pqp_res(X0)),findmin_pqp_res(X0)) ),
inference(cnf_transformation,[],[f64]) ).
fof(f113,plain,
! [X2,X0,X1] :
( findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad)
| create_slb = X1
| ~ contains_slb(X1,findmin_pqp_res(X0))
| ~ strictly_less_than(findmin_pqp_res(X0),lookup_slb(X1,findmin_pqp_res(X0))) ),
inference(cnf_transformation,[],[f66]) ).
fof(f114,plain,
! [X2,X0,X1] :
( findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad)
| create_slb = X1
| contains_slb(X1,findmin_pqp_res(X0)) ),
inference(cnf_transformation,[],[f68]) ).
fof(f115,plain,
! [X2,X3,X0,X1] :
( ~ contains_cpq(triple(X0,X1,X2),X3)
| contains_slb(X1,X3) ),
inference(cnf_transformation,[],[f81]) ).
fof(f121,plain,
! [X2,X0,X1] :
( ~ check_cpq(triple(X0,X1,X2))
| sP7(X0,X1) ),
inference(cnf_transformation,[],[f121_D]) ).
fof(f121_D,definition,
! [X1,X0] :
( ! [X2] : ~ check_cpq(triple(X0,X1,X2))
<=> ~ sP7(X0,X1) ),
introduced(definition,[new_symbols(definition,[sP7])],[general_splitting_component_introduction]) ).
fof(f122,plain,
! [X0,X1,X6,X5] :
( less_than(X6,X5)
| ~ pair_in_list(X1,X5,X6)
| ~ sP7(X0,X1) ),
inference(general_splitting,[],[f82,f121_D]) ).
fof(f123,plain,
! [X0,X1] :
( ~ sP7(X0,X1)
| sP8(X1) ),
inference(cnf_transformation,[],[f123_D]) ).
fof(f123_D,definition,
! [X1] :
( ! [X0] : ~ sP7(X0,X1)
<=> ~ sP8(X1) ),
introduced(definition,[new_symbols(definition,[sP8])],[general_splitting_component_introduction]) ).
fof(f124,plain,
! [X1,X6,X5] :
( ~ pair_in_list(X1,X5,X6)
| less_than(X6,X5)
| ~ sP8(X1) ),
inference(general_splitting,[],[f122,f123_D]) ).
fof(f125,plain,
contains_slb(sK4,sK6),
inference(resolution,[],[f88,f115]) ).
fof(f126,plain,
( check_cpq(triple(sK3,update_slb(sK4,findmin_pqp_res(sK3)),bad))
| create_slb = sK4
| contains_slb(sK4,findmin_pqp_res(sK3)) ),
inference(superposition,[],[f89,f114]) ).
fof(f127,plain,
( check_cpq(triple(sK3,update_slb(sK4,findmin_pqp_res(sK3)),bad))
| create_slb = sK4
| ~ contains_slb(sK4,findmin_pqp_res(sK3))
| ~ strictly_less_than(findmin_pqp_res(sK3),lookup_slb(sK4,findmin_pqp_res(sK3))) ),
inference(superposition,[],[f89,f113]) ).
fof(f128,plain,
( check_cpq(triple(sK3,update_slb(sK4,findmin_pqp_res(sK3)),sK5))
| create_slb = sK4
| ~ contains_slb(sK4,findmin_pqp_res(sK3))
| ~ less_than(lookup_slb(sK4,findmin_pqp_res(sK3)),findmin_pqp_res(sK3)) ),
inference(superposition,[],[f89,f112]) ).
fof(f130,definition,
( spl9_1
<=> less_than(lookup_slb(sK4,findmin_pqp_res(sK3)),findmin_pqp_res(sK3)) ),
introduced(definition,[new_symbols(definition,[spl9_1])],[avatar_definition]) ).
fof(f132,plain,
( ~ less_than(lookup_slb(sK4,findmin_pqp_res(sK3)),findmin_pqp_res(sK3))
| spl9_1 ),
inference(avatar_component_clause,[],[f130]) ).
fof(f134,definition,
( spl9_2
<=> contains_slb(sK4,findmin_pqp_res(sK3)) ),
introduced(definition,[new_symbols(definition,[spl9_2])],[avatar_definition]) ).
fof(f138,definition,
( spl9_3
<=> create_slb = sK4 ),
introduced(definition,[new_symbols(definition,[spl9_3])],[avatar_definition]) ).
fof(f139,plain,
( create_slb != sK4
| spl9_3 ),
inference(avatar_component_clause,[],[f138]) ).
fof(f140,plain,
( create_slb = sK4
| ~ spl9_3 ),
inference(avatar_component_clause,[],[f138]) ).
fof(f142,definition,
( spl9_4
<=> check_cpq(triple(sK3,update_slb(sK4,findmin_pqp_res(sK3)),sK5)) ),
introduced(definition,[new_symbols(definition,[spl9_4])],[avatar_definition]) ).
fof(f144,plain,
( check_cpq(triple(sK3,update_slb(sK4,findmin_pqp_res(sK3)),sK5))
| ~ spl9_4 ),
inference(avatar_component_clause,[],[f142]) ).
fof(f145,plain,
( ~ spl9_1
| ~ spl9_2
| spl9_3
| spl9_4 ),
inference(avatar_split_clause,[],[f128,f142,f138,f134,f130]) ).
fof(f147,definition,
( spl9_5
<=> strictly_less_than(findmin_pqp_res(sK3),lookup_slb(sK4,findmin_pqp_res(sK3))) ),
introduced(definition,[new_symbols(definition,[spl9_5])],[avatar_definition]) ).
fof(f149,plain,
( ~ strictly_less_than(findmin_pqp_res(sK3),lookup_slb(sK4,findmin_pqp_res(sK3)))
| spl9_5 ),
inference(avatar_component_clause,[],[f147]) ).
fof(f151,definition,
( spl9_6
<=> check_cpq(triple(sK3,update_slb(sK4,findmin_pqp_res(sK3)),bad)) ),
introduced(definition,[new_symbols(definition,[spl9_6])],[avatar_definition]) ).
fof(f153,plain,
( check_cpq(triple(sK3,update_slb(sK4,findmin_pqp_res(sK3)),bad))
| ~ spl9_6 ),
inference(avatar_component_clause,[],[f151]) ).
fof(f154,plain,
( ~ spl9_5
| ~ spl9_2
| spl9_3
| spl9_6 ),
inference(avatar_split_clause,[],[f127,f151,f138,f134,f147]) ).
fof(f155,plain,
( spl9_2
| spl9_3
| spl9_6 ),
inference(avatar_split_clause,[],[f126,f151,f138,f134]) ).
fof(f156,plain,
~ less_than(findmin_cpq_res(triple(sK3,sK4,sK5)),sK6),
inference(resolution,[],[f87,f103]) ).
fof(f158,plain,
( strictly_less_than(sK6,findmin_pqp_res(sK3))
| create_slb = sK4 ),
inference(superposition,[],[f87,f111]) ).
fof(f160,definition,
( spl9_7
<=> strictly_less_than(sK6,findmin_pqp_res(sK3)) ),
introduced(definition,[new_symbols(definition,[spl9_7])],[avatar_definition]) ).
fof(f162,plain,
( strictly_less_than(sK6,findmin_pqp_res(sK3))
| ~ spl9_7 ),
inference(avatar_component_clause,[],[f160]) ).
fof(f163,plain,
( spl9_3
| spl9_7 ),
inference(avatar_split_clause,[],[f158,f160,f138]) ).
fof(f164,plain,
( strictly_less_than(sK6,findmin_cpq_res(triple(sK3,create_slb,sK5)))
| ~ spl9_3 ),
inference(superposition,[],[f87,f140]) ).
fof(f165,plain,
( contains_slb(create_slb,sK6)
| ~ spl9_3 ),
inference(superposition,[],[f125,f140]) ).
fof(f181,plain,
( less_than(findmin_pqp_res(sK3),lookup_slb(sK4,findmin_pqp_res(sK3)))
| spl9_1 ),
inference(resolution,[],[f132,f91]) ).
fof(f184,plain,
! [X2,X3,X0,X1] :
( ~ strictly_less_than(X2,findmin_cpq_res(triple(X0,X1,X3)))
| ~ contains_slb(X1,X2)
| less_than(findmin_pqp_res(X0),sK2(X0,X1,X2))
| less_than(findmin_pqp_res(X0),X2)
| ~ sP8(update_slb(X1,findmin_pqp_res(X0))) ),
inference(resolution,[],[f85,f124]) ).
fof(f190,plain,
! [X2,X3,X0,X1] :
( pair_in_list(update_slb(X0,findmin_pqp_res(X1)),X2,findmin_pqp_res(X1))
| ~ contains_slb(X0,X2)
| ~ strictly_less_than(X2,findmin_cpq_res(triple(X1,X0,X3)))
| less_than(sK2(X1,X0,X2),X2)
| ~ sP8(update_slb(X0,findmin_pqp_res(X1))) ),
inference(resolution,[],[f86,f124]) ).
fof(f193,plain,
! [X2,X0,X1] :
( pair_in_list(create_slb,X1,sK2(X0,create_slb,X1))
| pair_in_list(create_slb,X1,findmin_pqp_res(X0))
| ~ contains_slb(create_slb,X1)
| ~ strictly_less_than(X1,findmin_cpq_res(triple(X0,create_slb,X2))) ),
inference(superposition,[],[f86,f110]) ).
fof(f194,plain,
! [X2,X0,X1] :
( pair_in_list(create_slb,X1,findmin_pqp_res(X0))
| ~ contains_slb(create_slb,X1)
| ~ strictly_less_than(X1,findmin_cpq_res(triple(X0,create_slb,X2))) ),
inference(forward_subsumption_resolution,[],[f193,f97]) ).
fof(f195,plain,
! [X2,X0,X1] :
( ~ strictly_less_than(X1,findmin_cpq_res(triple(X0,create_slb,X2)))
| ~ contains_slb(create_slb,X1) ),
inference(forward_subsumption_resolution,[],[f194,f97]) ).
fof(f198,plain,
( ~ less_than(findmin_pqp_res(sK3),sK6)
| create_slb = sK4 ),
inference(superposition,[],[f156,f111]) ).
fof(f229,plain,
( ~ contains_slb(create_slb,sK6)
| ~ spl9_3 ),
inference(resolution,[],[f195,f164]) ).
fof(f230,plain,
( $false
| ~ spl9_3 ),
inference(forward_subsumption_resolution,[],[f229,f165]) ).
fof(f231,plain,
~ spl9_3,
inference(avatar_contradiction_clause,[],[f230]) ).
fof(f232,plain,
( ~ less_than(findmin_pqp_res(sK3),sK6)
| spl9_3 ),
inference(forward_subsumption_resolution,[],[f198,f139]) ).
fof(f239,plain,
( strictly_less_than(findmin_pqp_res(sK3),lookup_slb(sK4,findmin_pqp_res(sK3)))
| less_than(lookup_slb(sK4,findmin_pqp_res(sK3)),findmin_pqp_res(sK3))
| spl9_1 ),
inference(resolution,[],[f181,f105]) ).
fof(f241,plain,
( less_than(lookup_slb(sK4,findmin_pqp_res(sK3)),findmin_pqp_res(sK3))
| spl9_1
| spl9_5 ),
inference(forward_subsumption_resolution,[],[f239,f149]) ).
fof(f242,plain,
( $false
| spl9_1
| spl9_5 ),
inference(forward_subsumption_resolution,[],[f241,f132]) ).
fof(f243,plain,
( spl9_1
| spl9_5 ),
inference(avatar_contradiction_clause,[],[f242]) ).
fof(f249,plain,
( sP7(sK3,update_slb(sK4,findmin_pqp_res(sK3)))
| ~ spl9_6 ),
inference(resolution,[],[f153,f121]) ).
fof(f250,plain,
( sP8(update_slb(sK4,findmin_pqp_res(sK3)))
| ~ spl9_6 ),
inference(resolution,[],[f249,f123]) ).
fof(f254,plain,
! [X2,X0,X1] :
( ~ strictly_less_than(X1,findmin_pqp_res(X0))
| ~ contains_slb(X2,X1)
| less_than(findmin_pqp_res(X0),sK2(X0,X2,X1))
| less_than(findmin_pqp_res(X0),X1)
| ~ sP8(update_slb(X2,findmin_pqp_res(X0)))
| create_slb = X2 ),
inference(superposition,[],[f184,f111]) ).
fof(f255,plain,
! [X2,X0,X1] :
( less_than(findmin_pqp_res(X0),sK2(X0,X2,X1))
| ~ contains_slb(X2,X1)
| ~ strictly_less_than(X1,findmin_pqp_res(X0))
| ~ sP8(update_slb(X2,findmin_pqp_res(X0)))
| create_slb = X2 ),
inference(forward_subsumption_resolution,[],[f254,f103]) ).
fof(f262,plain,
! [X2,X3,X0,X1] :
( ~ contains_slb(X0,X1)
| ~ strictly_less_than(X1,findmin_cpq_res(triple(X2,X0,X3)))
| less_than(sK2(X2,X0,X1),X1)
| ~ sP8(update_slb(X0,findmin_pqp_res(X2)))
| less_than(findmin_pqp_res(X2),X1)
| ~ sP8(update_slb(X0,findmin_pqp_res(X2))) ),
inference(resolution,[],[f190,f124]) ).
fof(f266,plain,
! [X2,X3,X0,X1] :
( ~ strictly_less_than(X1,findmin_cpq_res(triple(X2,X0,X3)))
| ~ contains_slb(X0,X1)
| less_than(sK2(X2,X0,X1),X1)
| ~ sP8(update_slb(X0,findmin_pqp_res(X2)))
| less_than(findmin_pqp_res(X2),X1) ),
inference(duplicate_literal_removal,[],[f262]) ).
fof(f427,plain,
( ~ contains_slb(sK4,sK6)
| less_than(sK2(sK3,sK4,sK6),sK6)
| ~ sP8(update_slb(sK4,findmin_pqp_res(sK3)))
| less_than(findmin_pqp_res(sK3),sK6) ),
inference(resolution,[],[f266,f87]) ).
fof(f430,plain,
( less_than(sK2(sK3,sK4,sK6),sK6)
| ~ sP8(update_slb(sK4,findmin_pqp_res(sK3)))
| less_than(findmin_pqp_res(sK3),sK6) ),
inference(forward_subsumption_resolution,[],[f427,f125]) ).
fof(f441,definition,
( spl9_13
<=> less_than(sK2(sK3,sK4,sK6),sK6) ),
introduced(definition,[new_symbols(definition,[spl9_13])],[avatar_definition]) ).
fof(f442,plain,
( less_than(sK2(sK3,sK4,sK6),sK6)
| ~ spl9_13 ),
inference(avatar_component_clause,[],[f441]) ).
fof(f443,plain,
( ~ less_than(sK2(sK3,sK4,sK6),sK6)
| spl9_13 ),
inference(avatar_component_clause,[],[f441]) ).
fof(f448,plain,
( less_than(sK2(sK3,sK4,sK6),sK6)
| less_than(findmin_pqp_res(sK3),sK6)
| ~ spl9_6 ),
inference(forward_subsumption_resolution,[],[f430,f250]) ).
fof(f449,plain,
( less_than(sK2(sK3,sK4,sK6),sK6)
| spl9_3
| ~ spl9_6 ),
inference(forward_subsumption_resolution,[],[f448,f232]) ).
fof(f450,plain,
( spl9_13
| spl9_3
| ~ spl9_6 ),
inference(avatar_split_clause,[],[f449,f151,f138,f441]) ).
fof(f460,plain,
( sP7(sK3,update_slb(sK4,findmin_pqp_res(sK3)))
| ~ spl9_4 ),
inference(resolution,[],[f144,f121]) ).
fof(f466,plain,
( ! [X0] :
( ~ less_than(X0,sK2(sK3,sK4,sK6))
| less_than(X0,sK6) )
| ~ spl9_13 ),
inference(resolution,[],[f442,f92]) ).
fof(f526,plain,
( less_than(findmin_pqp_res(sK3),sK6)
| ~ contains_slb(sK4,sK6)
| ~ strictly_less_than(sK6,findmin_pqp_res(sK3))
| ~ sP8(update_slb(sK4,findmin_pqp_res(sK3)))
| create_slb = sK4
| ~ spl9_13 ),
inference(resolution,[],[f466,f255]) ).
fof(f528,plain,
( ~ contains_slb(sK4,sK6)
| ~ strictly_less_than(sK6,findmin_pqp_res(sK3))
| ~ sP8(update_slb(sK4,findmin_pqp_res(sK3)))
| create_slb = sK4
| ~ spl9_13 ),
inference(forward_subsumption_resolution,[],[f526,f103]) ).
fof(f531,plain,
( ~ strictly_less_than(sK6,findmin_pqp_res(sK3))
| ~ sP8(update_slb(sK4,findmin_pqp_res(sK3)))
| create_slb = sK4
| ~ spl9_13 ),
inference(forward_subsumption_resolution,[],[f528,f125]) ).
fof(f532,plain,
( ~ sP8(update_slb(sK4,findmin_pqp_res(sK3)))
| create_slb = sK4
| ~ spl9_7
| ~ spl9_13 ),
inference(forward_subsumption_resolution,[],[f531,f162]) ).
fof(f533,plain,
( create_slb = sK4
| ~ spl9_6
| ~ spl9_7
| ~ spl9_13 ),
inference(forward_subsumption_resolution,[],[f532,f250]) ).
fof(f534,plain,
( $false
| spl9_3
| ~ spl9_6
| ~ spl9_7
| ~ spl9_13 ),
inference(forward_subsumption_resolution,[],[f533,f139]) ).
fof(f535,plain,
( spl9_3
| ~ spl9_6
| ~ spl9_7
| ~ spl9_13 ),
inference(avatar_contradiction_clause,[],[f534]) ).
fof(f537,definition,
( spl9_17
<=> sP8(update_slb(sK4,findmin_pqp_res(sK3))) ),
introduced(definition,[new_symbols(definition,[spl9_17])],[avatar_definition]) ).
fof(f538,plain,
( sP8(update_slb(sK4,findmin_pqp_res(sK3)))
| ~ spl9_17 ),
inference(avatar_component_clause,[],[f537]) ).
fof(f539,plain,
( ~ sP8(update_slb(sK4,findmin_pqp_res(sK3)))
| spl9_17 ),
inference(avatar_component_clause,[],[f537]) ).
fof(f550,plain,
( ~ sP8(update_slb(sK4,findmin_pqp_res(sK3)))
| spl9_3
| ~ spl9_7
| ~ spl9_13 ),
inference(forward_subsumption_resolution,[],[f532,f139]) ).
fof(f551,plain,
( ~ spl9_17
| spl9_3
| ~ spl9_7
| ~ spl9_13 ),
inference(avatar_split_clause,[],[f550,f441,f160,f138,f537]) ).
fof(f566,plain,
( sP8(update_slb(sK4,findmin_pqp_res(sK3)))
| ~ spl9_4 ),
inference(resolution,[],[f460,f123]) ).
fof(f567,plain,
( $false
| ~ spl9_4
| spl9_17 ),
inference(forward_subsumption_resolution,[],[f566,f539]) ).
fof(f568,plain,
( ~ spl9_4
| spl9_17 ),
inference(avatar_contradiction_clause,[],[f567]) ).
fof(f570,plain,
( ~ sP8(update_slb(sK4,findmin_pqp_res(sK3)))
| less_than(findmin_pqp_res(sK3),sK6)
| spl9_13 ),
inference(forward_subsumption_resolution,[],[f430,f443]) ).
fof(f571,plain,
( less_than(findmin_pqp_res(sK3),sK6)
| spl9_13
| ~ spl9_17 ),
inference(forward_subsumption_resolution,[],[f570,f538]) ).
fof(f572,plain,
( $false
| spl9_3
| spl9_13
| ~ spl9_17 ),
inference(forward_subsumption_resolution,[],[f571,f232]) ).
fof(f573,plain,
( spl9_3
| spl9_13
| ~ spl9_17 ),
inference(avatar_contradiction_clause,[],[f572]) ).
cnf(s1,plain,
( ~ spl9_1
| ~ spl9_2
| spl9_3
| spl9_4 ),
inference(sat_conversion,[],[f145]) ).
cnf(s2,plain,
( ~ spl9_2
| spl9_3
| ~ spl9_5
| spl9_6 ),
inference(sat_conversion,[],[f154]) ).
cnf(s3,plain,
( spl9_2
| spl9_3
| spl9_6 ),
inference(sat_conversion,[],[f155]) ).
cnf(s4,plain,
( spl9_3
| spl9_7 ),
inference(sat_conversion,[],[f163]) ).
cnf(s6,plain,
~ spl9_3,
inference(sat_conversion,[],[f231]) ).
cnf(s7,plain,
( spl9_1
| spl9_5 ),
inference(sat_conversion,[],[f243]) ).
cnf(s15,plain,
( spl9_3
| ~ spl9_6
| spl9_13 ),
inference(sat_conversion,[],[f450]) ).
cnf(s21,plain,
( spl9_3
| ~ spl9_6
| ~ spl9_7
| ~ spl9_13 ),
inference(sat_conversion,[],[f535]) ).
cnf(s24,plain,
( spl9_3
| ~ spl9_7
| ~ spl9_13
| ~ spl9_17 ),
inference(sat_conversion,[],[f551]) ).
cnf(s28,plain,
( ~ spl9_4
| spl9_17 ),
inference(sat_conversion,[],[f568]) ).
cnf(s29,plain,
( spl9_3
| spl9_13
| ~ spl9_17 ),
inference(sat_conversion,[],[f573]) ).
cnf(s30,plain,
spl9_7,
inference(rat,[],[s4,s6]) ).
cnf(s31,plain,
( spl9_2
| spl9_6 ),
inference(rat,[],[s3,s6]) ).
cnf(s32,plain,
( ~ spl9_2
| ~ spl9_5
| spl9_6 ),
inference(rat,[],[s2,s6]) ).
cnf(s33,plain,
( ~ spl9_1
| ~ spl9_2
| spl9_4 ),
inference(rat,[],[s1,s6]) ).
cnf(s34,plain,
~ spl9_6,
inference(rat,[],[s15,s21,s6,s30]) ).
cnf(s35,plain,
spl9_2,
inference(rat,[],[s31,s34]) ).
cnf(s36,plain,
~ spl9_5,
inference(rat,[],[s32,s35,s34]) ).
cnf(s37,plain,
spl9_1,
inference(rat,[],[s7,s36]) ).
cnf(s38,plain,
spl9_4,
inference(rat,[],[s33,s35,s37]) ).
cnf(s39,plain,
spl9_17,
inference(rat,[],[s28,s38]) ).
cnf(s41,plain,
spl9_13,
inference(rat,[],[s29,s6,s39]) ).
cnf(s42,plain,
$false,
inference(rat,[],[s24,s30,s6,s39,s41]) ).
fof(f574,plain,
$false,
inference(avatar_sat_refutation,[],[s42]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV407+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.19 % Computer : n011.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 10:50:45 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.24 Running first-order theorem proving
% 0.08/0.24 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.95/1.12 % (3315987)Detected formulas, will run a generic FOF schedule.
% 2.95/1.12 % (3315996)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=375885685:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.95/1.12 % (3315992)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=3931627589:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.95/1.12 % (3315994)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=2495343963:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.95/1.12 % (3315997)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3746163296:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.95/1.12 % (3315998)dis-21_1_sil=8000:lcm=predicate:random_seed=2531472819: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.95/1.12 % (3315993)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=3660563456:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.95/1.12 % (3315995)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=208319742:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.95/1.12 % (3315996)Instruction limit reached!
% 2.95/1.12 % (3315996)------------------------------
% 2.95/1.12 % (3315996)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.95/1.12 % (3315996)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.95/1.12 % (3315996)CaDiCaL version: 2.1.3
% 2.95/1.12 % (3315996)Termination reason: Instruction limit
% 2.95/1.12 % (3315996)Termination phase: Saturation
% 2.95/1.12 % (3315996)Time elapsed: 0.037 s
% 2.95/1.12 % (3315996)Peak memory usage: 88 MB
% 2.95/1.12 % (3315996)Instructions burned: 122 (million)
% 2.95/1.12 % (3315995)First to succeed.
% 2.95/1.12 % (3315995)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3315987"
% 2.95/1.12 % (3315998)Instruction limit reached!
% 2.95/1.12 % (3315998)------------------------------
% 2.95/1.12 % (3315998)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.95/1.12 % (3315998)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.95/1.12 % (3315998)CaDiCaL version: 2.1.3
% 2.95/1.12 % (3315998)Termination reason: Instruction limit
% 2.95/1.12 % (3315998)Termination phase: Saturation
% 2.95/1.12 % (3315998)Time elapsed: 0.052 s
% 2.95/1.12 % (3315998)Peak memory usage: 88 MB
% 2.95/1.12 % (3315998)Instructions burned: 132 (million)
% 2.95/1.12 % (3315997)Instruction limit reached!
% 2.95/1.12 % (3315997)------------------------------
% 2.95/1.12 % (3315997)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.95/1.12 % (3315997)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.95/1.12 % (3315997)CaDiCaL version: 2.1.3
% 2.95/1.12 % (3315997)Termination reason: Instruction limit
% 2.95/1.12 % (3315997)Termination phase: Saturation
% 2.95/1.12 % (3315997)Time elapsed: 0.103 s
% 2.95/1.12 % (3315997)Peak memory usage: 89 MB
% 2.95/1.12 % (3315997)Instructions burned: 140 (million)
% 2.95/1.12 % (3316006)lrs+10_1_sil=8000:sp=occurrence:random_seed=2846345838:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 2.95/1.12 % (3316007)lrs+10_1_sil=32000:urr=on:br=off:random_seed=3649463754:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.95/1.12 % (3316006)Instruction limit reached!
% 2.95/1.12 % (3316006)------------------------------
% 2.95/1.12 % (3316006)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.95/1.12 % (3316006)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.95/1.12 % (3316006)CaDiCaL version: 2.1.3
% 2.95/1.12 % (3316006)Termination reason: Instruction limit
% 2.95/1.12 % (3316006)Termination phase: Saturation
% 2.95/1.12 % (3316006)Time elapsed: 0.091 s
% 2.95/1.12 % (3316006)Peak memory usage: 90 MB
% 2.95/1.12 % (3316006)Instructions burned: 288 (million)
% 2.95/1.12 % (3316008)lrs+1011_1_sil=32000:sp=occurrence:random_seed=3804252125:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 2.95/1.12 % (3315995)Refutation found. Thanks to Tanya!
% 2.95/1.12 % SZS status Theorem for theBenchmark
% 2.95/1.12 % SZS output start Proof for theBenchmark
% See solution above
% 3.84/1.32 % (3315995)------------------------------
% 3.84/1.32 % (3315995)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.84/1.32 % (3315995)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.84/1.32 % (3315995)CaDiCaL version: 2.1.3
% 3.84/1.32 % (3315995)Termination reason: Refutation
% 3.84/1.32 % (3315995)Time elapsed: 0.022 s
% 3.84/1.32 % (3315995)Peak memory usage: 90 MB
% 3.84/1.32 % (3315995)Instructions burned: 29 (million)
% 3.84/1.32 % (3315995)------------------------------
% 3.84/1.32 % (3315995)------------------------------
% 3.84/1.32 % (3315987)Success in time 0.448 s
% 3.84/1.32 % Vampire exiting
%------------------------------------------------------------------------------