FDP---0.9.16.SAT-Ass.s

%------------------------------------------------------------------------------
% File     : FDP---0.9.16
% Problem  : NUM288-1 : TPTP v5.0.0. Bugfixed v4.0.0.
% Transfm  : add_equality
% Format   : protein
% Command  : fdp-casc %s %d

% 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 : Mon Jan 10 02:01:22 EST 2011

% Result   : Satisfiable 0.23s
% Output   : Assurance 0.23s
% 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/NUM288-1+noeq ...
% Done.
% Input File...............: /tmp/NUM288-1+noeq.tme
% System...................: Linux art05.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...: [+(_2048)]
% 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.................: 0
% # Commits................: 0
% # Unit extension steps...: 8
% # Unit back subsumptions.: 0
% # Branches closed........: 0
% # Level cuts.............: 0
% Time.....................: 0.01 seconds.
% Result...................: SATISFIABLE with model:
%   +(divides(n0, successor(A_2120)))
%   +(divides(multiply(A_2131, n0), n0))
%   +(divides(add(A_2142, n0), A_2142))
%   +(less(n0, successor(A_2152)))
%   +(equalish(multiply(A_2163, successor(B_2166)), add(multiply(A_2163, B_2166), A_2163)))
%   +(equalish(multiply(A_2183, n0), n0))
%   +(equalish(add(A_2194, successor(B_2197)), successor(add(A_2194, B_2197))))
%   +(equalish(add(A_2213, n0), A_2213))
%   +(_2217)
% 
%------------------------------------------------------------------------------