TSTP Solution File: SWV370+1 by iProver---3.8

View Problem - Process Solution

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

% Computer : n021.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 : Thu Aug 31 22:32:45 EDT 2023

% Result   : Theorem 6.76s 1.69s
% Output   : CNFRefutation 6.76s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   25
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   72 (  13 unt;   0 def)
%            Number of atoms       :  202 (  27 equ)
%            Maximal formula atoms :   16 (   2 avg)
%            Number of connectives :  213 (  83   ~;  90   |;  27   &)
%                                         (   8 <=>;   4  =>;   0  <=;   1 <~>)
%            Maximal formula depth :   12 (   5 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   6 con; 0-3 aty)
%            Number of variables   :  187 (  12 sgn; 115   !;  34   ?)

% 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(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,conjecture,
    ! [X0] :
      ( ! [X1,X2,X3] :
          ( contains_cpq(triple(X1,X0,X2),X3)
        <=> contains_pq(i(triple(X1,X0,X2)),X3) )
     => ! [X4,X5,X6,X7,X8] :
          ( contains_cpq(triple(X4,insert_slb(X0,pair(X6,X7)),X5),X8)
        <=> contains_pq(i(triple(X4,insert_slb(X0,pair(X6,X7)),X5)),X8) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l6_co) ).

fof(f64,negated_conjecture,
    ~ ! [X0] :
        ( ! [X1,X2,X3] :
            ( contains_cpq(triple(X1,X0,X2),X3)
          <=> contains_pq(i(triple(X1,X0,X2)),X3) )
       => ! [X4,X5,X6,X7,X8] :
            ( contains_cpq(triple(X4,insert_slb(X0,pair(X6,X7)),X5),X8)
          <=> contains_pq(i(triple(X4,insert_slb(X0,pair(X6,X7)),X5)),X8) ) ),
    inference(negated_conjecture,[],[f63]) ).

fof(f115,plain,
    ? [X0] :
      ( ? [X4,X5,X6,X7,X8] :
          ( contains_cpq(triple(X4,insert_slb(X0,pair(X6,X7)),X5),X8)
        <~> contains_pq(i(triple(X4,insert_slb(X0,pair(X6,X7)),X5)),X8) )
      & ! [X1,X2,X3] :
          ( contains_cpq(triple(X1,X0,X2),X3)
        <=> contains_pq(i(triple(X1,X0,X2)),X3) ) ),
    inference(ennf_transformation,[],[f64]) ).

fof(f116,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(f117,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,[],[f116]) ).

fof(f120,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(f121,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,[],[f120]) ).

fof(f125,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(f126,plain,
    ? [X0] :
      ( ? [X4,X5,X6,X7,X8] :
          ( ( ~ contains_pq(i(triple(X4,insert_slb(X0,pair(X6,X7)),X5)),X8)
            | ~ contains_cpq(triple(X4,insert_slb(X0,pair(X6,X7)),X5),X8) )
          & ( contains_pq(i(triple(X4,insert_slb(X0,pair(X6,X7)),X5)),X8)
            | contains_cpq(triple(X4,insert_slb(X0,pair(X6,X7)),X5),X8) ) )
      & ! [X1,X2,X3] :
          ( ( contains_cpq(triple(X1,X0,X2),X3)
            | ~ contains_pq(i(triple(X1,X0,X2)),X3) )
          & ( contains_pq(i(triple(X1,X0,X2)),X3)
            | ~ contains_cpq(triple(X1,X0,X2),X3) ) ) ),
    inference(nnf_transformation,[],[f115]) ).

fof(f127,plain,
    ? [X0] :
      ( ? [X1,X2,X3,X4,X5] :
          ( ( ~ contains_pq(i(triple(X1,insert_slb(X0,pair(X3,X4)),X2)),X5)
            | ~ contains_cpq(triple(X1,insert_slb(X0,pair(X3,X4)),X2),X5) )
          & ( contains_pq(i(triple(X1,insert_slb(X0,pair(X3,X4)),X2)),X5)
            | contains_cpq(triple(X1,insert_slb(X0,pair(X3,X4)),X2),X5) ) )
      & ! [X6,X7,X8] :
          ( ( contains_cpq(triple(X6,X0,X7),X8)
            | ~ contains_pq(i(triple(X6,X0,X7)),X8) )
          & ( contains_pq(i(triple(X6,X0,X7)),X8)
            | ~ contains_cpq(triple(X6,X0,X7),X8) ) ) ),
    inference(rectify,[],[f126]) ).

fof(f128,plain,
    ( ? [X0] :
        ( ? [X1,X2,X3,X4,X5] :
            ( ( ~ contains_pq(i(triple(X1,insert_slb(X0,pair(X3,X4)),X2)),X5)
              | ~ contains_cpq(triple(X1,insert_slb(X0,pair(X3,X4)),X2),X5) )
            & ( contains_pq(i(triple(X1,insert_slb(X0,pair(X3,X4)),X2)),X5)
              | contains_cpq(triple(X1,insert_slb(X0,pair(X3,X4)),X2),X5) ) )
        & ! [X6,X7,X8] :
            ( ( contains_cpq(triple(X6,X0,X7),X8)
              | ~ contains_pq(i(triple(X6,X0,X7)),X8) )
            & ( contains_pq(i(triple(X6,X0,X7)),X8)
              | ~ contains_cpq(triple(X6,X0,X7),X8) ) ) )
   => ( ? [X5,X4,X3,X2,X1] :
          ( ( ~ contains_pq(i(triple(X1,insert_slb(sK1,pair(X3,X4)),X2)),X5)
            | ~ contains_cpq(triple(X1,insert_slb(sK1,pair(X3,X4)),X2),X5) )
          & ( contains_pq(i(triple(X1,insert_slb(sK1,pair(X3,X4)),X2)),X5)
            | contains_cpq(triple(X1,insert_slb(sK1,pair(X3,X4)),X2),X5) ) )
      & ! [X8,X7,X6] :
          ( ( contains_cpq(triple(X6,sK1,X7),X8)
            | ~ contains_pq(i(triple(X6,sK1,X7)),X8) )
          & ( contains_pq(i(triple(X6,sK1,X7)),X8)
            | ~ contains_cpq(triple(X6,sK1,X7),X8) ) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f129,plain,
    ( ? [X5,X4,X3,X2,X1] :
        ( ( ~ contains_pq(i(triple(X1,insert_slb(sK1,pair(X3,X4)),X2)),X5)
          | ~ contains_cpq(triple(X1,insert_slb(sK1,pair(X3,X4)),X2),X5) )
        & ( contains_pq(i(triple(X1,insert_slb(sK1,pair(X3,X4)),X2)),X5)
          | contains_cpq(triple(X1,insert_slb(sK1,pair(X3,X4)),X2),X5) ) )
   => ( ( ~ contains_pq(i(triple(sK2,insert_slb(sK1,pair(sK4,sK5)),sK3)),sK6)
        | ~ contains_cpq(triple(sK2,insert_slb(sK1,pair(sK4,sK5)),sK3),sK6) )
      & ( contains_pq(i(triple(sK2,insert_slb(sK1,pair(sK4,sK5)),sK3)),sK6)
        | contains_cpq(triple(sK2,insert_slb(sK1,pair(sK4,sK5)),sK3),sK6) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f130,plain,
    ( ( ~ contains_pq(i(triple(sK2,insert_slb(sK1,pair(sK4,sK5)),sK3)),sK6)
      | ~ contains_cpq(triple(sK2,insert_slb(sK1,pair(sK4,sK5)),sK3),sK6) )
    & ( contains_pq(i(triple(sK2,insert_slb(sK1,pair(sK4,sK5)),sK3)),sK6)
      | contains_cpq(triple(sK2,insert_slb(sK1,pair(sK4,sK5)),sK3),sK6) )
    & ! [X6,X7,X8] :
        ( ( contains_cpq(triple(X6,sK1,X7),X8)
          | ~ contains_pq(i(triple(X6,sK1,X7)),X8) )
        & ( contains_pq(i(triple(X6,sK1,X7)),X8)
          | ~ contains_cpq(triple(X6,sK1,X7),X8) ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4,sK5,sK6])],[f127,f129,f128]) ).

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

fof(f140,plain,
    ! [X2,X0,X1] :
      ( contains_pq(insert_pq(X0,X1),X2)
      | ~ contains_pq(X0,X2) ),
    inference(cnf_transformation,[],[f117]) ).

fof(f141,plain,
    ! [X2,X0,X1] :
      ( contains_pq(insert_pq(X0,X1),X2)
      | X1 != X2 ),
    inference(cnf_transformation,[],[f117]) ).

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

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

fof(f156,plain,
    ! [X2,X3,X0,X1] :
      ( contains_slb(insert_slb(X0,pair(X1,X3)),X2)
      | X1 != X2 ),
    inference(cnf_transformation,[],[f121]) ).

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

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

fof(f195,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(f196,plain,
    ! [X8,X6,X7] :
      ( contains_pq(i(triple(X6,sK1,X7)),X8)
      | ~ contains_cpq(triple(X6,sK1,X7),X8) ),
    inference(cnf_transformation,[],[f130]) ).

fof(f197,plain,
    ! [X8,X6,X7] :
      ( contains_cpq(triple(X6,sK1,X7),X8)
      | ~ contains_pq(i(triple(X6,sK1,X7)),X8) ),
    inference(cnf_transformation,[],[f130]) ).

fof(f198,plain,
    ( contains_pq(i(triple(sK2,insert_slb(sK1,pair(sK4,sK5)),sK3)),sK6)
    | contains_cpq(triple(sK2,insert_slb(sK1,pair(sK4,sK5)),sK3),sK6) ),
    inference(cnf_transformation,[],[f130]) ).

fof(f199,plain,
    ( ~ contains_pq(i(triple(sK2,insert_slb(sK1,pair(sK4,sK5)),sK3)),sK6)
    | ~ contains_cpq(triple(sK2,insert_slb(sK1,pair(sK4,sK5)),sK3),sK6) ),
    inference(cnf_transformation,[],[f130]) ).

fof(f204,plain,
    ! [X2,X0] : contains_pq(insert_pq(X0,X2),X2),
    inference(equality_resolution,[],[f141]) ).

fof(f205,plain,
    ! [X2,X3,X0] : contains_slb(insert_slb(X0,pair(X2,X3)),X2),
    inference(equality_resolution,[],[f156]) ).

cnf(c_57,plain,
    contains_pq(insert_pq(X0,X1),X1),
    inference(cnf_transformation,[],[f204]) ).

cnf(c_58,plain,
    ( ~ contains_pq(X0,X1)
    | contains_pq(insert_pq(X0,X2),X1) ),
    inference(cnf_transformation,[],[f140]) ).

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

cnf(c_72,plain,
    contains_slb(insert_slb(X0,pair(X1,X2)),X1),
    inference(cnf_transformation,[],[f205]) ).

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

cnf(c_74,plain,
    ( ~ contains_slb(insert_slb(X0,pair(X1,X2)),X3)
    | X1 = X3
    | contains_slb(X0,X3) ),
    inference(cnf_transformation,[],[f154]) ).

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

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

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

cnf(c_112,negated_conjecture,
    ( ~ contains_pq(i(triple(sK2,insert_slb(sK1,pair(sK4,sK5)),sK3)),sK6)
    | ~ contains_cpq(triple(sK2,insert_slb(sK1,pair(sK4,sK5)),sK3),sK6) ),
    inference(cnf_transformation,[],[f199]) ).

cnf(c_113,negated_conjecture,
    ( contains_pq(i(triple(sK2,insert_slb(sK1,pair(sK4,sK5)),sK3)),sK6)
    | contains_cpq(triple(sK2,insert_slb(sK1,pair(sK4,sK5)),sK3),sK6) ),
    inference(cnf_transformation,[],[f198]) ).

cnf(c_114,negated_conjecture,
    ( ~ contains_pq(i(triple(X0,sK1,X1)),X2)
    | contains_cpq(triple(X0,sK1,X1),X2) ),
    inference(cnf_transformation,[],[f197]) ).

cnf(c_115,negated_conjecture,
    ( ~ contains_cpq(triple(X0,sK1,X1),X2)
    | contains_pq(i(triple(X0,sK1,X1)),X2) ),
    inference(cnf_transformation,[],[f196]) ).

cnf(c_5975,plain,
    ( ~ contains_cpq(triple(sK2,insert_slb(sK1,pair(sK4,sK5)),sK3),sK6)
    | ~ contains_pq(insert_pq(i(triple(sK2,sK1,sK3)),sK4),sK6) ),
    inference(superposition,[status(thm)],[c_111,c_112]) ).

cnf(c_5976,plain,
    ( contains_cpq(triple(sK2,insert_slb(sK1,pair(sK4,sK5)),sK3),sK6)
    | contains_pq(insert_pq(i(triple(sK2,sK1,sK3)),sK4),sK6) ),
    inference(superposition,[status(thm)],[c_111,c_113]) ).

cnf(c_6012,plain,
    ( contains_pq(insert_pq(i(triple(sK2,sK1,sK3)),sK4),sK6)
    | contains_slb(insert_slb(sK1,pair(sK4,sK5)),sK6) ),
    inference(superposition,[status(thm)],[c_5976,c_97]) ).

cnf(c_6013,plain,
    ( ~ contains_pq(insert_pq(i(triple(sK2,sK1,sK3)),sK4),sK6)
    | ~ contains_slb(insert_slb(sK1,pair(sK4,sK5)),sK6) ),
    inference(superposition,[status(thm)],[c_96,c_5975]) ).

cnf(c_6015,plain,
    ( sK4 = sK6
    | contains_pq(i(triple(sK2,sK1,sK3)),sK6)
    | contains_slb(insert_slb(sK1,pair(sK4,sK5)),sK6) ),
    inference(superposition,[status(thm)],[c_6012,c_59]) ).

cnf(c_6016,plain,
    ( ~ contains_pq(i(triple(sK2,sK1,sK3)),sK6)
    | ~ contains_slb(insert_slb(sK1,pair(sK4,sK5)),sK6) ),
    inference(superposition,[status(thm)],[c_58,c_6013]) ).

cnf(c_6018,plain,
    ( ~ contains_pq(i(triple(sK2,sK1,sK3)),sK6)
    | ~ contains_slb(sK1,sK6) ),
    inference(superposition,[status(thm)],[c_73,c_6016]) ).

cnf(c_6021,plain,
    ( sK4 = sK6
    | contains_pq(i(triple(sK2,sK1,sK3)),sK6)
    | contains_slb(sK1,sK6) ),
    inference(superposition,[status(thm)],[c_6015,c_74]) ).

cnf(c_6023,plain,
    ( ~ contains_cpq(triple(sK2,sK1,sK3),sK6)
    | ~ contains_slb(sK1,sK6) ),
    inference(superposition,[status(thm)],[c_115,c_6018]) ).

cnf(c_6024,plain,
    ~ contains_slb(sK1,sK6),
    inference(superposition,[status(thm)],[c_96,c_6023]) ).

cnf(c_9684,plain,
    ( ~ contains_cpq(triple(sK2,insert_slb(sK1,pair(sK4,sK5)),sK3),sK6)
    | ~ contains_pq(insert_pq(i(triple(sK2,sK1,sK3)),sK4),sK6) ),
    inference(superposition,[status(thm)],[c_111,c_112]) ).

cnf(c_9685,plain,
    ( contains_cpq(triple(sK2,insert_slb(sK1,pair(sK4,sK5)),sK3),sK6)
    | contains_pq(insert_pq(i(triple(sK2,sK1,sK3)),sK4),sK6) ),
    inference(superposition,[status(thm)],[c_111,c_113]) ).

cnf(c_9742,plain,
    ( contains_pq(insert_pq(i(triple(sK2,sK1,sK3)),sK4),sK6)
    | contains_slb(insert_slb(sK1,pair(sK4,sK5)),sK6) ),
    inference(superposition,[status(thm)],[c_9685,c_97]) ).

cnf(c_9743,plain,
    ( ~ contains_pq(insert_pq(i(triple(sK2,sK1,sK3)),sK4),sK6)
    | ~ contains_slb(insert_slb(sK1,pair(sK4,sK5)),sK6) ),
    inference(superposition,[status(thm)],[c_96,c_9684]) ).

cnf(c_9753,plain,
    ( sK4 = sK6
    | contains_pq(i(triple(sK2,sK1,sK3)),sK6)
    | contains_slb(insert_slb(sK1,pair(sK4,sK5)),sK6) ),
    inference(superposition,[status(thm)],[c_9742,c_59]) ).

cnf(c_9987,plain,
    ( contains_pq(i(triple(sK2,sK1,sK3)),sK6)
    | sK4 = sK6 ),
    inference(global_subsumption_just,[status(thm)],[c_9753,c_6021,c_6024]) ).

cnf(c_9988,plain,
    ( sK4 = sK6
    | contains_pq(i(triple(sK2,sK1,sK3)),sK6) ),
    inference(renaming,[status(thm)],[c_9987]) ).

cnf(c_9990,plain,
    ( sK4 = sK6
    | contains_cpq(triple(sK2,sK1,sK3),sK6) ),
    inference(superposition,[status(thm)],[c_9988,c_114]) ).

cnf(c_9992,plain,
    ( sK4 = sK6
    | contains_slb(sK1,sK6) ),
    inference(superposition,[status(thm)],[c_9990,c_97]) ).

cnf(c_10023,plain,
    sK4 = sK6,
    inference(global_subsumption_just,[status(thm)],[c_9992,c_6024,c_9992]) ).

cnf(c_10033,plain,
    ( ~ contains_pq(i(triple(sK2,insert_slb(sK1,pair(sK4,sK5)),sK3)),sK4)
    | ~ contains_cpq(triple(sK2,insert_slb(sK1,pair(sK4,sK5)),sK3),sK6) ),
    inference(superposition,[status(thm)],[c_10023,c_112]) ).

cnf(c_10081,plain,
    ( ~ contains_cpq(triple(sK2,insert_slb(sK1,pair(sK4,sK5)),sK3),sK6)
    | ~ contains_pq(insert_pq(i(triple(sK2,sK1,sK3)),sK4),sK4) ),
    inference(superposition,[status(thm)],[c_111,c_10033]) ).

cnf(c_10094,plain,
    ( ~ contains_pq(insert_pq(i(triple(sK2,sK1,sK3)),sK4),sK4)
    | contains_pq(insert_pq(i(triple(sK2,sK1,sK3)),sK4),sK6) ),
    inference(superposition,[status(thm)],[c_9685,c_10081]) ).

cnf(c_10096,plain,
    contains_pq(insert_pq(i(triple(sK2,sK1,sK3)),sK4),sK6),
    inference(superposition,[status(thm)],[c_57,c_10094]) ).

cnf(c_10106,plain,
    ~ contains_slb(insert_slb(sK1,pair(sK4,sK5)),sK6),
    inference(superposition,[status(thm)],[c_10096,c_9743]) ).

cnf(c_10221,plain,
    ~ contains_slb(insert_slb(sK1,pair(sK4,sK5)),sK4),
    inference(superposition,[status(thm)],[c_10023,c_10106]) ).

cnf(c_10223,plain,
    $false,
    inference(superposition,[status(thm)],[c_72,c_10221]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.16  % Problem  : SWV370+1 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.17  % Command  : run_iprover %s %d THM
% 0.14/0.38  % Computer : n021.cluster.edu
% 0.14/0.38  % Model    : x86_64 x86_64
% 0.14/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.38  % Memory   : 8042.1875MB
% 0.14/0.38  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.38  % CPULimit : 300
% 0.14/0.38  % WCLimit  : 300
% 0.14/0.38  % DateTime : Tue Aug 29 04:52:44 EDT 2023
% 0.14/0.39  % CPUTime  : 
% 0.21/0.53  Running first-order theorem proving
% 0.21/0.53  Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 6.76/1.69  % SZS status Started for theBenchmark.p
% 6.76/1.69  % SZS status Theorem for theBenchmark.p
% 6.76/1.69  
% 6.76/1.69  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 6.76/1.69  
% 6.76/1.69  ------  iProver source info
% 6.76/1.69  
% 6.76/1.69  git: date: 2023-05-31 18:12:56 +0000
% 6.76/1.69  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 6.76/1.69  git: non_committed_changes: false
% 6.76/1.69  git: last_make_outside_of_git: false
% 6.76/1.69  
% 6.76/1.69  ------ Parsing...
% 6.76/1.69  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 6.76/1.69  
% 6.76/1.69  ------ 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: 5 0s  sf_e  pe_s  pe_e 
% 6.76/1.69  
% 6.76/1.69  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 6.76/1.69  
% 6.76/1.69  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 6.76/1.69  ------ Proving...
% 6.76/1.69  ------ Problem Properties 
% 6.76/1.69  
% 6.76/1.69  
% 6.76/1.69  clauses                                 59
% 6.76/1.69  conjectures                             4
% 6.76/1.69  EPR                                     7
% 6.76/1.69  Horn                                    41
% 6.76/1.69  unary                                   22
% 6.76/1.69  binary                                  19
% 6.76/1.69  lits                                    115
% 6.76/1.69  lits eq                                 40
% 6.76/1.69  fd_pure                                 0
% 6.76/1.69  fd_pseudo                               0
% 6.76/1.69  fd_cond                                 5
% 6.76/1.69  fd_pseudo_cond                          7
% 6.76/1.69  AC symbols                              0
% 6.76/1.69  
% 6.76/1.69  ------ Input Options Time Limit: Unbounded
% 6.76/1.69  
% 6.76/1.69  
% 6.76/1.69  ------ 
% 6.76/1.69  Current options:
% 6.76/1.69  ------ 
% 6.76/1.69  
% 6.76/1.69  
% 6.76/1.69  
% 6.76/1.69  
% 6.76/1.69  ------ Proving...
% 6.76/1.69  
% 6.76/1.69  
% 6.76/1.69  % SZS status Theorem for theBenchmark.p
% 6.76/1.69  
% 6.76/1.69  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 6.76/1.69  
% 6.76/1.69  
%------------------------------------------------------------------------------