TSTP Solution File: SWV372+1 by iProver---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.9
% Problem  : SWV372+1 : TPTP v8.2.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n023.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Mon Jun 24 17:10:46 EDT 2024

% Result   : Theorem 184.31s 24.86s
% Output   : CNFRefutation 184.31s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named definition)

% Comments : 
%------------------------------------------------------------------------------
fof(f9,axiom,
    ! [X0,X1,X2] :
      ( contains_pq(insert_pq(X0,X1),X2)
    <=> ( X1 = X2
        | contains_pq(X0,X2) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax9) ).

fof(f21,axiom,
    ! [X0,X1,X2,X3] :
      ( contains_slb(insert_slb(X0,pair(X1,X3)),X2)
    <=> ( X1 = X2
        | contains_slb(X0,X2) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax21) ).

fof(f39,axiom,
    ! [X0,X1,X2,X3] :
      ( contains_cpq(triple(X0,X1,X2),X3)
    <=> contains_slb(X1,X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax39) ).

fof(f40,axiom,
    ! [X0,X1] :
      ( ok(triple(X0,X1,bad))
    <=> $false ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax40) ).

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

fof(f46,axiom,
    ! [X0,X1] : findmin_cpq_eff(triple(X0,create_slb,X1)) = triple(X0,create_slb,bad),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax46) ).

fof(f47,axiom,
    ! [X0,X1,X2,X3] :
      ( ( ~ 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) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax47) ).

fof(f51,axiom,
    ! [X0,X1,X2,X3] :
      ( create_slb != X1
     => findmin_pqp_res(X0) = findmin_cpq_res(triple(X0,X1,X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax51) ).

fof(f53,axiom,
    ! [X0] : findmin_cpq_res(X0) = removemin_cpq_res(X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax53) ).

fof(f55,axiom,
    ! [X0,X1,X2,X3,X4] : i(triple(X0,insert_slb(X1,pair(X3,X4)),X2)) = insert_pq(i(triple(X0,X1,X2)),X3),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax55) ).

fof(f63,axiom,
    ! [X0,X1,X2,X3] :
      ( contains_cpq(triple(X0,X1,X2),X3)
    <=> contains_pq(i(triple(X0,X1,X2)),X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l8_li56) ).

fof(f65,axiom,
    ! [X0,X1,X2] :
      ( ~ ok(triple(X0,X1,X2))
     => ~ phi(triple(X0,X1,X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l8_lX) ).

fof(f66,conjecture,
    ! [X0,X1,X2] :
      ( phi(findmin_cpq_eff(triple(X0,X1,X2)))
     => contains_pq(i(triple(X0,X1,X2)),findmin_cpq_res(triple(X0,X1,X2))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l8_co) ).

fof(f67,negated_conjecture,
    ~ ! [X0,X1,X2] :
        ( phi(findmin_cpq_eff(triple(X0,X1,X2)))
       => contains_pq(i(triple(X0,X1,X2)),findmin_cpq_res(triple(X0,X1,X2))) ),
    inference(negated_conjecture,[],[f66]) ).

fof(f70,plain,
    ! [X0,X1] : ~ ok(triple(X0,X1,bad)),
    inference(true_and_false_elimination,[],[f40]) ).

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

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

fof(f75,plain,
    ! [X0,X1,X2] :
      ( create_slb != X1
     => findmin_pqp_res(X0) = findmin_cpq_res(triple(X0,X1,X2)) ),
    inference(rectify,[],[f51]) ).

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

fof(f111,plain,
    ! [X0,X1,X2] :
      ( findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad)
      | contains_slb(X1,findmin_pqp_res(X0))
      | create_slb = X1 ),
    inference(ennf_transformation,[],[f72]) ).

fof(f112,plain,
    ! [X0,X1,X2] :
      ( findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad)
      | contains_slb(X1,findmin_pqp_res(X0))
      | create_slb = X1 ),
    inference(flattening,[],[f111]) ).

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

fof(f119,plain,
    ! [X0,X1,X2] :
      ( ~ phi(triple(X0,X1,X2))
      | ok(triple(X0,X1,X2)) ),
    inference(ennf_transformation,[],[f65]) ).

fof(f120,plain,
    ? [X0,X1,X2] :
      ( ~ contains_pq(i(triple(X0,X1,X2)),findmin_cpq_res(triple(X0,X1,X2)))
      & phi(findmin_cpq_eff(triple(X0,X1,X2))) ),
    inference(ennf_transformation,[],[f67]) ).

fof(f121,plain,
    ! [X0,X1,X2] :
      ( ( contains_pq(insert_pq(X0,X1),X2)
        | ( X1 != X2
          & ~ contains_pq(X0,X2) ) )
      & ( X1 = X2
        | contains_pq(X0,X2)
        | ~ contains_pq(insert_pq(X0,X1),X2) ) ),
    inference(nnf_transformation,[],[f9]) ).

fof(f122,plain,
    ! [X0,X1,X2] :
      ( ( contains_pq(insert_pq(X0,X1),X2)
        | ( X1 != X2
          & ~ contains_pq(X0,X2) ) )
      & ( X1 = X2
        | contains_pq(X0,X2)
        | ~ contains_pq(insert_pq(X0,X1),X2) ) ),
    inference(flattening,[],[f121]) ).

fof(f125,plain,
    ! [X0,X1,X2,X3] :
      ( ( contains_slb(insert_slb(X0,pair(X1,X3)),X2)
        | ( X1 != X2
          & ~ contains_slb(X0,X2) ) )
      & ( X1 = X2
        | contains_slb(X0,X2)
        | ~ contains_slb(insert_slb(X0,pair(X1,X3)),X2) ) ),
    inference(nnf_transformation,[],[f21]) ).

fof(f126,plain,
    ! [X0,X1,X2,X3] :
      ( ( contains_slb(insert_slb(X0,pair(X1,X3)),X2)
        | ( X1 != X2
          & ~ contains_slb(X0,X2) ) )
      & ( X1 = X2
        | contains_slb(X0,X2)
        | ~ contains_slb(insert_slb(X0,pair(X1,X3)),X2) ) ),
    inference(flattening,[],[f125]) ).

fof(f130,plain,
    ! [X0,X1,X2,X3] :
      ( ( contains_cpq(triple(X0,X1,X2),X3)
        | ~ contains_slb(X1,X3) )
      & ( contains_slb(X1,X3)
        | ~ contains_cpq(triple(X0,X1,X2),X3) ) ),
    inference(nnf_transformation,[],[f39]) ).

fof(f135,plain,
    ! [X0,X1,X2,X3] :
      ( ( contains_cpq(triple(X0,X1,X2),X3)
        | ~ contains_pq(i(triple(X0,X1,X2)),X3) )
      & ( contains_pq(i(triple(X0,X1,X2)),X3)
        | ~ contains_cpq(triple(X0,X1,X2),X3) ) ),
    inference(nnf_transformation,[],[f63]) ).

fof(f136,plain,
    ( ? [X0,X1,X2] :
        ( ~ contains_pq(i(triple(X0,X1,X2)),findmin_cpq_res(triple(X0,X1,X2)))
        & phi(findmin_cpq_eff(triple(X0,X1,X2))) )
   => ( ~ contains_pq(i(triple(sK2,sK3,sK4)),findmin_cpq_res(triple(sK2,sK3,sK4)))
      & phi(findmin_cpq_eff(triple(sK2,sK3,sK4))) ) ),
    introduced(choice_axiom,[]) ).

fof(f137,plain,
    ( ~ contains_pq(i(triple(sK2,sK3,sK4)),findmin_cpq_res(triple(sK2,sK3,sK4)))
    & phi(findmin_cpq_eff(triple(sK2,sK3,sK4))) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4])],[f120,f136]) ).

fof(f146,plain,
    ! [X2,X0,X1] :
      ( X1 = X2
      | contains_pq(X0,X2)
      | ~ contains_pq(insert_pq(X0,X1),X2) ),
    inference(cnf_transformation,[],[f122]) ).

fof(f162,plain,
    ! [X2,X3,X0,X1] :
      ( contains_slb(insert_slb(X0,pair(X1,X3)),X2)
      | ~ contains_slb(X0,X2) ),
    inference(cnf_transformation,[],[f126]) ).

fof(f186,plain,
    ! [X2,X3,X0,X1] :
      ( contains_cpq(triple(X0,X1,X2),X3)
      | ~ contains_slb(X1,X3) ),
    inference(cnf_transformation,[],[f130]) ).

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

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

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

fof(f194,plain,
    ! [X2,X0,X1] :
      ( findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad)
      | contains_slb(X1,findmin_pqp_res(X0))
      | create_slb = X1 ),
    inference(cnf_transformation,[],[f112]) ).

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

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

fof(f202,plain,
    ! [X2,X3,X0,X1,X4] : i(triple(X0,insert_slb(X1,pair(X3,X4)),X2)) = insert_pq(i(triple(X0,X1,X2)),X3),
    inference(cnf_transformation,[],[f55]) ).

fof(f207,plain,
    ! [X2,X3,X0,X1] :
      ( contains_pq(i(triple(X0,X1,X2)),X3)
      | ~ contains_cpq(triple(X0,X1,X2),X3) ),
    inference(cnf_transformation,[],[f135]) ).

fof(f210,plain,
    ! [X2,X0,X1] :
      ( ~ phi(triple(X0,X1,X2))
      | ok(triple(X0,X1,X2)) ),
    inference(cnf_transformation,[],[f119]) ).

fof(f211,plain,
    phi(findmin_cpq_eff(triple(sK2,sK3,sK4))),
    inference(cnf_transformation,[],[f137]) ).

fof(f212,plain,
    ~ contains_pq(i(triple(sK2,sK3,sK4)),findmin_cpq_res(triple(sK2,sK3,sK4))),
    inference(cnf_transformation,[],[f137]) ).

fof(f216,plain,
    ! [X2,X0,X1] :
      ( findmin_pqp_res(X0) = removemin_cpq_res(triple(X0,X1,X2))
      | create_slb = X1 ),
    inference(definition_unfolding,[],[f198,f200]) ).

fof(f218,plain,
    ~ contains_pq(i(triple(sK2,sK3,sK4)),removemin_cpq_res(triple(sK2,sK3,sK4))),
    inference(definition_unfolding,[],[f212,f200]) ).

cnf(c_59,plain,
    ( ~ contains_pq(insert_pq(X0,X1),X2)
    | X1 = X2
    | contains_pq(X0,X2) ),
    inference(cnf_transformation,[],[f146]) ).

cnf(c_73,plain,
    ( ~ contains_slb(X0,X1)
    | contains_slb(insert_slb(X0,pair(X2,X3)),X1) ),
    inference(cnf_transformation,[],[f162]) ).

cnf(c_96,plain,
    ( ~ contains_slb(X0,X1)
    | contains_cpq(triple(X2,X0,X3),X1) ),
    inference(cnf_transformation,[],[f186]) ).

cnf(c_98,plain,
    ~ ok(triple(X0,X1,bad)),
    inference(cnf_transformation,[],[f187]) ).

cnf(c_101,plain,
    ( remove_cpq(triple(X0,X1,X2),X3) = triple(X0,X1,bad)
    | contains_slb(X1,X3) ),
    inference(cnf_transformation,[],[f190]) ).

cnf(c_104,plain,
    findmin_cpq_eff(triple(X0,create_slb,X1)) = triple(X0,create_slb,bad),
    inference(cnf_transformation,[],[f193]) ).

cnf(c_105,plain,
    ( triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) = findmin_cpq_eff(triple(X0,X1,X2))
    | X1 = create_slb
    | contains_slb(X1,findmin_pqp_res(X0)) ),
    inference(cnf_transformation,[],[f194]) ).

