%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV407+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n015.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:21:10 PM UTC 2026
% Result : Theorem 25.63s 5.72s
% Output : Refutation 25.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 24
% Syntax : Number of formulae : 144 ( 26 unt; 10 def)
% Number of atoms : 376 ( 72 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 370 ( 138 ~; 185 |; 20 &)
% ( 14 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 18 ( 16 usr; 11 prp; 0-3 aty)
% Number of functors : 15 ( 15 usr; 7 con; 0-3 aty)
% Number of variables : 231 ( 4 sgn 222 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1,X2] :
( ( less_than(X0,X1)
& less_than(X1,X2) )
=> less_than(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+0.ax',transitivity) ).
fof(f2,axiom,
! [X0,X1] :
( less_than(X0,X1)
| less_than(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+0.ax',totality) ).
fof(f4,axiom,
! [X0,X1] :
( strictly_less_than(X0,X1)
<=> ( less_than(X0,X1)
& ~ less_than(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+0.ax',stricly_smaller_definition) ).
fof(f5,axiom,
! [X0] : less_than(bottom,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+0.ax',bottom_smallest) ).
fof(f27,axiom,
! [X0,X1,X2,X3] :
( contains_cpq(triple(X0,X1,X2),X3)
<=> contains_slb(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',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/sandbox2/benchmark/Axioms/SWV007+3.ax',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/sandbox2/benchmark/Axioms/SWV007+3.ax',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/sandbox2/benchmark/Axioms/SWV007+3.ax',ax49) ).
fof(f38,axiom,
! [X0,X1] : findmin_cpq_res(triple(X0,create_slb,X1)) = bottom,
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax50) ).
fof(f39,axiom,
! [X0,X1,X2,X3] :
( X1 != create_slb
=> findmin_cpq_res(triple(X0,X1,X2)) = findmin_pqp_res(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax51) ).
fof(f41,axiom,
! [X0] : removemin_cpq_res(X0) = findmin_cpq_res(X0),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax53) ).
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/sandbox2/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/sandbox2/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/sandbox2/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(f46,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(f47,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(f48,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
=> findmin_cpq_res(triple(X0,X1,X2)) = findmin_pqp_res(X0) ),
inference(rectify,[],[f39]) ).
fof(f50,plain,
! [X0,X1,X2] :
( less_than(X0,X2)
| ~ less_than(X0,X1)
| ~ less_than(X1,X2) ),
inference(ennf_transformation,[],[f1]) ).
fof(f51,plain,
! [X0,X1,X2] :
( less_than(X0,X2)
| ~ less_than(X0,X1)
| ~ less_than(X1,X2) ),
inference(flattening,[],[f50]) ).
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,[],[f46]) ).
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(f72,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,[],[f47]) ).
fof(f73,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,[],[f72]) ).
fof(f74,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,[],[f48]) ).
fof(f75,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,[],[f74]) ).
fof(f76,plain,
! [X0,X1,X2] :
( findmin_cpq_res(triple(X0,X1,X2)) = findmin_pqp_res(X0)
| create_slb = X1 ),
inference(ennf_transformation,[],[f49]) ).
fof(f77,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(f78,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(f79,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,[],[f78]) ).
fof(f80,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(f81,plain,
! [X2,X0,X1] :
( ~ less_than(X0,X1)
| ~ less_than(X1,X2)
| less_than(X0,X2) ),
inference(cnf_transformation,[],[f51]) ).
fof(f82,plain,
! [X0,X1] :
( less_than(X1,X0)
| less_than(X0,X1) ),
inference(cnf_transformation,[],[f2]) ).
fof(f84,plain,
! [X0,X1] :
( ~ less_than(X1,X0)
| ~ strictly_less_than(X0,X1) ),
inference(cnf_transformation,[],[f4]) ).
fof(f86,plain,
! [X0,X1] :
( less_than(X1,X0)
| ~ less_than(X0,X1)
| strictly_less_than(X0,X1) ),
inference(cnf_transformation,[],[f4]) ).
fof(f87,plain,
! [X0] : less_than(bottom,X0),
inference(cnf_transformation,[],[f5]) ).
fof(f116,plain,
! [X2,X3,X0,X1] :
( ~ contains_cpq(triple(X0,X1,X2),X3)
| contains_slb(X1,X3) ),
inference(cnf_transformation,[],[f27]) ).
fof(f124,plain,
! [X2,X0,X1] :
( contains_slb(X1,findmin_pqp_res(X0))
| create_slb = X1
| findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) ),
inference(cnf_transformation,[],[f71]) ).
fof(f125,plain,
! [X2,X0,X1] :
( ~ strictly_less_than(findmin_pqp_res(X0),lookup_slb(X1,findmin_pqp_res(X0)))
| ~ contains_slb(X1,findmin_pqp_res(X0))
| create_slb = X1
| findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) ),
inference(cnf_transformation,[],[f73]) ).
fof(f126,plain,
! [X2,X0,X1] :
( ~ contains_slb(X1,findmin_pqp_res(X0))
| ~ less_than(lookup_slb(X1,findmin_pqp_res(X0)),findmin_pqp_res(X0))
| create_slb = X1
| findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),X2) ),
inference(cnf_transformation,[],[f75]) ).
fof(f127,plain,
! [X0,X1] : bottom = findmin_cpq_res(triple(X0,create_slb,X1)),
inference(cnf_transformation,[],[f38]) ).
fof(f128,plain,
! [X2,X0,X1] :
( create_slb = X1
| findmin_pqp_res(X0) = findmin_cpq_res(triple(X0,X1,X2)) ),
inference(cnf_transformation,[],[f76]) ).
fof(f130,plain,
! [X0] : findmin_cpq_res(X0) = removemin_cpq_res(X0),
inference(cnf_transformation,[],[f41]) ).
fof(f131,plain,
! [X2,X3,X0,X1,X4] :
( ~ check_cpq(triple(X0,X1,X2))
| less_than(X4,X3)
| ~ pair_in_list(X1,X3,X4) ),
inference(cnf_transformation,[],[f77]) ).
fof(f134,plain,
! [X2,X3,X0,X1] :
( ~ strictly_less_than(X3,findmin_cpq_res(triple(X0,X1,X2)))
| ~ contains_slb(X1,X3)
| less_than(findmin_pqp_res(X0),sK2(X0,X1,X3))
| pair_in_list(update_slb(X1,findmin_pqp_res(X0)),X3,findmin_pqp_res(X0)) ),
inference(cnf_transformation,[],[f79]) ).
fof(f135,plain,
! [X2,X3,X0,X1] :
( ~ strictly_less_than(X3,findmin_cpq_res(triple(X0,X1,X2)))
| ~ contains_slb(X1,X3)
| 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)) ),
inference(cnf_transformation,[],[f79]) ).
fof(f136,plain,
strictly_less_than(sK6,findmin_cpq_res(triple(sK3,sK4,sK5))),
inference(cnf_transformation,[],[f80]) ).
fof(f137,plain,
contains_cpq(triple(sK3,sK4,sK5),sK6),
inference(cnf_transformation,[],[f80]) ).
fof(f138,plain,
check_cpq(findmin_cpq_eff(triple(sK3,sK4,sK5))),
inference(cnf_transformation,[],[f80]) ).
fof(f141,plain,
! [X0,X1] : bottom = removemin_cpq_res(triple(X0,create_slb,X1)),
inference(definition_unfolding,[],[f127,f130]) ).
fof(f142,plain,
! [X2,X0,X1] :
( findmin_pqp_res(X0) = removemin_cpq_res(triple(X0,X1,X2))
| create_slb = X1 ),
inference(definition_unfolding,[],[f128,f130]) ).
fof(f143,plain,
! [X2,X3,X0,X1] :
( ~ strictly_less_than(X3,removemin_cpq_res(triple(X0,X1,X2)))
| ~ contains_slb(X1,X3)
| 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)) ),
inference(definition_unfolding,[],[f135,f130]) ).
fof(f144,plain,
! [X2,X3,X0,X1] :
( ~ strictly_less_than(X3,removemin_cpq_res(triple(X0,X1,X2)))
| ~ contains_slb(X1,X3)
| less_than(findmin_pqp_res(X0),sK2(X0,X1,X3))
| pair_in_list(update_slb(X1,findmin_pqp_res(X0)),X3,findmin_pqp_res(X0)) ),
inference(definition_unfolding,[],[f134,f130]) ).
fof(f145,plain,
strictly_less_than(sK6,removemin_cpq_res(triple(sK3,sK4,sK5))),
inference(definition_unfolding,[],[f136,f130]) ).
fof(f149,plain,
! [X0,X1] :
( less_than(X1,X0)
| ~ less_than(X0,X1)
| ~ strictly_less_than(X0,X1) ),
inference(consistent_polarity_flipping,[],[f86]) ).
fof(f151,plain,
! [X0,X1] :
( ~ less_than(X1,X0)
| strictly_less_than(X0,X1) ),
inference(consistent_polarity_flipping,[],[f84]) ).
fof(f155,plain,
! [X2,X0,X1] :
( strictly_less_than(findmin_pqp_res(X0),lookup_slb(X1,findmin_pqp_res(X0)))
| ~ contains_slb(X1,findmin_pqp_res(X0))
| create_slb = X1
| findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) ),
inference(consistent_polarity_flipping,[],[f125]) ).
fof(f156,plain,
! [X2,X3,X0,X1] :
( ~ contains_slb(X1,X3)
| strictly_less_than(X3,removemin_cpq_res(triple(X0,X1,X2)))
| 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)) ),
inference(consistent_polarity_flipping,[],[f143]) ).
fof(f157,plain,
! [X2,X3,X0,X1] :
( ~ contains_slb(X1,X3)
| strictly_less_than(X3,removemin_cpq_res(triple(X0,X1,X2)))
| less_than(findmin_pqp_res(X0),sK2(X0,X1,X3))
| pair_in_list(update_slb(X1,findmin_pqp_res(X0)),X3,findmin_pqp_res(X0)) ),
inference(consistent_polarity_flipping,[],[f144]) ).
fof(f158,plain,
~ strictly_less_than(sK6,removemin_cpq_res(triple(sK3,sK4,sK5))),
inference(consistent_polarity_flipping,[],[f145]) ).
fof(f162,plain,
! [X0] : strictly_less_than(X0,bottom),
inference(resolution,[],[f151,f87]) ).
fof(f175,plain,
contains_slb(sK4,sK6),
inference(resolution,[],[f116,f137]) ).
fof(f177,plain,
! [X0,X1] :
( ~ strictly_less_than(X0,X1)
| less_than(X1,X0) ),
inference(forward_subsumption_resolution,[],[f149,f82]) ).
fof(f198,plain,
( ~ strictly_less_than(sK6,findmin_pqp_res(sK3))
| create_slb = sK4 ),
inference(superposition,[],[f158,f142]) ).
fof(f201,definition,
( spl7_1
<=> create_slb = sK4 ),
introduced(definition,[new_symbols(definition,[spl7_1])],[avatar_definition]) ).
fof(f202,plain,
( create_slb != sK4
| spl7_1 ),
inference(avatar_component_clause,[],[f201]) ).
fof(f203,plain,
( create_slb = sK4
| ~ spl7_1 ),
inference(avatar_component_clause,[],[f201]) ).
fof(f205,definition,
( spl7_2
<=> strictly_less_than(sK6,findmin_pqp_res(sK3)) ),
introduced(definition,[new_symbols(definition,[spl7_2])],[avatar_definition]) ).
fof(f207,plain,
( ~ strictly_less_than(sK6,findmin_pqp_res(sK3))
| spl7_2 ),
inference(avatar_component_clause,[],[f205]) ).
fof(f208,plain,
( spl7_1
| ~ spl7_2 ),
inference(avatar_split_clause,[],[f198,f205,f201]) ).
fof(f376,plain,
! [X0,X1] :
( strictly_less_than(sK6,removemin_cpq_res(triple(X0,sK4,X1)))
| pair_in_list(update_slb(sK4,findmin_pqp_res(X0)),sK6,findmin_pqp_res(X0))
| less_than(findmin_pqp_res(X0),sK2(X0,sK4,sK6)) ),
inference(resolution,[],[f157,f175]) ).
fof(f381,plain,
! [X2,X3,X0,X1] :
( ~ less_than(lookup_slb(X0,findmin_pqp_res(X1)),findmin_pqp_res(X1))
| create_slb = X0
| findmin_cpq_eff(triple(X1,X0,X2)) = triple(X1,update_slb(X0,findmin_pqp_res(X1)),X2)
| create_slb = X0
| triple(X1,update_slb(X0,findmin_pqp_res(X1)),bad) = findmin_cpq_eff(triple(X1,X0,X3)) ),
inference(resolution,[],[f126,f124]) ).
fof(f383,plain,
! [X2,X3,X0,X1] :
( ~ less_than(lookup_slb(X0,findmin_pqp_res(X1)),findmin_pqp_res(X1))
| create_slb = X0
| findmin_cpq_eff(triple(X1,X0,X2)) = triple(X1,update_slb(X0,findmin_pqp_res(X1)),X2)
| triple(X1,update_slb(X0,findmin_pqp_res(X1)),bad) = findmin_cpq_eff(triple(X1,X0,X3)) ),
inference(duplicate_literal_removal,[],[f381]) ).
fof(f385,plain,
! [X2,X0,X1] :
( strictly_less_than(findmin_pqp_res(X0),lookup_slb(X1,findmin_pqp_res(X0)))
| create_slb = X1
| findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) ),
inference(forward_subsumption_resolution,[],[f155,f124]) ).
fof(f386,plain,
! [X2,X0,X1] :
( less_than(lookup_slb(X0,findmin_pqp_res(X1)),findmin_pqp_res(X1))
| findmin_cpq_eff(triple(X1,X0,X2)) = triple(X1,update_slb(X0,findmin_pqp_res(X1)),bad)
| create_slb = X0 ),
inference(resolution,[],[f385,f177]) ).
fof(f394,plain,
! [X0,X1] :
( strictly_less_than(sK6,removemin_cpq_res(triple(X0,sK4,X1)))
| pair_in_list(update_slb(sK4,findmin_pqp_res(X0)),sK6,sK2(X0,sK4,sK6))
| pair_in_list(update_slb(sK4,findmin_pqp_res(X0)),sK6,findmin_pqp_res(X0)) ),
inference(resolution,[],[f156,f175]) ).
fof(f417,plain,
( ~ strictly_less_than(sK6,removemin_cpq_res(triple(sK3,create_slb,sK5)))
| ~ spl7_1 ),
inference(superposition,[],[f158,f203]) ).
fof(f434,plain,
( ~ strictly_less_than(sK6,bottom)
| ~ spl7_1 ),
inference(forward_demodulation,[],[f417,f141]) ).
fof(f437,plain,
( $false
| ~ spl7_1 ),
inference(forward_subsumption_resolution,[],[f434,f162]) ).
fof(f438,plain,
~ spl7_1,
inference(avatar_contradiction_clause,[],[f437]) ).
fof(f1208,plain,
! [X2,X3,X0,X1] :
( findmin_cpq_eff(triple(X1,X0,X2)) = triple(X1,update_slb(X0,findmin_pqp_res(X1)),X2)
| triple(X1,update_slb(X0,findmin_pqp_res(X1)),bad) = findmin_cpq_eff(triple(X1,X0,X3))
| create_slb = X0 ),
inference(forward_subsumption_resolution,[],[f383,f386]) ).
fof(f1249,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ check_cpq(findmin_cpq_eff(triple(X0,X1,X2)))
| less_than(X3,X4)
| ~ pair_in_list(update_slb(X1,findmin_pqp_res(X0)),X4,X3)
| findmin_cpq_eff(triple(X0,X1,X5)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),X5)
| create_slb = X1 ),
inference(superposition,[],[f131,f1208]) ).
fof(f6601,definition,
( spl7_77
<=> ! [X0,X1] :
( less_than(X0,X1)
| ~ pair_in_list(update_slb(sK4,findmin_pqp_res(sK3)),X1,X0) ) ),
introduced(definition,[new_symbols(definition,[spl7_77])],[avatar_definition]) ).
fof(f6602,plain,
( ! [X0,X1] :
( ~ pair_in_list(update_slb(sK4,findmin_pqp_res(sK3)),X1,X0)
| less_than(X0,X1) )
| ~ spl7_77 ),
inference(avatar_component_clause,[],[f6601]) ).
fof(f6627,plain,
! [X2,X0,X1] :
( less_than(X0,X1)
| ~ pair_in_list(update_slb(sK4,findmin_pqp_res(sK3)),X1,X0)
| findmin_cpq_eff(triple(sK3,sK4,X2)) = triple(sK3,update_slb(sK4,findmin_pqp_res(sK3)),X2)
| create_slb = sK4 ),
inference(resolution,[],[f1249,f138]) ).
fof(f6659,plain,
( ! [X2,X0,X1] :
( less_than(X0,X1)
| ~ pair_in_list(update_slb(sK4,findmin_pqp_res(sK3)),X1,X0)
| findmin_cpq_eff(triple(sK3,sK4,X2)) = triple(sK3,update_slb(sK4,findmin_pqp_res(sK3)),X2) )
| spl7_1 ),
inference(forward_subsumption_resolution,[],[f6627,f202]) ).
fof(f6662,definition,
( spl7_78
<=> ! [X2] : findmin_cpq_eff(triple(sK3,sK4,X2)) = triple(sK3,update_slb(sK4,findmin_pqp_res(sK3)),X2) ),
introduced(definition,[new_symbols(definition,[spl7_78])],[avatar_definition]) ).
fof(f6663,plain,
( ! [X2] : findmin_cpq_eff(triple(sK3,sK4,X2)) = triple(sK3,update_slb(sK4,findmin_pqp_res(sK3)),X2)
| ~ spl7_78 ),
inference(avatar_component_clause,[],[f6662]) ).
fof(f6664,plain,
( spl7_78
| spl7_77
| spl7_1 ),
inference(avatar_split_clause,[],[f6659,f201,f6601,f6662]) ).
fof(f8136,definition,
( spl7_92
<=> pair_in_list(update_slb(sK4,findmin_pqp_res(sK3)),sK6,findmin_pqp_res(sK3)) ),
introduced(definition,[new_symbols(definition,[spl7_92])],[avatar_definition]) ).
fof(f8138,plain,
( pair_in_list(update_slb(sK4,findmin_pqp_res(sK3)),sK6,findmin_pqp_res(sK3))
| ~ spl7_92 ),
inference(avatar_component_clause,[],[f8136]) ).
fof(f8140,definition,
( spl7_93
<=> ! [X0] : strictly_less_than(sK6,removemin_cpq_res(triple(sK3,sK4,X0))) ),
introduced(definition,[new_symbols(definition,[spl7_93])],[avatar_definition]) ).
fof(f8141,plain,
( ! [X0] : strictly_less_than(sK6,removemin_cpq_res(triple(sK3,sK4,X0)))
| ~ spl7_93 ),
inference(avatar_component_clause,[],[f8140]) ).
fof(f8143,definition,
( spl7_94
<=> less_than(sK2(sK3,sK4,sK6),sK6) ),
introduced(definition,[new_symbols(definition,[spl7_94])],[avatar_definition]) ).
fof(f8145,plain,
( less_than(sK2(sK3,sK4,sK6),sK6)
| ~ spl7_94 ),
inference(avatar_component_clause,[],[f8143]) ).
fof(f8149,definition,
( spl7_95
<=> less_than(findmin_pqp_res(sK3),sK2(sK3,sK4,sK6)) ),
introduced(definition,[new_symbols(definition,[spl7_95])],[avatar_definition]) ).
fof(f8151,plain,
( less_than(findmin_pqp_res(sK3),sK2(sK3,sK4,sK6))
| ~ spl7_95 ),
inference(avatar_component_clause,[],[f8149]) ).
fof(f8153,definition,
( spl7_96
<=> less_than(findmin_pqp_res(sK3),sK6) ),
introduced(definition,[new_symbols(definition,[spl7_96])],[avatar_definition]) ).
fof(f8154,plain,
( ~ less_than(findmin_pqp_res(sK3),sK6)
| spl7_96 ),
inference(avatar_component_clause,[],[f8153]) ).
fof(f8155,plain,
( less_than(findmin_pqp_res(sK3),sK6)
| ~ spl7_96 ),
inference(avatar_component_clause,[],[f8153]) ).
fof(f9716,plain,
( strictly_less_than(sK6,findmin_pqp_res(sK3))
| ~ spl7_96 ),
inference(resolution,[],[f8155,f151]) ).
fof(f9733,plain,
( $false
| spl7_2
| ~ spl7_96 ),
inference(forward_subsumption_resolution,[],[f9716,f207]) ).
fof(f9734,plain,
( spl7_2
| ~ spl7_96 ),
inference(avatar_contradiction_clause,[],[f9733]) ).
fof(f73140,definition,
( spl7_217
<=> ! [X0] : ~ check_cpq(findmin_cpq_eff(triple(sK3,sK4,X0))) ),
introduced(definition,[new_symbols(definition,[spl7_217])],[avatar_definition]) ).
fof(f73141,plain,
( ! [X0] : ~ check_cpq(findmin_cpq_eff(triple(sK3,sK4,X0)))
| ~ spl7_217 ),
inference(avatar_component_clause,[],[f73140]) ).
fof(f73358,plain,
( less_than(findmin_pqp_res(sK3),sK6)
| ~ spl7_77
| ~ spl7_92 ),
inference(resolution,[],[f6602,f8138]) ).
fof(f73359,plain,
( ! [X0] :
( less_than(findmin_pqp_res(sK3),sK6)
| strictly_less_than(sK6,removemin_cpq_res(triple(sK3,sK4,X0)))
| less_than(findmin_pqp_res(sK3),sK2(sK3,sK4,sK6)) )
| ~ spl7_77 ),
inference(resolution,[],[f6602,f376]) ).
fof(f73368,plain,
( ! [X0] :
( less_than(sK2(sK3,sK4,sK6),sK6)
| strictly_less_than(sK6,removemin_cpq_res(triple(sK3,sK4,X0)))
| pair_in_list(update_slb(sK4,findmin_pqp_res(sK3)),sK6,findmin_pqp_res(sK3)) )
| ~ spl7_77 ),
inference(resolution,[],[f6602,f394]) ).
fof(f73417,plain,
( ! [X0] :
( strictly_less_than(sK6,removemin_cpq_res(triple(sK3,sK4,X0)))
| less_than(findmin_pqp_res(sK3),sK2(sK3,sK4,sK6)) )
| ~ spl7_77
| spl7_96 ),
inference(forward_subsumption_resolution,[],[f73359,f8154]) ).
fof(f73418,plain,
( $false
| ~ spl7_77
| ~ spl7_92
| spl7_96 ),
inference(forward_subsumption_resolution,[],[f73358,f8154]) ).
fof(f73419,plain,
( ~ spl7_77
| ~ spl7_92
| spl7_96 ),
inference(avatar_contradiction_clause,[],[f73418]) ).
fof(f73436,plain,
( spl7_95
| spl7_93
| ~ spl7_77
| spl7_96 ),
inference(avatar_split_clause,[],[f73417,f8153,f6601,f8140,f8149]) ).
fof(f73445,plain,
( spl7_92
| spl7_93
| spl7_94
| ~ spl7_77 ),
inference(avatar_split_clause,[],[f73368,f6601,f8143,f8140,f8136]) ).
fof(f73578,plain,
( $false
| ~ spl7_93 ),
inference(backward_subsumption_resolution,[],[f158,f8141]) ).
fof(f73581,plain,
~ spl7_93,
inference(avatar_contradiction_clause,[],[f73578]) ).
fof(f73668,plain,
( ! [X2,X0,X1] :
( ~ check_cpq(findmin_cpq_eff(triple(sK3,sK4,X0)))
| less_than(X1,X2)
| ~ pair_in_list(update_slb(sK4,findmin_pqp_res(sK3)),X2,X1) )
| ~ spl7_78 ),
inference(superposition,[],[f131,f6663]) ).
fof(f74601,plain,
( ! [X0] :
( ~ less_than(sK2(sK3,sK4,sK6),X0)
| less_than(findmin_pqp_res(sK3),X0) )
| ~ spl7_95 ),
inference(resolution,[],[f8151,f81]) ).
fof(f77937,plain,
( less_than(findmin_pqp_res(sK3),sK6)
| ~ spl7_94
| ~ spl7_95 ),
inference(resolution,[],[f74601,f8145]) ).
fof(f77943,plain,
( $false
| ~ spl7_94
| ~ spl7_95
| spl7_96 ),
inference(forward_subsumption_resolution,[],[f77937,f8154]) ).
fof(f77944,plain,
( ~ spl7_94
| ~ spl7_95
| spl7_96 ),
inference(avatar_contradiction_clause,[],[f77943]) ).
fof(f78885,plain,
( spl7_77
| spl7_217
| ~ spl7_78 ),
inference(avatar_split_clause,[],[f73668,f6662,f73140,f6601]) ).
fof(f79582,plain,
( $false
| ~ spl7_217 ),
inference(backward_subsumption_resolution,[],[f138,f73141]) ).
fof(f79647,plain,
~ spl7_217,
inference(avatar_contradiction_clause,[],[f79582]) ).
cnf(s1,plain,
( spl7_1
| ~ spl7_2 ),
inference(sat_conversion,[],[f208]) ).
cnf(s14,plain,
~ spl7_1,
inference(sat_conversion,[],[f438]) ).
cnf(s111,plain,
( spl7_1
| spl7_77
| spl7_78 ),
inference(sat_conversion,[],[f6664]) ).
cnf(s164,plain,
( spl7_2
| ~ spl7_96 ),
inference(sat_conversion,[],[f9734]) ).
cnf(s824,plain,
( ~ spl7_77
| ~ spl7_92
| spl7_96 ),
inference(sat_conversion,[],[f73419]) ).
cnf(s837,plain,
( ~ spl7_77
| spl7_93
| spl7_95
| spl7_96 ),
inference(sat_conversion,[],[f73436]) ).
cnf(s841,plain,
( ~ spl7_77
| spl7_92
| spl7_93
| spl7_94 ),
inference(sat_conversion,[],[f73445]) ).
cnf(s871,plain,
~ spl7_93,
inference(sat_conversion,[],[f73581]) ).
cnf(s1418,plain,
( ~ spl7_94
| ~ spl7_95
| spl7_96 ),
inference(sat_conversion,[],[f77944]) ).
cnf(s2243,plain,
( spl7_77
| ~ spl7_78
| spl7_217 ),
inference(sat_conversion,[],[f78885]) ).
cnf(s2444,plain,
~ spl7_217,
inference(sat_conversion,[],[f79647]) ).
cnf(s2472,plain,
( spl7_77
| ~ spl7_78 ),
inference(rat,[],[s2243,s2444]) ).
cnf(s2478,plain,
( ~ spl7_77
| spl7_92
| spl7_94 ),
inference(rat,[],[s841,s871]) ).
cnf(s2480,plain,
( ~ spl7_77
| spl7_95
| spl7_96 ),
inference(rat,[],[s837,s871]) ).
cnf(s2498,plain,
~ spl7_2,
inference(rat,[],[s1,s14]) ).
cnf(s2499,plain,
~ spl7_96,
inference(rat,[],[s164,s2498]) ).
cnf(s2500,plain,
~ spl7_77,
inference(rat,[],[s1418,s2478,s824,s2480,s2499]) ).
cnf(s2502,plain,
~ spl7_78,
inference(rat,[],[s2472,s2500]) ).
cnf(s2509,plain,
$false,
inference(rat,[],[s111,s14,s2502,s2500]) ).
fof(f79699,plain,
$false,
inference(avatar_sat_refutation,[],[s2509]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV407+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.19 % Computer : n015.cluster.edu
% 0.07/0.19 % Model : x86_64 x86_64
% 0.07/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.19 % Memory : 8046.5625MB
% 0.07/0.19 % OS : Linux 6.8.0-71-generic
% 0.07/0.19 % CPULimit : 300
% 0.07/0.19 % WCLimit : 300
% 0.07/0.19 % DateTime : Mon Sep 28 10:54:01 UTC 2026
% 0.07/0.19 % CPUTime :
% 0.07/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.22 Running first-order model finding
% 0.07/0.22 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 16.06/2.51 % (2541066)Will run a generic schedule for satisfiability detection.
% 16.06/2.51 % (2541082)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3580430892:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 16.06/2.51 % (2541079)% WARNING: option uhcvi not known.
% 16.06/2.51 % (2541081)dis+10_1_sil=32000:sp=arity:random_seed=3216776792:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 16.06/2.51 % (2541083)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2981541235:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 16.06/2.51 % (2541078)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2107936773_2999 on theBenchmark for (2999ds/0Mi)
% 16.06/2.51 % (2541079)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2282522156:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 16.06/2.51 % (2541080)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2788069084:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 16.06/2.51 % (2541084)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4115706391:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 16.06/2.51 % TRYING [1]
% 16.06/2.51 % TRYING [2]
% 16.06/2.51 % TRYING [3]
% 16.06/2.51 % (2541082)Instruction limit reached!
% 16.06/2.51 % (2541082)------------------------------
% 16.06/2.51 % (2541082)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 16.06/2.51 % (2541082)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 16.06/2.51 % (2541082)CaDiCaL version: 2.1.3
% 16.06/2.51 % (2541082)Termination reason: Instruction limit
% 16.06/2.51 % (2541082)Termination phase: Saturation
% 16.06/2.51 % (2541082)Time elapsed: 0.037 s
% 16.06/2.51 % (2541082)Peak memory usage: 12 MB
% 16.06/2.51 % (2541082)Instructions burned: 118 (million)
% 16.06/2.51 % (2541102)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1573690181:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 16.06/2.51 % TRYING [1]
% 16.06/2.51 % TRYING [2]
% 16.06/2.51 % TRYING [3]
% 16.06/2.51 % TRYING [4]
% 16.06/2.51 % TRYING [4]
% 16.06/2.51 % (2541081)Instruction limit reached!
% 16.06/2.51 % (2541081)------------------------------
% 16.06/2.51 % (2541081)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 16.06/2.51 % (2541081)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 16.06/2.51 % (2541081)CaDiCaL version: 2.1.3
% 16.06/2.51 % (2541081)Termination reason: Instruction limit
% 16.06/2.51 % (2541081)Termination phase: Saturation
% 16.06/2.51 % (2541081)Time elapsed: 0.063 s
% 16.06/2.51 % (2541081)Peak memory usage: 12 MB
% 16.06/2.51 % (2541081)Instructions burned: 103 (million)
% 16.06/2.51 % (2541084)Instruction limit reached!
% 16.06/2.51 % (2541084)------------------------------
% 16.06/2.51 % (2541084)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 16.06/2.51 % (2541084)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 16.06/2.51 % (2541084)CaDiCaL version: 2.1.3
% 16.06/2.51 % (2541084)Termination reason: Instruction limit
% 16.06/2.51 % (2541084)Termination phase: Saturation
% 16.06/2.51 % (2541084)Time elapsed: 0.061 s
% 16.06/2.51 % (2541084)Peak memory usage: 11 MB
% 16.06/2.51 % (2541084)Instructions burned: 161 (million)
% 16.06/2.51 % (2541106)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1105755324:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 16.06/2.51 % (2541107)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=1352648748:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 16.06/2.51 % (2541083)Instruction limit reached!
% 16.06/2.51 % (2541083)------------------------------
% 16.06/2.51 % (2541083)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 16.06/2.51 % (2541083)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 16.06/2.51 % (2541083)CaDiCaL version: 2.1.3
% 16.06/2.51 % (2541083)Termination reason: Instruction limit
% 16.06/2.51 % (2541083)Termination phase: Saturation
% 16.06/2.51 % (2541083)Time elapsed: 0.086 s
% 16.06/2.51 % (2541083)Peak memory usage: 13 MB
% 16.06/2.51 % (2541083)Instructions burned: 132 (million)
% 16.06/2.51 % (2541121)ott-21_1_sil=16000:fs=off:random_seed=497055815:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 16.06/2.51 % TRYING [5]
% 16.06/2.51 % TRYING [5]
% 16.06/2.51 % (2541106)Instruction limit reached!
% 16.06/2.51 % (2541106)------------------------------
% 16.06/2.51 % (2541106)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 25.63/5.72 % (2541106)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 25.63/5.72 % (2541106)CaDiCaL version: 2.1.3
% 25.63/5.72 % (2541106)Termination reason: Instruction limit
% 25.63/5.72 % (2541106)Termination phase: Saturation
% 25.63/5.72 % (2541106)Time elapsed: 0.082 s
% 25.63/5.72 % (2541106)Peak memory usage: 12 MB
% 25.63/5.72 % (2541106)Instructions burned: 131 (million)
% 25.63/5.72 % (2541136)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=3253745668:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 25.63/5.72 % (2541102)Instruction limit reached!
% 25.63/5.72 % (2541102)------------------------------
% 25.63/5.72 % (2541102)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 25.63/5.72 % (2541102)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 25.63/5.72 % (2541102)CaDiCaL version: 2.1.3
% 25.63/5.72 % (2541102)Termination reason: Instruction limit
% 25.63/5.72 % (2541102)Termination phase: Finite model building constraint generation
% 25.63/5.72 % (2541102)Time elapsed: 0.147 s
% 25.63/5.72 % (2541102)Peak memory usage: 32 MB
% 25.63/5.72 % (2541102)Instructions burned: 715 (million)
% 25.63/5.72 % (2541142)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=518737572:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 25.63/5.72 % TRYING [1]
% 25.63/5.72 % TRYING [2]
% 25.63/5.72 % TRYING [3]
% 25.63/5.72 % (2541121)Instruction limit reached!
% 25.63/5.72 % (2541121)------------------------------
% 25.63/5.72 % (2541121)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 25.63/5.72 % (2541121)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 25.63/5.72 % (2541121)CaDiCaL version: 2.1.3
% 25.63/5.72 % (2541121)Termination reason: Instruction limit
% 25.63/5.72 % (2541121)Termination phase: Saturation
% 25.63/5.72 % (2541121)Time elapsed: 0.104 s
% 25.63/5.72 % (2541121)Peak memory usage: 12 MB
% 25.63/5.72 % (2541121)Instructions burned: 180 (million)
% 25.63/5.72 % (2541151)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=3807540546:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 25.63/5.72 % TRYING [4]
% 25.63/5.72 % TRYING [5]
% 25.63/5.72 % (2541107)Instruction limit reached!
% 25.63/5.72 % (2541107)------------------------------
% 25.63/5.72 % (2541107)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 25.63/5.72 % (2541107)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 25.63/5.72 % (2541107)CaDiCaL version: 2.1.3
% 25.63/5.72 % (2541107)Termination reason: Instruction limit
% 25.63/5.72 % (2541107)Termination phase: Saturation
% 25.63/5.72 % (2541107)Time elapsed: 0.295 s
% 25.63/5.72 % (2541107)Peak memory usage: 14 MB
% 25.63/5.72 % (2541107)Instructions burned: 685 (million)
% 25.63/5.72 % (2541142)Instruction limit reached!
% 25.63/5.72 % (2541142)------------------------------
% 25.63/5.72 % (2541142)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 25.63/5.72 % (2541142)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 25.63/5.72 % (2541142)CaDiCaL version: 2.1.3
% 25.63/5.72 % (2541142)Termination reason: Instruction limit
% 25.63/5.72 % (2541142)Termination phase: Finite model building constraint generation
% 25.63/5.72 % (2541142)Time elapsed: 0.190 s
% 25.63/5.72 % (2541142)Peak memory usage: 26 MB
% 25.63/5.72 % (2541142)Instructions burned: 867 (million)
% 25.63/5.72 % (2541163)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=3657924526:i=889:ins=1_2995 on theBenchmark for (2995ds/889Mi)
% 25.63/5.72 % TRYING [6]
% 25.63/5.72 % (2541164)ott+1_16_sil=32000:plsq=on:plsqc=2:sas=cadical:avsql=on:sp=reverse_frequency:plsqr=128,1:bsr=unit_only:rp=on:newcnf=on:random_seed=3693627611:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2995 on theBenchmark for (2995ds/692Mi)
% 25.63/5.72 % (2541136)Instruction limit reached!
% 25.63/5.72 % (2541136)------------------------------
% 25.63/5.72 % (2541136)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 25.63/5.72 % (2541136)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 25.63/5.72 % (2541136)CaDiCaL version: 2.1.3
% 25.63/5.72 % (2541136)Termination reason: Instruction limit
% 25.63/5.72 % (2541136)Termination phase: Saturation
% 25.63/5.72 % (2541136)Time elapsed: 0.310 s
% 25.63/5.72 % (2541136)Peak memory usage: 13 MB
% 25.63/5.72 % (2541136)Instructions burned: 477 (million)
% 25.63/5.72 % (2541167)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=3009396922:i=879:kws=inv_precedence:fsr=off_2994 on theBenchmark for (2994ds/879Mi)
% 25.63/5.72 % (2541164)Instruction limit reached!
% 25.63/5.72 % (2541164)------------------------------
% 25.63/5.72 % (2541164)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 25.63/5.72 % (2541164)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 25.63/5.72 % (2541164)CaDiCaL version: 2.1.3
% 25.63/5.72 % (2541164)Termination reason: Instruction limit
% 25.63/5.72 % (2541164)Termination phase: Saturation
% 25.63/5.72 % (2541164)Time elapsed: 0.222 s
% 25.63/5.72 % (2541164)Peak memory usage: 20 MB
% 25.63/5.72 % (2541164)Instructions burned: 692 (million)
% 25.63/5.72 % (2541169)fmb+10_1_sil=64000:random_seed=391486782:i=22061:nm=2:gsp=on_2993 on theBenchmark for (2993ds/22061Mi)
% 25.63/5.72 % TRYING [1]
% 25.63/5.72 % TRYING [2]
% 25.63/5.72 % TRYING [3]
% 25.63/5.72 % TRYING [4]
% 25.63/5.72 % (2541163)Instruction limit reached!
% 25.63/5.72 % (2541163)------------------------------
% 25.63/5.72 % (2541163)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 25.63/5.72 % (2541163)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 25.63/5.72 % (2541163)CaDiCaL version: 2.1.3
% 25.63/5.72 % (2541163)Termination reason: Instruction limit
% 25.63/5.72 % (2541163)Termination phase: Finite model building constraint generation
% 25.63/5.72 % (2541163)Time elapsed: 0.400 s
% 25.63/5.72 % (2541163)Peak memory usage: 104 MB
% 25.63/5.72 % (2541163)Instructions burned: 891 (million)
% 25.63/5.72 % TRYING [5]
% 25.63/5.72 % (2541171)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=3173762927:i=9515:nm=5_2991 on theBenchmark for (2991ds/9515Mi)
% 25.63/5.72 % TRYING [20]
% 25.63/5.72 % (2541151)Instruction limit reached!
% 25.63/5.72 % (2541151)------------------------------
% 25.63/5.72 % (2541151)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 25.63/5.72 % (2541151)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 25.63/5.72 % (2541151)CaDiCaL version: 2.1.3
% 25.63/5.72 % (2541151)Termination reason: Instruction limit
% 25.63/5.72 % (2541151)Termination phase: Saturation
% 25.63/5.72 % (2541151)Time elapsed: 0.785 s
% 25.63/5.72 % (2541151)Peak memory usage: 16 MB
% 25.63/5.72 % (2541151)Instructions burned: 1180 (million)
% 25.63/5.72 % (2541181)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=781737237:fmbsr=1.7:i=920_2989 on theBenchmark for (2989ds/920Mi)
% 25.63/5.72 % TRYING [8]
% 25.63/5.72 % (2541167)Instruction limit reached!
% 25.63/5.72 % (2541167)------------------------------
% 25.63/5.72 % (2541167)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 25.63/5.72 % (2541167)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 25.63/5.72 % (2541167)CaDiCaL version: 2.1.3
% 25.63/5.72 % (2541167)Termination reason: Instruction limit
% 25.63/5.72 % (2541167)Termination phase: Saturation
% 25.63/5.72 % (2541167)Time elapsed: 0.601 s
% 25.63/5.72 % (2541167)Peak memory usage: 18 MB
% 25.63/5.72 % (2541167)Instructions burned: 880 (million)
% 25.63/5.72 % (2541188)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=1537533156:i=5131_2988 on theBenchmark for (2988ds/5131Mi)
% 25.63/5.72 % TRYING [6]
% 25.63/5.72 % TRYING [7]
% 25.63/5.72 % (2541181)Instruction limit reached!
% 25.63/5.72 % (2541181)------------------------------
% 25.63/5.72 % (2541181)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 25.63/5.72 % (2541181)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 25.63/5.72 % (2541181)CaDiCaL version: 2.1.3
% 25.63/5.72 % (2541181)Termination reason: Instruction limit
% 25.63/5.72 % (2541181)Termination phase: Finite model building constraint generation
% 25.63/5.72 % (2541181)Time elapsed: 0.550 s
% 25.63/5.72 % (2541181)Peak memory usage: 64 MB
% 25.63/5.72 % (2541181)Instructions burned: 921 (million)
% 25.63/5.72 % (2541196)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=75382604:i=1472:ins=7:fdi=8:gsp=on_2983 on theBenchmark for (2983ds/1472Mi)
% 25.63/5.72 % (2541196)Instruction limit reached!
% 25.63/5.72 % (2541196)------------------------------
% 25.63/5.72 % (2541196)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 25.63/5.72 % (2541196)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 25.63/5.72 % (2541196)CaDiCaL version: 2.1.3
% 25.63/5.72 % (2541196)Termination reason: Instruction limit
% 25.63/5.72 % (2541196)Termination phase: Saturation
% 25.63/5.72 % (2541196)Time elapsed: 0.590 s
% 25.63/5.72 % (2541196)Peak memory usage: 13 MB
% 25.63/5.72 % (2541196)Instructions burned: 1474 (million)
% 25.63/5.72 % (2541261)fmb+10_1_sil=16000:sas=cadical:bce=on:fmbss=77:random_seed=1512093665:i=6324_2977 on theBenchmark for (2977ds/6324Mi)
% 25.63/5.72 % (2541261)Cannot represent all propositional literals internally
% 25.63/5.72 % (2541261)Refutation not found, incomplete strategy
% 25.63/5.72 % (2541261)------------------------------
% 25.63/5.72 % (2541261)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 25.63/5.72 % (2541261)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 25.63/5.72 % (2541261)CaDiCaL version: 2.1.3
% 25.63/5.72 % (2541261)Termination reason: Refutation not found, incomplete strategy
% 25.63/5.72 % (2541261)Time elapsed: 0.008 s
% 25.63/5.72 % (2541261)Peak memory usage: 11 MB
% 25.63/5.72 % (2541261)Instructions burned: 14 (million)
% 25.63/5.72 % (2541261)------------------------------
% 25.63/5.72 % (2541261)------------------------------
% 25.63/5.72 % (2541268)fmb+10_1_fmbas=function:sil=32000:sas=cadical:fmbss=16:random_seed=4141244742:fmbsr=2.30978:i=2174_2977 on theBenchmark for (2977ds/2174Mi)
% 25.63/5.72 % TRYING [16]
% 25.63/5.72 % TRYING [7]
% 25.63/5.72 % (2541268)Instruction limit reached!
% 25.63/5.72 % (2541268)------------------------------
% 25.63/5.72 % (2541268)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 25.63/5.72 % (2541268)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 25.63/5.72 % (2541268)CaDiCaL version: 2.1.3
% 25.63/5.72 % (2541268)Termination reason: Instruction limit
% 25.63/5.72 % (2541268)Termination phase: Finite model building constraint generation
% 25.63/5.72 % (2541268)Time elapsed: 0.759 s
% 25.63/5.72 % (2541268)Peak memory usage: 142 MB
% 25.63/5.72 % (2541268)Instructions burned: 2177 (million)
% 25.63/5.72 % (2541355)ott-2_1_sil=16000:newcnf=on:random_seed=3916967149:avsq=on:i=869:avsqr=1,16:kws=inv_arity_squared_2969 on theBenchmark for (2969ds/869Mi)
% 25.63/5.72 % TRYING [8]
% 25.63/5.72 % (2541355)Instruction limit reached!
% 25.63/5.72 % (2541355)------------------------------
% 25.63/5.72 % (2541355)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 25.63/5.72 % (2541355)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 25.63/5.72 % (2541355)CaDiCaL version: 2.1.3
% 25.63/5.72 % (2541355)Termination reason: Instruction limit
% 25.63/5.72 % (2541355)Termination phase: Saturation
% 25.63/5.72 % (2541355)Time elapsed: 0.314 s
% 25.63/5.72 % (2541355)Peak memory usage: 13 MB
% 25.63/5.72 % (2541355)Instructions burned: 871 (million)
% 25.63/5.72 % (2541357)ott+10_1_sil=32000:tgt=ground:random_seed=3499554017:i=5114:av=off_2965 on theBenchmark for (2965ds/5114Mi)
% 25.63/5.72 % (2541188)Instruction limit reached!
% 25.63/5.72 % (2541188)------------------------------
% 25.63/5.72 % (2541188)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 25.63/5.72 % (2541188)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 25.63/5.72 % (2541188)CaDiCaL version: 2.1.3
% 25.63/5.72 % (2541188)Termination reason: Instruction limit
% 25.63/5.72 % (2541188)Termination phase: Saturation
% 25.63/5.72 % (2541188)Time elapsed: 2.899 s
% 25.63/5.72 % (2541188)Peak memory usage: 29 MB
% 25.63/5.72 % (2541188)Instructions burned: 5131 (million)
% 25.63/5.72 % (2541359)fmb+10_1_sil=64000:sas=cadical:bce=on:rp=on:random_seed=1997369321:i=54282_2959 on theBenchmark for (2959ds/54282Mi)
% 25.63/5.72 % TRYING [1]
% 25.63/5.72 % TRYING [2]
% 25.63/5.72 % TRYING [3]
% 25.63/5.72 % TRYING [4]
% 25.63/5.72 % TRYING [5]
% 25.63/5.72 % (2541171)Instruction limit reached!
% 25.63/5.72 % (2541171)------------------------------
% 25.63/5.72 % (2541171)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 25.63/5.72 % (2541171)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 25.63/5.72 % (2541171)CaDiCaL version: 2.1.3
% 25.63/5.72 % (2541171)Termination reason: Instruction limit
% 25.63/5.72 % (2541171)Termination phase: Finite model building constraint generation
% 25.63/5.72 % (2541171)Time elapsed: 3.526 s
% 25.63/5.72 % (2541171)Peak memory usage: 518 MB
% 25.63/5.72 % (2541171)Instructions burned: 9517 (million)
% 25.63/5.72 % (2541361)dis-11_1_sil=16000:sp=reverse_frequency:alpa=true:random_seed=377634059:i=3512:aac=none_2955 on theBenchmark for (2955ds/3512Mi)
% 25.63/5.72 % TRYING [6]
% 25.63/5.72 % (2541079) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2541066-2541079"...
% 25.63/5.72 % (2541079)...printing done.
% 25.63/5.72 % (2541079)Refutation found. Thanks to Tanya!
% 25.63/5.72 % SZS status Theorem for theBenchmark
% 25.63/5.72 % SZS output start Proof for theBenchmark
% See solution above
% 25.63/5.72 % (2541079)------------------------------
% 25.63/5.72 % (2541079)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 25.63/5.72 % (2541079)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 25.63/5.72 % (2541079)CaDiCaL version: 2.1.3
% 25.63/5.72 % (2541079)Termination reason: Refutation
% 25.63/5.72 % (2541079)Time elapsed: 5.396 s
% 25.63/5.72 % (2541079)Peak memory usage: 35 MB
% 25.63/5.72 % (2541079)Instructions burned: 10357 (million)
% 25.63/5.72 % (2541066)Success in time 5.491 s
% 25.63/5.72 % Vampire exiting
%------------------------------------------------------------------------------