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

View Problem - Process Solution

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

% Computer : n022.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 03:33:37 EDT 2024

% Result   : Theorem 0.46s 1.15s
% Output   : CNFRefutation 0.46s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named f17)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    ( ! [X0] :
        ( c
        | p(X0) )
  <=> ( c
      | ! [X0] : p(X0) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

fof(f2,negated_conjecture,
    ~ ( ! [X0] :
          ( c
          | p(X0) )
    <=> ( c
        | ! [X0] : p(X0) ) ),
    inference(negated_conjecture,[],[f1]) ).

fof(f3,plain,
    ~ ( ! [X0] :
          ( c
          | p(X0) )
    <=> ( c
        | ! [X1] : p(X1) ) ),
    inference(rectify,[],[f2]) ).

fof(f4,plain,
    ( ! [X0] :
        ( c
        | p(X0) )
  <~> ( c
      | ! [X1] : p(X1) ) ),
    inference(ennf_transformation,[],[f3]) ).

fof(f5,plain,
    ( ( ( ~ c
        & ? [X1] : ~ p(X1) )
      | ? [X0] :
          ( ~ c
          & ~ p(X0) ) )
    & ( c
      | ! [X1] : p(X1)
      | ! [X0] :
          ( c
          | p(X0) ) ) ),
    inference(nnf_transformation,[],[f4]) ).

fof(f6,plain,
    ( ( ( ~ c
        & ? [X1] : ~ p(X1) )
      | ? [X0] :
          ( ~ c
          & ~ p(X0) ) )
    & ( c
      | ! [X1] : p(X1)
      | ! [X0] :
          ( c
          | p(X0) ) ) ),
    inference(flattening,[],[f5]) ).

fof(f7,plain,
    ( ( ( ~ c
        & ? [X0] : ~ p(X0) )
      | ? [X1] :
          ( ~ c
          & ~ p(X1) ) )
    & ( c
      | ! [X2] : p(X2)
      | ! [X3] :
          ( c
          | p(X3) ) ) ),
    inference(rectify,[],[f6]) ).

fof(f8,plain,
    ( ? [X0] : ~ p(X0)
   => ~ p(sK0) ),
    introduced(choice_axiom,[]) ).

fof(f9,plain,
    ( ? [X1] :
        ( ~ c
        & ~ p(X1) )
   => ( ~ c
      & ~ p(sK1) ) ),
    introduced(choice_axiom,[]) ).

fof(f10,plain,
    ( ( ( ~ c
        & ~ p(sK0) )
      | ( ~ c
        & ~ p(sK1) ) )
    & ( c
      | ! [X2] : p(X2)
      | ! [X3] :
          ( c
          | p(X3) ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f7,f9,f8]) ).

fof(f12,plain,
    ( ~ p(sK0)
    | ~ p(sK1) ),
    inference(cnf_transformation,[],[f10]) ).

cnf(c_49,negated_conjecture,
    ~ c,
    inference(cnf_transformation,[],[f16]) ).

cnf(c_52,negated_conjecture,
    ( ~ p(sK1)
    | ~ p(sK0) ),
    inference(cnf_transformation,[],[f12]) ).

cnf(c_53,negated_conjecture,
    ( p(X0)
    | p(X1)
    | c ),
    inference(cnf_transformation,[],[f17]) ).

cnf(c_54,plain,
    ( p(sK0)
    | c ),
    inference(instantiation,[status(thm)],[c_53]) ).

cnf(c_55,plain,
    ( p(X1)
    | p(X0) ),
    inference(global_subsumption_just,[status(thm)],[c_53,c_49,c_53]) ).

cnf(c_56,negated_conjecture,
    ( p(X0)
    | p(X1) ),
    inference(renaming,[status(thm)],[c_55]) ).

cnf(c_62,negated_conjecture,
    ~ p(sK1),
    inference(global_subsumption_just,[status(thm)],[c_52,c_49,c_54,c_52]) ).

cnf(c_78,negated_conjecture,
    ( p(X0)
    | ~ sP0_iProver_def ),
    inference(splitting,[splitting(split),new_symbols(definition,[sP0_iProver_def])],[c_56]) ).

cnf(c_79,negated_conjecture,
    sP0_iProver_def,
    inference(splitting,[splitting(split),new_symbols(definition,[])],[c_56]) ).

cnf(c_80,negated_conjecture,
    ~ p(sK1),
    inference(demodulation,[status(thm)],[c_62]) ).

cnf(c_81,negated_conjecture,
    sP0_iProver_def,
    inference(demodulation,[status(thm)],[c_79]) ).

cnf(c_83,negated_conjecture,
    ( ~ sP0_iProver_def
    | p(X0) ),
    inference(demodulation,[status(thm)],[c_78]) ).

cnf(c_86,negated_conjecture,
    p(X0),
    inference(global_subsumption_just,[status(thm)],[c_83,c_81,c_83]) ).

cnf(c_88,plain,
    $false,
    inference(resolution,[status(thm)],[c_86,c_80]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : SYN930+1 : TPTP v8.1.2. Released v3.1.0.
% 0.07/0.14  % Command  : run_iprover %s %d THM
% 0.14/0.35  % Computer : n022.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Thu May  2 20:55:42 EDT 2024
% 0.14/0.35  % CPUTime  : 
% 0.21/0.48  Running first-order theorem proving
% 0.21/0.48  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
% 0.46/1.15  % SZS status Started for theBenchmark.p
% 0.46/1.15  % SZS status Theorem for theBenchmark.p
% 0.46/1.15  
% 0.46/1.15  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.46/1.15  
% 0.46/1.15  ------  iProver source info
% 0.46/1.15  
% 0.46/1.15  git: date: 2024-05-02 19:28:25 +0000
% 0.46/1.15  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.46/1.15  git: non_committed_changes: false
% 0.46/1.15  
% 0.46/1.15  ------ Parsing...
% 0.46/1.15  ------ Clausification by vclausify_rel  & Parsing by iProver...------  preprocesses with Option_epr_non_horn_non_eq
% 0.46/1.15  
% 0.46/1.15  
% 0.46/1.15  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  pe_s  pe_e  sf_s  rm: 0 0s  sf_e  pe_s  pe_e 
% 0.46/1.15  
% 0.46/1.15  ------ Preprocessing...------  preprocesses with Option_epr_non_horn_non_eq
% 0.46/1.15   gs_s  sp: 2 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 0.46/1.15  ------ Proving...
% 0.46/1.15  ------ Problem Properties 
% 0.46/1.15  
% 0.46/1.15  
% 0.46/1.15  clauses                                 3
% 0.46/1.15  conjectures                             3
% 0.46/1.15  EPR                                     3
% 0.46/1.15  Horn                                    3
% 0.46/1.15  unary                                   2
% 0.46/1.15  binary                                  1
% 0.46/1.15  lits                                    4
% 0.46/1.15  lits eq                                 0
% 0.46/1.15  fd_pure                                 0
% 0.46/1.15  fd_pseudo                               0
% 0.46/1.15  fd_cond                                 0
% 0.46/1.15  fd_pseudo_cond                          0
% 0.46/1.15  AC symbols                              0
% 0.46/1.15  
% 0.46/1.15  ------ Schedule EPR Horn non eq is on
% 0.46/1.15  
% 0.46/1.15  ------ no equalities: superposition off 
% 0.46/1.15  
% 0.46/1.15  ------ Option_epr_horn Time Limit: Unbounded
% 0.46/1.15  
% 0.46/1.15  
% 0.46/1.15  ------ 
% 0.46/1.15  Current options:
% 0.46/1.15  ------ 
% 0.46/1.15  
% 0.46/1.15  
% 0.46/1.15  
% 0.46/1.15  
% 0.46/1.15  ------ Proving...
% 0.46/1.15  
% 0.46/1.15  
% 0.46/1.15  % SZS status Theorem for theBenchmark.p
% 0.46/1.15  
% 0.46/1.15  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.46/1.15  
% 0.46/1.15  
%------------------------------------------------------------------------------