TSTP Solution File: RNG088+2 by iProver---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.9
% Problem  : RNG088+2 : TPTP v8.2.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n013.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 14:04:00 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
fof(f25,axiom,
    ( aIdeal0(xJ)
    & ! [X0] :
        ( aElementOf0(X0,xJ)
       => ( ! [X1] :
              ( aElement0(X1)
             => aElementOf0(sdtasdt0(X1,X0),xJ) )
          & ! [X1] :
              ( aElementOf0(X1,xJ)
             => aElementOf0(sdtpldt0(X0,X1),xJ) ) ) )
    & aSet0(xJ)
    & aIdeal0(xI)
    & ! [X0] :
        ( aElementOf0(X0,xI)
       => ( ! [X1] :
              ( aElement0(X1)
             => aElementOf0(sdtasdt0(X1,X0),xI) )
          & ! [X1] :
              ( aElementOf0(X1,xI)
             => aElementOf0(sdtpldt0(X0,X1),xI) ) ) )
    & aSet0(xI) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__870) ).

fof(f27,axiom,
    ( xx = sdtpldt0(xk,xl)
    & aElementOf0(xl,xJ)
    & aElementOf0(xk,xI) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__934) ).

fof(f28,axiom,
    ( xy = sdtpldt0(xm,xn)
    & aElementOf0(xn,xJ)
    & aElementOf0(xm,xI) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__967) ).