cnf(c_109,plain,
    ( removemin_cpq_res(triple(X0,X1,X2)) = findmin_pqp_res(X0)
    | X1 = create_slb ),
    inference(cnf_transformation,[],[f216]) ).

cnf(c_111,plain,
    i(triple(X0,insert_slb(X1,pair(X2,X3)),X4)) = insert_pq(i(triple(X0,X1,X4)),X2),
    inference(cnf_transformation,[],[f202]) ).

cnf(c_117,plain,
    ( ~ contains_cpq(triple(X0,X1,X2),X3)
    | contains_pq(i(triple(X0,X1,X2)),X3) ),
    inference(cnf_transformation,[],[f207]) ).

cnf(c_119,plain,
    ( ~ phi(triple(X0,X1,X2))
    | ok(triple(X0,X1,X2)) ),
    inference(cnf_transformation,[],[f210]) ).

cnf(c_120,negated_conjecture,
    ~ contains_pq(i(triple(sK2,sK3,sK4)),removemin_cpq_res(triple(sK2,sK3,sK4))),
    inference(cnf_transformation,[],[f218]) ).

cnf(c_121,negated_conjecture,
    phi(findmin_cpq_eff(triple(sK2,sK3,sK4))),
    inference(cnf_transformation,[],[f211]) ).

