↑ Up

CARINE---0.734.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CARINE---0.734
% Problem  : FLD013-4 : 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:19:35 EST 2010

% Result   : Unsatisfiable 2.64s
% Output   : Refutation 2.64s
% 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/SystemOnTPTP23048/FLD/FLD013-4+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 = 1 secs [nr = 249] [nf = 0] [nu = 166] [ut = 105]
% Looking for a proof at depth = 2 ...
% 	t = 3 secs [nr = 1300612] [nf = 90] [nu = 1034358] [ut = 27314]
% 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(),b_0())
% B1: sum_3(additive_identity_0(),c_0(),d_0())
% B3: ~sum_3(d_0(),b_0(),u_0())
% B6: defined_1(a_0())
% B10: defined_1(u_0())
% B13: ~sum_3(x1,x0,x2) | sum_3(x0,x1,x2)
% B15: ~defined_1(x0) | sum_3(additive_identity_0(),x0,x0)
% B23: ~defined_1(x1) | ~defined_1(x0) | sum_3(x0,x1,add_2(x0,x1))
% B28: ~sum_3(x3,x5,x2) | ~sum_3(x4,x1,x5) | ~sum_3(x3,x4,x0) | sum_3(x0,x1,x2)
% B29: ~sum_3(x4,x5,x2) | ~sum_3(x3,x5,x1) | ~sum_3(x0,x3,x4) | sum_3(x0,x1,x2)
% Unit Clauses:
% --------------
% U2: < d0 v0 dv0 f0 c3 t3 td1 b nc > sum_3(a_0(),c_0(),u_0())
% U9: < d0 v0 dv0 f0 c1 t1 td1 b > defined_1(d_0())
% U15: < d1 v0 dv0 f0 c3 t3 td1 > ~sum_3(b_0(),d_0(),u_0())
% U25: < d1 v0 dv0 f0 c3 t3 td1 > sum_3(additive_identity_0(),a_0(),a_0())
% U41: < d1 v0 dv0 f0 c3 t3 td1 > sum_3(additive_identity_0(),u_0(),u_0())
% U53: < d1 v0 dv0 f0 c3 t3 td1 > sum_3(a_0(),additive_identity_0(),a_0())
% U3737: < d2 v0 dv0 f1 c4 t5 td2 > sum_3(a_0(),d_0(),add_2(a_0(),d_0()))
% U27344: < d3 v0 dv0 f0 c3 t3 td1 > sum_3(b_0(),c_0(),u_0())
% U27351: < d3 v0 dv0 f1 c4 t5 td2 > ~sum_3(additive_identity_0(),add_2(a_0(),d_0()),u_0())
% U27480: < d3 v0 dv0 f1 c4 t5 td2 > ~sum_3(a_0(),c_0(),add_2(a_0(),d_0()))
% U27506: < d3 v0 dv0 f1 c4 t5 td2 > sum_3(a_0(),c_0(),add_2(a_0(),d_0()))
% --------------- Start of Proof ---------------
% Derivation of unit clause U2:
% sum_3(a_0(),c_0(),u_0()) ....... U2
% Derivation of unit clause U9:
% defined_1(d_0()) ....... U9
% Derivation of unit clause U15:
% ~sum_3(d_0(),b_0(),u_0()) ....... B3
% ~sum_3(x1,x0,x2) | sum_3(x0,x1,x2) ....... B13
%  ~sum_3(b_0(), d_0(), u_0()) ....... R1 [B3:L0, B13:L1]
% Derivation of unit clause U25:
% defined_1(a_0()) ....... B6
% ~defined_1(x0) | sum_3(additive_identity_0(),x0,x0) ....... B15
%  sum_3(additive_identity_0(), a_0(), a_0()) ....... R1 [B6:L0, B15:L0]
% Derivation of unit clause U41:
% defined_1(u_0()) ....... B10
% ~defined_1(x0) | sum_3(additive_identity_0(),x0,x0) ....... B15
%  sum_3(additive_identity_0(), u_0(), u_0()) ....... R1 [B10:L0, B15:L0]
% Derivation of unit clause U53:
% ~sum_3(x1,x0,x2) | sum_3(x0,x1,x2) ....... B13
% sum_3(additive_identity_0(),a_0(),a_0()) ....... U25
%  sum_3(a_0(), additive_identity_0(), a_0()) ....... R1 [B13:L0, U25:L0]
% Derivation of unit clause U3737:
% defined_1(a_0()) ....... B6
% ~defined_1(x1) | ~defined_1(x0) | sum_3(x0,x1,add_2(x0,x1)) ....... B23
%  ~defined_1(x0) | sum_3(a_0(), x0, add_2(a_0(), x0)) ....... R1 [B6:L0, B23:L1]
%  defined_1(d_0()) ....... U9
%   sum_3(a_0(), d_0(), add_2(a_0(), d_0())) ....... R2 [R1:L0, U9:L0]
% Derivation of unit clause U27344:
% sum_3(additive_identity_0(),a_0(),b_0()) ....... B0
% ~sum_3(x3,x5,x2) | ~sum_3(x4,x1,x5) | ~sum_3(x3,x4,x0) | sum_3(x0,x1,x2) ....... B28
%  ~sum_3(additive_identity_0(), x0, x1) | ~sum_3(a_0(), x2, x0) | sum_3(b_0(), x2, x1) ....... R1 [B0:L0, B28:L2]
%  sum_3(additive_identity_0(),u_0(),u_0()) ....... U41
%   ~sum_3(a_0(), x0, u_0()) | sum_3(b_0(), x0, u_0()) ....... R2 [R1:L0, U41:L0]
%   sum_3(a_0(),c_0(),u_0()) ....... U2
%    sum_3(b_0(), c_0(), u_0()) ....... R3 [R2:L0, U2:L0]
% Derivation of unit clause U27351:
% sum_3(additive_identity_0(),a_0(),b_0()) ....... B0
% ~sum_3(x3,x5,x2) | ~sum_3(x4,x1,x5) | ~sum_3(x3,x4,x0) | sum_3(x0,x1,x2) ....... B28
%  ~sum_3(additive_identity_0(), x0, x1) | ~sum_3(a_0(), x2, x0) | sum_3(b_0(), x2, x1) ....... R1 [B0:L0, B28:L2]
%  sum_3(a_0(),d_0(),add_2(a_0(),d_0())) ....... U3737
%   ~sum_3(additive_identity_0(), add_2(a_0(), d_0()), x0) | sum_3(b_0(), d_0(), x0) ....... R2 [R1:L1, U3737:L0]
%   ~sum_3(b_0(),d_0(),u_0()) ....... U15
%    ~sum_3(additive_identity_0(), add_2(a_0(), d_0()), u_0()) ....... R3 [R2:L1, U15:L0]
% Derivation of unit clause U27480:
% sum_3(additive_identity_0(),a_0(),b_0()) ....... B0
% ~sum_3(x4,x5,x2) | ~sum_3(x3,x5,x1) | ~sum_3(x0,x3,x4) | sum_3(x0,x1,x2) ....... B29
%  ~sum_3(b_0(), x0, x1) | ~sum_3(a_0(), x0, x2) | sum_3(additive_identity_0(), x2, x1) ....... R1 [B0:L0, B29:L2]
%  sum_3(b_0(),c_0(),u_0()) ....... U27344
%   ~sum_3(a_0(), c_0(), x0) | sum_3(additive_identity_0(), x0, u_0()) ....... R2 [R1:L0, U27344:L0]
%   ~sum_3(additive_identity_0(),add_2(a_0(),d_0()),u_0()) ....... U27351
%    ~sum_3(a_0(), c_0(), add_2(a_0(), d_0())) ....... R3 [R2:L1, U27351:L0]
% Derivation of unit clause U27506:
% sum_3(additive_identity_0(),c_0(),d_0()) ....... B1
% ~sum_3(x3,x5,x2) | ~sum_3(x4,x1,x5) | ~sum_3(x3,x4,x0) | sum_3(x0,x1,x2) ....... B28
%  ~sum_3(x0, d_0(), x1) | ~sum_3(x0, additive_identity_0(), x2) | sum_3(x2, c_0(), x1) ....... R1 [B1:L0, B28:L1]
%  sum_3(a_0(),d_0(),add_2(a_0(),d_0())) ....... U3737
%   ~sum_3(a_0(), additive_identity_0(), x0) | sum_3(x0, c_0(), add_2(a_0(), d_0())) ....... R2 [R1:L0, U3737:L0]
%   sum_3(a_0(),additive_identity_0(),a_0()) ....... U53
%    sum_3(a_0(), c_0(), add_2(a_0(), d_0())) ....... R3 [R2:L0, U53:L0]
% Derivation of the empty clause:
% sum_3(a_0(),c_0(),add_2(a_0(),d_0())) ....... U27506
% ~sum_3(a_0(),c_0(),add_2(a_0(),d_0())) ....... U27480
%  [] ....... R1 [U27506:L0, U27480:L0]
% --------------- End of Proof ---------------
% PROOF FOUND!
% ---------------------------------------------
% |                Statistics                 |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 1303882
% 	resolvents: 1303776	factors: 106
% Number of unit clauses generated: 1034914
% % unit clauses generated to total clauses generated: 79.37
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 12	[1] = 93	[2] = 27209	[3] = 193	
% Total = 27507
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 1034914	[2] = 268844	[3] = 124	
% Average size of a generated clause: 2.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] defined_1		(+)26593	(-)0
% [1] less_or_equal_2	(+)0	(-)0
% [2] product_3		(+)286	(-)0
% [3] sum_3		(+)618	(-)10
% 			------------------
% 		Total:	(+)27497	(-)10
% Total number of unit clauses retained: 27507
% Number of clauses skipped because of their length: 8046
% N base clauses skippped in resolve-with-all-base-clauses
% 	because of the shortest resolvents table: 0
% Number of successful unifications: 1303900
% Number of unification failures: 429491
% Number of unit to unit unification failures: 6178
% N literal unification failure due to lookup root_id table: 8798
% N base clause resolution failure due to lookup table: 3321
% 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: 901831
% N unit clauses dropped because too much nesting: 428743
% 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: 12458
% Total number of terms of all unit clauses in table: 183718
% Max allowed number of states in UCFA: 80000
% Ratio n states used/total allowed states: 0.16
% Ratio n states used/total unit clauses terms: 0.07
% Number of symbols (columns) in UCFA: 49
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 1733391
% ConstructUnitClause() = 929326
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 1.02 secs
% --------------------------------------------------------
% |                                                      |
%   Inferences per sec: 651941
% |                                                      |
% --------------------------------------------------------
% Elapsed time: 3 secs
% CPU time: 2.64 secs
% 
%------------------------------------------------------------------------------