fof(f29,conjecture,
    ( aElementOf0(sdtpldt0(xl,xn),xJ)
    & aElementOf0(sdtpldt0(xk,xm),xI) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).

fof(f30,negated_conjecture,
    ~ ( aElementOf0(sdtpldt0(xl,xn),xJ)
      & aElementOf0(sdtpldt0(xk,xm),xI) ),
    inference(negated_conjecture,[],[f29]) ).

fof(f35,plain,
    ( aIdeal0(xJ)
    & ! [X0] :
        ( aElementOf0(X0,xJ)
       => ( ! [X1] :
              ( aElement0(X1)
             => aElementOf0(sdtasdt0(X1,X0),xJ) )
          & ! [X2] :
              ( aElementOf0(X2,xJ)
             => aElementOf0(sdtpldt0(X0,X2),xJ) ) ) )
    & aSet0(xJ)
    & aIdeal0(xI)
    & ! [X3] :
        ( aElementOf0(X3,xI)
       => ( ! [X4] :
              ( aElement0(X4)
             => aElementOf0(sdtasdt0(X4,X3),xI) )
          & ! [X5] :
              ( aElementOf0(X5,xI)
             => aElementOf0(sdtpldt0(X3,X5),xI) ) ) )
    & aSet0(xI) ),
    inference(rectify,[],[f25]) ).

fof(f68,plain,
    ( aIdeal0(xJ)
    & ! [X0] :
        ( ( ! [X1] :
              ( aElementOf0(sdtasdt0(X1,X0),xJ)
              | ~ aElement0(X1) )
          & ! [X2] :
              ( aElementOf0(sdtpldt0(X0,X2),xJ)
              | ~ aElementOf0(X2,xJ) ) )
        | ~ aElementOf0(X0,xJ) )
    & aSet0(xJ)
    & aIdeal0(xI)
    & ! [X3] :
        ( ( ! [X4] :
              ( aElementOf0(sdtasdt0(X4,X3),xI)
              | ~ aElement0(X4) )
          & ! [X5] :
              ( aElementOf0(sdtpldt0(X3,X5),xI)
              | ~ aElementOf0(X5,xI) ) )
        | ~ aElementOf0(X3,xI) )
    & aSet0(xI) ),
    inference(ennf_transformation,[],[f35]) ).

fof(f69,plain,
    ( ~ aElementOf0(sdtpldt0(xl,xn),xJ)
    | ~ aElementOf0(sdtpldt0(xk,xm),xI) ),
    inference(ennf_transformation,[],[f30]) ).

fof(f143,plain,
    ! [X3,X5] :
      ( aElementOf0(sdtpldt0(X3,X5),xI)
      | ~ aElementOf0(X5,xI)
      | ~ aElementOf0(X3,xI) ),
    inference(cnf_transformation,[],[f68]) ).

fof(f147,plain,
    ! [X2,X0] :
      ( aElementOf0(sdtpldt0(X0,X2),xJ)
      | ~ aElementOf0(X2,xJ)
      | ~ aElementOf0(X0,xJ) ),
    inference(cnf_transformation,[],[f68]) ).

fof(f159,plain,
    aElementOf0(xk,xI),
    inference(cnf_transformation,[],[f27]) ).

fof(f160,plain,
    aElementOf0(xl,xJ),
    inference(cnf_transformation,[],[f27]) ).

fof(f162,plain,
    aElementOf0(xm,xI),
    inference(cnf_transformation,[],[f28]) ).

fof(f163,plain,
    aElementOf0(xn,xJ),
    inference(cnf_transformation,[],[f28]) ).

fof(f165,plain,
    ( ~ aElementOf0(sdtpldt0(xl,xn),xJ)
    | ~ aElementOf0(sdtpldt0(xk,xm),xI) ),
    inference(cnf_transformation,[],[f69]) ).

cnf(c_101,plain,
    ( ~ aElementOf0(X0,xJ)
    | ~ aElementOf0(X1,xJ)
    | aElementOf0(sdtpldt0(X0,X1),xJ) ),
    inference(cnf_transformation,[],[f147]) ).

cnf(c_105,plain,
    ( ~ aElementOf0(X0,xI)
    | ~ aElementOf0(X1,xI)
    | aElementOf0(sdtpldt0(X1,X0),xI) ),
    inference(cnf_transformation,[],[f143]) ).

cnf(c_117,plain,
    aElementOf0(xl,xJ),
    inference(cnf_transformation,[],[f160]) ).

cnf(c_118,plain,
    aElementOf0(xk,xI),
    inference(cnf_transformation,[],[f159]) ).

cnf(c_120,plain,
    aElementOf0(xn,xJ),
    inference(cnf_transformation,[],[f163]) ).

cnf(c_121,plain,
    aElementOf0(xm,xI),
    inference(cnf_transformation,[],[f162]) ).

cnf(c_122,negated_conjecture,
    ( ~ aElementOf0(sdtpldt0(xk,xm),xI)
    | ~ aElementOf0(sdtpldt0(xl,xn),xJ) ),
    inference(cnf_transformation,[],[f165]) ).

cnf(c_2941,plain,
    sdtpldt0(xk,xm) = sP0_iProver_def,
    definition ).

cnf(c_2942,plain,
    sdtpldt0(xl,xn) = sP1_iProver_def,
    definition ).

cnf(c_2943,negated_conjecture,
    ( ~ aElementOf0(sP0_iProver_def,xI)
    | ~ aElementOf0(sP1_iProver_def,xJ) ),
    inference(demodulation,[status(thm)],[c_122,c_2942,c_2941]) ).

cnf(c_4579,plain,
    ( ~ aElementOf0(xl,xJ)
    | ~ aElementOf0(xn,xJ)
    | aElementOf0(sP1_iProver_def,xJ) ),
    inference(superposition,[status(thm)],[c_2942,c_101]) ).

cnf(c_4594,plain,
    aElementOf0(sP1_iProver_def,xJ),
    inference(forward_subsumption_resolution,[status(thm)],[c_4579,c_120,c_117]) ).

cnf(c_4611,plain,
    ~ aElementOf0(sP0_iProver_def,xI),
    inference(backward_subsumption_resolution,[status(thm)],[c_2943,c_4594]) ).

cnf(c_4694,plain,
    ( ~ aElementOf0(xk,xI)
    | ~ aElementOf0(xm,xI)
    | aElementOf0(sP0_iProver_def,xI) ),
    inference(superposition,[status(thm)],[c_2941,c_105]) ).

cnf(c_4707,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_4694,c_4611,c_121,c_118]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : RNG088+2 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.12  % Command  : run_iprover %s %d THM
% 0.12/0.33  % Computer : n013.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 : Tue Jun 18 13:32:39 EDT 2024
% 0.12/0.33  % CPUTime  : 
% 0.20/0.46  Running first-order theorem proving
% 0.20/0.46  Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.58/1.14  % SZS status Started for theBenchmark.p
% 3.58/1.14  % SZS status Theorem for theBenchmark.p
% 3.58/1.14  
% 3.58/1.14  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.58/1.14  
% 3.58/1.14  ------  iProver source info
% 3.58/1.14  
% 3.58/1.14  git: date: 2024-06-12 09:56:46 +0000
% 3.58/1.14  git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 3.58/1.14  git: non_committed_changes: false
% 3.58/1.14  
% 3.58/1.14  ------ Parsing...
% 3.58/1.14  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 3.58/1.14  
% 3.58/1.14  ------ 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: 2 0s  sf_e  pe_s  pe_e 
% 3.58/1.14  
% 3.58/1.14  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 3.58/1.14  
% 3.58/1.14  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 3.58/1.14  ------ Proving...
% 3.58/1.14  ------ Problem Properties 
% 3.58/1.14  
% 3.58/1.14  
% 3.58/1.14  clauses                                 70
% 3.58/1.14  conjectures                             1
% 3.58/1.14  EPR                                     17
% 3.58/1.14  Horn                                    61
% 3.58/1.14  unary                                   22
% 3.58/1.14  binary                                  13
% 3.58/1.14  lits                                    189
% 3.58/1.14  lits eq                                 37
% 3.58/1.14  fd_pure                                 0
% 3.58/1.14  fd_pseudo                               0
% 3.58/1.14  fd_cond                                 1
% 3.58/1.14  fd_pseudo_cond                          8
% 3.58/1.14  AC symbols                              0
% 3.58/1.14  
% 3.58/1.14  ------ Schedule dynamic 5 is on 
% 3.58/1.14  
% 3.58/1.14  ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.58/1.14  
% 3.58/1.14  
% 3.58/1.14  ------ 
% 3.58/1.14  Current options:
% 3.58/1.14  ------ 
% 3.58/1.14  
% 3.58/1.14  
% 3.58/1.14  
% 3.58/1.14  
% 3.58/1.14  ------ Proving...
% 3.58/1.14  
% 3.58/1.14  
% 3.58/1.14  % SZS status Theorem for theBenchmark.p
% 3.58/1.14  
% 3.58/1.14  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.58/1.14  
% 3.58/1.14  
%------------------------------------------------------------------------------