cnf(c_2566,plain,
    triple(sK2,sK3,sK4) = sP0_iProver_def,
    definition ).

cnf(c_2567,plain,
    findmin_cpq_eff(sP0_iProver_def) = sP1_iProver_def,
    definition ).

cnf(c_2568,plain,
    i(sP0_iProver_def) = sP2_iProver_def,
    definition ).

cnf(c_2569,plain,
    removemin_cpq_res(sP0_iProver_def) = sP3_iProver_def,
    definition ).

cnf(c_2570,negated_conjecture,
    phi(sP1_iProver_def),
    inference(demodulation,[status(thm)],[c_121,c_2566,c_2567]) ).

cnf(c_2571,negated_conjecture,
    ~ contains_pq(sP2_iProver_def,sP3_iProver_def),
    inference(demodulation,[status(thm)],[c_120,c_2569,c_2568]) ).

cnf(c_4096,plain,
    ( ~ contains_slb(sK3,X0)
    | contains_cpq(sP0_iProver_def,X0) ),
    inference(superposition,[status(thm)],[c_2566,c_96]) ).

cnf(c_4717,plain,
    ( ~ contains_cpq(triple(X0,insert_slb(X1,pair(X2,X3)),X4),X5)
    | contains_pq(insert_pq(i(triple(X0,X1,X4)),X2),X5) ),
    inference(superposition,[status(thm)],[c_111,c_117]) ).

