TSTP Solution File: FLD016-5 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : FLD016-5 : TPTP v5.0.0. Bugfixed v2.1.0.
% Transfm : add_equality
% Format : carine
% Command : carine %s t=%d xo=off uct=32000
% Computer : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Sat Nov 27 18:23:06 EST 2010
% Result : Unsatisfiable 2.87s
% Output : Refutation 2.87s
% 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/SystemOnTPTP17014/FLD/FLD016-5+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 = 250] [nf = 0] [nu = 166] [ut = 105]
% Looking for a proof at depth = 2 ...
% t = 3 secs [nr = 1300615] [nf = 90] [nu = 1034358] [ut = 27314]
% 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(),q_0(),r_0())
% B2: sum_3(a_0(),v_0(),r_0())
% B3: ~sum_3(additive_identity_0(),u_0(),v_0())
% B6: defined_1(a_0())
% B8: defined_1(v_0())
% 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)
% B29: ~sum_3(x4,x5,x2) | ~sum_3(x3,x5,x1) | ~sum_3(x0,x3,x4) | sum_3(x0,x1,x2)
% Unit Clauses:
% --------------
% U1: < d0 v0 dv0 f0 c3 t3 td1 b nc > sum_3(a_0(),u_0(),q_0())
% U25: < d1 v0 dv0 f0 c3 t3 td1 > sum_3(additive_identity_0(),a_0(),a_0())
% U27: < d1 v0 dv0 f1 c3 t4 td2 > sum_3(additive_inverse_1(a_0()),a_0(),additive_identity_0())
% U33: < d1 v0 dv0 f0 c3 t3 td1 > sum_3(additive_identity_0(),v_0(),v_0())
% U27314: < d3 v0 dv0 f0 c3 t3 td1 > sum_3(a_0(),u_0(),r_0())
% U27667: < d3 v0 dv0 f1 c3 t4 td2 > sum_3(additive_inverse_1(a_0()),r_0(),v_0())
% U27728: < d3 v0 dv0 f1 c3 t4 td2 > ~sum_3(additive_inverse_1(a_0()),a_0(),additive_identity_0())
% --------------- Start of Proof ---------------
% Derivation of unit clause U1:
% sum_3(a_0(),u_0(),q_0()) ....... U1
% Derivation of unit clause U25:
% 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(a_0()) ....... B6
% ~defined_1(x0) | sum_3(additive_inverse_1(x0),x0,additive_identity_0()) ....... B17
% sum_3(additive_inverse_1(a_0()), a_0(), additive_identity_0()) ....... R1 [B6:L0, B17:L0]
% Derivation of unit clause U33:
% defined_1(v_0()) ....... B8
% ~defined_1(x0) | sum_3(additive_identity_0(),x0,x0) ....... B15
% sum_3(additive_identity_0(), v_0(), v_0()) ....... R1 [B8:L0, B15:L0]
% Derivation of unit clause U27314:
% sum_3(additive_identity_0(),q_0(),r_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(x0, x1, q_0()) | ~sum_3(additive_identity_0(), x0, x2) | sum_3(x2, x1, r_0()) ....... R1 [B0:L0, B28:L0]
% sum_3(a_0(),u_0(),q_0()) ....... U1
% ~sum_3(additive_identity_0(), a_0(), x0) | sum_3(x0, u_0(), r_0()) ....... R2 [R1:L0, U1:L0]
% sum_3(additive_identity_0(),a_0(),a_0()) ....... U25
% sum_3(a_0(), u_0(), r_0()) ....... R3 [R2:L0, U25:L0]
% Derivation of unit clause U27667:
% sum_3(a_0(),v_0(),r_0()) ....... B2
% ~sum_3(x4,x5,x2) | ~sum_3(x3,x5,x1) | ~sum_3(x0,x3,x4) | sum_3(x0,x1,x2) ....... B29
% ~sum_3(x0, v_0(), x1) | ~sum_3(x2, a_0(), x0) | sum_3(x2, r_0(), x1) ....... R1 [B2:L0, B29:L1]
% sum_3(additive_identity_0(),v_0(),v_0()) ....... U33
% ~sum_3(x0, a_0(), additive_identity_0()) | sum_3(x0, r_0(), v_0()) ....... R2 [R1:L0, U33:L0]
% sum_3(additive_inverse_1(a_0()),a_0(),additive_identity_0()) ....... U27
% sum_3(additive_inverse_1(a_0()), r_0(), v_0()) ....... R3 [R2:L0, U27:L0]
% Derivation of unit clause U27728:
% ~sum_3(additive_identity_0(),u_0(),v_0()) ....... B3
% ~sum_3(x3,x5,x2) | ~sum_3(x4,x1,x5) | ~sum_3(x3,x4,x0) | sum_3(x0,x1,x2) ....... B28
% ~sum_3(x0, x1, v_0()) | ~sum_3(x2, u_0(), x1) | ~sum_3(x0, x2, additive_identity_0()) ....... R1 [B3:L0, B28:L3]
% sum_3(additive_inverse_1(a_0()),r_0(),v_0()) ....... U27667
% ~sum_3(x0, u_0(), r_0()) | ~sum_3(additive_inverse_1(a_0()), x0, additive_identity_0()) ....... R2 [R1:L0, U27667:L0]
% sum_3(a_0(),u_0(),r_0()) ....... U27314
% ~sum_3(additive_inverse_1(a_0()), a_0(), additive_identity_0()) ....... R3 [R2:L0, U27314:L0]
% Derivation of the empty clause:
% ~sum_3(additive_inverse_1(a_0()),a_0(),additive_identity_0()) ....... U27728
% sum_3(additive_inverse_1(a_0()),a_0(),additive_identity_0()) ....... U27
% [] ....... R1 [U27728:L0, U27:L0]
% --------------- End of Proof ---------------
% PROOF FOUND!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 1307497
% resolvents: 1307369 factors: 128
% Number of unit clauses generated: 1035871
% % unit clauses generated to total clauses generated: 79.23
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 12 [1] = 93 [2] = 27209 [3] = 415
% Total = 27729
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 1035871 [2] = 271418 [3] = 208
% 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 (+)0 (-)0
% [2] product_3 (+)286 (-)0
% [3] sum_3 (+)835 (-)15
% ------------------
% Total: (+)27714 (-)15
% Total number of unit clauses retained: 27729
% Number of clauses skipped because of their length: 16059
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 0
% Number of successful unifications: 1307509
% Number of unification failures: 1012548
% Number of unit to unit unification failures: 11701
% N literal unification failure due to lookup root_id table: 17899
% N base clause resolution failure due to lookup table: 6390
% 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: 902564
% 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: 12713
% Total number of terms of all unit clauses in table: 185134
% 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() = 2320057
% ConstructUnitClause() = 930281
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 1.10 secs
% --------------------------------------------------------
% | |
% Inferences per sec: 653748
% | |
% --------------------------------------------------------
% Elapsed time: 3 secs
% CPU time: 2.86 secs
%
%------------------------------------------------------------------------------