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

% Computer : n009.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:28:43 EDT 2024

% Result   : Theorem 0.91s 1.23s
% Output   : CNFRefutation 0.91s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named f20)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    ( ( ( r
        & q )
      | p )
  <=> ( ( r
        | p )
      & ( q
        | p ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel13) ).

fof(f2,negated_conjecture,
    ~ ( ( ( r
          & q )
        | p )
    <=> ( ( r
          | p )
        & ( q
          | p ) ) ),
    inference(negated_conjecture,[],[f1]) ).

fof(f3,plain,
    ( ( ( r
        & q )
      | p )
  <~> ( ( r
        | p )
      & ( q
        | p ) ) ),
    inference(ennf_transformation,[],[f2]) ).

fof(f4,plain,
    ( sP0
  <=> ( ( r
        | p )
      & ( q
        | p ) ) ),
    introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).

fof(f5,plain,
    ( ( ( r
        & q )
      | p )
  <~> sP0 ),
    inference(definition_folding,[],[f3,f4]) ).

fof(f6,plain,
    ( ( sP0
      | ( ~ r
        & ~ p )
      | ( ~ q
        & ~ p ) )
    & ( ( ( r
          | p )
        & ( q
          | p ) )
      | ~ sP0 ) ),
    inference(nnf_transformation,[],[f4]) ).

fof(f7,plain,
    ( ( sP0
      | ( ~ r
        & ~ p )
      | ( ~ q
        & ~ p ) )
    & ( ( ( r
          | p )
        & ( q
          | p ) )
      | ~ sP0 ) ),
    inference(flattening,[],[f6]) ).

fof(f8,plain,
    ( ( ~ sP0
      | ( ( ~ r
          | ~ q )
        & ~ p ) )
    & ( sP0
      | ( r
        & q )
      | p ) ),
    inference(nnf_transformation,[],[f5]) ).

fof(f9,plain,
    ( ( ~ sP0
      | ( ( ~ r
          | ~ q )
        & ~ p ) )
    & ( sP0
      | ( r
        & q )
      | p ) ),
    inference(flattening,[],[f8]) ).

fof(f10,plain,
    ( q
    | p
    | ~ sP0 ),
    inference(cnf_transformation,[],[f7]) ).

fof(f11,plain,
    ( r
    | p
    | ~ sP0 ),
    inference(cnf_transformation,[],[f7]) ).

fof(f15,plain,
    ( sP0
    | ~ r
    | ~ q ),
    inference(cnf_transformation,[],[f7]) ).

fof(f16,plain,
    ( sP0
    | q
    | p ),
    inference(cnf_transformation,[],[f9]) ).

fof(f17,plain,
    ( sP0
    | r
    | p ),
    inference(cnf_transformation,[],[f9]) ).

fof(f18,plain,
    ( ~ sP0
    | ~ p ),
    inference(cnf_transformation,[],[f9]) ).

fof(f19,plain,
    ( ~ sP0
    | ~ r
    | ~ q ),
    inference(cnf_transformation,[],[f9]) ).

cnf(c_49,plain,
    ( ~ r
    | ~ q
    | sP0 ),
    inference(cnf_transformation,[],[f15]) ).

cnf(c_52,plain,
    ( ~ p
    | sP0 ),
    inference(cnf_transformation,[],[f20]) ).

cnf(c_53,plain,
    ( ~ sP0
    | r
    | p ),
    inference(cnf_transformation,[],[f11]) ).

cnf(c_54,plain,
    ( ~ sP0
    | q
    | p ),
    inference(cnf_transformation,[],[f10]) ).

cnf(c_55,negated_conjecture,
    ( ~ sP0
    | ~ r
    | ~ q ),
    inference(cnf_transformation,[],[f19]) ).

cnf(c_56,negated_conjecture,
    ( ~ sP0
    | ~ p ),
    inference(cnf_transformation,[],[f18]) ).

cnf(c_57,negated_conjecture,
    ( sP0
    | r
    | p ),
    inference(cnf_transformation,[],[f17]) ).

cnf(c_58,negated_conjecture,
    ( sP0
    | q
    | p ),
    inference(cnf_transformation,[],[f16]) ).

cnf(c_59,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_55,c_49,c_53,c_54,c_56,c_52,c_57,c_58]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : SYN045+1 : TPTP v8.1.2. Released v2.0.0.
% 0.10/0.13  % Command  : run_iprover %s %d THM
% 0.14/0.34  % Computer : n009.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 300
% 0.14/0.34  % DateTime : Thu May  2 20:45:26 EDT 2024
% 0.14/0.35  % CPUTime  : 
% 0.21/0.47  Running first-order theorem proving
% 0.21/0.47  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.91/1.23  % SZS status Started for theBenchmark.p
% 0.91/1.23  % SZS status Theorem for theBenchmark.p
% 0.91/1.23  
% 0.91/1.23  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.91/1.23  
% 0.91/1.23  ------  iProver source info
% 0.91/1.23  
% 0.91/1.23  git: date: 2024-05-02 19:28:25 +0000
% 0.91/1.23  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.91/1.23  git: non_committed_changes: false
% 0.91/1.23  
% 0.91/1.23  ------ Parsing...
% 0.91/1.23  ------ Clausification by vclausify_rel  & Parsing by iProver...------  preprocesses with Option_epr_non_horn_non_eq
% 0.91/1.23  
% 0.91/1.23  
% 0.91/1.23  ------ Preprocessing...
% 0.91/1.23  
% 0.91/1.23  % SZS status Theorem for theBenchmark.p
% 0.91/1.23  
% 0.91/1.23  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.91/1.23  
% 0.91/1.23  
%------------------------------------------------------------------------------