↑ Up

Vampire-SAT---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire-SAT---5.0.1
% Problem  : SWV380+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT

% Computer : n003.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:07 PM UTC 2026

% Result   : Theorem 6.67s 1.27s
% Output   : Refutation 6.67s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   20
%            Number of leaves      :   27
% Syntax   : Number of formulae    :  157 (  39 unt;   9 def)
%            Number of atoms       :  365 ( 104 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :  340 ( 132   ~; 168   |;  14   &)
%                                         (  11 <=>;  15  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :   15 (  13 usr;  10 prp; 0-2 aty)
%            Number of functors    :   15 (  15 usr;   6 con; 0-3 aty)
%            Number of variables   :  234 (   4 sgn 231   !;   3   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1,X2] :
      ( ( less_than(X0,X1)
        & less_than(X1,X2) )
     => less_than(X0,X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV007+0.ax',transitivity) ).

fof(f2,axiom,
    ! [X0,X1] :
      ( less_than(X0,X1)
      | less_than(X1,X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV007+0.ax',totality) ).

fof(f3,axiom,
    ! [X0] : less_than(X0,X0),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV007+0.ax',reflexivity) ).

fof(f4,axiom,
    ! [X0,X1] :
      ( strictly_less_than(X0,X1)
    <=> ( less_than(X0,X1)
        & ~ less_than(X1,X0) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV007+0.ax',stricly_smaller_definition) ).

fof(f8,axiom,
    ! [X0] : ~ contains_slb(create_slb,X0),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV007+2.ax',ax20) ).

fof(f28,axiom,
    ! [X0,X1] :
      ( ok(triple(X0,X1,bad))
    <=> $false ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax40) ).

fof(f29,axiom,
    ! [X0,X1,X2] :
      ( ~ ok(triple(X0,X1,X2))
     => X2 = bad ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax41) ).

fof(f31,axiom,
    ! [X0,X1,X2,X3] :
      ( ~ contains_slb(X1,X3)
     => remove_cpq(triple(X0,X1,X2),X3) = triple(X0,X1,bad) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax43) ).

fof(f34,axiom,
    ! [X0,X1] : findmin_cpq_eff(triple(X0,create_slb,X1)) = triple(X0,create_slb,bad),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax46) ).

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/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/sandbox/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/sandbox/benchmark/Axioms/SWV007+3.ax',ax49) ).

fof(f38,axiom,
    ! [X0,X1] : findmin_cpq_res(triple(X0,create_slb,X1)) = bottom,
    file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/SWV007+3.ax',ax51) ).

fof(f40,axiom,
    ! [X0] : removemin_cpq_eff(X0) = remove_cpq(findmin_cpq_eff(X0),findmin_cpq_res(X0)),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax52) ).

fof(f41,axiom,
    ! [X0] : removemin_cpq_res(X0) = findmin_cpq_res(X0),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax53) ).

fof(f42,axiom,
    ! [X0,X1,X2,X3] :
      ( ~ ok(triple(X0,X1,X2))
     => ~ ok(remove_cpq(triple(X0,X1,X2),X3)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l16_l14) ).

fof(f43,conjecture,
    ! [X0,X1,X2] :
      ( ~ ok(triple(X0,X1,X2))
     => ~ ok(removemin_cpq_eff(triple(X0,X1,X2))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l16_co) ).

fof(f44,negated_conjecture,
    ~ ! [X0,X1,X2] :
        ( ~ ok(triple(X0,X1,X2))
       => ~ ok(removemin_cpq_eff(triple(X0,X1,X2))) ),
    inference(negated_conjecture,[status(cth)],[f43]) ).

fof(f45,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(f46,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(f47,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(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] :
      ( ( less_than(X0,X1)
        & ~ less_than(X1,X0) )
     => strictly_less_than(X0,X1) ),
    inference(unused_predicate_definition_removal,[],[f4]) ).

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(f52,plain,
    ! [X0,X1] :
      ( strictly_less_than(X0,X1)
      | ~ less_than(X0,X1)
      | less_than(X1,X0) ),
    inference(ennf_transformation,[],[f49]) ).

fof(f53,plain,
    ! [X0,X1] :
      ( strictly_less_than(X0,X1)
      | ~ less_than(X0,X1)
      | less_than(X1,X0) ),
    inference(flattening,[],[f52]) ).

fof(f66,plain,
    ! [X0,X1,X2] :
      ( X2 = bad
      | ok(triple(X0,X1,X2)) ),
    inference(ennf_transformation,[],[f29]) ).

fof(f67,plain,
    ! [X0,X1,X2,X3] :
      ( remove_cpq(triple(X0,X1,X2),X3) = triple(X0,X1,bad)
      | contains_slb(X1,X3) ),
    inference(ennf_transformation,[],[f31]) ).

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)) ),
    inference(ennf_transformation,[],[f45]) ).

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)) ),
    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)),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,[],[f46]) ).

fof(f75,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,[],[f74]) ).

fof(f76,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,[],[f47]) ).

fof(f77,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,[],[f76]) ).

fof(f78,plain,
    ! [X0,X1,X2] :
      ( findmin_cpq_res(triple(X0,X1,X2)) = findmin_pqp_res(X0)
      | create_slb = X1 ),
    inference(ennf_transformation,[],[f48]) ).