cnf(c_4719,plain,
    ( ~ contains_cpq(triple(sK2,sK3,sK4),X0)
    | contains_pq(i(sP0_iProver_def),X0) ),
    inference(superposition,[status(thm)],[c_2566,c_117]) ).

cnf(c_4726,plain,
    ( ~ contains_cpq(sP0_iProver_def,X0)
    | contains_pq(sP2_iProver_def,X0) ),
    inference(light_normalisation,[status(thm)],[c_4719,c_2566,c_2568]) ).

cnf(c_4773,plain,
    ( remove_cpq(triple(X0,sK3,X1),X2) = triple(X0,sK3,bad)
    | contains_cpq(sP0_iProver_def,X2) ),
    inference(superposition,[status(thm)],[c_101,c_4096]) ).

cnf(c_6327,plain,
    ( remove_cpq(triple(X0,sK3,X1),X2) = triple(X0,sK3,bad)
    | contains_pq(sP2_iProver_def,X2) ),
    inference(superposition,[status(thm)],[c_4773,c_4726]) ).

cnf(c_6658,plain,
    remove_cpq(triple(X0,sK3,X1),sP3_iProver_def) = triple(X0,sK3,bad),
    inference(superposition,[status(thm)],[c_6327,c_2571]) ).

cnf(c_6755,plain,
    triple(sK2,sK3,bad) = remove_cpq(sP0_iProver_def,sP3_iProver_def),
    inference(superposition,[status(thm)],[c_2566,c_6658]) ).

cnf(c_6767,plain,
    ( ~ phi(remove_cpq(sP0_iProver_def,sP3_iProver_def))
    | ok(triple(sK2,sK3,bad)) ),
    inference(superposition,[status(thm)],[c_6755,c_119]) ).

cnf(c_6775,plain,
    ~ ok(remove_cpq(sP0_iProver_def,sP3_iProver_def)),
    inference(superposition,[status(thm)],[c_6755,c_98]) ).

cnf(c_6789,plain,
    ( ~ phi(remove_cpq(sP0_iProver_def,sP3_iProver_def))
    | ok(remove_cpq(sP0_iProver_def,sP3_iProver_def)) ),
    inference(light_normalisation,[status(thm)],[c_6767,c_6755]) ).

cnf(c_30960,plain,
    ( ~ contains_slb(insert_slb(X0,pair(X1,X2)),X3)
    | contains_pq(insert_pq(i(triple(X4,X0,X5)),X1),X3) ),
    inference(superposition,[status(thm)],[c_96,c_4717]) ).

