%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWV398+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 : n014.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:07 PM UTC 2026
% Result : Theorem 5.58s 1.51s
% Output : Refutation 6.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 18
% Syntax : Number of formulae : 113 ( 19 unt; 8 def)
% Number of atoms : 304 ( 37 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 323 ( 132 ~; 142 |; 28 &)
% ( 11 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 15 ( 13 usr; 9 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 5 con; 0-3 aty)
% Number of variables : 173 ( 3 sgn 158 !; 15 ?)
% Comments :
%------------------------------------------------------------------------------
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(f16,axiom,
! [X0] : update_slb(create_slb,X0) = create_slb,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax28) ).
fof(f24,axiom,
! [X0,X1] : check_cpq(triple(X0,create_slb,X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax36) ).
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(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',l26_li4142) ).
fof(f43,axiom,
! [X0] :
( ? [X1,X2] :
( pair_in_list(X0,X1,X2)
& strictly_less_than(X1,X2) )
=> ! [X3] :
? [X4,X5] :
( pair_in_list(update_slb(X0,X3),X4,X5)
& strictly_less_than(X4,X5) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l34_l35) ).
fof(f44,conjecture,
! [X0,X1,X2] :
( ~ check_cpq(triple(X0,X1,X2))
=> ~ check_cpq(findmin_cpq_eff(triple(X0,X1,X2))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l24_co) ).
fof(f45,negated_conjecture,
~ ! [X0,X1,X2] :
( ~ check_cpq(triple(X0,X1,X2))
=> ~ check_cpq(findmin_cpq_eff(triple(X0,X1,X2))) ),
inference(negated_conjecture,[status(cth)],[f44]) ).
fof(f46,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(f49,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(f50,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(f54,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(f55,plain,
! [X0] :
( ! [X3] :
? [X4,X5] :
( pair_in_list(update_slb(X0,X3),X4,X5)
& strictly_less_than(X4,X5) )
| ! [X1,X2] :
( ~ pair_in_list(X0,X1,X2)
| ~ strictly_less_than(X1,X2) ) ),
inference(ennf_transformation,[],[f43]) ).
fof(f56,plain,
? [X0,X1,X2] :
( check_cpq(findmin_cpq_eff(triple(X0,X1,X2)))
& ~ check_cpq(triple(X0,X1,X2)) ),
inference(ennf_transformation,[],[f45]) ).
fof(f57,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,[],[f46]) ).
fof(f58,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,[],[f57]) ).
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,[],[f49]) ).
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(f70,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,[],[f50]) ).
fof(f71,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,[],[f70]) ).
fof(f84,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,[],[f54]) ).
fof(f85,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,[],[f84]) ).
fof(f86,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))],[f85]) ).
fof(f87,plain,
! [X0] :
( ! [X1] :
? [X2,X3] :
( pair_in_list(update_slb(X0,X1),X2,X3)
& strictly_less_than(X2,X3) )
| ! [X4,X5] :
( ~ pair_in_list(X0,X4,X5)
| ~ strictly_less_than(X4,X5) ) ),
inference(rectify,[],[f55]) ).
fof(f88,plain,
! [X0] :
( ! [X1] :
( pair_in_list(update_slb(X0,X1),sK2(X0,X1),sK3(X0,X1))
& strictly_less_than(sK2(X0,X1),sK3(X0,X1)) )
| ! [X4,X5] :
( ~ pair_in_list(X0,X4,X5)
| ~ strictly_less_than(X4,X5) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3]),skolemize(X2,sK2(X0,X1)),skolemize(X3,sK3(X0,X1))],[f87]) ).
fof(f89,plain,
( check_cpq(findmin_cpq_eff(triple(sK4,sK5,sK6)))
& ~ check_cpq(triple(sK4,sK5,sK6)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4,sK5,sK6]),skolemize(X0,sK4),skolemize(X1,sK5),skolemize(X2,sK6)],[f56]) ).
fof(f91,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(f92,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,[],[f91]) ).
fof(f97,plain,
! [X2,X0,X1,X6,X5] :
( ~ check_cpq(triple(X0,X1,X2))
| ~ pair_in_list(X1,X5,X6)
| less_than(X6,X5) ),
inference(cnf_transformation,[],[f86]) ).
fof(f98,plain,
! [X2,X0,X1] :
( pair_in_list(X1,sK0(X1),sK1(X1))
| check_cpq(triple(X0,X1,X2)) ),
inference(cnf_transformation,[],[f86]) ).
fof(f99,plain,
! [X2,X0,X1] :
( check_cpq(triple(X0,X1,X2))
| ~ less_than(sK1(X1),sK0(X1)) ),
inference(cnf_transformation,[],[f86]) ).
fof(f100,plain,
! [X0,X1,X4,X5] :
( strictly_less_than(sK2(X0,X1),sK3(X0,X1))
| ~ pair_in_list(X0,X4,X5)
| ~ strictly_less_than(X4,X5) ),
inference(cnf_transformation,[],[f88]) ).
fof(f101,plain,
! [X0,X1,X4,X5] :
( pair_in_list(update_slb(X0,X1),sK2(X0,X1),sK3(X0,X1))
| ~ pair_in_list(X0,X4,X5)
| ~ strictly_less_than(X4,X5) ),
inference(cnf_transformation,[],[f88]) ).
fof(f102,plain,
~ check_cpq(triple(sK4,sK5,sK6)),
inference(cnf_transformation,[],[f89]) ).
fof(f103,plain,
check_cpq(findmin_cpq_eff(triple(sK4,sK5,sK6))),
inference(cnf_transformation,[],[f89]) ).
fof(f104,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,[],[f58]) ).
fof(f109,plain,
! [X0,X1] :
( ~ strictly_less_than(X0,X1)
| ~ less_than(X1,X0) ),
inference(cnf_transformation,[],[f92]) ).
fof(f111,plain,
! [X0,X1] :
( strictly_less_than(X0,X1)
| ~ less_than(X0,X1)
| less_than(X1,X0) ),
inference(cnf_transformation,[],[f92]) ).
fof(f113,plain,
! [X0,X1] :
( less_than(X1,X0)
| less_than(X0,X1) ),
inference(cnf_transformation,[],[f2]) ).
fof(f121,plain,
! [X0,X1] : check_cpq(triple(X0,create_slb,X1)),
inference(cnf_transformation,[],[f24]) ).
fof(f124,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(f127,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,[],[f71]) ).
fof(f128,plain,
! [X0] : create_slb = update_slb(create_slb,X0),
inference(cnf_transformation,[],[f16]) ).
fof(f157,plain,
( check_cpq(triple(sK4,update_slb(sK5,findmin_pqp_res(sK4)),bad))
| create_slb = sK5
| contains_slb(sK5,findmin_pqp_res(sK4)) ),
inference(superposition,[],[f103,f127]) ).
fof(f158,plain,
( check_cpq(triple(sK4,update_slb(sK5,findmin_pqp_res(sK4)),bad))
| create_slb = sK5
| ~ contains_slb(sK5,findmin_pqp_res(sK4))
| ~ strictly_less_than(findmin_pqp_res(sK4),lookup_slb(sK5,findmin_pqp_res(sK4))) ),
inference(superposition,[],[f103,f124]) ).
fof(f159,plain,
( check_cpq(triple(sK4,update_slb(sK5,findmin_pqp_res(sK4)),sK6))
| create_slb = sK5
| ~ contains_slb(sK5,findmin_pqp_res(sK4))
| ~ less_than(lookup_slb(sK5,findmin_pqp_res(sK4)),findmin_pqp_res(sK4)) ),
inference(superposition,[],[f103,f104]) ).
fof(f161,definition,
( spl7_1
<=> less_than(lookup_slb(sK5,findmin_pqp_res(sK4)),findmin_pqp_res(sK4)) ),
introduced(definition,[new_symbols(definition,[spl7_1])],[avatar_definition]) ).
fof(f163,plain,
( ~ less_than(lookup_slb(sK5,findmin_pqp_res(sK4)),findmin_pqp_res(sK4))
| spl7_1 ),
inference(avatar_component_clause,[],[f161]) ).
fof(f165,definition,
( spl7_2
<=> contains_slb(sK5,findmin_pqp_res(sK4)) ),
introduced(definition,[new_symbols(definition,[spl7_2])],[avatar_definition]) ).
fof(f169,definition,
( spl7_3
<=> create_slb = sK5 ),
introduced(definition,[new_symbols(definition,[spl7_3])],[avatar_definition]) ).
fof(f171,plain,
( create_slb = sK5
| ~ spl7_3 ),
inference(avatar_component_clause,[],[f169]) ).
fof(f173,definition,
( spl7_4
<=> check_cpq(triple(sK4,update_slb(sK5,findmin_pqp_res(sK4)),sK6)) ),
introduced(definition,[new_symbols(definition,[spl7_4])],[avatar_definition]) ).
fof(f175,plain,
( check_cpq(triple(sK4,update_slb(sK5,findmin_pqp_res(sK4)),sK6))
| ~ spl7_4 ),
inference(avatar_component_clause,[],[f173]) ).
fof(f176,plain,
( ~ spl7_1
| ~ spl7_2
| spl7_3
| spl7_4 ),
inference(avatar_split_clause,[],[f159,f173,f169,f165,f161]) ).
fof(f178,definition,
( spl7_5
<=> strictly_less_than(findmin_pqp_res(sK4),lookup_slb(sK5,findmin_pqp_res(sK4))) ),
introduced(definition,[new_symbols(definition,[spl7_5])],[avatar_definition]) ).
fof(f180,plain,
( ~ strictly_less_than(findmin_pqp_res(sK4),lookup_slb(sK5,findmin_pqp_res(sK4)))
| spl7_5 ),
inference(avatar_component_clause,[],[f178]) ).
fof(f182,definition,
( spl7_6
<=> check_cpq(triple(sK4,update_slb(sK5,findmin_pqp_res(sK4)),bad)) ),
introduced(definition,[new_symbols(definition,[spl7_6])],[avatar_definition]) ).
fof(f183,plain,
( ~ check_cpq(triple(sK4,update_slb(sK5,findmin_pqp_res(sK4)),bad))
| spl7_6 ),
inference(avatar_component_clause,[],[f182]) ).
fof(f184,plain,
( check_cpq(triple(sK4,update_slb(sK5,findmin_pqp_res(sK4)),bad))
| ~ spl7_6 ),
inference(avatar_component_clause,[],[f182]) ).
fof(f185,plain,
( ~ spl7_5
| ~ spl7_2
| spl7_3
| spl7_6 ),
inference(avatar_split_clause,[],[f158,f182,f169,f165,f178]) ).
fof(f186,plain,
( spl7_2
| spl7_3
| spl7_6 ),
inference(avatar_split_clause,[],[f157,f182,f169,f165]) ).
fof(f189,plain,
~ less_than(sK1(sK5),sK0(sK5)),
inference(resolution,[],[f99,f102]) ).
fof(f218,plain,
! [X2,X3,X0,X1] :
( ~ less_than(sK3(X0,X3),sK2(X0,X3))
| ~ strictly_less_than(X1,X2)
| ~ pair_in_list(X0,X1,X2) ),
inference(resolution,[],[f100,f109]) ).
fof(f225,plain,
( ~ less_than(findmin_pqp_res(sK4),lookup_slb(sK5,findmin_pqp_res(sK4)))
| less_than(lookup_slb(sK5,findmin_pqp_res(sK4)),findmin_pqp_res(sK4))
| spl7_5 ),
inference(resolution,[],[f180,f111]) ).
fof(f226,plain,
( less_than(lookup_slb(sK5,findmin_pqp_res(sK4)),findmin_pqp_res(sK4))
| spl7_5 ),
inference(forward_subsumption_resolution,[],[f225,f113]) ).
fof(f227,plain,
( $false
| spl7_1
| spl7_5 ),
inference(forward_subsumption_resolution,[],[f226,f163]) ).
fof(f228,plain,
( spl7_1
| spl7_5 ),
inference(avatar_contradiction_clause,[],[f227]) ).
fof(f232,plain,
( ! [X0,X1] :
( ~ pair_in_list(update_slb(sK5,findmin_pqp_res(sK4)),X0,X1)
| less_than(X1,X0) )
| ~ spl7_6 ),
inference(resolution,[],[f184,f97]) ).
fof(f289,plain,
( ! [X0,X1] :
( less_than(sK3(sK5,findmin_pqp_res(sK4)),sK2(sK5,findmin_pqp_res(sK4)))
| ~ pair_in_list(sK5,X0,X1)
| ~ strictly_less_than(X0,X1) )
| ~ spl7_6 ),
inference(resolution,[],[f232,f101]) ).
fof(f292,plain,
( ! [X0,X1] :
( ~ pair_in_list(sK5,X0,X1)
| ~ strictly_less_than(X0,X1) )
| ~ spl7_6 ),
inference(forward_subsumption_resolution,[],[f289,f218]) ).
fof(f297,plain,
( ! [X0,X1] :
( ~ strictly_less_than(sK0(sK5),sK1(sK5))
| check_cpq(triple(X0,sK5,X1)) )
| ~ spl7_6 ),
inference(resolution,[],[f292,f98]) ).
fof(f299,definition,
( spl7_11
<=> ! [X0,X1] : check_cpq(triple(X0,sK5,X1)) ),
introduced(definition,[new_symbols(definition,[spl7_11])],[avatar_definition]) ).
fof(f300,plain,
( ! [X0,X1] : check_cpq(triple(X0,sK5,X1))
| ~ spl7_11 ),
inference(avatar_component_clause,[],[f299]) ).
fof(f302,definition,
( spl7_12
<=> strictly_less_than(sK0(sK5),sK1(sK5)) ),
introduced(definition,[new_symbols(definition,[spl7_12])],[avatar_definition]) ).
fof(f303,plain,
( strictly_less_than(sK0(sK5),sK1(sK5))
| ~ spl7_12 ),
inference(avatar_component_clause,[],[f302]) ).
fof(f304,plain,
( ~ strictly_less_than(sK0(sK5),sK1(sK5))
| spl7_12 ),
inference(avatar_component_clause,[],[f302]) ).
fof(f305,plain,
( spl7_11
| ~ spl7_12
| ~ spl7_6 ),
inference(avatar_split_clause,[],[f297,f182,f302,f299]) ).
fof(f313,plain,
( ~ less_than(sK0(sK5),sK1(sK5))
| less_than(sK1(sK5),sK0(sK5))
| spl7_12 ),
inference(resolution,[],[f304,f111]) ).
fof(f314,plain,
( less_than(sK1(sK5),sK0(sK5))
| spl7_12 ),
inference(forward_subsumption_resolution,[],[f313,f113]) ).
fof(f315,plain,
( $false
| spl7_12 ),
inference(forward_subsumption_resolution,[],[f314,f189]) ).
fof(f316,plain,
spl7_12,
inference(avatar_contradiction_clause,[],[f315]) ).
fof(f317,plain,
( ~ check_cpq(triple(sK4,update_slb(create_slb,findmin_pqp_res(sK4)),bad))
| ~ spl7_3
| spl7_6 ),
inference(forward_demodulation,[],[f183,f171]) ).
fof(f319,plain,
( ~ check_cpq(triple(sK4,create_slb,bad))
| ~ spl7_3
| spl7_6 ),
inference(forward_demodulation,[],[f317,f128]) ).
fof(f320,plain,
( $false
| ~ spl7_3
| spl7_6 ),
inference(forward_subsumption_resolution,[],[f319,f121]) ).
fof(f321,plain,
( ~ spl7_3
| spl7_6 ),
inference(avatar_contradiction_clause,[],[f320]) ).
fof(f324,plain,
( $false
| ~ spl7_11 ),
inference(resolution,[],[f300,f102]) ).
fof(f325,plain,
~ spl7_11,
inference(avatar_contradiction_clause,[],[f324]) ).
fof(f329,plain,
( ! [X0,X1] :
( ~ pair_in_list(update_slb(sK5,findmin_pqp_res(sK4)),X0,X1)
| less_than(X1,X0) )
| ~ spl7_4 ),
inference(resolution,[],[f175,f97]) ).
fof(f338,plain,
( ! [X0,X1] :
( less_than(sK3(sK5,findmin_pqp_res(sK4)),sK2(sK5,findmin_pqp_res(sK4)))
| ~ pair_in_list(sK5,X0,X1)
| ~ strictly_less_than(X0,X1) )
| ~ spl7_4 ),
inference(resolution,[],[f329,f101]) ).
fof(f341,plain,
( ! [X0,X1] :
( ~ pair_in_list(sK5,X0,X1)
| ~ strictly_less_than(X0,X1) )
| ~ spl7_4 ),
inference(forward_subsumption_resolution,[],[f338,f218]) ).
fof(f353,plain,
( ! [X0,X1] :
( ~ strictly_less_than(sK0(sK5),sK1(sK5))
| check_cpq(triple(X0,sK5,X1)) )
| ~ spl7_4 ),
inference(resolution,[],[f341,f98]) ).
fof(f354,plain,
( ! [X0,X1] : check_cpq(triple(X0,sK5,X1))
| ~ spl7_4
| ~ spl7_12 ),
inference(forward_subsumption_resolution,[],[f353,f303]) ).
fof(f355,plain,
( spl7_11
| ~ spl7_4
| ~ spl7_12 ),
inference(avatar_split_clause,[],[f354,f302,f173,f299]) ).
cnf(s1,plain,
( ~ spl7_1
| ~ spl7_2
| spl7_3
| spl7_4 ),
inference(sat_conversion,[],[f176]) ).
cnf(s2,plain,
( ~ spl7_2
| spl7_3
| ~ spl7_5
| spl7_6 ),
inference(sat_conversion,[],[f185]) ).
cnf(s3,plain,
( spl7_2
| spl7_3
| spl7_6 ),
inference(sat_conversion,[],[f186]) ).
cnf(s5,plain,
( spl7_1
| spl7_5 ),
inference(sat_conversion,[],[f228]) ).
cnf(s7,plain,
( ~ spl7_6
| spl7_11
| ~ spl7_12 ),
inference(sat_conversion,[],[f305]) ).
cnf(s8,plain,
spl7_12,
inference(sat_conversion,[],[f316]) ).
cnf(s9,plain,
( ~ spl7_3
| spl7_6 ),
inference(sat_conversion,[],[f321]) ).
cnf(s10,plain,
~ spl7_11,
inference(sat_conversion,[],[f325]) ).
cnf(s11,plain,
( ~ spl7_4
| spl7_11
| ~ spl7_12 ),
inference(sat_conversion,[],[f355]) ).
cnf(s12,plain,
~ spl7_4,
inference(rat,[],[s11,s10,s8]) ).
cnf(s13,plain,
~ spl7_6,
inference(rat,[],[s7,s8,s10]) ).
cnf(s14,plain,
~ spl7_3,
inference(rat,[],[s9,s13]) ).
cnf(s15,plain,
spl7_2,
inference(rat,[],[s3,s13,s14]) ).
cnf(s16,plain,
~ spl7_5,
inference(rat,[],[s2,s13,s14,s15]) ).
cnf(s17,plain,
spl7_1,
inference(rat,[],[s5,s16]) ).
cnf(s18,plain,
$false,
inference(rat,[],[s1,s12,s14,s15,s17]) ).
fof(f356,plain,
$false,
inference(avatar_sat_refutation,[],[s18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV398+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.07/0.18 % Computer : n014.cluster.edu
% 0.07/0.18 % Model : x86_64 x86_64
% 0.07/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18 % Memory : 8046.5625MB
% 0.07/0.18 % OS : Linux 6.8.0-71-generic
% 0.07/0.18 % CPULimit : 300
% 0.07/0.18 % WCLimit : 300
% 0.07/0.18 % DateTime : Mon Sep 28 10:50:01 UTC 2026
% 0.07/0.19 % CPUTime :
% 0.07/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.22 Running first-order theorem proving
% 0.07/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
% 5.58/1.51 % (1702958)Detected formulas, will run a generic FOF schedule.
% 5.58/1.51 % (1702965)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=1284664641:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 5.58/1.51 % (1702963)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=4165723798:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 5.58/1.51 % (1702967)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=866266201:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 5.58/1.51 % (1702966)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3657122907:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 5.58/1.51 % (1702969)dis-21_1_sil=8000:lcm=predicate:random_seed=432118211: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.58/1.51 % (1702964)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=2971569484:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 5.58/1.51 % (1702968)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3182286587:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 5.58/1.51 % (1702967)Instruction limit reached!
% 5.58/1.51 % (1702967)------------------------------
% 5.58/1.51 % (1702967)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.58/1.51 % (1702967)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.58/1.51 % (1702967)CaDiCaL version: 2.1.3
% 5.58/1.51 % (1702967)Termination reason: Instruction limit
% 5.58/1.51 % (1702967)Termination phase: Saturation
% 5.58/1.51 % (1702967)Time elapsed: 0.051 s
% 5.58/1.51 % (1702967)Peak memory usage: 88 MB
% 5.58/1.51 % (1702967)Instructions burned: 119 (million)
% 5.58/1.51 % (1702969)Instruction limit reached!
% 5.58/1.51 % (1702969)------------------------------
% 5.58/1.51 % (1702969)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.58/1.51 % (1702969)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.58/1.51 % (1702969)CaDiCaL version: 2.1.3
% 5.58/1.51 % (1702969)Termination reason: Instruction limit
% 5.58/1.51 % (1702969)Termination phase: Saturation
% 5.58/1.51 % (1702969)Time elapsed: 0.052 s
% 5.58/1.51 % (1702969)Peak memory usage: 88 MB
% 5.58/1.51 % (1702969)Instructions burned: 129 (million)
% 5.58/1.51 % (1702966)Instruction limit reached!
% 5.58/1.51 % (1702966)------------------------------
% 5.58/1.51 % (1702966)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.58/1.51 % (1702966)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.58/1.51 % (1702966)CaDiCaL version: 2.1.3
% 5.58/1.51 % (1702966)Termination reason: Instruction limit
% 5.58/1.51 % (1702966)Termination phase: Saturation
% 5.58/1.51 % (1702966)Time elapsed: 0.067 s
% 5.58/1.51 % (1702966)Peak memory usage: 89 MB
% 5.58/1.51 % (1702966)Instructions burned: 109 (million)
% 5.58/1.51 % (1702968)Instruction limit reached!
% 5.58/1.51 % (1702968)------------------------------
% 5.58/1.51 % (1702968)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.58/1.51 % (1702968)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.58/1.51 % (1702968)CaDiCaL version: 2.1.3
% 5.58/1.51 % (1702968)Termination reason: Instruction limit
% 5.58/1.51 % (1702968)Termination phase: Saturation
% 5.58/1.51 % (1702968)Time elapsed: 0.089 s
% 5.58/1.51 % (1702968)Peak memory usage: 89 MB
% 5.58/1.51 % (1702968)Instructions burned: 139 (million)
% 5.58/1.51 % (1702977)lrs+10_1_sil=8000:sp=occurrence:random_seed=1056424652:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 5.58/1.51 % (1702978)lrs+10_1_sil=32000:urr=on:br=off:random_seed=1377917945:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/157Mi)
% 5.58/1.51 % (1702978)Refutation not found, incomplete strategy
% 5.58/1.51 % (1702978)------------------------------
% 5.58/1.51 % (1702978)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.58/1.51 % (1702978)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.58/1.51 % (1702978)CaDiCaL version: 2.1.3
% 5.58/1.51 % (1702978)Termination reason: Refutation not found, incomplete strategy
% 5.58/1.51 % (1702978)Time elapsed: 0.002 s
% 5.58/1.51 % (1702978)Peak memory usage: 89 MB
% 5.58/1.51 % (1702978)Instructions burned: 2 (million)
% 5.58/1.51 % (1702979)lrs+1011_1_sil=32000:sp=occurrence:random_seed=2741049931:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 5.58/1.51 % (1702980)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=2972729498:s2a=on:i=248:s2at=1.23:gtg=position_2997 on theBenchmark for (2997ds/248Mi)
% 5.58/1.51 % (1702977)Instruction limit reached!
% 5.58/1.51 % (1702977)------------------------------
% 5.58/1.51 % (1702977)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.58/1.51 % (1702977)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.58/1.51 % (1702977)CaDiCaL version: 2.1.3
% 5.58/1.51 % (1702977)Termination reason: Instruction limit
% 5.58/1.51 % (1702977)Termination phase: Saturation
% 5.58/1.51 % (1702977)Time elapsed: 0.141 s
% 5.58/1.51 % (1702977)Peak memory usage: 89 MB
% 5.58/1.51 % (1702977)Instructions burned: 287 (million)
% 5.58/1.51 % (1702980)Instruction limit reached!
% 5.58/1.51 % (1702980)------------------------------
% 5.58/1.51 % (1702980)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.58/1.51 % (1702980)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.58/1.51 % (1702980)CaDiCaL version: 2.1.3
% 5.58/1.51 % (1702980)Termination reason: Instruction limit
% 5.58/1.51 % (1702980)Termination phase: Saturation
% 5.58/1.51 % (1702980)Time elapsed: 0.164 s
% 5.58/1.51 % (1702980)Peak memory usage: 91 MB
% 5.58/1.51 % (1702980)Instructions burned: 248 (million)
% 5.58/1.51 % (1702979)Instruction limit reached!
% 5.58/1.51 % (1702979)------------------------------
% 5.58/1.51 % (1702979)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.58/1.51 % (1702979)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.58/1.51 % (1702979)CaDiCaL version: 2.1.3
% 5.58/1.51 % (1702979)Termination reason: Instruction limit
% 5.58/1.51 % (1702979)Termination phase: Saturation
% 5.58/1.51 % (1702979)Time elapsed: 0.217 s
% 5.58/1.51 % (1702979)Peak memory usage: 91 MB
% 5.58/1.51 % (1702979)Instructions burned: 326 (million)
% 5.58/1.51 % (1702978)------------------------------
% 5.58/1.51 % (1702978)------------------------------
% 5.58/1.51 % (1702985)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=2605439493:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2995 on theBenchmark for (2995ds/294Mi)
% 5.58/1.51 % (1702985)First to succeed.
% 5.58/1.51 % (1702985)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1702958"
% 5.58/1.51 % (1702986)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=1760428760:i=2350_2994 on theBenchmark for (2994ds/2350Mi)
% 5.58/1.51 % (1702987)dis-1011_32:1_sfv=off:sil=16000:sos=all:erd=off:acc=on:fd=off:flr=on:random_seed=2968698220:cts=off:i=113:fsr=off:ss=included:sgt=4_2994 on theBenchmark for (2994ds/113Mi)
% 5.58/1.51 % (1702988)lrs-1004_1_sil=8000:sp=occurrence:sos=all:erd=off:fs=off:bce=on:random_seed=1518729151:i=127:av=off:fsr=off:sup=off_2994 on theBenchmark for (2994ds/127Mi)
% 5.58/1.51 % (1702987)Instruction limit reached!
% 5.58/1.51 % (1702987)------------------------------
% 5.58/1.51 % (1702987)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.58/1.51 % (1702987)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.58/1.51 % (1702987)CaDiCaL version: 2.1.3
% 5.58/1.51 % (1702987)Termination reason: Instruction limit
% 5.58/1.51 % (1702987)Termination phase: Saturation
% 5.58/1.51 % (1702987)Time elapsed: 0.076 s
% 5.58/1.51 % (1702987)Peak memory usage: 89 MB
% 5.58/1.51 % (1702987)Instructions burned: 114 (million)
% 5.58/1.51 % (1702988)Instruction limit reached!
% 5.58/1.51 % (1702988)------------------------------
% 5.58/1.51 % (1702988)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.58/1.51 % (1702988)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.58/1.51 % (1702988)CaDiCaL version: 2.1.3
% 5.58/1.51 % (1702988)Termination reason: Instruction limit
% 5.58/1.51 % (1702988)Termination phase: Saturation
% 5.58/1.51 % (1702988)Time elapsed: 0.062 s
% 5.58/1.51 % (1702988)Peak memory usage: 88 MB
% 5.58/1.51 % (1702988)Instructions burned: 127 (million)
% 5.58/1.51 % (1702963)Also succeeded, but the first one will report.
% 5.58/1.51 % (1702964)Also succeeded, but the first one will report.
% 5.58/1.51 % (1702985)Refutation found. Thanks to Tanya!
% 5.58/1.51 % SZS status Theorem for theBenchmark
% 5.58/1.51 % SZS output start Proof for theBenchmark
% See solution above
% 6.61/1.66 % (1702985)------------------------------
% 6.61/1.66 % (1702985)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.61/1.66 % (1702985)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.61/1.66 % (1702985)CaDiCaL version: 2.1.3
% 6.61/1.66 % (1702985)Termination reason: Refutation
% 6.61/1.66 % (1702985)Time elapsed: 0.013 s
% 6.61/1.66 % (1702985)Peak memory usage: 90 MB
% 6.61/1.66 % (1702985)Instructions burned: 16 (million)
% 6.61/1.66 % (1702985)------------------------------
% 6.61/1.66 % (1702985)------------------------------
% 6.61/1.66 % (1702958)Success in time 0.856 s
% 6.61/1.66 % Vampire exiting
%------------------------------------------------------------------------------