fof(f79,plain,
    ! [X0,X1,X2,X3] :
      ( ~ ok(remove_cpq(triple(X0,X1,X2),X3))
      | ok(triple(X0,X1,X2)) ),
    inference(ennf_transformation,[],[f42]) ).

fof(f80,plain,
    ? [X0,X1,X2] :
      ( ok(removemin_cpq_eff(triple(X0,X1,X2)))
      & ~ ok(triple(X0,X1,X2)) ),
    inference(ennf_transformation,[],[f44]) ).

fof(f81,plain,
    ! [X2,X0,X1] :
      ( ~ less_than(X1,X2)
      | ~ less_than(X0,X1)
      | 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(f83,plain,
    ! [X0] : less_than(X0,X0),
    inference(cnf_transformation,[],[f3]) ).

fof(f84,plain,
    ! [X0,X1] :
      ( less_than(X1,X0)
      | ~ less_than(X0,X1)
      | strictly_less_than(X0,X1) ),
    inference(cnf_transformation,[],[f53]) ).

fof(f88,plain,
    ! [X0] : ~ contains_slb(create_slb,X0),
    inference(cnf_transformation,[],[f8]) ).

fof(f115,plain,
    ! [X0,X1] : ~ ok(triple(X0,X1,bad)),
    inference(cnf_transformation,[],[f28]) ).

fof(f116,plain,
    ! [X2,X0,X1] :
      ( ok(triple(X0,X1,X2))
      | bad = X2 ),
    inference(cnf_transformation,[],[f66]) ).

fof(f118,plain,
    ! [X2,X3,X0,X1] :
      ( contains_slb(X1,X3)
      | triple(X0,X1,bad) = remove_cpq(triple(X0,X1,X2),X3) ),
    inference(cnf_transformation,[],[f67]) ).

fof(f121,plain,
    ! [X0,X1] : findmin_cpq_eff(triple(X0,create_slb,X1)) = triple(X0,create_slb,bad),
    inference(cnf_transformation,[],[f34]) ).

fof(f122,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,[],[f73]) ).

fof(f123,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,[],[f75]) ).

fof(f124,plain,
    ! [X2,X0,X1] :
      ( ~ less_than(lookup_slb(X1,findmin_pqp_res(X0)),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)),X2) ),
    inference(cnf_transformation,[],[f77]) ).

fof(f125,plain,
    ! [X0,X1] : bottom = findmin_cpq_res(triple(X0,create_slb,X1)),
    inference(cnf_transformation,[],[f38]) ).

fof(f126,plain,
    ! [X2,X0,X1] :
      ( create_slb = X1
      | findmin_pqp_res(X0) = findmin_cpq_res(triple(X0,X1,X2)) ),
    inference(cnf_transformation,[],[f78]) ).

fof(f127,plain,
    ! [X0] : removemin_cpq_eff(X0) = remove_cpq(findmin_cpq_eff(X0),findmin_cpq_res(X0)),
    inference(cnf_transformation,[],[f40]) ).

fof(f128,plain,
    ! [X0] : findmin_cpq_res(X0) = removemin_cpq_res(X0),
    inference(cnf_transformation,[],[f41]) ).

fof(f129,plain,
    ! [X2,X3,X0,X1] :
      ( ok(triple(X0,X1,X2))
      | ~ ok(remove_cpq(triple(X0,X1,X2),X3)) ),
    inference(cnf_transformation,[],[f79]) ).

fof(f130,plain,
    ~ ok(triple(sK0,sK1,sK2)),
    inference(cnf_transformation,[],[f80]) ).

fof(f131,plain,
    ok(removemin_cpq_eff(triple(sK0,sK1,sK2))),
    inference(cnf_transformation,[],[f80]) ).

fof(f132,plain,
    ! [X0] : removemin_cpq_eff(X0) = remove_cpq(findmin_cpq_eff(X0),removemin_cpq_res(X0)),
    inference(definition_unfolding,[],[f127,f128]) ).

fof(f134,plain,
    ! [X0,X1] : bottom = removemin_cpq_res(triple(X0,create_slb,X1)),
    inference(definition_unfolding,[],[f125,f128]) ).

fof(f135,plain,
    ! [X2,X0,X1] :
      ( findmin_pqp_res(X0) = removemin_cpq_res(triple(X0,X1,X2))
      | create_slb = X1 ),
    inference(definition_unfolding,[],[f126,f128]) ).

fof(f136,plain,
    ok(remove_cpq(findmin_cpq_eff(triple(sK0,sK1,sK2)),removemin_cpq_res(triple(sK0,sK1,sK2)))),
    inference(definition_unfolding,[],[f131,f132]) ).

fof(f140,plain,
    ! [X2,X0,X1] :
      ( ~ less_than(X0,X2)
      | less_than(X0,X1)
      | less_than(X1,X2) ),
    inference(consistent_polarity_flipping,[],[f81]) ).

fof(f141,plain,
    ! [X0,X1] :
      ( ~ less_than(X1,X0)
      | ~ less_than(X0,X1) ),
    inference(consistent_polarity_flipping,[],[f82]) ).

fof(f142,plain,
    ! [X0] : ~ less_than(X0,X0),
    inference(consistent_polarity_flipping,[],[f83]) ).

fof(f143,plain,
    ! [X0,X1] :
      ( ~ less_than(X1,X0)
      | less_than(X0,X1)
      | ~ strictly_less_than(X0,X1) ),
    inference(consistent_polarity_flipping,[],[f84]) ).

