TSTP Solution File: FLD010-3 by CARINE---0.734

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CARINE---0.734
% Problem  : FLD010-3 : TPTP v5.0.0. Bugfixed v2.1.0.
% Transfm  : add_equality
% Format   : carine
% Command  : carine %s t=%d xo=off uct=32000

% 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 : Sat Nov 27 18:13:38 EST 2010

% Result   : Unsatisfiable 0.15s
% Output   : Refutation 0.15s
% Verified : 
% SZS Type : None (Parsing solution fails)
% Syntax   : Number of formulae    : 0

% Comments : 
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Command entered:
% /home/graph/tptp/Systems/CARINE---0.734/carine /tmp/SystemOnTPTP22446/FLD/FLD010-3+noeq.car t=300 xo=off uct=32000
% CARINE version 0.734 (Dec 2003)
% Initializing tables ... done.
% Parsing ............................ done.
% Calculating time slices ... done.
% Building Lookup Tables ... done.
% Looking for a proof at depth = 1 ...
% 	t = 0 secs [nr = 86] [nf = 0] [nu = 50] [ut = 31]
% Looking for a proof at depth = 2 ...
% +================================================+
% |                                                |
% | Congratulations!!! ........ A proof was found. |
% |                                                |
% +================================================+
% Base Clauses and Unit Clauses used in proof:
% ============================================
% Base Clauses:
% -------------
% B0: ~sum_3(additive_identity_0(),multiplicative_identity_0(),additive_identity_0())
% B1: ~product_3(multiplicative_identity_0(),multiplicative_inverse_1(multiplicative_identity_0()),multiplicative_identity_0())
% B5: ~product_3(x1,x0,x2) | product_3(x0,x1,x2)
% B18: ~defined_1(x0) | product_3(multiplicative_inverse_1(x0),x0,multiplicative_identity_0()) | sum_3(additive_identity_0(),x0,additive_identity_0())
% Unit Clauses:
% --------------
% U3: < d0 v0 dv0 f0 c1 t1 td1 b > defined_1(multiplicative_identity_0())
% U6: < d1 v0 dv0 f1 c3 t4 td2 > ~product_3(multiplicative_inverse_1(multiplicative_identity_0()),multiplicative_identity_0(),multiplicative_identity_0())
% U32: < d2 v0 dv0 f1 c3 t4 td2 > product_3(multiplicative_inverse_1(multiplicative_identity_0()),multiplicative_identity_0(),multiplicative_identity_0())
% --------------- Start of Proof ---------------
% Derivation of unit clause U3:
% defined_1(multiplicative_identity_0()) ....... U3
% Derivation of unit clause U6:
% ~product_3(multiplicative_identity_0(),multiplicative_inverse_1(multiplicative_identity_0()),multiplicative_identity_0()) ....... B1
% ~product_3(x1,x0,x2) | product_3(x0,x1,x2) ....... B5
%  ~product_3(multiplicative_inverse_1(multiplicative_identity_0()), multiplicative_identity_0(), multiplicative_identity_0()) ....... R1 [B1:L0, B5:L1]
% Derivation of unit clause U32:
% ~sum_3(additive_identity_0(),multiplicative_identity_0(),additive_identity_0()) ....... B0
% ~defined_1(x0) | product_3(multiplicative_inverse_1(x0),x0,multiplicative_identity_0()) | sum_3(additive_identity_0(),x0,additive_identity_0()) ....... B18
%  ~defined_1(multiplicative_identity_0()) | product_3(multiplicative_inverse_1(multiplicative_identity_0()), multiplicative_identity_0(), multiplicative_identity_0()) ....... R1 [B0:L0, B18:L2]
%  defined_1(multiplicative_identity_0()) ....... U3
%   product_3(multiplicative_inverse_1(multiplicative_identity_0()), multiplicative_identity_0(), multiplicative_identity_0()) ....... R2 [R1:L0, U3:L0]
% Derivation of the empty clause:
% product_3(multiplicative_inverse_1(multiplicative_identity_0()),multiplicative_identity_0(),multiplicative_identity_0()) ....... U32
% ~product_3(multiplicative_inverse_1(multiplicative_identity_0()),multiplicative_identity_0(),multiplicative_identity_0()) ....... U6
%  [] ....... R1 [U32:L0, U6:L0]
% --------------- End of Proof ---------------
% PROOF FOUND!
% ---------------------------------------------
% |                Statistics                 |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 96
% 	resolvents: 96	factors: 0
% Number of unit clauses generated: 53
% % unit clauses generated to total clauses generated: 55.21
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 5		[1] = 26	[2] = 2		
% Total = 33
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 53	[2] = 43	
% Average size of a generated clause: 2.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] defined_1		(+)9	(-)0
% [1] less_or_equal_2	(+)0	(-)0
% [2] product_3		(+)6	(-)2
% [3] sum_3		(+)13	(-)3
% 			------------------
% 		Total:	(+)28	(-)5
% Total number of unit clauses retained: 33
% Number of clauses skipped because of their length: 99
% N base clauses skippped in resolve-with-all-base-clauses
% 	because of the shortest resolvents table: 0
% Number of successful unifications: 99
% Number of unification failures: 15
% Number of unit to unit unification failures: 50
% N literal unification failure due to lookup root_id table: 90
% N base clause resolution failure due to lookup table: 71
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 3
% N unit clauses dropped because they exceeded max values: 24
% N unit clauses dropped because too much nesting: 4
% N unit clauses not constrcuted because table was full: 0
% N unit clauses dropped because UCFA table was full: 0
% Max number of terms in a unit clause: 8
% Max term depth in a unit clause: 4
% Number of states in UCFA table: 69
% Total number of terms of all unit clauses in table: 125
% Max allowed number of states in UCFA: 80000
% Ratio n states used/total allowed states: 0.00
% Ratio n states used/total unit clauses terms: 0.55
% Number of symbols (columns) in UCFA: 44
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 114
% ConstructUnitClause() = 52
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% |                                                      |
%   Inferences per sec: inf
% |                                                      |
% --------------------------------------------------------
% Elapsed time: 0 secs
% CPU time: 0.14 secs
% 
%------------------------------------------------------------------------------