%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : NUM395+1 : TPTP v7.0.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : Source/sine.py -e eprover -t %d %s

% Computer : n073.star.cs.uiowa.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory   : 32218.625MB
% OS       : Linux 3.10.0-693.2.2.el7.x86_64
% CPULimit : 300s
% DateTime : Mon Jan  8 15:21:14 EST 2018

% Result   : Theorem 0.06s
% Output   : CNFRefutation 0.06s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   17 (   9 unt;   0 def)
%            Number of atoms       :   40 (   0 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   39 (  16   ~;  14   |;   8   &)
%                                         (   1 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-1 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :    5 (   0 sgn   4   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(6,axiom,
    ! [X1] :
      ( ordinal(X1)
    <=> ( epsilon_transitive(X1)
        & epsilon_connected(X1) ) ),
    file('/export/starexec/sandbox2/tmp/tmpMvpOUt/sel_theBenchmark.p_1',d4_ordinal1) ).

fof(16,axiom,
    ( epsilon_transitive(empty_set)
    & epsilon_connected(empty_set) ),
    file('/export/starexec/sandbox2/tmp/tmpMvpOUt/sel_theBenchmark.p_1',l18_ordinal1) ).

fof(19,conjecture,
    ordinal(empty_set),
    file('/export/starexec/sandbox2/tmp/tmpMvpOUt/sel_theBenchmark.p_1',t27_ordinal1) ).

fof(30,negated_conjecture,
    ~ ordinal(empty_set),
    inference(assume_negation,[status(cth)],[19]) ).

fof(34,negated_conjecture,
    ~ ordinal(empty_set),
    inference(fof_simplification,[status(thm)],[30,theory(equality)]) ).

fof(54,plain,
    ! [X1] :
      ( ( ~ ordinal(X1)
        | ( epsilon_transitive(X1)
          & epsilon_connected(X1) ) )
      & ( ~ epsilon_transitive(X1)
        | ~ epsilon_connected(X1)
        | ordinal(X1) ) ),
    inference(fof_nnf,[status(thm)],[6]) ).

fof(55,plain,
    ! [X2] :
      ( ( ~ ordinal(X2)
        | ( epsilon_transitive(X2)
          & epsilon_connected(X2) ) )
      & ( ~ epsilon_transitive(X2)
        | ~ epsilon_connected(X2)
        | ordinal(X2) ) ),
    inference(variable_rename,[status(thm)],[54]) ).

fof(56,plain,
    ! [X2] :
      ( ( epsilon_transitive(X2)
        | ~ ordinal(X2) )
      & ( epsilon_connected(X2)
        | ~ ordinal(X2) )
      & ( ~ epsilon_transitive(X2)
        | ~ epsilon_connected(X2)
        | ordinal(X2) ) ),
    inference(distribute,[status(thm)],[55]) ).

cnf(57,plain,
    ( ordinal(X1)
    | ~ epsilon_connected(X1)
    | ~ epsilon_transitive(X1) ),
    inference(split_conjunct,[status(thm)],[56]) ).

cnf(96,plain,
    epsilon_connected(empty_set),
    inference(split_conjunct,[status(thm)],[16]) ).

cnf(97,plain,
    epsilon_transitive(empty_set),
    inference(split_conjunct,[status(thm)],[16]) ).

cnf(106,negated_conjecture,
    ~ ordinal(empty_set),
    inference(split_conjunct,[status(thm)],[34]) ).

cnf(144,plain,
    ( ordinal(empty_set)
    | ~ epsilon_transitive(empty_set) ),
    inference(spm,[status(thm)],[57,96,theory(equality)]) ).

cnf(147,plain,
    ( ordinal(empty_set)
    | $false ),
    inference(rw,[status(thm)],[144,97,theory(equality)]) ).

cnf(148,plain,
    ordinal(empty_set),
    inference(cn,[status(thm)],[147,theory(equality)]) ).

cnf(149,plain,
    $false,
    inference(sr,[status(thm)],[148,106,theory(equality)]) ).

cnf(150,plain,
    $false,
    149,
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM395+1 : TPTP v7.0.0. Released v3.2.0.
% 0.00/0.04  % Command  : Source/sine.py -e eprover -t %d %s
% 0.02/0.23  % Computer : n073.star.cs.uiowa.edu
% 0.02/0.23  % Model    : x86_64 x86_64
% 0.02/0.23  % CPU      : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.02/0.23  % Memory   : 32218.625MB
% 0.02/0.23  % OS       : Linux 3.10.0-693.2.2.el7.x86_64
% 0.02/0.23  % CPULimit : 300
% 0.02/0.23  % DateTime : Mon Jan  8 08:49:12 CST 2018
% 0.02/0.23  % CPUTime  : 
% 0.06/0.28  % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.28  --creating new selector for []
% 0.06/0.34  -running prover on /export/starexec/sandbox2/tmp/tmpMvpOUt/sel_theBenchmark.p_1 with time limit 29
% 0.06/0.34  -running prover with command ['/export/starexec/sandbox2/solver/bin/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=29', '/export/starexec/sandbox2/tmp/tmpMvpOUt/sel_theBenchmark.p_1']
% 0.06/0.34  -prover status Theorem
% 0.06/0.34  Problem theBenchmark.p solved in phase 0.
% 0.06/0.34  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.34  % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.35  Solved 1 out of 1.
% 0.06/0.35  # Problem is unsatisfiable (or provable), constructing proof object
% 0.06/0.35  # SZS status Theorem
% 0.06/0.35  # SZS output start CNFRefutation.
% See solution above
% 0.06/0.35  # SZS output end CNFRefutation
%------------------------------------------------------------------------------