fof(f161,plain,
    ! [X0,X1] : ok(triple(X0,X1,bad)),
    inference(consistent_polarity_flipping,[],[f115]) ).

fof(f162,plain,
    ! [X2,X0,X1] :
      ( ~ ok(triple(X0,X1,X2))
      | bad = X2 ),
    inference(consistent_polarity_flipping,[],[f116]) ).

fof(f165,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,[],[f123]) ).

fof(f166,plain,
    ! [X2,X0,X1] :
      ( less_than(lookup_slb(X1,findmin_pqp_res(X0)),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)),X2) ),
    inference(consistent_polarity_flipping,[],[f124]) ).

fof(f167,plain,
    ! [X2,X3,X0,X1] :
      ( ok(remove_cpq(triple(X0,X1,X2),X3))
      | ~ ok(triple(X0,X1,X2)) ),
    inference(consistent_polarity_flipping,[],[f129]) ).

fof(f168,plain,
    ~ ok(remove_cpq(findmin_cpq_eff(triple(sK0,sK1,sK2)),removemin_cpq_res(triple(sK0,sK1,sK2)))),
    inference(consistent_polarity_flipping,[],[f136]) ).

fof(f169,plain,
    ok(triple(sK0,sK1,sK2)),
    inference(consistent_polarity_flipping,[],[f130]) ).

fof(f170,plain,
    bad = sK2,
    inference(resolution,[],[f162,f169]) ).

fof(f172,plain,
    ~ ok(remove_cpq(findmin_cpq_eff(triple(sK0,sK1,bad)),removemin_cpq_res(triple(sK0,sK1,bad)))),
    inference(superposition,[],[f168,f170]) ).

fof(f175,plain,
    ! [X0,X1] :
      ( ~ strictly_less_than(X0,X1)
      | ~ less_than(X1,X0) ),
    inference(forward_subsumption_resolution,[],[f143,f141]) ).

fof(f185,definition,
    ( spl3_1
  <=> create_slb = sK1 ),
    introduced(definition,[new_symbols(definition,[spl3_1])],[avatar_definition]) ).

fof(f186,plain,
    ( create_slb != sK1
    | spl3_1 ),
    inference(avatar_component_clause,[],[f185]) ).

fof(f187,plain,
    ( create_slb = sK1
    | ~ spl3_1 ),
    inference(avatar_component_clause,[],[f185]) ).

fof(f189,definition,
    ( spl3_2
  <=> ok(remove_cpq(findmin_cpq_eff(triple(sK0,sK1,bad)),findmin_pqp_res(sK0))) ),
    introduced(definition,[new_symbols(definition,[spl3_2])],[avatar_definition]) ).

fof(f191,plain,
    ( ~ ok(remove_cpq(findmin_cpq_eff(triple(sK0,sK1,bad)),findmin_pqp_res(sK0)))
    | spl3_2 ),
    inference(avatar_component_clause,[],[f189]) ).

fof(f197,plain,
    ! [X2,X0,X1] : triple(X0,create_slb,bad) = remove_cpq(triple(X0,create_slb,X1),X2),
    inference(resolution,[],[f118,f88]) ).

fof(f262,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,[],[f165,f122]) ).

fof(f264,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,[],[f262,f175]) ).

fof(f270,plain,
    ! [X2,X3,X0,X1] :
      ( ~ contains_slb(X0,findmin_pqp_res(X1))
      | create_slb = X0
      | findmin_cpq_eff(triple(X1,X0,X2)) = triple(X1,update_slb(X0,findmin_pqp_res(X1)),X2)
      | less_than(lookup_slb(X0,findmin_pqp_res(X1)),X3)
      | less_than(X3,findmin_pqp_res(X1)) ),
    inference(resolution,[],[f166,f140]) ).

fof(f340,plain,
    ! [X2,X3,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))
      | create_slb = X1
      | findmin_cpq_eff(triple(X0,X1,X3)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),X3) ),
    inference(resolution,[],[f264,f166]) ).

fof(f348,plain,
    ! [X2,X3,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))
      | findmin_cpq_eff(triple(X0,X1,X3)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),X3) ),
    inference(duplicate_literal_removal,[],[f340]) ).

fof(f350,plain,
    ! [X2,X3,X0,X1] :
      ( findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad)
      | findmin_cpq_eff(triple(X0,X1,X3)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),X3)
      | create_slb = X1 ),
    inference(forward_subsumption_resolution,[],[f348,f122]) ).

fof(f1807,definition,
    ( spl3_13
  <=> ! [X2] :
        ( less_than(lookup_slb(sK1,findmin_pqp_res(sK0)),X2)
        | less_than(X2,findmin_pqp_res(sK0)) ) ),
    introduced(definition,[new_symbols(definition,[spl3_13])],[avatar_definition]) ).

fof(f1808,plain,
    ( ! [X2] :
        ( less_than(lookup_slb(sK1,findmin_pqp_res(sK0)),X2)
        | less_than(X2,findmin_pqp_res(sK0)) )
    | ~ spl3_13 ),
    inference(avatar_component_clause,[],[f1807]) ).

fof(f1820,plain,
    ( ~ ok(remove_cpq(findmin_cpq_eff(triple(sK0,create_slb,bad)),removemin_cpq_res(triple(sK0,create_slb,bad))))
    | ~ spl3_1 ),
    inference(superposition,[],[f172,f187]) ).

