TSTP Solution File: COM021+4 by iProver---3.9

View Problem - Process Solution

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

% Computer : n008.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 : Fri May  3 02:10:29 EDT 2024

% Result   : Theorem 0.46s 1.16s
% Output   : CNFRefutation 0.46s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   25 (   9 unt;   0 def)
%            Number of atoms       :  141 (  17 equ)
%            Maximal formula atoms :   15 (   5 avg)
%            Number of connectives :  132 (  16   ~;  35   |;  78   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-3 aty)
%            Number of functors    :    8 (   8 usr;   8 con; 0-0 aty)
%            Number of variables   :   19 (   1 sgn   4   !;  14   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f23,axiom,
    ( aNormalFormOfIn0(xd,xw,xR)
    & ~ ? [X0] : aReductOfIn0(X0,xd,xR)
    & sdtmndtasgtdt0(xw,xR,xd)
    & ( ( sdtmndtplgtdt0(xw,xR,xd)
        & ( ? [X0] :
              ( sdtmndtplgtdt0(X0,xR,xd)
              & aReductOfIn0(X0,xw,xR)
              & aElement0(X0) )
          | aReductOfIn0(xd,xw,xR) ) )
      | xw = xd )
    & aElement0(xd) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__818) ).

fof(f24,axiom,
    ( sdtmndtasgtdt0(xd,xR,xx)
    & ( ( sdtmndtplgtdt0(xd,xR,xx)
        & ( ? [X0] :
              ( sdtmndtplgtdt0(X0,xR,xx)
              & aReductOfIn0(X0,xd,xR)
              & aElement0(X0) )
          | aReductOfIn0(xx,xd,xR) ) )
      | xd = xx )
    & sdtmndtasgtdt0(xb,xR,xx)
    & ( ( sdtmndtplgtdt0(xb,xR,xx)
        & ( ? [X0] :
              ( sdtmndtplgtdt0(X0,xR,xx)
              & aReductOfIn0(X0,xb,xR)
              & aElement0(X0) )
          | aReductOfIn0(xx,xb,xR) ) )
      | xb = xx )
    & aElement0(xx) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__850) ).

