FDP---0.9.16.SAT-Ass.s

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

% 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 Jan  9 15:18:57 EST 2011

% Result   : Satisfiable 0.29s
% Output   : Assurance 0.29s
% 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/KRS009-1+noeq ...
% Done.
% Input File...............: /tmp/KRS009-1+noeq.tme
% System...................: Linux art04.cs.miami.edu 2.6.26.8-57.fc8 #1 SMP Thu Dec 18 19:19:45 EST 2008 i686 i686 i386 GNU/Linux
% Automatic mode...........: on
% Time limit...............: 300 seconds
% Current restart interval.: 210 seconds
% Restart with =-axioms....: off
% Initial interpretation...: [+(_8113)]
% 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.................: 17
% # Commits................: 0
% # Unit extension steps...: 13
% # Unit back subsumptions.: 0
% # Branches closed........: 0
% # Level cuts.............: 0
% Time.....................: 0.06 seconds.
% Result...................: SATISFIABLE with model:
%   +(a(u8r3(exist)))
%   +(a(u8r2(exist)))
%   +(a(u8r1(exist)))
%   +(t(exist, u8r3(exist)))
%   +(t(exist, u8r2(exist)))
%   +(t(exist, u8r1(exist)))
%   -(equalish(u8r3(exist), u8r2(exist)))
%   -(equalish(u8r3(exist), u8r1(exist)))
%   -(equalish(u8r2(exist), u8r1(exist)))
%   +(t3least(exist))
%   +(r1most(exist))
%   +(s1most(exist))
%   +(e(exist))
%   +(_8287)
%   -(r(exist, u8r1(exist)))
%   -(s(exist, u8r1(exist)))
%   -(r(exist, u8r2(exist)))
%   -(s(exist, u8r2(exist)))
%   -(p2least(X1_8415))
%   -(c(X1_8439))
%   -(r(X1_8464, X2_8465))
%   -(t3least(X1_8489))
%   -(e(X1_8513))
%   -(p(X1_8538, u8r2(exist)))
%   -(p(X1_8565, u8r1(exist)))
%   -(s1most(X1_8591))
%   -(equalish(u10r2(X1_8618), u10r1(X1_8618)))
%   -(p(X1_8645, u10r1(X1_8648)))
%   -(s(exist, u10r1(X1_8675)))
%   -(t(X1_8700, u8r1(exist)))
%   -(s(X1_8727, u8r1(exist)))
% 
%------------------------------------------------------------------------------