fof(f1825,plain,
    ( ~ ok(remove_cpq(findmin_cpq_eff(triple(sK0,create_slb,bad)),bottom))
    | ~ spl3_1 ),
    inference(forward_demodulation,[],[f1820,f134]) ).

fof(f1828,plain,
    ( ~ ok(remove_cpq(triple(sK0,create_slb,bad),bottom))
    | ~ spl3_1 ),
    inference(forward_demodulation,[],[f1825,f121]) ).

fof(f1831,plain,
    ( ~ ok(triple(sK0,create_slb,bad))
    | ~ spl3_1 ),
    inference(forward_demodulation,[],[f1828,f197]) ).

fof(f1836,plain,
    ( $false
    | ~ spl3_1 ),
    inference(forward_subsumption_resolution,[],[f1831,f161]) ).

fof(f1837,plain,
    ~ spl3_1,
    inference(avatar_contradiction_clause,[],[f1836]) ).

fof(f2042,definition,
    ( spl3_21
  <=> ! [X0] : triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),bad) = findmin_cpq_eff(triple(sK0,sK1,X0)) ),
    introduced(definition,[new_symbols(definition,[spl3_21])],[avatar_definition]) ).

fof(f2043,plain,
    ( ! [X0] : triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),bad) = findmin_cpq_eff(triple(sK0,sK1,X0))
    | ~ spl3_21 ),
    inference(avatar_component_clause,[],[f2042]) ).

fof(f2104,plain,
    ( ! [X0] :
        ( less_than(findmin_pqp_res(sK0),findmin_pqp_res(sK0))
        | triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),bad) = findmin_cpq_eff(triple(sK0,sK1,X0))
        | create_slb = sK1 )
    | ~ spl3_13 ),
    inference(resolution,[],[f1808,f264]) ).

fof(f2106,plain,
    ( ! [X0] :
        ( triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),bad) = findmin_cpq_eff(triple(sK0,sK1,X0))
        | create_slb = sK1 )
    | ~ spl3_13 ),
    inference(forward_subsumption_resolution,[],[f2104,f142]) ).

fof(f2111,plain,
    ( ! [X0] : triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),bad) = findmin_cpq_eff(triple(sK0,sK1,X0))
    | spl3_1
    | ~ spl3_13 ),
    inference(forward_subsumption_resolution,[],[f2106,f186]) ).

fof(f2113,plain,
    ( spl3_21
    | spl3_1
    | ~ spl3_13 ),
    inference(avatar_split_clause,[],[f2111,f1807,f185,f2042]) ).

fof(f3257,plain,
    ( ! [X0,X1] : findmin_cpq_eff(triple(sK0,sK1,X0)) = findmin_cpq_eff(triple(sK0,sK1,X1))
    | ~ spl3_21 ),
    inference(superposition,[],[f2043,f2043]) ).

fof(f3443,definition,
    ( spl3_46
  <=> ! [X2] : findmin_cpq_eff(triple(sK0,sK1,X2)) = triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),X2) ),
    introduced(definition,[new_symbols(definition,[spl3_46])],[avatar_definition]) ).

fof(f3444,plain,
    ( ! [X2] : findmin_cpq_eff(triple(sK0,sK1,X2)) = triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),X2)
    | ~ spl3_46 ),
    inference(avatar_component_clause,[],[f3443]) ).

fof(f3446,definition,
    ( spl3_47
  <=> ! [X0,X1] : findmin_cpq_eff(triple(sK0,sK1,X0)) = findmin_cpq_eff(triple(sK0,sK1,X1)) ),
    introduced(definition,[new_symbols(definition,[spl3_47])],[avatar_definition]) ).

fof(f3447,plain,
    ( ! [X0,X1] : findmin_cpq_eff(triple(sK0,sK1,X0)) = findmin_cpq_eff(triple(sK0,sK1,X1))
    | ~ spl3_47 ),
    inference(avatar_component_clause,[],[f3446]) ).

fof(f3551,definition,
    ( spl3_52
  <=> contains_slb(sK1,findmin_pqp_res(sK0)) ),
    introduced(definition,[new_symbols(definition,[spl3_52])],[avatar_definition]) ).

fof(f3552,plain,
    ( contains_slb(sK1,findmin_pqp_res(sK0))
    | ~ spl3_52 ),
    inference(avatar_component_clause,[],[f3551]) ).

fof(f3553,plain,
    ( ~ contains_slb(sK1,findmin_pqp_res(sK0))
    | spl3_52 ),
    inference(avatar_component_clause,[],[f3551]) ).

fof(f3626,plain,
    ( spl3_47
    | ~ spl3_21 ),
    inference(avatar_split_clause,[],[f3257,f2042,f3446]) ).

fof(f3786,plain,
    ( ! [X0] :
        ( create_slb = sK1
        | triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),bad) = findmin_cpq_eff(triple(sK0,sK1,X0)) )
    | spl3_52 ),
    inference(resolution,[],[f3553,f122]) ).

fof(f3790,plain,
    ( ! [X0] : triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),bad) = findmin_cpq_eff(triple(sK0,sK1,X0))
    | spl3_1
    | spl3_52 ),
    inference(forward_subsumption_resolution,[],[f3786,f186]) ).

fof(f3792,plain,
    ( spl3_21
    | spl3_1
    | spl3_52 ),
    inference(avatar_split_clause,[],[f3790,f3551,f185,f2042]) ).

