↑ Up

iProver---3.9.4.THM-CRf.s

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

% Computer : n026.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 : Fri Sep 25 03:17:30 PM UTC 2026

% Result   : Theorem 58.61s 8.82s
% Output   : CNFRefutation 58.61s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   20
%            Number of leaves      :   15
% Syntax   : Number of formulae    :   87 (  31 unt;   0 def)
%            Number of atoms       :  191 (  81 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :  164 (  60   ~;  76   |;  14   &)
%                                         (   2 <=>;  12  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   5 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :   15 (  15 usr;   6 con; 0-3 aty)
%            Number of variables   :  199 (   3 sgn 196   !;   3   ?;  70   :)

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

fof(f4,axiom,
    ! [X0,X1] :
      ( strictly_less_than(X0,X1)
    <=> ( ~ less_than(X1,X0)
        & less_than(X0,X1) ) ),
    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] :
      ( ( ~ contains_slb(X1,findmin_pqp_res(X0))
        & X1 != create_slb )
     => 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] :
      ( ( strictly_less_than(findmin_pqp_res(X0),lookup_slb(X1,findmin_pqp_res(X0)))
        & contains_slb(X1,findmin_pqp_res(X0))
        & X1 != create_slb )
     => 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] :
      ( ( less_than(lookup_slb(X1,findmin_pqp_res(X0)),findmin_pqp_res(X0))
        & contains_slb(X1,findmin_pqp_res(X0))
        & X1 != create_slb )
     => 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(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(f47,plain,
    ! [X0,X1] : ~ ok(triple(X0,X1,bad)),
    inference(true_and_false_elimination,[],[f28]) ).

fof(f48,plain,
    ! [X0,X1] : ~ ok(triple(X0,X1,bad)),
    inference(flattening,[],[f47]) ).

fof(f49,plain,
    ! [X0,X1,X2] :
      ( ( ~ contains_slb(X1,findmin_pqp_res(X0))
        & X1 != create_slb )
     => findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) ),
    inference(rectify,[],[f35]) ).

fof(f50,plain,
    ! [X0,X1,X2] :
      ( ( strictly_less_than(findmin_pqp_res(X0),lookup_slb(X1,findmin_pqp_res(X0)))
        & contains_slb(X1,findmin_pqp_res(X0))
        & X1 != create_slb )
     => findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) ),
    inference(rectify,[],[f36]) ).

fof(f51,plain,
    ! [X0,X1,X2] :
      ( ( less_than(lookup_slb(X1,findmin_pqp_res(X0)),findmin_pqp_res(X0))
        & contains_slb(X1,findmin_pqp_res(X0))
        & X1 != create_slb )
     => findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),X2) ),
    inference(rectify,[],[f37]) ).

fof(f53,plain,
    ! [X0,X1] :
      ( ( ~ less_than(X1,X0)
        & less_than(X0,X1) )
     => strictly_less_than(X0,X1) ),
    inference(unused_predicate_definition_removal,[],[f4]) ).

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

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

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

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

