TSTP Solution File: FLD007-3 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : FLD007-3 : TPTP v5.0.0. Bugfixed v2.1.0.
% Transfm : add_equality
% Format : carine
% Command : carine %s t=%d xo=off uct=32000
% Computer : art03.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 18:10:09 EST 2010
% Result : Unsatisfiable 0.60s
% Output : Refutation 0.60s
% 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/SystemOnTPTP19829/FLD/FLD007-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 = 119] [nf = 0] [nu = 75] [ut = 49]
% Looking for a proof at depth = 2 ...
% t = 1 secs [nr = 243137] [nf = 62] [nu = 177928] [ut = 7891]
% 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(additive_identity_0(),additive_inverse_1(additive_inverse_1(a_0())),a_0())
% B3: defined_1(a_0())
% B6: ~sum_3(x1,x0,x2) | sum_3(x0,x1,x2)
% B8: ~defined_1(x0) | sum_3(additive_identity_0(),x0,x0)
% B9: ~defined_1(x0) | defined_1(additive_inverse_1(x0))
% B10: ~defined_1(x0) | sum_3(additive_inverse_1(x0),x0,additive_identity_0())
% B21: ~sum_3(x3,x5,x2) | ~sum_3(x4,x1,x5) | ~sum_3(x3,x4,x0) | sum_3(x0,x1,x2)
% Unit Clauses:
% --------------
% U15: < d1 v0 dv0 f0 c3 t3 td1 > sum_3(additive_identity_0(),a_0(),a_0())
% U16: < d1 v0 dv0 f1 c1 t2 td2 > defined_1(additive_inverse_1(a_0()))
% U17: < d1 v0 dv0 f1 c3 t4 td2 > sum_3(additive_inverse_1(a_0()),a_0(),additive_identity_0())
% U23: < d1 v0 dv0 f0 c3 t3 td1 > sum_3(a_0(),additive_identity_0(),a_0())
% U24: < d1 v0 dv0 f1 c3 t4 td2 > sum_3(a_0(),additive_inverse_1(a_0()),additive_identity_0())
% U6927: < d2 v0 dv0 f3 c3 t6 td3 > sum_3(additive_inverse_1(a_0()),additive_inverse_1(additive_inverse_1(a_0())),additive_identity_0())
% U7893: < d3 v0 dv0 f1 c3 t4 td2 > ~sum_3(a_0(),additive_inverse_1(a_0()),additive_identity_0())
% --------------- Start of Proof ---------------
% Derivation of unit clause U15:
% defined_1(a_0()) ....... B3
% ~defined_1(x0) | sum_3(additive_identity_0(),x0,x0) ....... B8
% sum_3(additive_identity_0(), a_0(), a_0()) ....... R1 [B3:L0, B8:L0]
% Derivation of unit clause U16:
% defined_1(a_0()) ....... B3
% ~defined_1(x0) | defined_1(additive_inverse_1(x0)) ....... B9
% defined_1(additive_inverse_1(a_0())) ....... R1 [B3:L0, B9:L0]
% Derivation of unit clause U17:
% defined_1(a_0()) ....... B3
% ~defined_1(x0) | sum_3(additive_inverse_1(x0),x0,additive_identity_0()) ....... B10
% sum_3(additive_inverse_1(a_0()), a_0(), additive_identity_0()) ....... R1 [B3:L0, B10:L0]
% Derivation of unit clause U23:
% ~sum_3(x1,x0,x2) | sum_3(x0,x1,x2) ....... B6
% sum_3(additive_identity_0(),a_0(),a_0()) ....... U15
% sum_3(a_0(), additive_identity_0(), a_0()) ....... R1 [B6:L0, U15:L0]
% Derivation of unit clause U24:
% ~sum_3(x1,x0,x2) | sum_3(x0,x1,x2) ....... B6
% sum_3(additive_inverse_1(a_0()),a_0(),additive_identity_0()) ....... U17
% sum_3(a_0(), additive_inverse_1(a_0()), additive_identity_0()) ....... R1 [B6:L0, U17:L0]
% Derivation of unit clause U6927:
% ~sum_3(x1,x0,x2) | sum_3(x0,x1,x2) ....... B6
% ~defined_1(x0) | sum_3(additive_inverse_1(x0),x0,additive_identity_0()) ....... B10
% sum_3(x0, additive_inverse_1(x0), additive_identity_0()) | ~defined_1(x0) ....... R1 [B6:L0, B10:L1]
% defined_1(additive_inverse_1(a_0())) ....... U16
% sum_3(additive_inverse_1(a_0()), additive_inverse_1(additive_inverse_1(a_0())), additive_identity_0()) ....... R2 [R1:L1, U16:L0]
% Derivation of unit clause U7893:
% ~sum_3(additive_identity_0(),additive_inverse_1(additive_inverse_1(a_0())),a_0()) ....... B0
% ~sum_3(x3,x5,x2) | ~sum_3(x4,x1,x5) | ~sum_3(x3,x4,x0) | sum_3(x0,x1,x2) ....... B21
% ~sum_3(x0, x1, a_0()) | ~sum_3(x2, additive_inverse_1(additive_inverse_1(a_0())), x1) | ~sum_3(x0, x2, additive_identity_0()) ....... R1 [B0:L0, B21:L3]
% sum_3(a_0(),additive_identity_0(),a_0()) ....... U23
% ~sum_3(x0, additive_inverse_1(additive_inverse_1(a_0())), additive_identity_0()) | ~sum_3(a_0(), x0, additive_identity_0()) ....... R2 [R1:L0, U23:L0]
% sum_3(additive_inverse_1(a_0()),additive_inverse_1(additive_inverse_1(a_0())),additive_identity_0()) ....... U6927
% ~sum_3(a_0(), additive_inverse_1(a_0()), additive_identity_0()) ....... R3 [R2:L0, U6927:L0]
% Derivation of the empty clause:
% ~sum_3(a_0(),additive_inverse_1(a_0()),additive_identity_0()) ....... U7893
% sum_3(a_0(),additive_inverse_1(a_0()),additive_identity_0()) ....... U24
% [] ....... R1 [U7893:L0, U24:L0]
% --------------- End of Proof ---------------
% PROOF FOUND!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 243219
% resolvents: 243155 factors: 64
% Number of unit clauses generated: 177933
% % unit clauses generated to total clauses generated: 73.16
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 5 [1] = 44 [2] = 7842 [3] = 3
% Total = 7894
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 177933 [2] = 65245 [3] = 41
% Average size of a generated clause: 2.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] defined_1 (+)6546 (-)0
% [1] less_or_equal_2 (+)0 (-)0
% [2] product_3 (+)623 (-)0
% [3] sum_3 (+)719 (-)6
% ------------------
% Total: (+)7888 (-)6
% Total number of unit clauses retained: 7894
% Number of clauses skipped because of their length: 595
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 0
% Number of successful unifications: 243229
% Number of unification failures: 4975
% Number of unit to unit unification failures: 3605
% N literal unification failure due to lookup root_id table: 788
% N base clause resolution failure due to lookup table: 402
% 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: 146027
% N unit clauses dropped because too much nesting: 61496
% 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: 11
% Max term depth in a unit clause: 5
% Number of states in UCFA table: 16245
% Total number of terms of all unit clauses in table: 67397
% Max allowed number of states in UCFA: 104000
% Ratio n states used/total allowed states: 0.16
% Ratio n states used/total unit clauses terms: 0.24
% Number of symbols (columns) in UCFA: 45
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 248204
% ConstructUnitClause() = 153916
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.17 secs
% --------------------------------------------------------
% | |
% Inferences per sec: inf
% | |
% --------------------------------------------------------
% Elapsed time: 1 secs
% CPU time: 0.60 secs
%
%------------------------------------------------------------------------------