TSTP Solution File: ANA029-2 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : ANA029-2 : TPTP v5.0.0. Released v3.2.0.
% Transfm : add_equality
% Format : carine
% Command : carine %s t=%d xo=off uct=32000
% Computer : art04.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:28:26 EST 2010
% Result : Unsatisfiable 0.41s
% Output : Refutation 0.41s
% 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/SystemOnTPTP9518/ANA/ANA029-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 = 0 secs [nr = 16] [nf = 0] [nu = 8] [ut = 8]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 77] [nf = 0] [nu = 24] [ut = 14]
% 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_f_1(v_x_0()),v_k_1(v_x_0()),t_b_0()),t_b_0())
% B1: ~c_lessequals_3(c_Orderings_Omax_3(c_minus_3(v_f_1(v_x_0()),v_k_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_OrderedGroup_Opordered__ab__group__add_1(x0) | class_Orderings_Oorder_1(x0)
% B5: ~class_Ring__and__Field_Oordered__idom_1(x0) | class_OrderedGroup_Olordered__ab__group__abs_1(x0)
% B6: ~class_Ring__and__Field_Oordered__idom_1(x0) | class_OrderedGroup_Opordered__ab__group__add_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)
% B12: ~class_Orderings_Oorder_1(x0) | ~c_lessequals_3(x3,x1,x0) | ~c_lessequals_3(x1,x2,x0) | c_lessequals_3(x3,x2,x0)
% B13: ~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_OrderedGroup_Opordered__ab__group__add_1(t_b_0())
% U5: < d1 v0 dv0 f0 c1 t1 td1 > class_Orderings_Olinorder_1(t_b_0())
% U6: < d1 v1 dv1 f1 c3 t5 td2 > c_lessequals_3(c_0_0(),c_HOL_Oabs_2(x0,t_b_0()),t_b_0())
% U7: < d1 v0 dv0 f0 c1 t1 td1 > class_Orderings_Oorder_1(t_b_0())
% U14: < d3 v1 dv1 f4 c5 t10 td3 > ~c_lessequals_3(c_HOL_Oabs_2(x0,t_b_0()),c_minus_3(v_f_1(v_x_0()),v_k_1(v_x_0()),t_b_0()),t_b_0())
% U16: < d3 v0 dv0 f7 c8 t15 td4 > ~c_lessequals_3(c_minus_3(v_f_1(v_x_0()),v_k_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())
% U22: < d3 v1 dv1 f4 c5 t10 td3 > ~c_less_3(c_HOL_Oabs_2(x0,t_b_0()),c_minus_3(v_f_1(v_x_0()),v_k_1(v_x_0()),t_b_0()),t_b_0())
% U78: < d3 v1 dv1 f4 c5 t10 td3 > c_lessequals_3(c_minus_3(v_f_1(v_x_0()),v_k_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) ....... B5
% class_OrderedGroup_Olordered__ab__group__abs_1(t_b_0()) ....... R1 [B2:L0, B5: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_OrderedGroup_Opordered__ab__group__add_1(x0) ....... B6
% class_OrderedGroup_Opordered__ab__group__add_1(t_b_0()) ....... R1 [B2:L0, B6:L0]
% Derivation of unit clause U5:
% 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 U6:
% ~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 U7:
% ~class_OrderedGroup_Opordered__ab__group__add_1(x0) | class_Orderings_Oorder_1(x0) ....... B4
% class_OrderedGroup_Opordered__ab__group__add_1(t_b_0()) ....... U4
% class_Orderings_Oorder_1(t_b_0()) ....... R1 [B4:L0, U4:L0]
% Derivation of unit clause U14:
% ~c_lessequals_3(c_0_0(),c_minus_3(v_f_1(v_x_0()),v_k_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) ....... B12
% ~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_f_1(v_x_0()), v_k_1(v_x_0()), t_b_0()), t_b_0()) ....... R1 [B0:L0, B12:L3]
% class_Orderings_Oorder_1(t_b_0()) ....... U7
% ~c_lessequals_3(c_0_0(), x0, t_b_0()) | ~c_lessequals_3(x0, c_minus_3(v_f_1(v_x_0()), v_k_1(v_x_0()), t_b_0()), t_b_0()) ....... R2 [R1:L0, U7:L0]
% c_lessequals_3(c_0_0(),c_HOL_Oabs_2(x0,t_b_0()),t_b_0()) ....... U6
% ~c_lessequals_3(c_HOL_Oabs_2(x0, t_b_0()), c_minus_3(v_f_1(v_x_0()), v_k_1(v_x_0()), t_b_0()), t_b_0()) ....... R3 [R2:L0, U6:L0]
% Derivation of unit clause U16:
% ~c_lessequals_3(c_Orderings_Omax_3(c_minus_3(v_f_1(v_x_0()),v_k_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) ....... B13
% ~class_Orderings_Olinorder_1(t_b_0()) | ~c_lessequals_3(c_minus_3(v_f_1(v_x_0()), v_k_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, B13:L3]
% class_Orderings_Olinorder_1(t_b_0()) ....... U5
% ~c_lessequals_3(c_minus_3(v_f_1(v_x_0()), v_k_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, U5:L0]
% c_lessequals_3(c_0_0(),c_HOL_Oabs_2(x0,t_b_0()),t_b_0()) ....... U6
% ~c_lessequals_3(c_minus_3(v_f_1(v_x_0()), v_k_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, U6:L0]
% Derivation of unit clause U22:
% ~class_OrderedGroup_Opordered__ab__group__add_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_OrderedGroup_Opordered__ab__group__add_1(x0) | ~c_less_3(x1, x2, x0) | c_lessequals_3(x1, x2, x0) ....... R1 [B4:L1, B9:L0]
% class_OrderedGroup_Opordered__ab__group__add_1(t_b_0()) ....... U4
% ~c_less_3(x0, x1, t_b_0()) | c_lessequals_3(x0, x1, t_b_0()) ....... R2 [R1:L0, U4:L0]
% ~c_lessequals_3(c_HOL_Oabs_2(x0,t_b_0()),c_minus_3(v_f_1(v_x_0()),v_k_1(v_x_0()),t_b_0()),t_b_0()) ....... U14
% ~c_less_3(c_HOL_Oabs_2(x0, t_b_0()), c_minus_3(v_f_1(v_x_0()), v_k_1(v_x_0()), t_b_0()), t_b_0()) ....... R3 [R2:L1, U14:L0]
% Derivation of unit clause U78:
% ~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_f_1(v_x_0()),v_k_1(v_x_0()),t_b_0()),t_b_0()) ....... U22
% c_lessequals_3(c_minus_3(v_f_1(v_x_0()), v_k_1(v_x_0()), t_b_0()), c_HOL_Oabs_2(x0, t_b_0()), t_b_0()) ....... R3 [R2:L0, U22:L0]
% Derivation of the empty clause:
% c_lessequals_3(c_minus_3(v_f_1(v_x_0()),v_k_1(v_x_0()),t_b_0()),c_HOL_Oabs_2(x0,t_b_0()),t_b_0()) ....... U78
% ~c_lessequals_3(c_minus_3(v_f_1(v_x_0()),v_k_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()) ....... U16
% [] ....... R1 [U78:L0, U16:L0]
% --------------- End of Proof ---------------
% PROOF FOUND!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 476
% resolvents: 472 factors: 4
% Number of unit clauses generated: 247
% % unit clauses generated to total clauses generated: 51.89
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 3 [1] = 5 [2] = 6 [3] = 65
% Total = 79
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 247 [2] = 189 [3] = 40
% Average size of a generated clause: 2.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] class_OrderedGroup_Olordered__ab__group__abs_1 (+)1 (-)0
% [1] class_OrderedGroup_Opordered__ab__group__add_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 (-)7
% [6] c_lessequals_3 (+)28 (-)37
% ------------------
% Total: (+)35 (-)44
% Total number of unit clauses retained: 79
% Number of clauses skipped because of their length: 534
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 0
% Number of successful unifications: 493
% Number of unification failures: 1981
% Number of unit to unit unification failures: 1019
% N literal unification failure due to lookup root_id table: 974
% N base clause resolution failure due to lookup table: 1076
% 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: 147
% N unit clauses dropped because too much nesting: 16
% 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: 36
% Max term depth in a unit clause: 10
% Number of states in UCFA table: 1117
% Total number of terms of all unit clauses in table: 1471
% 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.76
% Number of symbols (columns) in UCFA: 50
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 2474
% ConstructUnitClause() = 223
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% | |
% Inferences per sec: inf
% | |
% --------------------------------------------------------
% Elapsed time: 0 secs
% CPU time: 0.41 secs
%
%------------------------------------------------------------------------------