TSTP Solution File: LCL433-2 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : LCL433-2 : TPTP v5.0.0. Released v3.2.0.
% Transfm : add_equality
% Format : carine
% Command : carine %s t=%d xo=off uct=32000
% Computer : art09.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 01:34:23 EST 2010
% Result : Unsatisfiable 0.39s
% Output : Refutation 0.39s
% 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/SystemOnTPTP6493/LCL/LCL433-2+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 = 81] [nf = 0] [nu = 69] [ut = 59]
% Looking for a proof at depth = 2 ...
% +================================================+
% | |
% | Congratulations!!! ........ A proof was found. |
% | |
% +================================================+
% Base Clauses and Unit Clauses used in proof:
% ============================================
% Base Clauses:
% -------------
% B0: c_PropLog_Osat_3(c_insert_3(v_x_0(),v_F_0(),tc_PropLog_Opl_1(t_a_0())),v_xa_0(),t_a_0())
% B1: ~c_in_3(v_xa_0(),c_PropLog_Othms_2(c_insert_3(v_x_0(),v_F_0(),tc_PropLog_Opl_1(t_a_0())),t_a_0()),tc_PropLog_Opl_1(t_a_0()))
% B2: ~c_PropLog_Osat_3(v_F_0(),x0,t_a_0()) | c_in_3(x0,c_PropLog_Othms_2(v_F_0(),t_a_0()),tc_PropLog_Opl_1(t_a_0()))
% B3: c_in_3(x0,c_insert_3(x0,x1,x2),x2)
% B4: ~c_PropLog_Osat_3(c_insert_3(x0,x1,tc_PropLog_Opl_1(x2)),x3,x2) | c_PropLog_Osat_3(x1,c_PropLog_Opl_Oop_A_N_62_3(x0,x3,x2),x2)
% B5: ~c_in_3(x0,c_PropLog_Othms_2(x1,x2),tc_PropLog_Opl_1(x2)) | c_in_3(x0,c_PropLog_Othms_2(c_insert_3(x3,x1,tc_PropLog_Opl_1(x2)),x2),tc_PropLog_Opl_1(x2))
% B6: ~c_in_3(x0,x1,tc_PropLog_Opl_1(x2)) | c_in_3(x0,c_PropLog_Othms_2(x1,x2),tc_PropLog_Opl_1(x2))
% B7: ~c_in_3(c_PropLog_Opl_Oop_A_N_62_3(x0,x3,x2),c_PropLog_Othms_2(x1,x2),tc_PropLog_Opl_1(x2)) | ~c_in_3(x0,c_PropLog_Othms_2(x1,x2),tc_PropLog_Opl_1(x2)) | c_in_3(x3,c_PropLog_Othms_2(x1,x2),tc_PropLog_Opl_1(x2))
% Unit Clauses:
% --------------
% U3: < d1 v0 dv0 f1 c5 t6 td2 > c_PropLog_Osat_3(v_F_0(),c_PropLog_Opl_Oop_A_N_62_3(v_x_0(),v_xa_0(),t_a_0()),t_a_0())
% U6: < d1 v0 dv0 f3 c6 t9 td2 > c_in_3(c_PropLog_Opl_Oop_A_N_62_3(v_x_0(),v_xa_0(),t_a_0()),c_PropLog_Othms_2(v_F_0(),t_a_0()),tc_PropLog_Opl_1(t_a_0()))
% U8: < d1 v6 dv3 f4 c0 t10 td4 > c_in_3(x0,c_PropLog_Othms_2(c_insert_3(x0,x1,tc_PropLog_Opl_1(x2)),x2),tc_PropLog_Opl_1(x2))
% U9: < d1 v1 dv1 f5 c7 t13 td4 > c_in_3(c_PropLog_Opl_Oop_A_N_62_3(v_x_0(),v_xa_0(),t_a_0()),c_PropLog_Othms_2(c_insert_3(x0,v_F_0(),tc_PropLog_Opl_1(t_a_0())),t_a_0()),tc_PropLog_Opl_1(t_a_0()))
% U59: < d2 v0 dv0 f4 c6 t10 td4 > ~c_in_3(v_x_0(),c_PropLog_Othms_2(c_insert_3(v_x_0(),v_F_0(),tc_PropLog_Opl_1(t_a_0())),t_a_0()),tc_PropLog_Opl_1(t_a_0()))
% --------------- Start of Proof ---------------
% Derivation of unit clause U3:
% c_PropLog_Osat_3(c_insert_3(v_x_0(),v_F_0(),tc_PropLog_Opl_1(t_a_0())),v_xa_0(),t_a_0()) ....... B0
% ~c_PropLog_Osat_3(c_insert_3(x0,x1,tc_PropLog_Opl_1(x2)),x3,x2) | c_PropLog_Osat_3(x1,c_PropLog_Opl_Oop_A_N_62_3(x0,x3,x2),x2) ....... B4
% c_PropLog_Osat_3(v_F_0(), c_PropLog_Opl_Oop_A_N_62_3(v_x_0(), v_xa_0(), t_a_0()), t_a_0()) ....... R1 [B0:L0, B4:L0]
% Derivation of unit clause U6:
% ~c_PropLog_Osat_3(v_F_0(),x0,t_a_0()) | c_in_3(x0,c_PropLog_Othms_2(v_F_0(),t_a_0()),tc_PropLog_Opl_1(t_a_0())) ....... B2
% c_PropLog_Osat_3(v_F_0(),c_PropLog_Opl_Oop_A_N_62_3(v_x_0(),v_xa_0(),t_a_0()),t_a_0()) ....... U3
% c_in_3(c_PropLog_Opl_Oop_A_N_62_3(v_x_0(), v_xa_0(), t_a_0()), c_PropLog_Othms_2(v_F_0(), t_a_0()), tc_PropLog_Opl_1(t_a_0())) ....... R1 [B2:L0, U3:L0]
% Derivation of unit clause U8:
% c_in_3(x0,c_insert_3(x0,x1,x2),x2) ....... B3
% ~c_in_3(x0,x1,tc_PropLog_Opl_1(x2)) | c_in_3(x0,c_PropLog_Othms_2(x1,x2),tc_PropLog_Opl_1(x2)) ....... B6
% c_in_3(x0, c_PropLog_Othms_2(c_insert_3(x0, x1, tc_PropLog_Opl_1(x2)), x2), tc_PropLog_Opl_1(x2)) ....... R1 [B3:L0, B6:L0]
% Derivation of unit clause U9:
% ~c_in_3(x0,c_PropLog_Othms_2(x1,x2),tc_PropLog_Opl_1(x2)) | c_in_3(x0,c_PropLog_Othms_2(c_insert_3(x3,x1,tc_PropLog_Opl_1(x2)),x2),tc_PropLog_Opl_1(x2)) ....... B5
% c_in_3(c_PropLog_Opl_Oop_A_N_62_3(v_x_0(),v_xa_0(),t_a_0()),c_PropLog_Othms_2(v_F_0(),t_a_0()),tc_PropLog_Opl_1(t_a_0())) ....... U6
% c_in_3(c_PropLog_Opl_Oop_A_N_62_3(v_x_0(), v_xa_0(), t_a_0()), c_PropLog_Othms_2(c_insert_3(x0, v_F_0(), tc_PropLog_Opl_1(t_a_0())), t_a_0()), tc_PropLog_Opl_1(t_a_0())) ....... R1 [B5:L0, U6:L0]
% Derivation of unit clause U59:
% ~c_in_3(v_xa_0(),c_PropLog_Othms_2(c_insert_3(v_x_0(),v_F_0(),tc_PropLog_Opl_1(t_a_0())),t_a_0()),tc_PropLog_Opl_1(t_a_0())) ....... B1
% ~c_in_3(c_PropLog_Opl_Oop_A_N_62_3(x0,x3,x2),c_PropLog_Othms_2(x1,x2),tc_PropLog_Opl_1(x2)) | ~c_in_3(x0,c_PropLog_Othms_2(x1,x2),tc_PropLog_Opl_1(x2)) | c_in_3(x3,c_PropLog_Othms_2(x1,x2),tc_PropLog_Opl_1(x2)) ....... B7
% ~c_in_3(c_PropLog_Opl_Oop_A_N_62_3(x0, v_xa_0(), t_a_0()), c_PropLog_Othms_2(c_insert_3(v_x_0(), v_F_0(), tc_PropLog_Opl_1(t_a_0())), t_a_0()), tc_PropLog_Opl_1(t_a_0())) | ~c_in_3(x0, c_PropLog_Othms_2(c_insert_3(v_x_0(), v_F_0(), tc_PropLog_Opl_1(t_a_0())), t_a_0()), tc_PropLog_Opl_1(t_a_0())) ....... R1 [B1:L0, B7:L2]
% c_in_3(c_PropLog_Opl_Oop_A_N_62_3(v_x_0(),v_xa_0(),t_a_0()),c_PropLog_Othms_2(c_insert_3(x0,v_F_0(),tc_PropLog_Opl_1(t_a_0())),t_a_0()),tc_PropLog_Opl_1(t_a_0())) ....... U9
% ~c_in_3(v_x_0(), c_PropLog_Othms_2(c_insert_3(v_x_0(), v_F_0(), tc_PropLog_Opl_1(t_a_0())), t_a_0()), tc_PropLog_Opl_1(t_a_0())) ....... R2 [R1:L0, U9:L0]
% Derivation of the empty clause:
% ~c_in_3(v_x_0(),c_PropLog_Othms_2(c_insert_3(v_x_0(),v_F_0(),tc_PropLog_Opl_1(t_a_0())),t_a_0()),tc_PropLog_Opl_1(t_a_0())) ....... U59
% c_in_3(x0,c_PropLog_Othms_2(c_insert_3(x0,x1,tc_PropLog_Opl_1(x2)),x2),tc_PropLog_Opl_1(x2)) ....... U8
% [] ....... R1 [U59:L0, U8:L0]
% --------------- End of Proof ---------------
% PROOF FOUND!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 86
% resolvents: 86 factors: 0
% Number of unit clauses generated: 73
% % unit clauses generated to total clauses generated: 84.88
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 3 [1] = 56 [2] = 1
% Total = 60
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 73 [2] = 13
% Average size of a generated clause: 2.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] c_PropLog_Osat_3 (+)2 (-)1
% [1] c_in_3 (+)52 (-)5
% ------------------
% Total: (+)54 (-)6
% Total number of unit clauses retained: 60
% Number of clauses skipped because of their length: 4
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 0
% Number of successful unifications: 92
% Number of unification failures: 16
% Number of unit to unit unification failures: 212
% N literal unification failure due to lookup root_id table: 32
% N base clause resolution failure due to lookup table: 18
% N UC-BCL resolution dropped due to lookup table: 1
% Max entries in substitution set: 4
% N unit clauses dropped because they exceeded max values: 13
% N unit clauses dropped because too much nesting: 9
% 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: 37
% Max term depth in a unit clause: 10
% Number of states in UCFA table: 663
% Total number of terms of all unit clauses in table: 1163
% Max allowed number of states in UCFA: 528000
% Ratio n states used/total allowed states: 0.00
% Ratio n states used/total unit clauses terms: 0.57
% Number of symbols (columns) in UCFA: 44
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 108
% ConstructUnitClause() = 70
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% | |
% Inferences per sec: inf
% | |
% --------------------------------------------------------
% Elapsed time: 1 secs
% CPU time: 0.38 secs
%
%------------------------------------------------------------------------------