TSTP Solution File: FLD066-3 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : FLD066-3 : TPTP v5.0.0. Bugfixed v2.1.0.
% Transfm : add_equality
% Format : carine
% Command : carine %s t=%d xo=off uct=32000
% Computer : art05.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 19:19:56 EST 2010
% Result : Unsatisfiable 2.62s
% Output : Refutation 2.62s
% 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/SystemOnTPTP28137/FLD/FLD066-3+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 = 248] [nf = 0] [nu = 160] [ut = 103]
% Looking for a proof at depth = 2 ...
% t = 2 secs [nr = 1300603] [nf = 82] [nu = 1034338] [ut = 27312]
% Looking for a proof at depth = 3 ...
% +================================================+
% | |
% | Congratulations!!! ........ A proof was found. |
% | |
% +================================================+
% Base Clauses and Unit Clauses used in proof:
% ============================================
% Base Clauses:
% -------------
% B0: sum_3(a_0(),c_0(),u_0())
% B1: sum_3(b_0(),c_0(),v_0())
% B2: less_or_equal_2(u_0(),v_0())
% B6: defined_1(a_0())
% B7: defined_1(b_0())
% B8: defined_1(c_0())
% B13: ~sum_3(x1,x0,x2) | sum_3(x0,x1,x2)
% B15: ~defined_1(x0) | sum_3(additive_identity_0(),x0,x0)
% B17: ~defined_1(x0) | sum_3(additive_inverse_1(x0),x0,additive_identity_0())
% B28: ~sum_3(x3,x5,x2) | ~sum_3(x4,x1,x5) | ~sum_3(x3,x4,x0) | sum_3(x0,x1,x2)
% B30: ~less_or_equal_2(x2,x3) | ~sum_3(x3,x4,x1) | ~sum_3(x2,x4,x0) | less_or_equal_2(x0,x1)
% Unit Clauses:
% --------------
% U3: < d0 v0 dv0 f0 c2 t2 td1 b nc > ~less_or_equal_2(a_0(),b_0())
% U23: < d1 v0 dv0 f0 c3 t3 td1 > sum_3(additive_identity_0(),a_0(),a_0())
% U27: < d1 v0 dv0 f0 c3 t3 td1 > sum_3(additive_identity_0(),b_0(),b_0())
% U33: < d1 v0 dv0 f1 c3 t4 td2 > sum_3(additive_inverse_1(c_0()),c_0(),additive_identity_0())
% U51: < d1 v0 dv0 f0 c3 t3 td1 > sum_3(a_0(),additive_identity_0(),a_0())
% U53: < d1 v0 dv0 f0 c3 t3 td1 > sum_3(b_0(),additive_identity_0(),b_0())
% U56: < d1 v0 dv0 f1 c3 t4 td2 > sum_3(c_0(),additive_inverse_1(c_0()),additive_identity_0())
% U27326: < d3 v0 dv0 f1 c3 t4 td2 > sum_3(u_0(),additive_inverse_1(c_0()),a_0())
% U27379: < d3 v0 dv0 f1 c3 t4 td2 > sum_3(v_0(),additive_inverse_1(c_0()),b_0())
% U27448: < d3 v0 dv0 f0 c2 t2 td1 > less_or_equal_2(a_0(),b_0())
% --------------- Start of Proof ---------------
% Derivation of unit clause U3:
% ~less_or_equal_2(a_0(),b_0()) ....... U3
% Derivation of unit clause U23:
% defined_1(a_0()) ....... B6
% ~defined_1(x0) | sum_3(additive_identity_0(),x0,x0) ....... B15
% sum_3(additive_identity_0(), a_0(), a_0()) ....... R1 [B6:L0, B15:L0]
% Derivation of unit clause U27:
% defined_1(b_0()) ....... B7
% ~defined_1(x0) | sum_3(additive_identity_0(),x0,x0) ....... B15
% sum_3(additive_identity_0(), b_0(), b_0()) ....... R1 [B7:L0, B15:L0]
% Derivation of unit clause U33:
% defined_1(c_0()) ....... B8
% ~defined_1(x0) | sum_3(additive_inverse_1(x0),x0,additive_identity_0()) ....... B17
% sum_3(additive_inverse_1(c_0()), c_0(), additive_identity_0()) ....... R1 [B8:L0, B17:L0]
% Derivation of unit clause U51:
% ~sum_3(x1,x0,x2) | sum_3(x0,x1,x2) ....... B13
% sum_3(additive_identity_0(),a_0(),a_0()) ....... U23
% sum_3(a_0(), additive_identity_0(), a_0()) ....... R1 [B13:L0, U23:L0]
% Derivation of unit clause U53:
% ~sum_3(x1,x0,x2) | sum_3(x0,x1,x2) ....... B13
% sum_3(additive_identity_0(),b_0(),b_0()) ....... U27
% sum_3(b_0(), additive_identity_0(), b_0()) ....... R1 [B13:L0, U27:L0]
% Derivation of unit clause U56:
% ~sum_3(x1,x0,x2) | sum_3(x0,x1,x2) ....... B13
% sum_3(additive_inverse_1(c_0()),c_0(),additive_identity_0()) ....... U33
% sum_3(c_0(), additive_inverse_1(c_0()), additive_identity_0()) ....... R1 [B13:L0, U33:L0]
% Derivation of unit clause U27326:
% sum_3(a_0(),c_0(),u_0()) ....... B0
% ~sum_3(x3,x5,x2) | ~sum_3(x4,x1,x5) | ~sum_3(x3,x4,x0) | sum_3(x0,x1,x2) ....... B28
% ~sum_3(a_0(), x0, x1) | ~sum_3(c_0(), x2, x0) | sum_3(u_0(), x2, x1) ....... R1 [B0:L0, B28:L2]
% sum_3(a_0(),additive_identity_0(),a_0()) ....... U51
% ~sum_3(c_0(), x0, additive_identity_0()) | sum_3(u_0(), x0, a_0()) ....... R2 [R1:L0, U51:L0]
% sum_3(c_0(),additive_inverse_1(c_0()),additive_identity_0()) ....... U56
% sum_3(u_0(), additive_inverse_1(c_0()), a_0()) ....... R3 [R2:L0, U56:L0]
% Derivation of unit clause U27379:
% sum_3(b_0(),c_0(),v_0()) ....... B1
% ~sum_3(x3,x5,x2) | ~sum_3(x4,x1,x5) | ~sum_3(x3,x4,x0) | sum_3(x0,x1,x2) ....... B28
% ~sum_3(b_0(), x0, x1) | ~sum_3(c_0(), x2, x0) | sum_3(v_0(), x2, x1) ....... R1 [B1:L0, B28:L2]
% sum_3(b_0(),additive_identity_0(),b_0()) ....... U53
% ~sum_3(c_0(), x0, additive_identity_0()) | sum_3(v_0(), x0, b_0()) ....... R2 [R1:L0, U53:L0]
% sum_3(c_0(),additive_inverse_1(c_0()),additive_identity_0()) ....... U56
% sum_3(v_0(), additive_inverse_1(c_0()), b_0()) ....... R3 [R2:L0, U56:L0]
% Derivation of unit clause U27448:
% less_or_equal_2(u_0(),v_0()) ....... B2
% ~less_or_equal_2(x2,x3) | ~sum_3(x3,x4,x1) | ~sum_3(x2,x4,x0) | less_or_equal_2(x0,x1) ....... B30
% ~sum_3(v_0(), x0, x1) | ~sum_3(u_0(), x0, x2) | less_or_equal_2(x2, x1) ....... R1 [B2:L0, B30:L0]
% sum_3(v_0(),additive_inverse_1(c_0()),b_0()) ....... U27379
% ~sum_3(u_0(), additive_inverse_1(c_0()), x0) | less_or_equal_2(x0, b_0()) ....... R2 [R1:L0, U27379:L0]
% sum_3(u_0(),additive_inverse_1(c_0()),a_0()) ....... U27326
% less_or_equal_2(a_0(), b_0()) ....... R3 [R2:L0, U27326:L0]
% Derivation of the empty clause:
% less_or_equal_2(a_0(),b_0()) ....... U27448
% ~less_or_equal_2(a_0(),b_0()) ....... U3
% [] ....... R1 [U27448:L0, U3:L0]
% --------------- End of Proof ---------------
% PROOF FOUND!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 1302890
% resolvents: 1302776 factors: 114
% Number of unit clauses generated: 1034752
% % unit clauses generated to total clauses generated: 79.42
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 12 [1] = 91 [2] = 27209 [3] = 137
% Total = 27449
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 1034752 [2] = 267973 [3] = 165
% Average size of a generated clause: 2.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] defined_1 (+)26593 (-)0
% [1] less_or_equal_2 (+)32 (-)1
% [2] product_3 (+)286 (-)0
% [3] sum_3 (+)536 (-)1
% ------------------
% Total: (+)27447 (-)2
% Total number of unit clauses retained: 27449
% Number of clauses skipped because of their length: 6304
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 0
% Number of successful unifications: 1302905
% Number of unification failures: 253545
% Number of unit to unit unification failures: 567
% N literal unification failure due to lookup root_id table: 7356
% N base clause resolution failure due to lookup table: 2765
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 9
% N unit clauses dropped because they exceeded max values: 901733
% N unit clauses dropped because too much nesting: 428743
% 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: 8
% Max term depth in a unit clause: 4
% Number of states in UCFA table: 12473
% Total number of terms of all unit clauses in table: 183363
% Max allowed number of states in UCFA: 80000
% Ratio n states used/total allowed states: 0.16
% Ratio n states used/total unit clauses terms: 0.07
% Number of symbols (columns) in UCFA: 49
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 1556450
% ConstructUnitClause() = 929170
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 1.08 secs
% --------------------------------------------------------
% | |
% Inferences per sec: 651445
% | |
% --------------------------------------------------------
% Elapsed time: 2 secs
% CPU time: 2.62 secs
%
%------------------------------------------------------------------------------