cnf(c_31005,plain,
    ( ~ contains_slb(X0,X1)
    | contains_pq(insert_pq(i(triple(X2,X0,X3)),X4),X1) ),
    inference(superposition,[status(thm)],[c_73,c_30960]) ).

cnf(c_31141,plain,
    ( ~ contains_slb(sK3,X0)
    | contains_pq(insert_pq(i(sP0_iProver_def),X1),X0) ),
    inference(superposition,[status(thm)],[c_2566,c_31005]) ).

cnf(c_31166,plain,
    ( ~ contains_slb(sK3,X0)
    | contains_pq(insert_pq(sP2_iProver_def,X1),X0) ),
    inference(light_normalisation,[status(thm)],[c_31141,c_2568]) ).

cnf(c_31573,plain,
    ( ~ contains_slb(sK3,X0)
    | X0 = X1
    | contains_pq(sP2_iProver_def,X0) ),
    inference(superposition,[status(thm)],[c_31166,c_59]) ).

cnf(c_31668,plain,
    ( ~ contains_slb(sK3,X0)
    | contains_pq(sP2_iProver_def,X0) ),
    inference(global_subsumption_just,[status(thm)],[c_31573,c_4096,c_4726]) ).

cnf(c_259999,plain,
    ( removemin_cpq_res(sP0_iProver_def) = findmin_pqp_res(sK2)
    | create_slb = sK3 ),
    inference(superposition,[status(thm)],[c_2566,c_109]) ).

cnf(c_260001,plain,
    ( findmin_pqp_res(sK2) = sP3_iProver_def
    | create_slb = sK3 ),
    inference(light_normalisation,[status(thm)],[c_259999,c_2569]) ).

cnf(c_260011,plain,
    ( ~ contains_slb(sK3,X0)
    | contains_cpq(sP0_iProver_def,X0) ),
    inference(superposition,[status(thm)],[c_2566,c_96]) ).

cnf(c_260601,plain,
    ( ~ contains_cpq(triple(X0,insert_slb(X1,pair(X2,X3)),X4),X5)
    | contains_pq(insert_pq(i(triple(X0,X1,X4)),X2),X5) ),
    inference(superposition,[status(thm)],[c_111,c_117]) ).

cnf(c_260603,plain,
    ( ~ contains_cpq(triple(sK2,sK3,sK4),X0)
    | contains_pq(i(sP0_iProver_def),X0) ),
    inference(superposition,[status(thm)],[c_2566,c_117]) ).

cnf(c_260609,plain,
    ( ~ contains_cpq(sP0_iProver_def,X0)
    | contains_pq(sP2_iProver_def,X0) ),
    inference(light_normalisation,[status(thm)],[c_260603,c_2566,c_2568]) ).

cnf(c_260739,plain,
    ( remove_cpq(triple(X0,sK3,X1),X2) = triple(X0,sK3,bad)
    | contains_cpq(sP0_iProver_def,X2) ),
    inference(superposition,[status(thm)],[c_101,c_260011]) ).

cnf(c_261862,plain,
    ( remove_cpq(triple(X0,sK3,X1),X2) = triple(X0,sK3,bad)
    | contains_pq(sP2_iProver_def,X2) ),
    inference(superposition,[status(thm)],[c_260739,c_260609]) ).

cnf(c_262204,plain,
    remove_cpq(triple(X0,sK3,X1),sP3_iProver_def) = triple(X0,sK3,bad),
    inference(superposition,[status(thm)],[c_261862,c_2571]) ).

cnf(c_262255,plain,
    triple(sK2,sK3,bad) = remove_cpq(sP0_iProver_def,sP3_iProver_def),
    inference(superposition,[status(thm)],[c_2566,c_262204]) ).

cnf(c_262288,plain,
    ( ~ phi(remove_cpq(sP0_iProver_def,sP3_iProver_def))
    | ok(triple(sK2,sK3,bad)) ),
    inference(superposition,[status(thm)],[c_262255,c_119]) ).

cnf(c_262310,plain,
    ( ~ phi(remove_cpq(sP0_iProver_def,sP3_iProver_def))
    | ok(remove_cpq(sP0_iProver_def,sP3_iProver_def)) ),
    inference(light_normalisation,[status(thm)],[c_262288,c_262255]) ).

