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

View Problem - Process Solution

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

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

% Result   : Unsatisfiable 0.47s
% Output   : Refutation 0.47s
% 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/SystemOnTPTP15161/FLD/FLD009-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 = 150] [nf = 0] [nu = 94] [ut = 59]
% Looking for a proof at depth = 2 ...
% 	t = 1 secs [nr = 158256] [nf = 78] [nu = 120649] [ut = 4022]
% Looking for a proof at depth = 3 ...
% +================================================+
% |                                                |
% | Congratulations!!! ........ A proof was found. |
% |                                                |
% +================================================+
% Base Clauses and Unit Clauses used in proof:
% ============================================
% Base Clauses:
% -------------
% B0: ~sum_3(additive_identity_0(),a_0(),additive_identity_0())
% B1: ~product_3(a_0(),x0,b_0())
% B5: defined_1(b_0())
% B9: ~defined_1(x0) | product_3(multiplicative_identity_0(),x0,x0)
% B17: ~defined_1(x1) | ~defined_1(x0) | product_3(x0,x1,multiply_2(x0,x1))
% B19: ~defined_1(x0) | defined_1(multiplicative_inverse_1(x0)) | sum_3(additive_identity_0(),x0,additive_identity_0())
% B20: ~defined_1(x0) | product_3(multiplicative_inverse_1(x0),x0,multiplicative_identity_0()) | sum_3(additive_identity_0(),x0,additive_identity_0())
% B22: ~product_3(x4,x5,x2) | ~product_3(x3,x5,x1) | ~product_3(x0,x3,x4) | product_3(x0,x1,x2)
% Unit Clauses:
% --------------
% U4: < d0 v0 dv0 f0 c1 t1 td1 b > defined_1(a_0())
% U21: < d1 v0 dv0 f0 c3 t3 td1 > product_3(multiplicative_identity_0(),b_0(),b_0())
% U59: < d2 v0 dv0 f1 c1 t2 td2 > defined_1(multiplicative_inverse_1(a_0()))
% U3756: < d2 v0 dv0 f3 c4 t7 td3 > product_3(multiplicative_inverse_1(a_0()),b_0(),multiply_2(multiplicative_inverse_1(a_0()),b_0()))
% U4026: < d3 v0 dv0 f1 c3 t4 td2 > product_3(a_0(),multiplicative_inverse_1(a_0()),multiplicative_identity_0())
% U4155: < d3 v0 dv0 f1 c3 t4 td2 > ~product_3(a_0(),multiplicative_inverse_1(a_0()),multiplicative_identity_0())
% --------------- Start of Proof ---------------
% Derivation of unit clause U4:
% defined_1(a_0()) ....... U4
% Derivation of unit clause U21:
% defined_1(b_0()) ....... B5
% ~defined_1(x0) | product_3(multiplicative_identity_0(),x0,x0) ....... B9
%  product_3(multiplicative_identity_0(), b_0(), b_0()) ....... R1 [B5:L0, B9:L0]
% Derivation of unit clause U59:
% ~sum_3(additive_identity_0(),a_0(),additive_identity_0()) ....... B0
% ~defined_1(x0) | defined_1(multiplicative_inverse_1(x0)) | sum_3(additive_identity_0(),x0,additive_identity_0()) ....... B19
%  ~defined_1(a_0()) | defined_1(multiplicative_inverse_1(a_0())) ....... R1 [B0:L0, B19:L2]
%  defined_1(a_0()) ....... U4
%   defined_1(multiplicative_inverse_1(a_0())) ....... R2 [R1:L0, U4:L0]
% Derivation of unit clause U3756:
% defined_1(b_0()) ....... B5
% ~defined_1(x1) | ~defined_1(x0) | product_3(x0,x1,multiply_2(x0,x1)) ....... B17
%  ~defined_1(x0) | product_3(x0, b_0(), multiply_2(x0, b_0())) ....... R1 [B5:L0, B17:L0]
%  defined_1(multiplicative_inverse_1(a_0())) ....... U59
%   product_3(multiplicative_inverse_1(a_0()), b_0(), multiply_2(multiplicative_inverse_1(a_0()), b_0())) ....... R2 [R1:L0, U59:L0]
% Derivation of unit clause U4026:
% ~sum_3(additive_identity_0(),a_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()) ....... B20
%  ~defined_1(a_0()) | product_3(multiplicative_inverse_1(a_0()), a_0(), multiplicative_identity_0()) ....... R1 [B0:L0, B20:L2]
%  ~product_3(x1,x0,x2) | product_3(x0,x1,x2) ....... B7
%   ~defined_1(a_0()) | product_3(a_0(), multiplicative_inverse_1(a_0()), multiplicative_identity_0()) ....... R2 [R1:L1, B7:L0]
%   defined_1(a_0()) ....... U4
%    product_3(a_0(), multiplicative_inverse_1(a_0()), multiplicative_identity_0()) ....... R3 [R2:L0, U4:L0]
% Derivation of unit clause U4155:
% ~product_3(a_0(),x0,b_0()) ....... B1
% ~product_3(x4,x5,x2) | ~product_3(x3,x5,x1) | ~product_3(x0,x3,x4) | product_3(x0,x1,x2) ....... B22
%  ~product_3(x0, x1, b_0()) | ~product_3(x2, x1, x3) | ~product_3(a_0(), x2, x0) ....... R1 [B1:L0, B22:L3]
%  product_3(multiplicative_identity_0(),b_0(),b_0()) ....... U21
%   ~product_3(x0, b_0(), x1) | ~product_3(a_0(), x0, multiplicative_identity_0()) ....... R2 [R1:L0, U21:L0]
%   product_3(multiplicative_inverse_1(a_0()),b_0(),multiply_2(multiplicative_inverse_1(a_0()),b_0())) ....... U3756
%    ~product_3(a_0(), multiplicative_inverse_1(a_0()), multiplicative_identity_0()) ....... R3 [R2:L0, U3756:L0]
% Derivation of the empty clause:
% ~product_3(a_0(),multiplicative_inverse_1(a_0()),multiplicative_identity_0()) ....... U4155
% product_3(a_0(),multiplicative_inverse_1(a_0()),multiplicative_identity_0()) ....... U4026
%  [] ....... R1 [U4155:L0, U4026:L0]
% --------------- End of Proof ---------------
% PROOF FOUND!
% ---------------------------------------------
% |                Statistics                 |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 160158
% 	resolvents: 160042	factors: 116
% Number of unit clauses generated: 121150
% % unit clauses generated to total clauses generated: 75.64
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 7		[1] = 52	[2] = 3963	[3] = 134	
% Total = 4156
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 121150	[2] = 38928	[3] = 80	
% Average size of a generated clause: 2.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] defined_1		(+)3733	(-)0
% [1] less_or_equal_2	(+)0	(-)0
% [2] product_3		(+)116	(-)51
% [3] sum_3		(+)173	(-)83
% 			------------------
% 		Total:	(+)4022	(-)134
% Total number of unit clauses retained: 4156
% Number of clauses skipped because of their length: 3581
% N base clauses skippped in resolve-with-all-base-clauses
% 	because of the shortest resolvents table: 0
% Number of successful unifications: 160169
% Number of unification failures: 135425
% Number of unit to unit unification failures: 20274
% N literal unification failure due to lookup root_id table: 2974
% N base clause resolution failure due to lookup table: 1713
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 9
% N unit clauses dropped because they exceeded max values: 102321
% N unit clauses dropped because too much nesting: 46557
% 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: 3674
% Total number of terms of all unit clauses in table: 26624
% Max allowed number of states in UCFA: 80000
% Ratio n states used/total allowed states: 0.05
% Ratio n states used/total unit clauses terms: 0.14
% Number of symbols (columns) in UCFA: 46
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 295594
% ConstructUnitClause() = 106470
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.08 secs
% --------------------------------------------------------
% |                                                      |
%   Inferences per sec: inf
% |                                                      |
% --------------------------------------------------------
% Elapsed time: 1 secs
% CPU time: 0.46 secs
% 
%------------------------------------------------------------------------------