fof(f25,conjecture,
    ( sdtmndtasgtdt0(xb,xR,xd)
    | sdtmndtplgtdt0(xb,xR,xd)
    | ? [X0] :
        ( sdtmndtplgtdt0(X0,xR,xd)
        & aReductOfIn0(X0,xb,xR)
        & aElement0(X0) )
    | aReductOfIn0(xd,xb,xR)
    | xb = xd ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).

fof(f26,negated_conjecture,
    ~ ( sdtmndtasgtdt0(xb,xR,xd)
      | sdtmndtplgtdt0(xb,xR,xd)
      | ? [X0] :
          ( sdtmndtplgtdt0(X0,xR,xd)
          & aReductOfIn0(X0,xb,xR)
          & aElement0(X0) )
      | aReductOfIn0(xd,xb,xR)
      | xb = xd ),
    inference(negated_conjecture,[],[f25]) ).

fof(f35,plain,
    ( aNormalFormOfIn0(xd,xw,xR)
    & ~ ? [X0] : aReductOfIn0(X0,xd,xR)
    & sdtmndtasgtdt0(xw,xR,xd)
    & ( ( sdtmndtplgtdt0(xw,xR,xd)
        & ( ? [X1] :
              ( sdtmndtplgtdt0(X1,xR,xd)
              & aReductOfIn0(X1,xw,xR)
              & aElement0(X1) )
          | aReductOfIn0(xd,xw,xR) ) )
      | xw = xd )
    & aElement0(xd) ),
    inference(rectify,[],[f23]) ).

fof(f36,plain,
    ( sdtmndtasgtdt0(xd,xR,xx)
    & ( ( sdtmndtplgtdt0(xd,xR,xx)
        & ( ? [X0] :
              ( sdtmndtplgtdt0(X0,xR,xx)
              & aReductOfIn0(X0,xd,xR)
              & aElement0(X0) )
          | aReductOfIn0(xx,xd,xR) ) )
      | xd = xx )
    & sdtmndtasgtdt0(xb,xR,xx)
    & ( ( sdtmndtplgtdt0(xb,xR,xx)
        & ( ? [X1] :
              ( sdtmndtplgtdt0(X1,xR,xx)
              & aReductOfIn0(X1,xb,xR)
              & aElement0(X1) )
          | aReductOfIn0(xx,xb,xR) ) )
      | xb = xx )
    & aElement0(xx) ),
    inference(rectify,[],[f24]) ).

fof(f61,plain,
    ( aNormalFormOfIn0(xd,xw,xR)
    & ! [X0] : ~ aReductOfIn0(X0,xd,xR)
    & sdtmndtasgtdt0(xw,xR,xd)
    & ( ( sdtmndtplgtdt0(xw,xR,xd)
        & ( ? [X1] :
              ( sdtmndtplgtdt0(X1,xR,xd)
              & aReductOfIn0(X1,xw,xR)
              & aElement0(X1) )
          | aReductOfIn0(xd,xw,xR) ) )
      | xw = xd )
    & aElement0(xd) ),
    inference(ennf_transformation,[],[f35]) ).

fof(f62,plain,
    ( ~ sdtmndtasgtdt0(xb,xR,xd)
    & ~ sdtmndtplgtdt0(xb,xR,xd)
    & ! [X0] :
        ( ~ sdtmndtplgtdt0(X0,xR,xd)
        | ~ aReductOfIn0(X0,xb,xR)
        | ~ aElement0(X0) )
    & ~ aReductOfIn0(xd,xb,xR)
    & xb != xd ),
    inference(ennf_transformation,[],[f26]) ).

fof(f133,plain,
    ( ? [X1] :
        ( sdtmndtplgtdt0(X1,xR,xd)
        & aReductOfIn0(X1,xw,xR)
        & aElement0(X1) )
   => ( sdtmndtplgtdt0(sK33,xR,xd)
      & aReductOfIn0(sK33,xw,xR)
      & aElement0(sK33) ) ),
    introduced(choice_axiom,[]) ).

fof(f134,plain,
    ( aNormalFormOfIn0(xd,xw,xR)
    & ! [X0] : ~ aReductOfIn0(X0,xd,xR)
    & sdtmndtasgtdt0(xw,xR,xd)
    & ( ( sdtmndtplgtdt0(xw,xR,xd)
        & ( ( sdtmndtplgtdt0(sK33,xR,xd)
            & aReductOfIn0(sK33,xw,xR)
            & aElement0(sK33) )
          | aReductOfIn0(xd,xw,xR) ) )
      | xw = xd )
    & aElement0(xd) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK33])],[f61,f133]) ).

fof(f135,plain,
    ( ? [X0] :
        ( sdtmndtplgtdt0(X0,xR,xx)
        & aReductOfIn0(X0,xd,xR)
        & aElement0(X0) )
   => ( sdtmndtplgtdt0(sK34,xR,xx)
      & aReductOfIn0(sK34,xd,xR)
      & aElement0(sK34) ) ),
    introduced(choice_axiom,[]) ).

fof(f136,plain,
    ( ? [X1] :
        ( sdtmndtplgtdt0(X1,xR,xx)
        & aReductOfIn0(X1,xb,xR)
        & aElement0(X1) )
   => ( sdtmndtplgtdt0(sK35,xR,xx)
      & aReductOfIn0(sK35,xb,xR)
      & aElement0(sK35) ) ),
    introduced(choice_axiom,[]) ).