cnf(c_262411,plain,
    ~ phi(remove_cpq(sP0_iProver_def,sP3_iProver_def)),
    inference(global_subsumption_just,[status(thm)],[c_262310,c_6775,c_6789]) ).

cnf(c_285405,plain,
    ( ~ contains_slb(insert_slb(X0,pair(X1,X2)),X3)
    | contains_pq(insert_pq(i(triple(X4,X0,X5)),X1),X3) ),
    inference(superposition,[status(thm)],[c_96,c_260601]) ).

cnf(c_285465,plain,
    ( ~ contains_slb(X0,X1)
    | contains_pq(insert_pq(i(triple(X2,X0,X3)),X4),X1) ),
    inference(superposition,[status(thm)],[c_73,c_285405]) ).

cnf(c_285593,plain,
    ( ~ contains_slb(sK3,X0)
    | contains_pq(insert_pq(i(sP0_iProver_def),X1),X0) ),
    inference(superposition,[status(thm)],[c_2566,c_285465]) ).

cnf(c_285618,plain,
    ( ~ contains_slb(sK3,X0)
    | contains_pq(insert_pq(sP2_iProver_def,X1),X0) ),
    inference(light_normalisation,[status(thm)],[c_285593,c_2568]) ).

cnf(c_285782,plain,
    ( ~ contains_slb(sK3,X0)
    | X0 = X1
    | contains_pq(sP2_iProver_def,X0) ),
    inference(superposition,[status(thm)],[c_285618,c_59]) ).

cnf(c_285889,plain,
    ( ~ contains_slb(sK3,X0)
    | contains_pq(sP2_iProver_def,X0) ),
    inference(global_subsumption_just,[status(thm)],[c_285782,c_31668]) ).

cnf(c_285896,plain,
    ( triple(X0,update_slb(sK3,findmin_pqp_res(X0)),bad) = findmin_cpq_eff(triple(X0,sK3,X1))
    | create_slb = sK3
    | contains_pq(sP2_iProver_def,findmin_pqp_res(X0)) ),
    inference(superposition,[status(thm)],[c_105,c_285889]) ).

cnf(c_592401,plain,
    ( triple(sK2,update_slb(sK3,findmin_pqp_res(sK2)),bad) = findmin_cpq_eff(triple(sK2,sK3,X0))
    | create_slb = sK3
    | contains_pq(sP2_iProver_def,sP3_iProver_def) ),
    inference(superposition,[status(thm)],[c_260001,c_285896]) ).

cnf(c_592406,plain,
    ( triple(sK2,update_slb(sK3,findmin_pqp_res(sK2)),bad) = findmin_cpq_eff(triple(sK2,sK3,X0))
    | create_slb = sK3 ),
    inference(forward_subsumption_resolution,[status(thm)],[c_592401,c_2571]) ).

cnf(c_592761,plain,
    ( ~ phi(findmin_cpq_eff(triple(sK2,sK3,X0)))
    | create_slb = sK3
    | ok(triple(sK2,update_slb(sK3,findmin_pqp_res(sK2)),bad)) ),
    inference(superposition,[status(thm)],[c_592406,c_119]) ).

cnf(c_592875,plain,
    ( ~ phi(findmin_cpq_eff(triple(sK2,sK3,X0)))
    | create_slb = sK3 ),
    inference(forward_subsumption_resolution,[status(thm)],[c_592761,c_98]) ).

cnf(c_595197,plain,
    ( ~ phi(findmin_cpq_eff(sP0_iProver_def))
    | create_slb = sK3 ),
    inference(superposition,[status(thm)],[c_2566,c_592875]) ).

cnf(c_595199,plain,
    ( ~ phi(sP1_iProver_def)
    | create_slb = sK3 ),
    inference(light_normalisation,[status(thm)],[c_595197,c_2567]) ).

cnf(c_595200,plain,
    create_slb = sK3,
    inference(forward_subsumption_resolution,[status(thm)],[c_595199,c_2570]) ).

cnf(c_595595,plain,
    triple(sK2,create_slb,bad) = remove_cpq(sP0_iProver_def,sP3_iProver_def),
    inference(demodulation,[status(thm)],[c_262255,c_595200]) ).

