TSTP Solution File: ANA025-2 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : ANA025-2 : TPTP v5.0.0. Released v3.2.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 : Sat Nov 27 17:27:05 EST 2010
% Result : Unsatisfiable 0.43s
% Output : Refutation 0.43s
% 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/SystemOnTPTP30956/ANA/ANA025-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 = 13] [nf = 0] [nu = 6] [ut = 7]
% Looking for a proof at depth = 2 ...
% t = 1 secs [nr = 51] [nf = 0] [nu = 18] [ut = 10]
% Looking for a proof at depth = 3 ...
% +================================================+
% | |
% | Congratulations!!! ........ A proof was found. |
% | |
% +================================================+
% Base Clauses and Unit Clauses used in proof:
% ============================================
% Base Clauses:
% -------------
% B0: ~c_lessequals_3(c_0_0(),c_minus_3(v_k_1(v_x_0()),v_g_1(v_x_0()),t_b_0()),t_b_0())
% B1: ~c_lessequals_3(c_Orderings_Omax_3(c_minus_3(v_k_1(v_x_0()),v_g_1(v_x_0()),t_b_0()),c_0_0(),t_b_0()),c_HOL_Oabs_2(c_minus_3(v_f_1(v_x_0()),v_g_1(v_x_0()),t_b_0()),t_b_0()),t_b_0())
% B2: class_Ring__and__Field_Oordered__idom_1(t_b_0())
% B3: ~class_OrderedGroup_Olordered__ab__group__abs_1(x0) | c_lessequals_3(c_0_0(),c_HOL_Oabs_2(x1,x0),x0)
% B4: ~class_LOrder_Ojoin__semilorder_1(x0) | class_Orderings_Oorder_1(x0)
% B5: ~class_OrderedGroup_Olordered__ab__group__abs_1(x0) | class_LOrder_Ojoin__semilorder_1(x0)
% B6: ~class_Ring__and__Field_Oordered__idom_1(x0) | class_OrderedGroup_Olordered__ab__group__abs_1(x0)
% B7: ~class_Ring__and__Field_Oordered__idom_1(x0) | class_Orderings_Olinorder_1(x0)
% B8: ~class_Orderings_Olinorder_1(x0) | c_less_3(x1,x2,x0) | c_lessequals_3(x2,x1,x0)
% B9: ~class_Orderings_Oorder_1(x0) | ~c_less_3(x1,x2,x0) | c_lessequals_3(x1,x2,x0)
% B10: ~class_Orderings_Oorder_1(x0) | ~c_lessequals_3(x3,x1,x0) | ~c_lessequals_3(x1,x2,x0) | c_lessequals_3(x3,x2,x0)
% B11: ~class_Orderings_Olinorder_1(x0) | ~c_lessequals_3(x3,x2,x0) | ~c_lessequals_3(x1,x2,x0) | c_lessequals_3(c_Orderings_Omax_3(x3,x1,x0),x2,x0)
% Unit Clauses:
% --------------
% U2: < d0 v0 dv0 f0 c1 t1 td1 b nc > class_Ring__and__Field_Oordered__idom_1(t_b_0())
% U3: < d1 v0 dv0 f0 c1 t1 td1 > class_OrderedGroup_Olordered__ab__group__abs_1(t_b_0())
% U4: < d1 v0 dv0 f0 c1 t1 td1 > class_Orderings_Olinorder_1(t_b_0())
% U5: < d1 v1 dv1 f1 c3 t5 td2 > c_lessequals_3(c_0_0(),c_HOL_Oabs_2(x0,t_b_0()),t_b_0())
% U6: < d1 v0 dv0 f0 c1 t1 td1 > class_LOrder_Ojoin__semilorder_1(t_b_0())
% U9: < d2 v0 dv0 f0 c1 t1 td1 > class_Orderings_Oorder_1(t_b_0())
% U11: < d3 v1 dv1 f4 c5 t10 td3 > ~c_lessequals_3(c_HOL_Oabs_2(x0,t_b_0()),c_minus_3(v_k_1(v_x_0()),v_g_1(v_x_0()),t_b_0()),t_b_0())
% U14: < d3 v0 dv0 f7 c8 t15 td4 > ~c_lessequals_3(c_minus_3(v_k_1(v_x_0()),v_g_1(v_x_0()),t_b_0()),c_HOL_Oabs_2(c_minus_3(v_f_1(v_x_0()),v_g_1(v_x_0()),t_b_0()),t_b_0()),t_b_0())
% U17: < d3 v1 dv1 f4 c5 t10 td3 > ~c_less_3(c_HOL_Oabs_2(x0,t_b_0()),c_minus_3(v_k_1(v_x_0()),v_g_1(v_x_0()),t_b_0()),t_b_0())
% U20: < d3 v1 dv1 f4 c5 t10 td3 > c_lessequals_3(c_minus_3(v_k_1(v_x_0()),v_g_1(v_x_0()),t_b_0()),c_HOL_Oabs_2(x0,t_b_0()),t_b_0())
% --------------- Start of Proof ---------------
% Derivation of unit clause U2:
% class_Ring__and__Field_Oordered__idom_1(t_b_0()) ....... U2
% Derivation of unit clause U3:
% class_Ring__and__Field_Oordered__idom_1(t_b_0()) ....... B2
% ~class_Ring__and__Field_Oordered__idom_1(x0) | class_OrderedGroup_Olordered__ab__group__abs_1(x0) ....... B6
% class_OrderedGroup_Olordered__ab__group__abs_1(t_b_0()) ....... R1 [B2:L0, B6:L0]
% Derivation of unit clause U4:
% class_Ring__and__Field_Oordered__idom_1(t_b_0()) ....... B2
% ~class_Ring__and__Field_Oordered__idom_1(x0) | class_Orderings_Olinorder_1(x0) ....... B7
% class_Orderings_Olinorder_1(t_b_0()) ....... R1 [B2:L0, B7:L0]
% Derivation of unit clause U5:
% ~class_OrderedGroup_Olordered__ab__group__abs_1(x0) | c_lessequals_3(c_0_0(),c_HOL_Oabs_2(x1,x0),x0) ....... B3
% class_OrderedGroup_Olordered__ab__group__abs_1(t_b_0()) ....... U3
% c_lessequals_3(c_0_0(), c_HOL_Oabs_2(x0, t_b_0()), t_b_0()) ....... R1 [B3:L0, U3:L0]
% Derivation of unit clause U6:
% ~class_OrderedGroup_Olordered__ab__group__abs_1(x0) | class_LOrder_Ojoin__semilorder_1(x0) ....... B5
% class_OrderedGroup_Olordered__ab__group__abs_1(t_b_0()) ....... U3
% class_LOrder_Ojoin__semilorder_1(t_b_0()) ....... R1 [B5:L0, U3:L0]
% Derivation of unit clause U9:
% ~class_LOrder_Ojoin__semilorder_1(x0) | class_Orderings_Oorder_1(x0) ....... B4
% ~class_OrderedGroup_Olordered__ab__group__abs_1(x0) | class_LOrder_Ojoin__semilorder_1(x0) ....... B5
% class_Orderings_Oorder_1(x0) | ~class_OrderedGroup_Olordered__ab__group__abs_1(x0) ....... R1 [B4:L0, B5:L1]
% class_OrderedGroup_Olordered__ab__group__abs_1(t_b_0()) ....... U3
% class_Orderings_Oorder_1(t_b_0()) ....... R2 [R1:L1, U3:L0]
% Derivation of unit clause U11:
% ~c_lessequals_3(c_0_0(),c_minus_3(v_k_1(v_x_0()),v_g_1(v_x_0()),t_b_0()),t_b_0()) ....... B0
% ~class_Orderings_Oorder_1(x0) | ~c_lessequals_3(x3,x1,x0) | ~c_lessequals_3(x1,x2,x0) | c_lessequals_3(x3,x2,x0) ....... B10
% ~class_Orderings_Oorder_1(t_b_0()) | ~c_lessequals_3(c_0_0(), x0, t_b_0()) | ~c_lessequals_3(x0, c_minus_3(v_k_1(v_x_0()), v_g_1(v_x_0()), t_b_0()), t_b_0()) ....... R1 [B0:L0, B10:L3]
% class_Orderings_Oorder_1(t_b_0()) ....... U9
% ~c_lessequals_3(c_0_0(), x0, t_b_0()) | ~c_lessequals_3(x0, c_minus_3(v_k_1(v_x_0()), v_g_1(v_x_0()), t_b_0()), t_b_0()) ....... R2 [R1:L0, U9:L0]
% c_lessequals_3(c_0_0(),c_HOL_Oabs_2(x0,t_b_0()),t_b_0()) ....... U5
% ~c_lessequals_3(c_HOL_Oabs_2(x0, t_b_0()), c_minus_3(v_k_1(v_x_0()), v_g_1(v_x_0()), t_b_0()), t_b_0()) ....... R3 [R2:L0, U5:L0]
% Derivation of unit clause U14:
% ~c_lessequals_3(c_Orderings_Omax_3(c_minus_3(v_k_1(v_x_0()),v_g_1(v_x_0()),t_b_0()),c_0_0(),t_b_0()),c_HOL_Oabs_2(c_minus_3(v_f_1(v_x_0()),v_g_1(v_x_0()),t_b_0()),t_b_0()),t_b_0()) ....... B1
% ~class_Orderings_Olinorder_1(x0) | ~c_lessequals_3(x3,x2,x0) | ~c_lessequals_3(x1,x2,x0) | c_lessequals_3(c_Orderings_Omax_3(x3,x1,x0),x2,x0) ....... B11
% ~class_Orderings_Olinorder_1(t_b_0()) | ~c_lessequals_3(c_minus_3(v_k_1(v_x_0()), v_g_1(v_x_0()), t_b_0()), c_HOL_Oabs_2(c_minus_3(v_f_1(v_x_0()), v_g_1(v_x_0()), t_b_0()), t_b_0()), t_b_0()) | ~c_lessequals_3(c_0_0(), c_HOL_Oabs_2(c_minus_3(v_f_1(v_x_0()), v_g_1(v_x_0()), t_b_0()), t_b_0()), t_b_0()) ....... R1 [B1:L0, B11:L3]
% class_Orderings_Olinorder_1(t_b_0()) ....... U4
% ~c_lessequals_3(c_minus_3(v_k_1(v_x_0()), v_g_1(v_x_0()), t_b_0()), c_HOL_Oabs_2(c_minus_3(v_f_1(v_x_0()), v_g_1(v_x_0()), t_b_0()), t_b_0()), t_b_0()) | ~c_lessequals_3(c_0_0(), c_HOL_Oabs_2(c_minus_3(v_f_1(v_x_0()), v_g_1(v_x_0()), t_b_0()), t_b_0()), t_b_0()) ....... R2 [R1:L0, U4:L0]
% c_lessequals_3(c_0_0(),c_HOL_Oabs_2(x0,t_b_0()),t_b_0()) ....... U5
% ~c_lessequals_3(c_minus_3(v_k_1(v_x_0()), v_g_1(v_x_0()), t_b_0()), c_HOL_Oabs_2(c_minus_3(v_f_1(v_x_0()), v_g_1(v_x_0()), t_b_0()), t_b_0()), t_b_0()) ....... R3 [R2:L1, U5:L0]
% Derivation of unit clause U17:
% ~class_LOrder_Ojoin__semilorder_1(x0) | class_Orderings_Oorder_1(x0) ....... B4
% ~class_Orderings_Oorder_1(x0) | ~c_less_3(x1,x2,x0) | c_lessequals_3(x1,x2,x0) ....... B9
% ~class_LOrder_Ojoin__semilorder_1(x0) | ~c_less_3(x1, x2, x0) | c_lessequals_3(x1, x2, x0) ....... R1 [B4:L1, B9:L0]
% class_LOrder_Ojoin__semilorder_1(t_b_0()) ....... U6
% ~c_less_3(x0, x1, t_b_0()) | c_lessequals_3(x0, x1, t_b_0()) ....... R2 [R1:L0, U6:L0]
% ~c_lessequals_3(c_HOL_Oabs_2(x0,t_b_0()),c_minus_3(v_k_1(v_x_0()),v_g_1(v_x_0()),t_b_0()),t_b_0()) ....... U11
% ~c_less_3(c_HOL_Oabs_2(x0, t_b_0()), c_minus_3(v_k_1(v_x_0()), v_g_1(v_x_0()), t_b_0()), t_b_0()) ....... R3 [R2:L1, U11:L0]
% Derivation of unit clause U20:
% ~class_Ring__and__Field_Oordered__idom_1(x0) | class_Orderings_Olinorder_1(x0) ....... B7
% ~class_Orderings_Olinorder_1(x0) | c_less_3(x1,x2,x0) | c_lessequals_3(x2,x1,x0) ....... B8
% ~class_Ring__and__Field_Oordered__idom_1(x0) | c_less_3(x1, x2, x0) | c_lessequals_3(x2, x1, x0) ....... R1 [B7:L1, B8:L0]
% class_Ring__and__Field_Oordered__idom_1(t_b_0()) ....... U2
% c_less_3(x0, x1, t_b_0()) | c_lessequals_3(x1, x0, t_b_0()) ....... R2 [R1:L0, U2:L0]
% ~c_less_3(c_HOL_Oabs_2(x0,t_b_0()),c_minus_3(v_k_1(v_x_0()),v_g_1(v_x_0()),t_b_0()),t_b_0()) ....... U17
% c_lessequals_3(c_minus_3(v_k_1(v_x_0()), v_g_1(v_x_0()), t_b_0()), c_HOL_Oabs_2(x0, t_b_0()), t_b_0()) ....... R3 [R2:L0, U17:L0]
% Derivation of the empty clause:
% c_lessequals_3(c_minus_3(v_k_1(v_x_0()),v_g_1(v_x_0()),t_b_0()),c_HOL_Oabs_2(x0,t_b_0()),t_b_0()) ....... U20
% ~c_lessequals_3(c_minus_3(v_k_1(v_x_0()),v_g_1(v_x_0()),t_b_0()),c_HOL_Oabs_2(c_minus_3(v_f_1(v_x_0()),v_g_1(v_x_0()),t_b_0()),t_b_0()),t_b_0()) ....... U14
% [] ....... R1 [U20:L0, U14:L0]
% --------------- End of Proof ---------------
% PROOF FOUND!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 154
% resolvents: 154 factors: 0
% Number of unit clauses generated: 61
% % unit clauses generated to total clauses generated: 39.61
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 3 [1] = 4 [2] = 3 [3] = 11
% Total = 21
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 61 [2] = 71 [3] = 22
% Average size of a generated clause: 2.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] class_LOrder_Ojoin__semilorder_1 (+)1 (-)0
% [1] class_OrderedGroup_Olordered__ab__group__abs_1 (+)1 (-)0
% [2] class_Orderings_Olinorder_1 (+)1 (-)0
% [3] class_Orderings_Oorder_1 (+)1 (-)0
% [4] class_Ring__and__Field_Oordered__idom_1 (+)1 (-)0
% [5] c_less_3 (+)2 (-)5
% [6] c_lessequals_3 (+)4 (-)5
% ------------------
% Total: (+)11 (-)10
% Total number of unit clauses retained: 21
% Number of clauses skipped because of their length: 87
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 0
% Number of successful unifications: 172
% Number of unification failures: 69
% Number of unit to unit unification failures: 29
% N literal unification failure due to lookup root_id table: 298
% N base clause resolution failure due to lookup table: 332
% 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: 22
% 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: 18
% Max term depth in a unit clause: 4
% Number of states in UCFA table: 163
% Total number of terms of all unit clauses in table: 196
% 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.83
% Number of symbols (columns) in UCFA: 50
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 241
% ConstructUnitClause() = 40
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% | |
% Inferences per sec: inf
% | |
% --------------------------------------------------------
% Elapsed time: 1 secs
% CPU time: 0.41 secs
%
%------------------------------------------------------------------------------