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

View Problem - Process Solution

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

% Computer : n004.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:35 EST 2017

% Result   : Theorem 2.23s
% Output   : CNFRefutation 2.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   18
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   60 (  25 unt;   0 def)
%            Number of atoms       :  119 (   9 equ)
%            Maximal formula atoms :    7 (   1 avg)
%            Number of connectives :  113 (  54   ~;  50   |;   9   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-4 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :  144 (   0 sgn  87   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(6,axiom,
    ! [X1,X2,X5,X7,X10,X11] :
      ( ~ s_e(X1,X2,X5,X7)
      | ~ s_e(X1,X2,X10,X11)
      | s_e(X5,X7,X10,X11) ),
    file('/export/starexec/sandbox/tmp/tmpQJhl5i/sel_theBenchmark.p_1',aA2) ).

fof(19,axiom,
    ! [X16,X17,X12] : s_e(X16,X17,s(X12,X16),s(X12,X17)),
    file('/export/starexec/sandbox/tmp/tmpQJhl5i/sel_theBenchmark.p_1',aSatz7_13) ).

fof(25,axiom,
    ! [X16,X12] : s_m(X16,X12,s(X12,X16)),
    file('/export/starexec/sandbox/tmp/tmpQJhl5i/sel_theBenchmark.p_1',aSatz7_4a) ).

fof(29,axiom,
    ! [X12,X16] :
      ( ~ equal(s(X12,X16),X16)
      | equal(X16,X12) ),
    file('/export/starexec/sandbox/tmp/tmpQJhl5i/sel_theBenchmark.p_1',aSatz7_10a) ).

fof(33,axiom,
    ! [X12,X13,X14,X15] :
      ( ~ s_e(X12,X13,X14,X15)
      | s_e(X13,X12,X15,X14) ),
    file('/export/starexec/sandbox/tmp/tmpQJhl5i/sel_theBenchmark.p_1',aSatz2_14) ).

fof(42,conjecture,
    ! [X12,X13,X16] :
      ( ~ equal(s(X12,s(X13,X16)),s(X13,s(X12,X16)))
      | equal(X12,X13) ),
    file('/export/starexec/sandbox/tmp/tmpQJhl5i/sel_theBenchmark.p_1',aSatz7_19) ).

fof(49,axiom,
    ! [X12,X16] : equal(s(X12,s(X12,X16)),X16),
    file('/export/starexec/sandbox/tmp/tmpQJhl5i/sel_theBenchmark.p_1',aSatz7_7) ).

fof(92,axiom,
    ! [X12,X20,X13] :
      ( ( ~ s_m(X12,X20,X13)
        | s_t(X12,X20,X13) )
      & ( ~ s_m(X12,X20,X13)
        | s_e(X20,X12,X20,X13) )
      & ( ~ s_t(X12,X20,X13)
        | ~ s_e(X20,X12,X20,X13)
        | s_m(X12,X20,X13) ) ),
    file('/export/starexec/sandbox/tmp/tmpQJhl5i/sel_theBenchmark.p_1',d_Defn7_1) ).

fof(99,axiom,
    ! [X16,X17,X18,X12] :
      ( s_t(X16,X17,X18)
      | ~ s_t(s(X12,X16),s(X12,X17),s(X12,X18)) ),
    file('/export/starexec/sandbox/tmp/tmpQJhl5i/sel_theBenchmark.p_1',aSatz7_15b) ).

fof(103,axiom,
    ! [X16,X12,X17,X13] :
      ( ~ s_m(X16,X12,X17)
      | ~ s_m(X16,X13,X17)
      | equal(X12,X13) ),
    file('/export/starexec/sandbox/tmp/tmpQJhl5i/sel_theBenchmark.p_1',aSatz7_17) ).

fof(121,negated_conjecture,
    ~ ! [X12,X13,X16] :
        ( ~ equal(s(X12,s(X13,X16)),s(X13,s(X12,X16)))
        | equal(X12,X13) ),
    inference(assume_negation,[status(cth)],[42]) ).

fof(125,plain,
    ! [X1,X2,X5,X7,X10,X11] :
      ( ~ s_e(X1,X2,X5,X7)
      | ~ s_e(X1,X2,X10,X11)
      | s_e(X5,X7,X10,X11) ),
    inference(fof_simplification,[status(thm)],[6,theory(equality)]) ).

fof(142,plain,
    ! [X12,X13,X14,X15] :
      ( ~ s_e(X12,X13,X14,X15)
      | s_e(X13,X12,X15,X14) ),
    inference(fof_simplification,[status(thm)],[33,theory(equality)]) ).

fof(189,plain,
    ! [X12,X20,X13] :
      ( ( ~ s_m(X12,X20,X13)
        | s_t(X12,X20,X13) )
      & ( ~ s_m(X12,X20,X13)
        | s_e(X20,X12,X20,X13) )
      & ( ~ s_t(X12,X20,X13)
        | ~ s_e(X20,X12,X20,X13)
        | s_m(X12,X20,X13) ) ),
    inference(fof_simplification,[status(thm)],[92,theory(equality)]) ).

fof(195,plain,
    ! [X16,X17,X18,X12] :
      ( s_t(X16,X17,X18)
      | ~ s_t(s(X12,X16),s(X12,X17),s(X12,X18)) ),
    inference(fof_simplification,[status(thm)],[99,theory(equality)]) ).

fof(197,plain,
    ! [X16,X12,X17,X13] :
      ( ~ s_m(X16,X12,X17)
      | ~ s_m(X16,X13,X17)
      | equal(X12,X13) ),
    inference(fof_simplification,[status(thm)],[103,theory(equality)]) ).

fof(223,plain,
    ! [X12,X13,X14,X15,X16,X17] :
      ( ~ s_e(X12,X13,X14,X15)
      | ~ s_e(X12,X13,X16,X17)
      | s_e(X14,X15,X16,X17) ),
    inference(variable_rename,[status(thm)],[125]) ).

cnf(224,plain,
    ( s_e(X1,X2,X3,X4)
    | ~ s_e(X5,X6,X3,X4)
    | ~ s_e(X5,X6,X1,X2) ),
    inference(split_conjunct,[status(thm)],[223]) ).

fof(257,plain,
    ! [X18,X19,X20] : s_e(X18,X19,s(X20,X18),s(X20,X19)),
    inference(variable_rename,[status(thm)],[19]) ).

cnf(258,plain,
    s_e(X1,X2,s(X3,X1),s(X3,X2)),
    inference(split_conjunct,[status(thm)],[257]) ).

fof(270,plain,
    ! [X17,X18] : s_m(X17,X18,s(X18,X17)),
    inference(variable_rename,[status(thm)],[25]) ).

cnf(271,plain,
    s_m(X1,X2,s(X2,X1)),
    inference(split_conjunct,[status(thm)],[270]) ).

fof(278,plain,
    ! [X17,X18] :
      ( ~ equal(s(X17,X18),X18)
      | equal(X18,X17) ),
    inference(variable_rename,[status(thm)],[29]) ).

cnf(279,plain,
    ( X1 = X2
    | s(X2,X1) != X1 ),
    inference(split_conjunct,[status(thm)],[278]) ).

fof(292,plain,
    ! [X16,X17,X18,X19] :
      ( ~ s_e(X16,X17,X18,X19)
      | s_e(X17,X16,X19,X18) ),
    inference(variable_rename,[status(thm)],[142]) ).

cnf(293,plain,
    ( s_e(X1,X2,X3,X4)
    | ~ s_e(X2,X1,X4,X3) ),
    inference(split_conjunct,[status(thm)],[292]) ).

fof(316,negated_conjecture,
    ? [X12,X13,X16] :
      ( equal(s(X12,s(X13,X16)),s(X13,s(X12,X16)))
      & ~ equal(X12,X13) ),
    inference(fof_nnf,[status(thm)],[121]) ).

fof(317,negated_conjecture,
    ? [X17,X18,X19] :
      ( equal(s(X17,s(X18,X19)),s(X18,s(X17,X19)))
      & ~ equal(X17,X18) ),
    inference(variable_rename,[status(thm)],[316]) ).

fof(318,negated_conjecture,
    ( equal(s(esk1_0,s(esk2_0,esk3_0)),s(esk2_0,s(esk1_0,esk3_0)))
    & ~ equal(esk1_0,esk2_0) ),
    inference(skolemize,[status(esa)],[317]) ).

cnf(319,negated_conjecture,
    esk1_0 != esk2_0,
    inference(split_conjunct,[status(thm)],[318]) ).

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

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

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

fof(438,plain,
    ! [X21,X22,X23] :
      ( ( ~ s_m(X21,X22,X23)
        | s_t(X21,X22,X23) )
      & ( ~ s_m(X21,X22,X23)
        | s_e(X22,X21,X22,X23) )
      & ( ~ s_t(X21,X22,X23)
        | ~ s_e(X22,X21,X22,X23)
        | s_m(X21,X22,X23) ) ),
    inference(variable_rename,[status(thm)],[189]) ).

cnf(439,plain,
    ( s_m(X1,X2,X3)
    | ~ s_e(X2,X1,X2,X3)
    | ~ s_t(X1,X2,X3) ),
    inference(split_conjunct,[status(thm)],[438]) ).

cnf(440,plain,
    ( s_e(X1,X2,X1,X3)
    | ~ s_m(X2,X1,X3) ),
    inference(split_conjunct,[status(thm)],[438]) ).

cnf(441,plain,
    ( s_t(X1,X2,X3)
    | ~ s_m(X1,X2,X3) ),
    inference(split_conjunct,[status(thm)],[438]) ).

fof(456,plain,
    ! [X19,X20,X21,X22] :
      ( s_t(X19,X20,X21)
      | ~ s_t(s(X22,X19),s(X22,X20),s(X22,X21)) ),
    inference(variable_rename,[status(thm)],[195]) ).

cnf(457,plain,
    ( s_t(X2,X3,X4)
    | ~ s_t(s(X1,X2),s(X1,X3),s(X1,X4)) ),
    inference(split_conjunct,[status(thm)],[456]) ).

fof(464,plain,
    ! [X18,X19,X20,X21] :
      ( ~ s_m(X18,X19,X20)
      | ~ s_m(X18,X21,X20)
      | equal(X19,X21) ),
    inference(variable_rename,[status(thm)],[197]) ).

cnf(465,plain,
    ( X1 = X2
    | ~ s_m(X3,X2,X4)
    | ~ s_m(X3,X1,X4) ),
    inference(split_conjunct,[status(thm)],[464]) ).

cnf(527,negated_conjecture,
    s_m(s(esk2_0,esk3_0),esk1_0,s(esk2_0,s(esk1_0,esk3_0))),
    inference(spm,[status(thm)],[271,320,theory(equality)]) ).

cnf(533,plain,
    s_e(s(X1,X2),X3,X2,s(X1,X3)),
    inference(spm,[status(thm)],[258,335,theory(equality)]) ).

cnf(596,plain,
    ( X1 = X2
    | ~ s_m(X3,X1,s(X2,X3)) ),
    inference(spm,[status(thm)],[465,271,theory(equality)]) ).

cnf(658,plain,
    ( s_t(X1,s(X2,X3),X4)
    | ~ s_t(s(X2,X1),X3,s(X2,X4)) ),
    inference(spm,[status(thm)],[457,335,theory(equality)]) ).

cnf(1766,negated_conjecture,
    s_t(s(esk2_0,esk3_0),esk1_0,s(esk2_0,s(esk1_0,esk3_0))),
    inference(spm,[status(thm)],[441,527,theory(equality)]) ).

cnf(1768,negated_conjecture,
    s_e(esk1_0,s(esk2_0,esk3_0),esk1_0,s(esk2_0,s(esk1_0,esk3_0))),
    inference(spm,[status(thm)],[440,527,theory(equality)]) ).

cnf(1830,plain,
    ( s_e(X1,X2,X3,s(X4,X5))
    | ~ s_e(s(X4,X3),X5,X1,X2) ),
    inference(spm,[status(thm)],[224,533,theory(equality)]) ).

cnf(2299,negated_conjecture,
    s_e(s(esk2_0,esk3_0),esk1_0,s(esk2_0,s(esk1_0,esk3_0)),esk1_0),
    inference(spm,[status(thm)],[293,1768,theory(equality)]) ).

cnf(4591,negated_conjecture,
    s_t(esk3_0,s(esk2_0,esk1_0),s(esk1_0,esk3_0)),
    inference(spm,[status(thm)],[658,1766,theory(equality)]) ).

cnf(67329,negated_conjecture,
    s_e(s(esk2_0,s(esk1_0,esk3_0)),esk1_0,esk3_0,s(esk2_0,esk1_0)),
    inference(spm,[status(thm)],[1830,2299,theory(equality)]) ).

cnf(67584,negated_conjecture,
    s_e(esk3_0,s(esk2_0,esk1_0),s(esk1_0,esk3_0),s(esk2_0,esk1_0)),
    inference(spm,[status(thm)],[1830,67329,theory(equality)]) ).

cnf(69631,negated_conjecture,
    s_e(s(esk2_0,esk1_0),esk3_0,s(esk2_0,esk1_0),s(esk1_0,esk3_0)),
    inference(spm,[status(thm)],[293,67584,theory(equality)]) ).

cnf(74152,negated_conjecture,
    ( s_m(esk3_0,s(esk2_0,esk1_0),s(esk1_0,esk3_0))
    | ~ s_t(esk3_0,s(esk2_0,esk1_0),s(esk1_0,esk3_0)) ),
    inference(spm,[status(thm)],[439,69631,theory(equality)]) ).

cnf(74211,negated_conjecture,
    ( s_m(esk3_0,s(esk2_0,esk1_0),s(esk1_0,esk3_0))
    | $false ),
    inference(rw,[status(thm)],[74152,4591,theory(equality)]) ).

cnf(74212,negated_conjecture,
    s_m(esk3_0,s(esk2_0,esk1_0),s(esk1_0,esk3_0)),
    inference(cn,[status(thm)],[74211,theory(equality)]) ).

cnf(74233,negated_conjecture,
    s(esk2_0,esk1_0) = esk1_0,
    inference(spm,[status(thm)],[596,74212,theory(equality)]) ).

cnf(74629,negated_conjecture,
    esk1_0 = esk2_0,
    inference(spm,[status(thm)],[279,74233,theory(equality)]) ).

cnf(75434,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[74629,319,theory(equality)]) ).

cnf(75435,negated_conjecture,
    $false,
    75434,
    [proof] ).

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