TSTP Solution File: LCL436-2 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : LCL436-2 : TPTP v5.0.0. Released v3.2.0.
% Transfm : add_equality
% Format : carine
% Command : carine %s t=%d xo=off uct=32000
% Computer : art06.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:54 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/SystemOnTPTP1151/LCL/LCL436-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 ...
% +================================================+
% | |
% | Congratulations!!! ........ A proof was found. |
% | |
% +================================================+
% Base Clauses and Unit Clauses used in proof:
% ============================================
% Base Clauses:
% -------------
% B0: ~c_in_3(c_PropLog_Opl_Oop_A_N_62_3(v_p_0(),c_PropLog_Opl_Oop_A_N_62_3(c_PropLog_Opl_Oop_A_N_62_3(v_pa_0(),c_PropLog_Opl_Oop_A_N_62_3(v_q_0(),v_r_0(),t_a_0()),t_a_0()),c_PropLog_Opl_Oop_A_N_62_3(c_PropLog_Opl_Oop_A_N_62_3(v_pa_0(),v_q_0(),t_a_0()),c_PropLog_Opl_Oop_A_N_62_3(v_pa_0(),v_r_0(),t_a_0()),t_a_0()),t_a_0()),t_a_0()),c_PropLog_Othms_2(v_H_0(),t_a_0()),tc_PropLog_Opl_1(t_a_0()))
% B2: ~c_in_3(x0,c_PropLog_Othms_2(x1,x2),tc_PropLog_Opl_1(x2)) | c_in_3(c_PropLog_Opl_Oop_A_N_62_3(x3,x0,x2),c_PropLog_Othms_2(x1,x2),tc_PropLog_Opl_1(x2))
% Unit Clauses:
% --------------
% U1: < d0 v16 dv5 f8 c0 t24 td4 b > c_in_3(c_PropLog_Opl_Oop_A_N_62_3(c_PropLog_Opl_Oop_A_N_62_3(x0,c_PropLog_Opl_Oop_A_N_62_3(x1,x2,x3),x3),c_PropLog_Opl_Oop_A_N_62_3(c_PropLog_Opl_Oop_A_N_62_3(x0,x1,x3),c_PropLog_Opl_Oop_A_N_62_3(x0,x2,x3),x3),x3),c_PropLog_Othms_2(x4,x3),tc_PropLog_Opl_1(x3))
% U2: < d1 v0 dv0 f8 c16 t24 td4 > ~c_in_3(c_PropLog_Opl_Oop_A_N_62_3(c_PropLog_Opl_Oop_A_N_62_3(v_pa_0(),c_PropLog_Opl_Oop_A_N_62_3(v_q_0(),v_r_0(),t_a_0()),t_a_0()),c_PropLog_Opl_Oop_A_N_62_3(c_PropLog_Opl_Oop_A_N_62_3(v_pa_0(),v_q_0(),t_a_0()),c_PropLog_Opl_Oop_A_N_62_3(v_pa_0(),v_r_0(),t_a_0()),t_a_0()),t_a_0()),c_PropLog_Othms_2(v_H_0(),t_a_0()),tc_PropLog_Opl_1(t_a_0()))
% --------------- Start of Proof ---------------
% Derivation of unit clause U1:
% c_in_3(c_PropLog_Opl_Oop_A_N_62_3(c_PropLog_Opl_Oop_A_N_62_3(x0,c_PropLog_Opl_Oop_A_N_62_3(x1,x2,x3),x3),c_PropLog_Opl_Oop_A_N_62_3(c_PropLog_Opl_Oop_A_N_62_3(x0,x1,x3),c_PropLog_Opl_Oop_A_N_62_3(x0,x2,x3),x3),x3),c_PropLog_Othms_2(x4,x3),tc_PropLog_Opl_1(x3)) ....... U1
% Derivation of unit clause U2:
% ~c_in_3(c_PropLog_Opl_Oop_A_N_62_3(v_p_0(),c_PropLog_Opl_Oop_A_N_62_3(c_PropLog_Opl_Oop_A_N_62_3(v_pa_0(),c_PropLog_Opl_Oop_A_N_62_3(v_q_0(),v_r_0(),t_a_0()),t_a_0()),c_PropLog_Opl_Oop_A_N_62_3(c_PropLog_Opl_Oop_A_N_62_3(v_pa_0(),v_q_0(),t_a_0()),c_PropLog_Opl_Oop_A_N_62_3(v_pa_0(),v_r_0(),t_a_0()),t_a_0()),t_a_0()),t_a_0()),c_PropLog_Othms_2(v_H_0(),t_a_0()),tc_PropLog_Opl_1(t_a_0())) ....... B0
% ~c_in_3(x0,c_PropLog_Othms_2(x1,x2),tc_PropLog_Opl_1(x2)) | c_in_3(c_PropLog_Opl_Oop_A_N_62_3(x3,x0,x2),c_PropLog_Othms_2(x1,x2),tc_PropLog_Opl_1(x2)) ....... B2
% ~c_in_3(c_PropLog_Opl_Oop_A_N_62_3(c_PropLog_Opl_Oop_A_N_62_3(v_pa_0(), c_PropLog_Opl_Oop_A_N_62_3(v_q_0(), v_r_0(), t_a_0()), t_a_0()), c_PropLog_Opl_Oop_A_N_62_3(c_PropLog_Opl_Oop_A_N_62_3(v_pa_0(), v_q_0(), t_a_0()), c_PropLog_Opl_Oop_A_N_62_3(v_pa_0(), v_r_0(), t_a_0()), t_a_0()), t_a_0()), c_PropLog_Othms_2(v_H_0(), t_a_0()), tc_PropLog_Opl_1(t_a_0())) ....... R1 [B0:L0, B2:L1]
% Derivation of the empty clause:
% ~c_in_3(c_PropLog_Opl_Oop_A_N_62_3(c_PropLog_Opl_Oop_A_N_62_3(v_pa_0(),c_PropLog_Opl_Oop_A_N_62_3(v_q_0(),v_r_0(),t_a_0()),t_a_0()),c_PropLog_Opl_Oop_A_N_62_3(c_PropLog_Opl_Oop_A_N_62_3(v_pa_0(),v_q_0(),t_a_0()),c_PropLog_Opl_Oop_A_N_62_3(v_pa_0(),v_r_0(),t_a_0()),t_a_0()),t_a_0()),c_PropLog_Othms_2(v_H_0(),t_a_0()),tc_PropLog_Opl_1(t_a_0())) ....... U2
% c_in_3(c_PropLog_Opl_Oop_A_N_62_3(c_PropLog_Opl_Oop_A_N_62_3(x0,c_PropLog_Opl_Oop_A_N_62_3(x1,x2,x3),x3),c_PropLog_Opl_Oop_A_N_62_3(c_PropLog_Opl_Oop_A_N_62_3(x0,x1,x3),c_PropLog_Opl_Oop_A_N_62_3(x0,x2,x3),x3),x3),c_PropLog_Othms_2(x4,x3),tc_PropLog_Opl_1(x3)) ....... U1
% [] ....... R1 [U2:L0, U1:L0]
% --------------- End of Proof ---------------
% PROOF FOUND!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 1
% resolvents: 1 factors: 0
% Number of unit clauses generated: 1
% % unit clauses generated to total clauses generated: 100.00
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 2 [1] = 1
% Total = 3
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 1
% Average size of a generated clause: 1.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] c_in_3 (+)1 (-)2
% ------------------
% Total: (+)1 (-)2
% Total number of unit clauses retained: 3
% Number of clauses skipped because of their length: 0
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 0
% Number of successful unifications: 2
% Number of unification failures: 0
% Number of unit to unit unification failures: 1
% N literal unification failure due to lookup root_id table: 1
% N base clause resolution failure due to lookup table: 0
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 0
% N unit clauses dropped because they exceeded max values: 0
% N unit clauses dropped because too much nesting: 0
% 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: 27
% Max term depth in a unit clause: 5
% Number of states in UCFA table: 76
% Total number of terms of all unit clauses in table: 75
% 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: 1.01
% Number of symbols (columns) in UCFA: 44
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 2
% ConstructUnitClause() = 1
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% | |
% Inferences per sec: inf
% | |
% --------------------------------------------------------
% Elapsed time: 1 secs
% CPU time: 0.38 secs
%
%------------------------------------------------------------------------------