TSTP Solution File: FLD010-1 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : FLD010-1 : TPTP v5.0.0. Bugfixed v2.7.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:14:15 EST 2010
% Result : Unsatisfiable 121.02s
% Output : Refutation 121.02s
% 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/SystemOnTPTP15365/FLD/FLD010-1+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 = 116] [nf = 0] [nu = 74] [ut = 46]
% Looking for a proof at depth = 2 ...
% t = 1 secs [nr = 91167] [nf = 106] [nu = 51051] [ut = 5432]
% Looking for a proof at depth = 3 ...
% Entering time slice 2
% Updating parameters ... done.
% Looking for a proof at depth = 1 ...
% +================================================+
% | |
% | Congratulations!!! ........ A proof was found. |
% | |
% +================================================+
% Base Clauses and Unit Clauses used in proof:
% ============================================
% Base Clauses:
% -------------
% B0: ~equalish_2(multiplicative_inverse_1(multiplicative_identity_0()),multiplicative_identity_0())
% B2: defined_1(multiplicative_identity_0())
% B3: ~equalish_2(additive_identity_0(),multiplicative_identity_0())
% B4: ~equalish_2(x1,x0) | equalish_2(x0,x1)
% B8: ~defined_1(x0) | equalish_2(multiply_2(multiplicative_identity_0(),x0),x0)
% B11: ~equalish_2(x2,x1) | ~equalish_2(x0,x2) | equalish_2(x0,x1)
% B22: ~defined_1(x0) | defined_1(multiplicative_inverse_1(x0)) | equalish_2(x0,additive_identity_0())
% B23: ~defined_1(x0) | equalish_2(multiply_2(x0,multiplicative_inverse_1(x0)),multiplicative_identity_0()) | equalish_2(x0,additive_identity_0())
% Unit Clauses:
% --------------
% U15: < d1 v0 dv0 f0 c2 t2 td1 > ~equalish_2(multiplicative_identity_0(),additive_identity_0())
% U2847: < d2 v0 dv0 f1 c1 t2 td2 > defined_1(multiplicative_inverse_1(multiplicative_identity_0()))
% U2848: < d2 v0 dv0 f2 c3 t5 td3 > equalish_2(multiply_2(multiplicative_identity_0(),multiplicative_inverse_1(multiplicative_identity_0())),multiplicative_identity_0())
% U4052: < d2 v0 dv0 f3 c3 t6 td3 > equalish_2(multiplicative_inverse_1(multiplicative_identity_0()),multiply_2(multiplicative_identity_0(),multiplicative_inverse_1(multiplicative_identity_0())))
% U5433: < d3 v0 dv0 f2 c3 t5 td3 > ~equalish_2(multiplicative_identity_0(),multiply_2(multiplicative_identity_0(),multiplicative_inverse_1(multiplicative_identity_0())))
% U10845: < d1 v0 dv0 f2 c3 t5 td3 > equalish_2(multiplicative_identity_0(),multiply_2(multiplicative_identity_0(),multiplicative_inverse_1(multiplicative_identity_0())))
% --------------- Start of Proof ---------------
% Derivation of unit clause U15:
% ~equalish_2(additive_identity_0(),multiplicative_identity_0()) ....... B3
% ~equalish_2(x1,x0) | equalish_2(x0,x1) ....... B4
% ~equalish_2(multiplicative_identity_0(), additive_identity_0()) ....... R1 [B3:L0, B4:L1]
% Derivation of unit clause U2847:
% defined_1(multiplicative_identity_0()) ....... B2
% ~defined_1(x0) | defined_1(multiplicative_inverse_1(x0)) | equalish_2(x0,additive_identity_0()) ....... B22
% defined_1(multiplicative_inverse_1(multiplicative_identity_0())) | equalish_2(multiplicative_identity_0(), additive_identity_0()) ....... R1 [B2:L0, B22:L0]
% ~equalish_2(multiplicative_identity_0(),additive_identity_0()) ....... U15
% defined_1(multiplicative_inverse_1(multiplicative_identity_0())) ....... R2 [R1:L1, U15:L0]
% Derivation of unit clause U2848:
% defined_1(multiplicative_identity_0()) ....... B2
% ~defined_1(x0) | equalish_2(multiply_2(x0,multiplicative_inverse_1(x0)),multiplicative_identity_0()) | equalish_2(x0,additive_identity_0()) ....... B23
% equalish_2(multiply_2(multiplicative_identity_0(), multiplicative_inverse_1(multiplicative_identity_0())), multiplicative_identity_0()) | equalish_2(multiplicative_identity_0(), additive_identity_0()) ....... R1 [B2:L0, B23:L0]
% ~equalish_2(multiplicative_identity_0(),additive_identity_0()) ....... U15
% equalish_2(multiply_2(multiplicative_identity_0(), multiplicative_inverse_1(multiplicative_identity_0())), multiplicative_identity_0()) ....... R2 [R1:L1, U15:L0]
% Derivation of unit clause U4052:
% ~equalish_2(x1,x0) | equalish_2(x0,x1) ....... B4
% ~defined_1(x0) | equalish_2(multiply_2(multiplicative_identity_0(),x0),x0) ....... B8
% equalish_2(x0, multiply_2(multiplicative_identity_0(), x0)) | ~defined_1(x0) ....... R1 [B4:L0, B8:L1]
% defined_1(multiplicative_inverse_1(multiplicative_identity_0())) ....... U2847
% equalish_2(multiplicative_inverse_1(multiplicative_identity_0()), multiply_2(multiplicative_identity_0(), multiplicative_inverse_1(multiplicative_identity_0()))) ....... R2 [R1:L1, U2847:L0]
% Derivation of unit clause U5433:
% ~equalish_2(multiplicative_inverse_1(multiplicative_identity_0()),multiplicative_identity_0()) ....... B0
% ~equalish_2(x2,x1) | ~equalish_2(x0,x2) | equalish_2(x0,x1) ....... B11
% ~equalish_2(x0, multiplicative_identity_0()) | ~equalish_2(multiplicative_inverse_1(multiplicative_identity_0()), x0) ....... R1 [B0:L0, B11:L2]
% ~equalish_2(x1,x0) | equalish_2(x0,x1) ....... B4
% ~equalish_2(multiplicative_inverse_1(multiplicative_identity_0()), x0) | ~equalish_2(multiplicative_identity_0(), x0) ....... R2 [R1:L0, B4:L1]
% equalish_2(multiplicative_inverse_1(multiplicative_identity_0()),multiply_2(multiplicative_identity_0(),multiplicative_inverse_1(multiplicative_identity_0()))) ....... U4052
% ~equalish_2(multiplicative_identity_0(), multiply_2(multiplicative_identity_0(), multiplicative_inverse_1(multiplicative_identity_0()))) ....... R3 [R2:L0, U4052:L0]
% Derivation of unit clause U10845:
% ~equalish_2(x1,x0) | equalish_2(x0,x1) ....... B4
% equalish_2(multiply_2(multiplicative_identity_0(),multiplicative_inverse_1(multiplicative_identity_0())),multiplicative_identity_0()) ....... U2848
% equalish_2(multiplicative_identity_0(), multiply_2(multiplicative_identity_0(), multiplicative_inverse_1(multiplicative_identity_0()))) ....... R1 [B4:L0, U2848:L0]
% Derivation of the empty clause:
% equalish_2(multiplicative_identity_0(),multiply_2(multiplicative_identity_0(),multiplicative_inverse_1(multiplicative_identity_0()))) ....... U10845
% ~equalish_2(multiplicative_identity_0(),multiply_2(multiplicative_identity_0(),multiplicative_inverse_1(multiplicative_identity_0()))) ....... U5433
% [] ....... R1 [U10845:L0, U5433:L0]
% --------------- End of Proof ---------------
% PROOF FOUND!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 48055652
% resolvents: 48055368 factors: 284
% Number of unit clauses generated: 47958077
% % unit clauses generated to total clauses generated: 99.80
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 4 [1] = 91 [2] = 5386 [3] = 5365
% Total = 10846
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 47958077 [2] = 97273 [3] = 302
% Average size of a generated clause: 2.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] defined_1 (+)2758 (-)0
% [1] equalish_2 (+)8070 (-)18
% [2] less_or_equal_2 (+)0 (-)0
% ------------------
% Total: (+)10828 (-)18
% Total number of unit clauses retained: 10846
% Number of clauses skipped because of their length: 244458
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 0
% Number of successful unifications: 48055663
% Number of unification failures: 329302
% Number of unit to unit unification failures: 145256
% N literal unification failure due to lookup root_id table: 141320
% N base clause resolution failure due to lookup table: 70036
% 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: 47911662
% N unit clauses dropped because too much nesting: 46382327
% 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: 16
% Max term depth in a unit clause: 5
% Number of states in UCFA table: 60837
% Total number of terms of all unit clauses in table: 141792
% Max allowed number of states in UCFA: 144000
% Ratio n states used/total allowed states: 0.42
% Ratio n states used/total unit clauses terms: 0.43
% Number of symbols (columns) in UCFA: 43
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 48384965
% ConstructUnitClause() = 47922504
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 54.83 secs
% --------------------------------------------------------
% | |
% Inferences per sec: 397154
% | |
% --------------------------------------------------------
% Elapsed time: 123 secs
% CPU time: 121.01 secs
%
%------------------------------------------------------------------------------