fof(f76,plain,
    ! [X0,X1,X2] :
      ( 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(ennf_transformation,[],[f49]) ).

fof(f77,plain,
    ! [X0,X1,X2] :
      ( 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(flattening,[],[f76]) ).

fof(f78,plain,
    ! [X0,X1,X2] :
      ( ~ 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(ennf_transformation,[],[f50]) ).

fof(f79,plain,
    ! [X0,X1,X2] :
      ( ~ 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(flattening,[],[f78]) ).

fof(f80,plain,
    ! [X0,X1,X2] :
      ( ~ 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(ennf_transformation,[],[f51]) ).

fof(f81,plain,
    ! [X0,X1,X2] :
      ( ~ 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(flattening,[],[f80]) ).

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

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

fof(f91,plain,
    ( ~ ok(triple(sK0,sK1,sK2))
    & ok(removemin_cpq_eff(triple(sK0,sK1,sK2))) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f84]) ).

fof(f93,plain,
    ! [X0,X1] :
      ( less_than(X1,X0)
      | less_than(X0,X1) ),
    inference(cnf_transformation,[],[f2]) ).

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

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

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

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

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

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

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

fof(f134,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,[],[f79]) ).

fof(f135,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,[],[f81]) ).

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

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

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

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

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

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

fof(f143,plain,
    ! [X0] : removemin_cpq_eff(X0) = remove_cpq(findmin_cpq_eff(X0),removemin_cpq_res(X0)),
    inference(definition_unfolding,[],[f138,f139]) ).

fof(f145,plain,
    ! [X0,X1] : bottom = removemin_cpq_res(triple(X0,create_slb,X1)),
    inference(definition_unfolding,[],[f136,f139]) ).

fof(f147,plain,
    ok(remove_cpq(findmin_cpq_eff(triple(sK0,sK1,sK2)),removemin_cpq_res(triple(sK0,sK1,sK2)))),
    inference(definition_unfolding,[],[f142,f143]) ).

tcf(c_50,plain,
    ! [X0: $i,X1: $i] :
      ( less_than(X1,X0)
      | less_than(X0,X1) ),
    inference(cnf_transformation,[],[f93]) ).

tcf(c_52,plain,
    ! [X0: $i,X1: $i] :
      ( strictly_less_than(X0,X1)
      | less_than(X1,X0)
      | ~ less_than(X0,X1) ),
    inference(cnf_transformation,[],[f95]) ).

tcf(c_56,plain,
    ! [X0: $i] : ~ contains_slb(create_slb,X0),
    inference(cnf_transformation,[],[f99]) ).

tcf(c_83,plain,
    ! [X0: $i,X1: $i] : ~ ok(triple(X0,X1,bad)),
    inference(cnf_transformation,[],[f126]) ).

tcf(c_84,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( ok(triple(X1,X2,X0))
      | ( X0 = bad ) ),
    inference(cnf_transformation,[],[f127]) ).

tcf(c_86,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( contains_slb(X1,X3)
      | ( remove_cpq(triple(X0,X1,X2),X3) = triple(X0,X1,bad) ) ),
    inference(cnf_transformation,[],[f129]) ).

tcf(c_89,plain,
    ! [X0: $i,X1: $i] : findmin_cpq_eff(triple(X0,create_slb,X1)) = triple(X0,create_slb,bad),
    inference(cnf_transformation,[],[f132]) ).

tcf(c_90,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( contains_slb(X1,findmin_pqp_res(X0))
      | ( X1 = create_slb )
      | ( triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) = findmin_cpq_eff(triple(X0,X1,X2)) ) ),
    inference(cnf_transformation,[],[f133]) ).

tcf(c_91,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( ( X1 = create_slb )
      | ( triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) = findmin_cpq_eff(triple(X0,X1,X2)) )
      | ~ contains_slb(X1,findmin_pqp_res(X0))
      | ~ strictly_less_than(findmin_pqp_res(X0),lookup_slb(X1,findmin_pqp_res(X0))) ),
    inference(cnf_transformation,[],[f134]) ).

tcf(c_92,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( ( X0 = create_slb )
      | ( triple(X1,update_slb(X0,findmin_pqp_res(X1)),X2) = findmin_cpq_eff(triple(X1,X0,X2)) )
      | ~ contains_slb(X0,findmin_pqp_res(X1))
      | ~ less_than(lookup_slb(X0,findmin_pqp_res(X1)),findmin_pqp_res(X1)) ),
    inference(cnf_transformation,[],[f135]) ).

tcf(c_93,plain,
    ! [X0: $i,X1: $i] : removemin_cpq_res(triple(X0,create_slb,X1)) = bottom,
    inference(cnf_transformation,[],[f145]) ).

tcf(c_95,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( ok(triple(X0,X1,X2))
      | ~ ok(remove_cpq(triple(X0,X1,X2),X3)) ),
    inference(cnf_transformation,[],[f140]) ).

tcf(c_96,negated_conjecture,
    ok(remove_cpq(findmin_cpq_eff(triple(sK0,sK1,sK2)),removemin_cpq_res(triple(sK0,sK1,sK2)))),
    inference(cnf_transformation,[],[f147]) ).

tcf(c_97,negated_conjecture,
    ~ ok(triple(sK0,sK1,sK2)),
    inference(cnf_transformation,[],[f141]) ).

tcf(c_132,plain,
    ! [X0: $i,X1: $i] :
      ( strictly_less_than(X0,X1)
      | less_than(X1,X0) ),
    inference(global_subsumption_just,[status(thm)],[c_52,c_50,c_52]) ).

tcf(c_133,plain,
    ! [X0: $i,X1: $i] :
      ( strictly_less_than(X1,X0)
      | less_than(X0,X1) ),
    inference(renaming,[status(thm)],[c_132]) ).

tcf(c_134,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( ( X1 = create_slb )
      | ( triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) = findmin_cpq_eff(triple(X0,X1,X2)) )
      | ~ strictly_less_than(findmin_pqp_res(X0),lookup_slb(X1,findmin_pqp_res(X0))) ),
    inference(global_subsumption_just,[status(thm)],[c_91,c_90,c_91]) ).