cnf(c_595605,plain,
    triple(sK2,create_slb,sK4) = sP0_iProver_def,
    inference(demodulation,[status(thm)],[c_2566,c_595200]) ).

cnf(c_596104,plain,
    triple(sK2,create_slb,bad) = findmin_cpq_eff(sP0_iProver_def),
    inference(superposition,[status(thm)],[c_595605,c_104]) ).

cnf(c_596274,plain,
    triple(sK2,create_slb,bad) = sP1_iProver_def,
    inference(light_normalisation,[status(thm)],[c_596104,c_2567,c_595595]) ).

cnf(c_598014,plain,
    remove_cpq(sP0_iProver_def,sP3_iProver_def) = sP1_iProver_def,
    inference(light_normalisation,[status(thm)],[c_595595,c_596274]) ).

cnf(c_598202,plain,
    ~ phi(sP1_iProver_def),
    inference(demodulation,[status(thm)],[c_262411,c_598014]) ).

cnf(c_598206,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_598202,c_2570]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SWV372+1 : TPTP v8.2.0. Released v3.3.0.
% 0.06/0.12  % Command  : run_iprover %s %d THM
% 0.12/0.33  % Computer : n023.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 300
% 0.12/0.33  % DateTime : Thu Jun 20 13:45:09 EDT 2024
% 0.12/0.33  % CPUTime  : 
% 0.19/0.46  Running first-order theorem proving
% 0.19/0.46  Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 184.31/24.86  % SZS status Started for theBenchmark.p
% 184.31/24.86  % SZS status Theorem for theBenchmark.p
% 184.31/24.86  
% 184.31/24.86  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 184.31/24.86  
% 184.31/24.86  ------  iProver source info
% 184.31/24.86  
% 184.31/24.86  git: date: 2024-06-12 09:56:46 +0000
% 184.31/24.86  git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 184.31/24.86  git: non_committed_changes: false
% 184.31/24.86  
% 184.31/24.86  ------ Parsing...
% 184.31/24.86  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 184.31/24.86  
% 184.31/24.86  ------ Preprocessing... sup_sim: 0  sf_s  rm: 1 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 
% 184.31/24.86  
% 184.31/24.86  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 184.31/24.86  
% 184.31/24.86  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 184.31/24.86  ------ Proving...
% 184.31/24.86  ------ Problem Properties 
% 184.31/24.86  
% 184.31/24.86  
% 184.31/24.86  clauses                                 74
% 184.31/24.86  conjectures                             2
% 184.31/24.86  EPR                                     11
% 184.31/24.86  Horn                                    57
% 184.31/24.86  unary                                   29
% 184.31/24.86  binary                                  26
% 184.31/24.86  lits                                    140
% 184.31/24.86  lits eq                                 44
% 184.31/24.86  fd_pure                                 0
% 184.31/24.86  fd_pseudo                               0
% 184.31/24.86  fd_cond                                 5
% 184.31/24.86  fd_pseudo_cond                          7
% 184.31/24.86  AC symbols                              0
% 184.31/24.86  
% 184.31/24.86  ------ Schedule dynamic 5 is on 
% 184.31/24.86  
% 184.31/24.86  ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 184.31/24.86  
% 184.31/24.86  
% 184.31/24.86  ------ 
% 184.31/24.86  Current options:
% 184.31/24.86  ------ 
% 184.31/24.86  
% 184.31/24.86  
% 184.31/24.86  
% 184.31/24.86  
% 184.31/24.86  ------ Proving...
% 184.31/24.86  Proof_search_loop: time out after: 8776 full_loop iterations
% 184.31/24.86  
% 184.31/24.86  ------ Input Options"1. --res_lit_sel adaptive --res_lit_sel_side num_symb" Time Limit: 15.
% 184.31/24.86  
% 184.31/24.86  
% 184.31/24.86  ------ 
% 184.31/24.86  Current options:
% 184.31/24.86  ------ 
% 184.31/24.86  
% 184.31/24.86  
% 184.31/24.86  
% 184.31/24.86  
% 184.31/24.86  ------ Proving...
% 184.31/24.86  
% 184.31/24.86  
% 184.31/24.86  % SZS status Theorem for theBenchmark.p
% 184.31/24.86  
% 184.31/24.86  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 184.31/24.86  
% 184.31/24.86  
%------------------------------------------------------------------------------