fof(f4607,plain,
    ( ! [X0,X1] :
        ( create_slb = sK1
        | findmin_cpq_eff(triple(sK0,sK1,X0)) = triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),X0)
        | less_than(lookup_slb(sK1,findmin_pqp_res(sK0)),X1)
        | less_than(X1,findmin_pqp_res(sK0)) )
    | ~ spl3_52 ),
    inference(resolution,[],[f3552,f270]) ).

fof(f4631,plain,
    ( ! [X0,X1] :
        ( findmin_cpq_eff(triple(sK0,sK1,X0)) = triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),X0)
        | less_than(lookup_slb(sK1,findmin_pqp_res(sK0)),X1)
        | less_than(X1,findmin_pqp_res(sK0)) )
    | spl3_1
    | ~ spl3_52 ),
    inference(forward_subsumption_resolution,[],[f4607,f186]) ).

fof(f4644,plain,
    ( spl3_13
    | spl3_46
    | spl3_1
    | ~ spl3_52 ),
    inference(avatar_split_clause,[],[f4631,f3551,f185,f3443,f1807]) ).

fof(f6516,plain,
    ( ! [X0] : ~ ok(remove_cpq(findmin_cpq_eff(triple(sK0,sK1,X0)),findmin_pqp_res(sK0)))
    | spl3_2
    | ~ spl3_47 ),
    inference(superposition,[],[f191,f3447]) ).

fof(f8023,plain,
    ( ok(findmin_cpq_eff(triple(sK0,sK1,bad)))
    | ~ spl3_46 ),
    inference(superposition,[],[f161,f3444]) ).

fof(f8037,plain,
    ( ! [X0,X1] :
        ( ~ ok(findmin_cpq_eff(triple(sK0,sK1,X0)))
        | ok(remove_cpq(findmin_cpq_eff(triple(sK0,sK1,X0)),X1)) )
    | ~ spl3_46 ),
    inference(superposition,[],[f167,f3444]) ).

fof(f14898,plain,
    ( ! [X0] : ok(remove_cpq(findmin_cpq_eff(triple(sK0,sK1,bad)),X0))
    | ~ spl3_46 ),
    inference(resolution,[],[f8037,f8023]) ).

fof(f14921,definition,
    ( spl3_137
  <=> ! [X0] : ok(remove_cpq(findmin_cpq_eff(triple(sK0,sK1,bad)),X0)) ),
    introduced(definition,[new_symbols(definition,[spl3_137])],[avatar_definition]) ).

fof(f14922,plain,
    ( ! [X0] : ok(remove_cpq(findmin_cpq_eff(triple(sK0,sK1,bad)),X0))
    | ~ spl3_137 ),
    inference(avatar_component_clause,[],[f14921]) ).

fof(f14967,plain,
    ( spl3_137
    | ~ spl3_46 ),
    inference(avatar_split_clause,[],[f14898,f3443,f14921]) ).

fof(f15061,plain,
    ( $false
    | ~ spl3_137 ),
    inference(backward_subsumption_resolution,[],[f172,f14922]) ).

fof(f15069,plain,
    ~ spl3_137,
    inference(avatar_contradiction_clause,[],[f15061]) ).

fof(f15360,plain,
    ( ~ ok(remove_cpq(findmin_cpq_eff(triple(sK0,sK1,bad)),findmin_pqp_res(sK0)))
    | create_slb = sK1 ),
    inference(superposition,[],[f172,f135]) ).

fof(f15361,plain,
    ( ~ ok(remove_cpq(findmin_cpq_eff(triple(sK0,sK1,bad)),findmin_pqp_res(sK0)))
    | spl3_1 ),
    inference(forward_subsumption_resolution,[],[f15360,f186]) ).

fof(f15370,plain,
    ( ~ spl3_2
    | spl3_1 ),
    inference(avatar_split_clause,[],[f15361,f185,f189]) ).

fof(f16870,plain,
    ( ! [X1] :
        ( ~ ok(remove_cpq(triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),bad),findmin_pqp_res(sK0)))
        | findmin_cpq_eff(triple(sK0,sK1,X1)) = triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),X1)
        | create_slb = sK1 )
    | spl3_2
    | ~ spl3_47 ),
    inference(superposition,[],[f6516,f350]) ).

fof(f16897,plain,
    ( ! [X1] :
        ( ~ ok(remove_cpq(triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),bad),findmin_pqp_res(sK0)))
        | findmin_cpq_eff(triple(sK0,sK1,X1)) = triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),X1) )
    | spl3_1
    | spl3_2
    | ~ spl3_47 ),
    inference(forward_subsumption_resolution,[],[f16870,f186]) ).

fof(f16914,definition,
    ( spl3_144
  <=> ok(remove_cpq(triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),bad),findmin_pqp_res(sK0))) ),
    introduced(definition,[new_symbols(definition,[spl3_144])],[avatar_definition]) ).

fof(f16916,plain,
    ( ~ ok(remove_cpq(triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),bad),findmin_pqp_res(sK0)))
    | spl3_144 ),
    inference(avatar_component_clause,[],[f16914]) ).

fof(f16922,plain,
    ( spl3_46
    | ~ spl3_144
    | spl3_1
    | spl3_2
    | ~ spl3_47 ),
    inference(avatar_split_clause,[],[f16897,f3446,f189,f185,f16914,f3443]) ).