fof(f137,plain,
    ( sdtmndtasgtdt0(xd,xR,xx)
    & ( ( sdtmndtplgtdt0(xd,xR,xx)
        & ( ( sdtmndtplgtdt0(sK34,xR,xx)
            & aReductOfIn0(sK34,xd,xR)
            & aElement0(sK34) )
          | aReductOfIn0(xx,xd,xR) ) )
      | xd = xx )
    & sdtmndtasgtdt0(xb,xR,xx)
    & ( ( sdtmndtplgtdt0(xb,xR,xx)
        & ( ( sdtmndtplgtdt0(sK35,xR,xx)
            & aReductOfIn0(sK35,xb,xR)
            & aElement0(sK35) )
          | aReductOfIn0(xx,xb,xR) ) )
      | xb = xx )
    & aElement0(xx) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK34,sK35])],[f36,f136,f135]) ).

fof(f265,plain,
    ! [X0] : ~ aReductOfIn0(X0,xd,xR),
    inference(cnf_transformation,[],[f134]) ).

fof(f272,plain,
    sdtmndtasgtdt0(xb,xR,xx),
    inference(cnf_transformation,[],[f137]) ).

fof(f274,plain,
    ( aReductOfIn0(sK34,xd,xR)
    | aReductOfIn0(xx,xd,xR)
    | xd = xx ),
    inference(cnf_transformation,[],[f137]) ).

fof(f282,plain,
    ~ sdtmndtasgtdt0(xb,xR,xd),
    inference(cnf_transformation,[],[f62]) ).

cnf(c_171,plain,
    ~ aReductOfIn0(X0,xd,xR),
    inference(cnf_transformation,[],[f265]) ).

cnf(c_181,plain,
    ( xd = xx
    | aReductOfIn0(xx,xd,xR)
    | aReductOfIn0(sK34,xd,xR) ),
    inference(cnf_transformation,[],[f274]) ).

cnf(c_183,plain,
    sdtmndtasgtdt0(xb,xR,xx),
    inference(cnf_transformation,[],[f272]) ).

cnf(c_189,negated_conjecture,
    ~ sdtmndtasgtdt0(xb,xR,xd),
    inference(cnf_transformation,[],[f282]) ).

cnf(c_313,plain,
    ( xd = xx
    | aReductOfIn0(sK34,xd,xR) ),
    inference(backward_subsumption_resolution,[status(thm)],[c_181,c_171]) ).

cnf(c_436,plain,
    xd = xx,
    inference(forward_subsumption_resolution,[status(thm)],[c_313,c_171]) ).

cnf(c_1209,plain,
    sdtmndtasgtdt0(xb,xR,xd),
    inference(light_normalisation,[status(thm)],[c_183,c_436]) ).

cnf(c_1211,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_189,c_1209]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : COM021+4 : TPTP v8.1.2. Released v4.0.0.
% 0.10/0.12  % Command  : run_iprover %s %d THM
% 0.11/0.33  % Computer : n008.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit : 300
% 0.11/0.33  % WCLimit  : 300
% 0.11/0.33  % DateTime : Fri May  3 00:41:43 EDT 2024
% 0.11/0.33  % CPUTime  : 
% 0.18/0.45  Running first-order theorem proving
% 0.18/0.45  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
% 0.46/1.16  % SZS status Started for theBenchmark.p
% 0.46/1.16  % SZS status Theorem for theBenchmark.p
% 0.46/1.16  
% 0.46/1.16  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.46/1.16  
% 0.46/1.16  ------  iProver source info
% 0.46/1.16  
% 0.46/1.16  git: date: 2024-05-02 19:28:25 +0000
% 0.46/1.16  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.46/1.16  git: non_committed_changes: false
% 0.46/1.16  
% 0.46/1.16  ------ Parsing...
% 0.46/1.16  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 0.46/1.16  
% 0.46/1.16  ------ Preprocessing...
% 0.46/1.16  
% 0.46/1.16  % SZS status Theorem for theBenchmark.p
% 0.46/1.16  
% 0.46/1.16  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.46/1.16  
% 0.46/1.16  
%------------------------------------------------------------------------------