↑ Up

CARINE---0.734.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CARINE---0.734
% Problem  : FLD030-3 : TPTP v5.0.0. Bugfixed v2.1.0.
% Transfm  : add_equality
% Format   : carine
% Command  : carine %s t=%d xo=off uct=32000

% Computer : art07.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:30:38 EST 2010

% Result   : Unsatisfiable 0.79s
% Output   : Refutation 0.79s
% 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/SystemOnTPTP20453/FLD/FLD030-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 = 179] [nf = 0] [nu = 116] [ut = 73]
% Looking for a proof at depth = 2 ...
% 	t = 1 secs [nr = 349408] [nf = 74] [nu = 270661] [ut = 8238]
% Looking for a proof at depth = 3 ...
% +================================================+
% |                                                |
% | Congratulations!!! ........ A proof was found. |
% |                                                |
% +================================================+
% Base Clauses and Unit Clauses used in proof:
% ============================================
% Base Clauses:
% -------------
% B0: product_3(multiplicative_identity_0(),a_0(),d_0())
% B1: ~product_3(d_0(),b_0(),multiply_2(a_0(),b_0()))
% B4: defined_1(a_0())
% B5: defined_1(b_0())
% B8: ~product_3(x1,x0,x2) | product_3(x0,x1,x2)
% B10: ~defined_1(x0) | product_3(multiplicative_identity_0(),x0,x0)
% B18: ~defined_1(x1) | ~defined_1(x0) | product_3(x0,x1,multiply_2(x0,x1))
% B22: ~product_3(x3,x5,x2) | ~product_3(x4,x1,x5) | ~product_3(x3,x4,x0) | product_3(x0,x1,x2)
% Unit Clauses:
% --------------
% U5: < d0 v0 dv0 f0 c1 t1 td1 b > defined_1(b_0())
% U8: < d1 v0 dv0 f0 c3 t3 td1 > product_3(a_0(),multiplicative_identity_0(),d_0())
% U22: < d1 v0 dv0 f0 c3 t3 td1 > product_3(multiplicative_identity_0(),b_0(),b_0())
% U2532: < d2 v0 dv0 f1 c4 t5 td2 > product_3(a_0(),b_0(),multiply_2(a_0(),b_0()))
% U8313: < d3 v0 dv0 f0 c3 t3 td1 > ~product_3(a_0(),multiplicative_identity_0(),d_0())
% --------------- Start of Proof ---------------
% Derivation of unit clause U5:
% defined_1(b_0()) ....... U5
% Derivation of unit clause U8:
% product_3(multiplicative_identity_0(),a_0(),d_0()) ....... B0
% ~product_3(x1,x0,x2) | product_3(x0,x1,x2) ....... B8
%  product_3(a_0(), multiplicative_identity_0(), d_0()) ....... R1 [B0:L0, B8:L0]
% Derivation of unit clause U22:
% defined_1(b_0()) ....... B5
% ~defined_1(x0) | product_3(multiplicative_identity_0(),x0,x0) ....... B10
%  product_3(multiplicative_identity_0(), b_0(), b_0()) ....... R1 [B5:L0, B10:L0]
% Derivation of unit clause U2532:
% defined_1(a_0()) ....... B4
% ~defined_1(x1) | ~defined_1(x0) | product_3(x0,x1,multiply_2(x0,x1)) ....... B18
%  ~defined_1(x0) | product_3(a_0(), x0, multiply_2(a_0(), x0)) ....... R1 [B4:L0, B18:L1]
%  defined_1(b_0()) ....... U5
%   product_3(a_0(), b_0(), multiply_2(a_0(), b_0())) ....... R2 [R1:L0, U5:L0]
% Derivation of unit clause U8313:
% ~product_3(d_0(),b_0(),multiply_2(a_0(),b_0())) ....... B1
% ~product_3(x3,x5,x2) | ~product_3(x4,x1,x5) | ~product_3(x3,x4,x0) | product_3(x0,x1,x2) ....... B22
%  ~product_3(x0, x1, multiply_2(a_0(), b_0())) | ~product_3(x2, b_0(), x1) | ~product_3(x0, x2, d_0()) ....... R1 [B1:L0, B22:L3]
%  product_3(a_0(),b_0(),multiply_2(a_0(),b_0())) ....... U2532
%   ~product_3(x0, b_0(), b_0()) | ~product_3(a_0(), x0, d_0()) ....... R2 [R1:L0, U2532:L0]
%   product_3(multiplicative_identity_0(),b_0(),b_0()) ....... U22
%    ~product_3(a_0(), multiplicative_identity_0(), d_0()) ....... R3 [R2:L0, U22:L0]
% Derivation of the empty clause:
% ~product_3(a_0(),multiplicative_identity_0(),d_0()) ....... U8313
% product_3(a_0(),multiplicative_identity_0(),d_0()) ....... U8
%  [] ....... R1 [U8313:L0, U8:L0]
% --------------- End of Proof ---------------
% PROOF FOUND!
% ---------------------------------------------
% |                Statistics                 |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 350836
% 	resolvents: 350748	factors: 88
% Number of unit clauses generated: 270922
% % unit clauses generated to total clauses generated: 77.22
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 8		[1] = 65	[2] = 8165	[3] = 76	
% Total = 8314
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 270922	[2] = 79830	[3] = 84	
% Average size of a generated clause: 2.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] defined_1		(+)7845	(-)0
% [1] less_or_equal_2	(+)0	(-)0
% [2] product_3		(+)228	(-)6
% [3] sum_3		(+)234	(-)1
% 			------------------
% 		Total:	(+)8307	(-)7
% Total number of unit clauses retained: 8314
% Number of clauses skipped because of their length: 3492
% N base clauses skippped in resolve-with-all-base-clauses
% 	because of the shortest resolvents table: 0
% Number of successful unifications: 350843
% Number of unification failures: 67655
% Number of unit to unit unification failures: 1375
% N literal unification failure due to lookup root_id table: 2754
% N base clause resolution failure due to lookup table: 1892
% 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: 231638
% N unit clauses dropped because too much nesting: 107664
% 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: 5449
% Total number of terms of all unit clauses in table: 54584
% Max allowed number of states in UCFA: 80000
% Ratio n states used/total allowed states: 0.07
% Ratio n states used/total unit clauses terms: 0.10
% Number of symbols (columns) in UCFA: 47
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 418498
% ConstructUnitClause() = 239944
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.24 secs
% --------------------------------------------------------
% |                                                      |
%   Inferences per sec: inf
% |                                                      |
% --------------------------------------------------------
% Elapsed time: 1 secs
% CPU time: 0.78 secs
% 
%------------------------------------------------------------------------------