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

% Computer : art05.cs.miami.edu
% Model    : i686 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory   : 2018MB
% OS       : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Sun Dec 26 13:13:24 EST 2010

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

% Comments : 
%------------------------------------------------------------------------------
fof(1,conjecture,
    ! [X1,X2,X3,X4] : f(X1,f(X2,f(X3,X4))) = f(f(f(X1,X2),X3),X4),
    file('/tmp/tmpOM9OGH/sel_SYN083+1.p_1',pel61) ).

fof(2,axiom,
    ! [X1,X2,X3] : f(X1,f(X2,X3)) = f(f(X1,X2),X3),
    file('/tmp/tmpOM9OGH/sel_SYN083+1.p_1',p61_1) ).

fof(3,negated_conjecture,
    ~ ! [X1,X2,X3,X4] : f(X1,f(X2,f(X3,X4))) = f(f(f(X1,X2),X3),X4),
    inference(assume_negation,[status(cth)],[1]) ).

fof(4,negated_conjecture,
    ? [X1,X2,X3,X4] : f(X1,f(X2,f(X3,X4))) != f(f(f(X1,X2),X3),X4),
    inference(fof_nnf,[status(thm)],[3]) ).

fof(5,negated_conjecture,
    ? [X5,X6,X7,X8] : f(X5,f(X6,f(X7,X8))) != f(f(f(X5,X6),X7),X8),
    inference(variable_rename,[status(thm)],[4]) ).

fof(6,negated_conjecture,
    f(esk1_0,f(esk2_0,f(esk3_0,esk4_0))) != f(f(f(esk1_0,esk2_0),esk3_0),esk4_0),
    inference(skolemize,[status(esa)],[5]) ).

cnf(7,negated_conjecture,
    f(esk1_0,f(esk2_0,f(esk3_0,esk4_0))) != f(f(f(esk1_0,esk2_0),esk3_0),esk4_0),
    inference(split_conjunct,[status(thm)],[6]) ).

fof(8,plain,
    ! [X4,X5,X6] : f(X4,f(X5,X6)) = f(f(X4,X5),X6),
    inference(variable_rename,[status(thm)],[2]) ).

cnf(9,plain,
    f(X1,f(X2,X3)) = f(f(X1,X2),X3),
    inference(split_conjunct,[status(thm)],[8]) ).

cnf(13,negated_conjecture,
    $false,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[7,9,theory(equality)]),9,theory(equality)]),9,theory(equality)]) ).

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

cnf(15,negated_conjecture,
    $false,
    14,
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SYN/SYN083+1.p
% --creating new selector for []
% -running prover on /tmp/tmpOM9OGH/sel_SYN083+1.p_1 with time limit 29
% -prover status Theorem
% Problem SYN083+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SYN/SYN083+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SYN/SYN083+1.p
% Solved 1 out of 1.
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% See solution above
% # SZS output end CNFRefutation
% 
%------------------------------------------------------------------------------