TSTP Solution File: GEO498+1 by SInE---0.4

View Problem - Process Solution

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

% Computer : n107.star.cs.uiowa.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory   : 32218.75MB
% OS       : Linux 3.10.0-327.36.3.el7.x86_64
% CPULimit : 300s
% DateTime : Fri Jan 20 10:18:34 EST 2017

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

% Comments : 
%------------------------------------------------------------------------------
fof(40,conjecture,
    ! [X12,X16,X18,X17] :
      ( ~ equal(s(X12,X16),X18)
      | ~ equal(s(X12,X17),X18)
      | equal(X16,X17) ),
    file('/export/starexec/sandbox2/tmp/tmpUzkVl3/sel_theBenchmark.p_1',aSatz7_8) ).

fof(43,axiom,
    ! [X12,X16] : equal(s(X12,s(X12,X16)),X16),
    file('/export/starexec/sandbox2/tmp/tmpUzkVl3/sel_theBenchmark.p_1',aSatz7_7) ).

fof(110,negated_conjecture,
    ~ ! [X12,X16,X18,X17] :
        ( ~ equal(s(X12,X16),X18)
        | ~ equal(s(X12,X17),X18)
        | equal(X16,X17) ),
    inference(assume_negation,[status(cth)],[40]) ).

fof(296,negated_conjecture,
    ? [X12,X16,X18,X17] :
      ( equal(s(X12,X16),X18)
      & equal(s(X12,X17),X18)
      & ~ equal(X16,X17) ),
    inference(fof_nnf,[status(thm)],[110]) ).

fof(297,negated_conjecture,
    ? [X19,X20,X21,X22] :
      ( equal(s(X19,X20),X21)
      & equal(s(X19,X22),X21)
      & ~ equal(X20,X22) ),
    inference(variable_rename,[status(thm)],[296]) ).

fof(298,negated_conjecture,
    ( equal(s(esk1_0,esk2_0),esk3_0)
    & equal(s(esk1_0,esk4_0),esk3_0)
    & ~ equal(esk2_0,esk4_0) ),
    inference(skolemize,[status(esa)],[297]) ).

cnf(299,negated_conjecture,
    esk2_0 != esk4_0,
    inference(split_conjunct,[status(thm)],[298]) ).

cnf(300,negated_conjecture,
    s(esk1_0,esk4_0) = esk3_0,
    inference(split_conjunct,[status(thm)],[298]) ).

cnf(301,negated_conjecture,
    s(esk1_0,esk2_0) = esk3_0,
    inference(split_conjunct,[status(thm)],[298]) ).

fof(307,plain,
    ! [X17,X18] : equal(s(X17,s(X17,X18)),X18),
    inference(variable_rename,[status(thm)],[43]) ).

cnf(308,plain,
    s(X1,s(X1,X2)) = X2,
    inference(split_conjunct,[status(thm)],[307]) ).

cnf(470,negated_conjecture,
    s(esk1_0,esk3_0) = esk2_0,
    inference(spm,[status(thm)],[308,301,theory(equality)]) ).

cnf(471,negated_conjecture,
    s(esk1_0,esk3_0) = esk4_0,
    inference(spm,[status(thm)],[308,300,theory(equality)]) ).

cnf(997,negated_conjecture,
    esk2_0 = esk4_0,
    inference(rw,[status(thm)],[471,470,theory(equality)]) ).

cnf(998,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[997,299,theory(equality)]) ).

cnf(999,negated_conjecture,
    $false,
    998,
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GEO498+1 : TPTP v7.0.0. Released v7.0.0.
% 0.00/0.04  % Command  : Source/sine.py -e eprover -t %d %s
% 0.02/0.35  % Computer : n107.star.cs.uiowa.edu
% 0.02/0.35  % Model    : x86_64 x86_64
% 0.02/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.02/0.35  % Memory   : 32218.75MB
% 0.02/0.35  % OS       : Linux 3.10.0-327.36.3.el7.x86_64
% 0.02/0.35  % CPULimit : 300
% 0.02/0.35  % DateTime : Fri Jan 20 05:32:48 CST 2017
% 0.02/0.35  % CPUTime  : 
% 0.02/0.40  % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.02/0.41  --creating new selector for [GEO011+0.ax]
% 0.06/0.50  -running prover on /export/starexec/sandbox2/tmp/tmpUzkVl3/sel_theBenchmark.p_1 with time limit 29
% 0.06/0.50  -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/tmpUzkVl3/sel_theBenchmark.p_1']
% 0.06/0.50  -prover status Theorem
% 0.06/0.50  Problem theBenchmark.p solved in phase 0.
% 0.06/0.50  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.50  % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.51  Solved 1 out of 1.
% 0.06/0.51  # Problem is unsatisfiable (or provable), constructing proof object
% 0.06/0.51  # SZS status Theorem
% 0.06/0.51  # SZS output start CNFRefutation.
% See solution above
% 0.06/0.51  # SZS output end CNFRefutation
%------------------------------------------------------------------------------