tcf(c_538,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
      ( less_than(X2,X3)
      | ( X0 = create_slb )
      | ( triple(X1,update_slb(X0,findmin_pqp_res(X1)),bad) = findmin_cpq_eff(triple(X1,X0,X4)) )
      | ( findmin_pqp_res(X1) != X3 )
      | ( lookup_slb(X0,findmin_pqp_res(X1)) != X2 ) ),
    inference(resolution_lifted,[status(thm)],[c_134,c_133]) ).

tcf(c_539,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( less_than(lookup_slb(X1,findmin_pqp_res(X0)),findmin_pqp_res(X0))
      | ( X1 = create_slb )
      | ( triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) = findmin_cpq_eff(triple(X0,X1,X2)) ) ),
    inference(unflattening,[status(thm)],[c_538]) ).

tcf(c_1459,plain,
    bad = sK2,
    inference(superposition,[status(thm)],[c_84,c_97]) ).

tcf(c_19326,plain,
    ok(remove_cpq(findmin_cpq_eff(triple(sK0,sK1,bad)),removemin_cpq_res(triple(sK0,sK1,bad)))),
    inference(light_normalisation,[status(thm)],[c_96,c_1459]) ).

tcf(c_19441,plain,
    ! [X0: $i,X1: $i,X2: $i] : remove_cpq(triple(X0,create_slb,X1),X2) = triple(X0,create_slb,bad),
    inference(superposition,[status(thm)],[c_86,c_56]) ).

tcf(c_20445,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( ( X0 = create_slb )
      | ( triple(X1,update_slb(X0,findmin_pqp_res(X1)),bad) = findmin_cpq_eff(triple(X1,X0,X3)) )
      | ( triple(X1,update_slb(X0,findmin_pqp_res(X1)),X2) = findmin_cpq_eff(triple(X1,X0,X2)) )
      | ~ contains_slb(X0,findmin_pqp_res(X1)) ),
    inference(superposition,[status(thm)],[c_539,c_92]) ).

tcf(c_20503,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( ( X1 = create_slb )
      | ( 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)),X2) = findmin_cpq_eff(triple(X0,X1,X2)) ) ),
    inference(forward_subsumption_resolution,[status(thm)],[c_20445,c_90]) ).

tcf(c_20539,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
      ( ok(triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad))
      | ( X1 = create_slb )
      | ( triple(X0,update_slb(X1,findmin_pqp_res(X0)),X4) = findmin_cpq_eff(triple(X0,X1,X4)) )
      | ~ ok(remove_cpq(findmin_cpq_eff(triple(X0,X1,X2)),X3)) ),
    inference(superposition,[status(thm)],[c_20503,c_95]) ).

tcf(c_20628,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
      ( ( X1 = create_slb )
      | ( triple(X0,update_slb(X1,findmin_pqp_res(X0)),X4) = findmin_cpq_eff(triple(X0,X1,X4)) )
      | ~ ok(remove_cpq(findmin_cpq_eff(triple(X0,X1,X2)),X3)) ),
    inference(forward_subsumption_resolution,[status(thm)],[c_20539,c_83]) ).

tcf(c_34023,plain,
    ! [X0: $i] :
      ( ( create_slb = sK1 )
      | ( triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),X0) = findmin_cpq_eff(triple(sK0,sK1,X0)) ) ),
    inference(superposition,[status(thm)],[c_19326,c_20628]) ).

