%------------------------------------------------------------------------------
% File     : FDP---0.9.16
% Problem  : KRS011-1 : TPTP v5.0.0. Released v2.0.0.
% Transfm  : add_equality
% Format   : protein
% Command  : fdp-casc %s %d

% Computer : art11.cs.miami.edu
% Model    : i686 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory   : 2006MB
% OS       : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Sun Jan  9 15:24:53 EST 2011

% Result   : Satisfiable 0.32s
% Output   : Assurance 0.32s
% Verified : 
% SZS Type : None (Parsing solution fails)
% Syntax   : Number of formulae    : 0

% Comments : 
%------------------------------------------------------------------------------
%----NO SOLUTION OUTPUT BY SYSTEM
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% FDPLL - A First-Order Davis-Putnam Theorem Prover
% Version 0.9.16 (26/06/2002)
% Proving /tmp/KRS011-1+noeq ...
% Done.
% Input File...............: /tmp/KRS011-1+noeq.tme
% System...................: Linux art11.cs.miami.edu 2.6.31.5-127.fc12.i686.PAE #1 SMP Sat Nov 7 21:25:57 EST 2009 i686 i686 i386 GNU/Linux
% Automatic mode...........: on
% Time limit...............: 300 seconds
% Current restart interval.: 210 seconds
% Restart with =-axioms....: off
% Initial interpretation...: [+(_10380)]
% Clause set type..........: Non-Horn, without equality
% Equality transformation..: off
% Non-constant functions...: yes
% Term depth settings......: 3/2 (Init/Increment)
% unit_extend..............: on
% splitting type...........: exact
% Final tree statistics:
% Tree for clause set......: as initially given
% # Restarts...............: 0
% Term depth limit.........: 3
% # Splits.................: 9
% # Commits................: 0
% # Unit extension steps...: 36
% # Unit back subsumptions.: 0
% # Branches closed........: 0
% # Level cuts.............: 0
% Time.....................: 0.06 seconds.
% Result...................: SATISFIABLE with model:
%   +(equalish(u11r4(exists), u9r4(exists)))
%   +(equalish(u10r4(exists), u9r4(exists)))
%   +(equalish(u9r4(exists), u11r4(exists)))
%   +(equalish(u9r4(exists), u10r4(exists)))
%   +(equalish(u9r4(exists), u9r4(exists)))
%   +(equalish(u11r4(exists), u10r4(exists)))
%   +(equalish(u10r4(exists), u11r4(exists)))
%   +(equalish(u10r4(exists), u10r4(exists)))
%   +(equalish(u11r4(exists), u11r4(exists)))
%   +(r(exists, u9r4(exists)))
%   +(t(u9r4(exists), u9r5(exists)))
%   -(d(u9r5(exists)))
%   -(e(u9r5(exists)))
%   +(r(exists, u10r4(exists)))
%   +(t(u10r4(exists), u10r5(exists)))
%   -(e(u10r5(exists)))
%   -(c(u10r5(exists)))
%   +(r(exists, u11r4(exists)))
%   +(t(u11r4(exists), u11r5(exists)))
%   -(d(u11r5(exists)))
%   -(c(u11r5(exists)))
%   +(r1(exists, u9r4(exists)))
%   +(t1(u9r4(exists), u9r5(exists)))
%   +(c(u9r5(exists)))
%   +(r2(exists, u10r4(exists)))
%   +(t2(u10r4(exists), u10r5(exists)))
%   +(d(u10r5(exists)))
%   +(r3(exists, u11r4(exists)))
%   +(t3(u11r4(exists), u11r5(exists)))
%   +(e(u11r5(exists)))
%   -(r2least(exists))
%   +(f1(exists))
%   +(f2(exists))
%   +(f3(exists))
%   -(g(exists))
%   +(f(exists))
%   +(_10773)
%   -(e(X1_10797))
%   -(d(X1_10821))
%   -(f2(X1_10845))
%   -(f3(X1_10869))
%   -(f(X1_10893))
%   -(r2least(X1_10917))
%   -(g(X1_10941))
%   -(r2(X1_10966, X2_10967))
%   -(r3(X1_10992, X2_10993))
% 
%------------------------------------------------------------------------------