%------------------------------------------------------------------------------
% File     : PyRes---1.3
% Problem  : SYN061+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s

% Computer : n007.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  : 600s
% DateTime : Thu Jul 21 11:25:00 EDT 2022

% Result   : Theorem 0.18s 0.50s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named input)

% Comments : 
%------------------------------------------------------------------------------
fof(pel31_2,axiom,
    ? [X] :
      ( big_i(X)
      & big_f(X) ),
    input ).

fof(c8,axiom,
    ? [X4] :
      ( big_i(X4)
      & big_f(X4) ),
    inference(variable_rename,status(thm),[pel31_2]) ).

fof(c9,axiom,
    ( big_i(skolem0001)
    & big_f(skolem0001) ),
    inference(skolemize,status(esa),[c8]) ).

cnf(c11,axiom,
    big_f(skolem0001),
    inference(split_conjunct,status(thm),[c9]) ).

fof(pel31_1,axiom,
    ~ ? [X] :
        ( big_f(X)
        & ( big_g(X)
          | big_h(X) ) ),
    input ).

fof(c12,axiom,
    ! [X] :
      ( ~ big_f(X)
      | ( ~ big_g(X)
        & ~ big_h(X) ) ),
    inference(fof_nnf,status(thm),[pel31_1]) ).

fof(c13,axiom,
    ! [X5] :
      ( ~ big_f(X5)
      | ( ~ big_g(X5)
        & ~ big_h(X5) ) ),
    inference(variable_rename,status(thm),[c12]) ).

fof(c14,axiom,
    ! [X5] :
      ( ( ~ big_f(X5)
        | ~ big_g(X5) )
      & ( ~ big_f(X5)
        | ~ big_h(X5) ) ),
    inference(distribute,status(thm),[c13]) ).

cnf(c16,axiom,
    ( ~ big_f(X9)
    | ~ big_h(X9) ),
    inference(split_conjunct,status(thm),[c14]) ).

cnf(c10,axiom,
    big_i(skolem0001),
    inference(split_conjunct,status(thm),[c9]) ).

fof(pel31,conjecture,
    ? [X] :
      ( big_i(X)
      & big_j(X) ),
    input ).

fof(c0,negated_conjecture,
    ~ ? [X] :
        ( big_i(X)
        & big_j(X) ),
    inference(assume_negation,status(cth),[pel31]) ).

fof(c1,negated_conjecture,
    ! [X] :
      ( ~ big_i(X)
      | ~ big_j(X) ),
    inference(fof_nnf,status(thm),[c0]) ).

fof(c2,negated_conjecture,
    ! [X2] :
      ( ~ big_i(X2)
      | ~ big_j(X2) ),
    inference(variable_rename,status(thm),[c1]) ).

cnf(c3,negated_conjecture,
    ( ~ big_i(X6)
    | ~ big_j(X6) ),
    inference(split_conjunct,status(thm),[c2]) ).

fof(pel31_3,axiom,
    ! [X] :
      ( ~ big_h(X)
     => big_j(X) ),
    input ).

fof(c4,axiom,
    ! [X] :
      ( ~ big_h(X)
     => big_j(X) ),
    inference(fof_simplification,status(thm),[pel31_3]) ).

fof(c5,axiom,
    ! [X] :
      ( big_h(X)
      | big_j(X) ),
    inference(fof_nnf,status(thm),[c4]) ).

fof(c6,axiom,
    ! [X3] :
      ( big_h(X3)
      | big_j(X3) ),
    inference(variable_rename,status(thm),[c5]) ).

cnf(c7,axiom,
    ( big_h(X7)
    | big_j(X7) ),
    inference(split_conjunct,status(thm),[c6]) ).

cnf(c17,plain,
    ( big_h(X10)
    | ~ big_i(X10) ),
    inference(resolution,status(thm),[c7,c3]) ).

cnf(c19,plain,
    big_h(skolem0001),
    inference(resolution,status(thm),[c17,c10]) ).

cnf(c20,plain,
    ~ big_f(skolem0001),
    inference(resolution,status(thm),[c19,c16]) ).

cnf(c21,plain,
    $false,
    inference(resolution,status(thm),[c20,c11]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : SYN061+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.12  % Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.12/0.33  % Computer : n007.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  : 600
% 0.12/0.33  % DateTime : Mon Jul 11 18:55:48 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.50  # Version:  1.3
% 0.18/0.50  # SZS status Theorem
% 0.18/0.50  # SZS output start CNFRefutation
% See solution above
% 0.18/0.50  
% 0.18/0.50  # Initial clauses    : 6
% 0.18/0.50  # Processed clauses  : 9
% 0.18/0.50  # Factors computed   : 0
% 0.18/0.50  # Resolvents computed: 5
% 0.18/0.50  # Tautologies deleted: 0
% 0.18/0.50  # Forward subsumed   : 0
% 0.18/0.50  # Backward subsumed  : 0
% 0.18/0.50  # -------- CPU Time ---------
% 0.18/0.50  # User time          : 0.149 s
% 0.18/0.50  # System time        : 0.016 s
% 0.18/0.50  # Total time         : 0.165 s
%------------------------------------------------------------------------------