fof(f18500,plain,
    ( ~ ok(triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),bad))
    | spl3_144 ),
    inference(resolution,[],[f16916,f167]) ).

fof(f18513,plain,
    ( $false
    | spl3_144 ),
    inference(forward_subsumption_resolution,[],[f18500,f161]) ).

fof(f18514,plain,
    spl3_144,
    inference(avatar_contradiction_clause,[],[f18513]) ).

cnf(s17,plain,
    ~ spl3_1,
    inference(sat_conversion,[],[f1837]) ).

cnf(s36,plain,
    ( spl3_1
    | ~ spl3_13
    | spl3_21 ),
    inference(sat_conversion,[],[f2113]) ).

cnf(s124,plain,
    ( ~ spl3_21
    | spl3_47 ),
    inference(sat_conversion,[],[f3626]) ).

cnf(s198,plain,
    ( spl3_1
    | spl3_21
    | spl3_52 ),
    inference(sat_conversion,[],[f3792]) ).

cnf(s238,plain,
    ( spl3_1
    | spl3_13
    | spl3_46
    | ~ spl3_52 ),
    inference(sat_conversion,[],[f4644]) ).

cnf(s571,plain,
    ( ~ spl3_46
    | spl3_137 ),
    inference(sat_conversion,[],[f14967]) ).

cnf(s572,plain,
    ~ spl3_137,
    inference(sat_conversion,[],[f15069]) ).

cnf(s782,plain,
    ( spl3_1
    | ~ spl3_2 ),
    inference(sat_conversion,[],[f15370]) ).

cnf(s829,plain,
    ( spl3_1
    | spl3_2
    | spl3_46
    | ~ spl3_47
    | ~ spl3_144 ),
    inference(sat_conversion,[],[f16922]) ).

cnf(s884,plain,
    spl3_144,
    inference(sat_conversion,[],[f18514]) ).

cnf(s893,plain,
    ( spl3_1
    | spl3_2
    | spl3_46
    | ~ spl3_47 ),
    inference(rat,[],[s829,s884]) ).

cnf(s897,plain,
    ~ spl3_46,
    inference(rat,[],[s571,s572]) ).

cnf(s912,plain,
    ( spl3_1
    | spl3_13
    | ~ spl3_52 ),
    inference(rat,[],[s238,s897]) ).

cnf(s926,plain,
    ~ spl3_2,
    inference(rat,[],[s782,s17]) ).

cnf(s928,plain,
    ~ spl3_47,
    inference(rat,[],[s893,s17,s897,s926]) ).

cnf(s930,plain,
    ~ spl3_21,
    inference(rat,[],[s124,s928]) ).

cnf(s932,plain,
    spl3_52,
    inference(rat,[],[s198,s17,s930]) ).

cnf(s934,plain,
    ~ spl3_13,
    inference(rat,[],[s36,s17,s930]) ).

cnf(s939,plain,
    $false,
    inference(rat,[],[s912,s17,s932,s934]) ).

