%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SYN080+1 : TPTP v5.0.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art04.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:08 EST 2010
% Result : Theorem 0.15s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 2
% Syntax : Number of formulae : 11 ( 11 unt; 0 def)
% Number of atoms : 11 ( 9 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 5 ( 5 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-1 aty)
% Number of variables : 14 ( 2 sgn 8 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,conjecture,
! [X1,X2] : f(f(X1)) = f(g(X2)),
file('/tmp/tmpZkDbPf/sel_SYN080+1.p_1',pel58) ).
fof(2,axiom,
! [X1,X2] : f(X1) = g(X2),
file('/tmp/tmpZkDbPf/sel_SYN080+1.p_1',pel58_1) ).
fof(3,negated_conjecture,
~ ! [X1,X2] : f(f(X1)) = f(g(X2)),
inference(assume_negation,[status(cth)],[1]) ).
fof(4,negated_conjecture,
? [X1,X2] : f(f(X1)) != f(g(X2)),
inference(fof_nnf,[status(thm)],[3]) ).
fof(5,negated_conjecture,
? [X3,X4] : f(f(X3)) != f(g(X4)),
inference(variable_rename,[status(thm)],[4]) ).
fof(6,negated_conjecture,
f(f(esk1_0)) != f(g(esk2_0)),
inference(skolemize,[status(esa)],[5]) ).
cnf(7,negated_conjecture,
f(f(esk1_0)) != f(g(esk2_0)),
inference(split_conjunct,[status(thm)],[6]) ).
fof(8,plain,
! [X3,X4] : f(X3) = g(X4),
inference(variable_rename,[status(thm)],[2]) ).
cnf(9,plain,
f(X1) = g(X2),
inference(split_conjunct,[status(thm)],[8]) ).
cnf(12,negated_conjecture,
$false,
inference(sr,[status(thm)],[7,9,theory(equality)]) ).
cnf(13,negated_conjecture,
$false,
12,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SYN/SYN080+1.p
% --creating new selector for []
% -running prover on /tmp/tmpZkDbPf/sel_SYN080+1.p_1 with time limit 29
% -prover status Theorem
% Problem SYN080+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SYN/SYN080+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SYN/SYN080+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
%
%------------------------------------------------------------------------------