tcf(c_34261,plain,
    ! [X0: $i,X1: $i] :
      ( ok(triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),X0))
      | ( create_slb = sK1 )
      | ~ ok(remove_cpq(findmin_cpq_eff(triple(sK0,sK1,X0)),X1)) ),
    inference(superposition,[status(thm)],[c_34023,c_95]) ).

tcf(c_37794,plain,
    ( ok(triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),bad))
    | ( create_slb = sK1 ) ),
    inference(superposition,[status(thm)],[c_19326,c_34261]) ).

tcf(c_37798,plain,
    create_slb = sK1,
    inference(forward_subsumption_resolution,[status(thm)],[c_37794,c_83]) ).

tcf(c_37810,plain,
    ok(remove_cpq(findmin_cpq_eff(triple(sK0,create_slb,bad)),removemin_cpq_res(triple(sK0,create_slb,bad)))),
    inference(demodulation,[status(thm)],[c_19326,c_37798]) ).

tcf(c_37811,plain,
    ok(triple(sK0,create_slb,bad)),
    inference(demodulation,[status(thm)],[c_37810,c_89,c_93,c_19441]) ).

tcf(c_37812,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_37811,c_83]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWV380+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.03  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.36  % Computer : n026.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Thu Sep 24 19:27:54 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.10/0.36  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.40  Running first-order theorem proving
% 0.10/0.40  Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.41  
% 0.10/0.41  % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.41  
% 0.10/0.41  % Detected problem language: tptp
% 0.10/0.42  % Proving...
% 58.61/8.82  % SZS status Started for theBenchmark.p
% 58.61/8.82  % SZS status Theorem for theBenchmark.p
% 58.61/8.82  
% 58.61/8.82  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 58.61/8.82  
% 58.61/8.82  % ------  iProver source info
% 58.61/8.82  
% 58.61/8.82  % git: date: 2026-07-19 20:42:38 +0200
% 58.61/8.82  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 58.61/8.82  % git: non_committed_changes: false
% 58.61/8.82  
% 58.61/8.82  % ------ Parsing...
% 58.61/8.82  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 58.61/8.82  
% 58.61/8.82  % ------ Preprocessing... sup_sim: 0  sf_s  rm: 7 0s  sf_e  pe_s  pe:1:0s pe:2:0s pe_e  sup_sim: 0  sf_s  rm: 4 0s  sf_e  pe_s  pe_e % 
% 58.61/8.82  
% 58.61/8.82  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 58.61/8.82  
% 58.61/8.82  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 58.61/8.82  % ------ Proving...
% 58.61/8.82  % ------ Problem Properties 
% 58.61/8.82  
% 58.61/8.82  % 
% 58.61/8.82  % clauses                               42
% 58.61/8.82  % conjectures                           2
% 58.61/8.82  % EPR                                   6
% 58.61/8.82  % Horn                                  28
% 58.61/8.82  % unary                                 17
% 58.61/8.82  % binary                                13
% 58.61/8.82  % lits                                  80
% 58.61/8.82  % lits eq                               28
% 58.61/8.82  % fd_pure                               0
% 58.61/8.82  % fd_pseudo                             0
% 58.61/8.82  % fd_cond                               5
% 58.61/8.82  % fd_pseudo_cond                        5
% 58.61/8.82  % AC symbols                            0
% 58.61/8.82  
% 58.61/8.82  % ------ Input Options Time Limit: Unbounded
% 58.61/8.82  
% 58.61/8.82  
% 58.61/8.82  % ------ 
% 58.61/8.82  % Current options:
% 58.61/8.82  % ------ 
% 58.61/8.82  
% 58.61/8.82  
% 58.61/8.82  % 
% 58.61/8.82  
% 58.61/8.82  % ------ Proving...
% 58.61/8.82  % 
% 58.61/8.82  
% 58.61/8.82  % SZS status Theorem for theBenchmark.p
% 58.61/8.82  
% 58.61/8.82  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 58.61/8.82  
% 58.61/8.82  
%------------------------------------------------------------------------------