fof(f18521,plain,
    $false,
    inference(avatar_sat_refutation,[],[s939]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV380+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.21  % Computer : n003.cluster.edu
% 0.10/0.21  % Model    : x86_64 x86_64
% 0.10/0.21  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.21  % Memory   : 8046.5625MB
% 0.10/0.21  % OS       : Linux 6.8.0-71-generic
% 0.10/0.21  % CPULimit : 300
% 0.10/0.21  % WCLimit  : 300
% 0.10/0.21  % DateTime : Mon Sep 28 10:48:12 UTC 2026
% 0.10/0.21  % CPUTime  : 
% 0.10/0.21  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.24  Running first-order model finding
% 0.10/0.24  Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.67/1.27  % (1506495)Will run a generic schedule for satisfiability detection.
% 6.67/1.27  % (1506503)dis+10_1_sil=32000:sp=arity:random_seed=3643086600:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 6.67/1.27  % (1506501)% WARNING: option uhcvi not known.
% 6.67/1.27  % (1506500)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4250084494_2999 on theBenchmark for (2999ds/0Mi)
% 6.67/1.27  % (1506501)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=350701513:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 6.67/1.27  % (1506502)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3489772457:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 6.67/1.27  % (1506504)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3167652275:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 6.67/1.27  % (1506505)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4260275612:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 6.67/1.27  % (1506506)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3451350867:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 6.67/1.27  % TRYING [1]
% 6.67/1.27  % TRYING [2]
% 6.67/1.27  % TRYING [3]
% 6.67/1.27  % (1506503)Instruction limit reached! 
% 6.67/1.27  % (1506503)------------------------------
% 6.67/1.27  % (1506503)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.67/1.27  % (1506503)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.67/1.27  % (1506503)CaDiCaL version: 2.1.3
% 6.67/1.27  % (1506503)Termination reason: Instruction limit
% 6.67/1.27  % (1506503)Termination phase: Saturation
% 6.67/1.27  % (1506503)Time elapsed: 0.033 s
% 6.67/1.27  % (1506503)Peak memory usage: 12 MB
% 6.67/1.27  % (1506503)Instructions burned: 103 (million)
% 6.67/1.27  % TRYING [4]
% 6.67/1.27  % (1506514)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1456602937:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 6.67/1.27  % TRYING [1]
% 6.67/1.27  % TRYING [2]
% 6.67/1.27  % TRYING [3]
% 6.67/1.27  % (1506504)Instruction limit reached! 
% 6.67/1.27  % (1506504)------------------------------
% 6.67/1.27  % (1506504)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.67/1.27  % (1506504)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.67/1.27  % (1506504)CaDiCaL version: 2.1.3
% 6.67/1.27  % (1506504)Termination reason: Instruction limit
% 6.67/1.27  % (1506504)Termination phase: Saturation
% 6.67/1.27  % (1506504)Time elapsed: 0.052 s
% 6.67/1.27  % (1506504)Peak memory usage: 12 MB
% 6.67/1.27  % (1506504)Instructions burned: 118 (million)
% 6.67/1.27  % TRYING [4]
% 6.67/1.27  % (1506516)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=613319693:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 6.67/1.27  % (1506505)Instruction limit reached! 
% 6.67/1.27  % (1506505)------------------------------
% 6.67/1.27  % (1506505)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.67/1.27  % (1506505)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.67/1.27  % (1506505)CaDiCaL version: 2.1.3
% 6.67/1.27  % (1506505)Termination reason: Instruction limit
% 6.67/1.27  % (1506505)Termination phase: Saturation
% 6.67/1.27  % (1506505)Time elapsed: 0.076 s
% 6.67/1.27  % (1506505)Peak memory usage: 12 MB
% 6.67/1.27  % (1506505)Instructions burned: 132 (million)
% 6.67/1.27  % (1506506)Instruction limit reached! 
% 6.67/1.27  % (1506506)------------------------------
% 6.67/1.27  % (1506506)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.67/1.27  % (1506506)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.67/1.27  % (1506506)CaDiCaL version: 2.1.3
% 6.67/1.27  % (1506506)Termination reason: Instruction limit
% 6.67/1.27  % (1506506)Termination phase: Saturation
% 6.67/1.27  % (1506506)Time elapsed: 0.090 s
% 6.67/1.27  % (1506506)Peak memory usage: 13 MB
% 6.67/1.27  % (1506506)Instructions burned: 160 (million)
% 6.67/1.27  % (1506518)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=1239573034:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 6.67/1.27  % TRYING [5]
% 6.67/1.27  % (1506519)ott-21_1_sil=16000:fs=off:random_seed=4156264362:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 6.67/1.27  % TRYING [5]
% 6.67/1.27  % (1506516)Instruction limit reached! 
% 6.67/1.27  % (1506516)------------------------------
% 6.67/1.27  % (1506516)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.67/1.27  % (1506516)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.67/1.27  % (1506516)CaDiCaL version: 2.1.3
% 6.67/1.27  % (1506516)Termination reason: Instruction limit
% 6.67/1.27  % (1506516)Termination phase: Saturation
% 6.67/1.27  % (1506516)Time elapsed: 0.076 s
% 6.67/1.27  % (1506516)Peak memory usage: 12 MB
% 6.67/1.27  % (1506516)Instructions burned: 133 (million)
% 6.67/1.27  % (1506522)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=3164480187:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 6.67/1.27  % (1506514)Instruction limit reached! 
% 6.67/1.27  % (1506514)------------------------------
% 6.67/1.27  % (1506514)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.67/1.27  % (1506514)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.67/1.27  % (1506514)CaDiCaL version: 2.1.3
% 6.67/1.27  % (1506514)Termination reason: Instruction limit
% 6.67/1.27  % (1506514)Termination phase: Finite model building constraint generation
% 6.67/1.27  % (1506514)Time elapsed: 0.151 s
% 6.67/1.27  % (1506514)Peak memory usage: 34 MB
% 6.67/1.27  % (1506514)Instructions burned: 716 (million)
% 6.67/1.27  % (1506524)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=2046299006:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 6.67/1.27  % TRYING [1]
% 6.67/1.27  % TRYING [2]
% 6.67/1.27  % (1506519)Instruction limit reached! 
% 6.67/1.27  % (1506519)------------------------------
% 6.67/1.27  % (1506519)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.67/1.27  % (1506519)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.67/1.27  % (1506519)CaDiCaL version: 2.1.3
% 6.67/1.27  % (1506519)Termination reason: Instruction limit
% 6.67/1.27  % (1506519)Termination phase: Saturation
% 6.67/1.27  % (1506519)Time elapsed: 0.097 s
% 6.67/1.27  % (1506519)Peak memory usage: 12 MB
% 6.67/1.27  % (1506519)Instructions burned: 181 (million)
% 6.67/1.27  % TRYING [3]
% 6.67/1.27  % (1506526)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=2141363669:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 6.67/1.27  % TRYING [4]
% 6.67/1.27  % TRYING [5]
% 6.67/1.27  % TRYING [6]
% 6.67/1.27  % (1506524)Instruction limit reached! 
% 6.67/1.27  % (1506524)------------------------------
% 6.67/1.27  % (1506524)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.67/1.27  % (1506524)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.67/1.27  % (1506524)CaDiCaL version: 2.1.3
% 6.67/1.27  % (1506524)Termination reason: Instruction limit
% 6.67/1.27  % (1506524)Termination phase: Finite model building constraint generation
% 6.67/1.27  % (1506524)Time elapsed: 0.176 s
% 6.67/1.27  % (1506524)Peak memory usage: 29 MB
% 6.67/1.27  % (1506524)Instructions burned: 865 (million)
% 6.67/1.27  % (1506528)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=1383178934:i=889:ins=1_2995 on theBenchmark for (2995ds/889Mi)
% 6.67/1.27  % (1506518)Instruction limit reached! 
% 6.67/1.27  % (1506518)------------------------------
% 6.67/1.27  % (1506518)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.67/1.27  % (1506518)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.67/1.27  % (1506518)CaDiCaL version: 2.1.3
% 6.67/1.27  % (1506518)Termination reason: Instruction limit
% 6.67/1.27  % (1506518)Termination phase: Saturation
% 6.67/1.27  % (1506518)Time elapsed: 0.327 s
% 6.67/1.27  % (1506518)Peak memory usage: 15 MB
% 6.67/1.27  % (1506518)Instructions burned: 685 (million)
% 6.67/1.27  % (1506530)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=3719325366: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)
% 6.67/1.27  % (1506522)Instruction limit reached! 
% 6.67/1.27  % (1506522)------------------------------
% 6.67/1.27  % (1506522)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.67/1.27  % (1506522)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.67/1.27  % (1506522)CaDiCaL version: 2.1.3
% 6.67/1.27  % (1506522)Termination reason: Instruction limit
% 6.67/1.27  % (1506522)Termination phase: Saturation
% 6.67/1.27  % (1506522)Time elapsed: 0.298 s
% 6.67/1.27  % (1506522)Peak memory usage: 13 MB
% 6.67/1.27  % (1506522)Instructions burned: 478 (million)
% 6.67/1.27  % (1506532)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=2205674510:i=879:kws=inv_precedence:fsr=off_2994 on theBenchmark for (2994ds/879Mi)
% 6.67/1.27  % (1506528)Instruction limit reached! 
% 6.67/1.27  % (1506528)------------------------------
% 6.67/1.27  % (1506528)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.67/1.27  % (1506528)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.67/1.27  % (1506528)CaDiCaL version: 2.1.3
% 6.67/1.27  % (1506528)Termination reason: Instruction limit
% 6.67/1.27  % (1506528)Termination phase: Finite model building constraint generation
% 6.67/1.27  % (1506528)Time elapsed: 0.232 s
% 6.67/1.27  % (1506528)Peak memory usage: 107 MB
% 6.67/1.27  % (1506528)Instructions burned: 891 (million)
% 6.67/1.27  % (1506534)fmb+10_1_sil=64000:random_seed=1068535007:i=22061:nm=2:gsp=on_2993 on theBenchmark for (2993ds/22061Mi)
% 6.67/1.27  % TRYING [1]
% 6.67/1.27  % TRYING [2]
% 6.67/1.27  % TRYING [3]
% 6.67/1.27  % TRYING [4]
% 6.67/1.27  % TRYING [5]
% 6.67/1.27  % (1506530)Instruction limit reached! 
% 6.67/1.27  % (1506530)------------------------------
% 6.67/1.27  % (1506530)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.67/1.27  % (1506530)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.67/1.27  % (1506530)CaDiCaL version: 2.1.3
% 6.67/1.27  % (1506530)Termination reason: Instruction limit
% 6.67/1.27  % (1506530)Termination phase: Saturation
% 6.67/1.27  % (1506530)Time elapsed: 0.404 s
% 6.67/1.27  % (1506530)Peak memory usage: 19 MB
% 6.67/1.27  % (1506530)Instructions burned: 693 (million)
% 6.67/1.27  % (1506536)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=3535567204:i=9515:nm=5_2991 on theBenchmark for (2991ds/9515Mi)
% 6.67/1.27  % TRYING [20]
% 6.67/1.27  % (1506526)Instruction limit reached! 
% 6.67/1.27  % (1506526)------------------------------
% 6.67/1.27  % (1506526)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.67/1.27  % (1506526)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.67/1.27  % (1506526)CaDiCaL version: 2.1.3
% 6.67/1.27  % (1506526)Termination reason: Instruction limit
% 6.67/1.27  % (1506526)Termination phase: Saturation
% 6.67/1.27  % (1506526)Time elapsed: 0.679 s
% 6.67/1.27  % (1506526)Peak memory usage: 19 MB
% 6.67/1.27  % (1506526)Instructions burned: 1180 (million)
% 6.67/1.27  % (1506538)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=1375805198:fmbsr=1.7:i=920_2990 on theBenchmark for (2990ds/920Mi)
% 6.67/1.27  % TRYING [8]
% 6.67/1.27  % (1506501) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1506495-1506501"...
% 6.67/1.27  % (1506501)...printing done.
% 6.67/1.27  % (1506501)Refutation found. Thanks to Tanya!
% 6.67/1.27  % SZS status Theorem for theBenchmark
% 6.67/1.27  % SZS output start Proof for theBenchmark
% See solution above
% 6.67/1.28  % (1506501)------------------------------
% 6.67/1.28  % (1506501)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.67/1.28  % (1506501)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.67/1.28  % (1506501)CaDiCaL version: 2.1.3
% 6.67/1.28  % (1506501)Termination reason: Refutation
% 6.67/1.28  % (1506501)Time elapsed: 0.970 s
% 6.67/1.28  % (1506501)Peak memory usage: 19 MB
% 6.67/1.28  % (1506501)Instructions burned: 1892 (million)
% 6.67/1.28  % (1506495)Success in time 1.024 s
% 6.67/1.28  % Vampire exiting
%------------------------------------------------------------------------------