↑ Up

CARINE---0.734.UNS-Ref.s

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

% Computer : art01.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 : Sun Nov 28 10:24:06 EST 2010

% Result   : Unsatisfiable 0.18s
% Output   : Refutation 0.18s
% 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/SystemOnTPTP24561/SYN/SYN563-1+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 = 110] [nf = 0] [nu = 87] [ut = 57]
% Looking for a proof at depth = 2 ...
% 	t = 0 secs [nr = 1585] [nf = 18] [nu = 1118] [ut = 152]
% Looking for a proof at depth = 3 ...
% +================================================+
% |                                                |
% | Congratulations!!! ........ A proof was found. |
% |                                                |
% +================================================+
% Base Clauses and Unit Clauses used in proof:
% ============================================
% Base Clauses:
% -------------
% B0: p6_2(x0,x0)
% B1: p5_2(f3_1(f3_1(x0)),f3_1(f4_1(x0)))
% B3: ~p6_2(f4_1(c7_0()),f3_1(f4_1(c8_0())))
% B4: p2_2(f4_1(c7_0()),f4_1(c8_0()))
% B5: p2_2(x0,x0)
% B10: ~p2_2(x0,x1) | p2_2(f3_1(x0),f3_1(x1))
% B11: ~p6_2(c7_0(),x0) | p6_2(c7_0(),f3_1(x0))
% B12: ~p2_2(x2,x1) | ~p2_2(x2,x0) | p2_2(x0,x1)
% B13: ~p5_2(x2,x1) | ~p6_2(x0,x2) | p5_2(x0,x1)
% B14: ~p6_2(x2,x1) | ~p6_2(x0,x2) | p6_2(x0,x1)
% B15: ~p2_2(x3,x1) | ~p2_2(x2,x0) | ~p6_2(x2,x3) | p6_2(x0,x1)
% Unit Clauses:
% --------------
% U5: < d0 v2 dv1 f0 c0 t2 td1 b nc > p2_2(x0,x0)
% U7: < d1 v0 dv0 f1 c2 t3 td2 > p6_2(c7_0(),f3_1(c7_0()))
% U15: < d1 v0 dv0 f4 c2 t6 td3 > p2_2(f3_1(f4_1(c7_0())),f3_1(f4_1(c8_0())))
% U51: < d1 v0 dv0 f2 c2 t4 td3 > p6_2(c7_0(),f3_1(f3_1(c7_0())))
% U57: < d2 v0 dv0 f2 c2 t4 td3 > p5_2(c7_0(),f3_1(f4_1(c7_0())))
% U68: < d2 v0 dv0 f4 c2 t6 td3 > p2_2(f3_1(f4_1(c8_0())),f3_1(f4_1(c7_0())))
% U250: < d3 v0 dv0 f4 c2 t6 td3 > p6_2(f3_1(f4_1(c7_0())),f3_1(f4_1(c8_0())))
% U424: < d3 v0 dv0 f2 c2 t4 td3 > ~p5_2(c7_0(),f3_1(f4_1(c7_0())))
% --------------- Start of Proof ---------------
% Derivation of unit clause U5:
% p2_2(x0,x0) ....... U5
% Derivation of unit clause U7:
% p6_2(x0,x0) ....... B0
% ~p6_2(c7_0(),x0) | p6_2(c7_0(),f3_1(x0)) ....... B11
%  p6_2(c7_0(), f3_1(c7_0())) ....... R1 [B0:L0, B11:L0]
% Derivation of unit clause U15:
% p2_2(f4_1(c7_0()),f4_1(c8_0())) ....... B4
% ~p2_2(x0,x1) | p2_2(f3_1(x0),f3_1(x1)) ....... B10
%  p2_2(f3_1(f4_1(c7_0())), f3_1(f4_1(c8_0()))) ....... R1 [B4:L0, B10:L0]
% Derivation of unit clause U51:
% ~p6_2(c7_0(),x0) | p6_2(c7_0(),f3_1(x0)) ....... B11
% p6_2(c7_0(),f3_1(c7_0())) ....... U7
%  p6_2(c7_0(), f3_1(f3_1(c7_0()))) ....... R1 [B11:L0, U7:L0]
% Derivation of unit clause U57:
% p5_2(f3_1(f3_1(x0)),f3_1(f4_1(x0))) ....... B1
% ~p5_2(x2,x1) | ~p6_2(x0,x2) | p5_2(x0,x1) ....... B13
%  ~p6_2(x0, f3_1(f3_1(x1))) | p5_2(x0, f3_1(f4_1(x1))) ....... R1 [B1:L0, B13:L0]
%  p6_2(c7_0(),f3_1(f3_1(c7_0()))) ....... U51
%   p5_2(c7_0(), f3_1(f4_1(c7_0()))) ....... R2 [R1:L0, U51:L0]
% Derivation of unit clause U68:
% p2_2(x0,x0) ....... B5
% ~p2_2(x2,x1) | ~p2_2(x2,x0) | p2_2(x0,x1) ....... B12
%  ~p2_2(x0, x1) | p2_2(x1, x0) ....... R1 [B5:L0, B12:L0]
%  p2_2(f3_1(f4_1(c7_0())),f3_1(f4_1(c8_0()))) ....... U15
%   p2_2(f3_1(f4_1(c8_0())), f3_1(f4_1(c7_0()))) ....... R2 [R1:L0, U15:L0]
% Derivation of unit clause U250:
% p6_2(x0,x0) ....... B0
% ~p2_2(x3,x1) | ~p2_2(x2,x0) | ~p6_2(x2,x3) | p6_2(x0,x1) ....... B15
%  ~p2_2(x0, x1) | ~p2_2(x0, x2) | p6_2(x2, x1) ....... R1 [B0:L0, B15:L2]
%  p2_2(x0,x0) ....... U5
%   ~p2_2(x0, x1) | p6_2(x1, x0) ....... R2 [R1:L0, U5:L0]
%   p2_2(f3_1(f4_1(c8_0())),f3_1(f4_1(c7_0()))) ....... U68
%    p6_2(f3_1(f4_1(c7_0())), f3_1(f4_1(c8_0()))) ....... R3 [R2:L0, U68:L0]
% Derivation of unit clause U424:
% ~p6_2(f4_1(c7_0()),f3_1(f4_1(c8_0()))) ....... B3
% ~p6_2(x2,x1) | ~p6_2(x0,x2) | p6_2(x0,x1) ....... B14
%  ~p6_2(x0, f3_1(f4_1(c8_0()))) | ~p6_2(f4_1(c7_0()), x0) ....... R1 [B3:L0, B14:L2]
%  ~p5_2(x0,x1) | p6_2(f4_1(x0),x1) ....... B7
%   ~p6_2(x0, f3_1(f4_1(c8_0()))) | ~p5_2(c7_0(), x0) ....... R2 [R1:L1, B7:L1]
%   p6_2(f3_1(f4_1(c7_0())),f3_1(f4_1(c8_0()))) ....... U250
%    ~p5_2(c7_0(), f3_1(f4_1(c7_0()))) ....... R3 [R2:L0, U250:L0]
% Derivation of the empty clause:
% ~p5_2(c7_0(),f3_1(f4_1(c7_0()))) ....... U424
% p5_2(c7_0(),f3_1(f4_1(c7_0()))) ....... U57
%  [] ....... R1 [U424:L0, U57:L0]
% --------------- End of Proof ---------------
% PROOF FOUND!
% ---------------------------------------------
% |                Statistics                 |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 6483
% 	resolvents: 6444	factors: 39
% Number of unit clauses generated: 4720
% % unit clauses generated to total clauses generated: 72.81
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 6		[1] = 51	[2] = 95	[3] = 273	
% Total = 425
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 4720	[2] = 1700	[3] = 63	
% Average size of a generated clause: 2.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] p2_2		(+)91	(-)79
% [1] p5_2		(+)34	(-)43
% [2] p6_2		(+)146	(-)32
% 			------------------
% 		Total:	(+)271	(-)154
% Total number of unit clauses retained: 425
% Number of clauses skipped because of their length: 1524
% N base clauses skippped in resolve-with-all-base-clauses
% 	because of the shortest resolvents table: 0
% Number of successful unifications: 6496
% Number of unification failures: 63225
% Number of unit to unit unification failures: 13292
% N literal unification failure due to lookup root_id table: 9135
% N base clause resolution failure due to lookup table: 525
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 6
% N unit clauses dropped because they exceeded max values: 3891
% N unit clauses dropped because too much nesting: 400
% 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: 10
% Max term depth in a unit clause: 5
% Number of states in UCFA table: 987
% Total number of terms of all unit clauses in table: 3062
% Max allowed number of states in UCFA: 96000
% Ratio n states used/total allowed states: 0.01
% Ratio n states used/total unit clauses terms: 0.32
% Number of symbols (columns) in UCFA: 41
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 69721
% ConstructUnitClause() = 4310
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.02 secs
% --------------------------------------------------------
% |                                                      |
%   Inferences per sec: inf
% |                                                      |
% --------------------------------------------------------
% Elapsed time: 0 secs
% CPU time: 0.18 secs
% 
%------------------------------------------------------------------------------