%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : NUN088+3 : TPTP v7.3.0. Released v7.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : sine.py -e eprover -t %d %s

% Computer : n188.star.cs.uiowa.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory   : 32218.5MB
% OS       : Linux 3.10.0-862.11.6.el7.x86_64
% CPULimit : 300s
% DateTime : Wed Feb 27 14:27:10 EST 2019

% Result   : Theorem 0.07s
% Output   : CNFRefutation 0.07s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   20 (   8 unt;   0 def)
%            Number of atoms       :   43 (   2 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   52 (  29   ~;  17   |;   6   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   27 (   2 sgn  18   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(5,axiom,
    ! [X14,X15] :
      ( ! [X16] :
          ( ~ r1(X16)
          | ~ equal(X16,X15) )
      | ~ r2(X14,X15) ),
    file('/export/starexec/sandbox/tmp/tmp16zAr5/sel_theBenchmark.p_1',axiom_7a) ).

fof(6,conjecture,
    ! [X17] :
      ( ! [X3] :
          ( ~ equal(X17,X3)
          | ~ r2(X17,X3) )
      | ~ r1(X17) ),
    file('/export/starexec/sandbox/tmp/tmp16zAr5/sel_theBenchmark.p_1',zerouneqone2) ).

fof(7,negated_conjecture,
    ~ ! [X17] :
        ( ! [X3] :
            ( ~ equal(X17,X3)
            | ~ r2(X17,X3) )
        | ~ r1(X17) ),
    inference(assume_negation,[status(cth)],[6]) ).

fof(11,plain,
    ! [X14,X15] :
      ( ! [X16] :
          ( ~ r1(X16)
          | ~ equal(X16,X15) )
      | ~ r2(X14,X15) ),
    inference(fof_simplification,[status(thm)],[5,theory(equality)]) ).

fof(12,negated_conjecture,
    ~ ! [X17] :
        ( ! [X3] :
            ( ~ equal(X17,X3)
            | ~ r2(X17,X3) )
        | ~ r1(X17) ),
    inference(fof_simplification,[status(thm)],[7,theory(equality)]) ).

fof(37,plain,
    ! [X17,X18] :
      ( ! [X19] :
          ( ~ r1(X19)
          | ~ equal(X19,X18) )
      | ~ r2(X17,X18) ),
    inference(variable_rename,[status(thm)],[11]) ).

fof(38,plain,
    ! [X17,X18,X19] :
      ( ~ r1(X19)
      | ~ equal(X19,X18)
      | ~ r2(X17,X18) ),
    inference(shift_quantors,[status(thm)],[37]) ).

cnf(39,plain,
    ( ~ r2(X1,X2)
    | X3 != X2
    | ~ r1(X3) ),
    inference(split_conjunct,[status(thm)],[38]) ).

fof(40,negated_conjecture,
    ? [X17] :
      ( ? [X3] :
          ( equal(X17,X3)
          & r2(X17,X3) )
      & r1(X17) ),
    inference(fof_nnf,[status(thm)],[12]) ).

fof(41,negated_conjecture,
    ? [X18] :
      ( ? [X19] :
          ( equal(X18,X19)
          & r2(X18,X19) )
      & r1(X18) ),
    inference(variable_rename,[status(thm)],[40]) ).

fof(42,negated_conjecture,
    ( equal(esk6_0,esk7_0)
    & r2(esk6_0,esk7_0)
    & r1(esk6_0) ),
    inference(skolemize,[status(esa)],[41]) ).

cnf(43,negated_conjecture,
    r1(esk6_0),
    inference(split_conjunct,[status(thm)],[42]) ).

cnf(44,negated_conjecture,
    r2(esk6_0,esk7_0),
    inference(split_conjunct,[status(thm)],[42]) ).

cnf(45,negated_conjecture,
    esk6_0 = esk7_0,
    inference(split_conjunct,[status(thm)],[42]) ).

cnf(46,negated_conjecture,
    r2(esk6_0,esk6_0),
    inference(rw,[status(thm)],[44,45,theory(equality)]) ).

cnf(52,plain,
    ( ~ r2(X1,X2)
    | ~ r1(X2) ),
    inference(er,[status(thm)],[39,theory(equality)]) ).

cnf(65,negated_conjecture,
    ~ r1(esk6_0),
    inference(spm,[status(thm)],[52,46,theory(equality)]) ).

cnf(69,negated_conjecture,
    $false,
    inference(rw,[status(thm)],[65,43,theory(equality)]) ).

cnf(70,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[69,theory(equality)]) ).

cnf(71,negated_conjecture,
    $false,
    70,
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : NUN088+3 : TPTP v7.3.0. Released v7.3.0.
% 0.00/0.05  % Command  : sine.py -e eprover -t %d %s
% 0.03/0.24  % Computer : n188.star.cs.uiowa.edu
% 0.03/0.24  % Model    : x86_64 x86_64
% 0.03/0.24  % CPU      : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.03/0.24  % Memory   : 32218.5MB
% 0.03/0.24  % OS       : Linux 3.10.0-862.11.6.el7.x86_64
% 0.03/0.24  % CPULimit : 300
% 0.03/0.24  % DateTime : Sun Feb 24 02:18:31 CST 2019
% 0.03/0.25  % CPUTime  : 
% 0.07/0.29  % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.29  --creating new selector for [NUM008+0.ax]
% 0.07/0.37  -running prover on /export/starexec/sandbox/tmp/tmp16zAr5/sel_theBenchmark.p_1 with time limit 29
% 0.07/0.37  -running prover with command ['/export/starexec/sandbox/solver/bin/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=29', '/export/starexec/sandbox/tmp/tmp16zAr5/sel_theBenchmark.p_1']
% 0.07/0.37  -prover status Theorem
% 0.07/0.37  Problem theBenchmark.p solved in phase 0.
% 0.07/0.37  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.37  % SZS status Ended for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.38  Solved 1 out of 1.
% 0.07/0.38  # Problem is unsatisfiable (or provable), constructing proof object
% 0.07/0.38  # SZS status Theorem
% 0.07/0.38  # SZS output start CNFRefutation.
% See solution above
% 0.07/0.38  # SZS output end CNFRefutation
%------------------------------------------------------------------------------