TSTP Solution File: LCL046-1 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : LCL046-1 : TPTP v5.0.0. Released v1.0.0.
% Transfm : add_equality
% Format : carine
% Command : carine %s t=%d xo=off uct=32000
% Computer : art07.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 23:32:32 EST 2010
% Result : Unsatisfiable 0.36s
% Output : Refutation 0.36s
% 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/SystemOnTPTP22505/LCL/LCL046-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 = 7] [nf = 0] [nu = 0] [ut = 4]
% Looking for a proof at depth = 2 ...
% +================================================+
% | |
% | Congratulations!!! ........ A proof was found. |
% | |
% +================================================+
% Base Clauses and Unit Clauses used in proof:
% ============================================
% Base Clauses:
% -------------
% B0: ~is_a_theorem_1(implies_2(a_0(),a_0()))
% B1: is_a_theorem_1(implies_2(implies_2(x0,x1),implies_2(implies_2(x1,x2),implies_2(x0,x2))))
% B4: ~is_a_theorem_1(x0) | ~is_a_theorem_1(implies_2(x0,x1)) | is_a_theorem_1(x1)
% Unit Clauses:
% --------------
% U2: < d0 v3 dv2 f3 c0 t6 td4 b > is_a_theorem_1(implies_2(x0,implies_2(not_1(x0),x1)))
% U3: < d0 v3 dv1 f3 c0 t6 td4 b > is_a_theorem_1(implies_2(implies_2(not_1(x0),x0),x0))
% U6: < d2 v3 dv1 f5 c2 t10 td5 > ~is_a_theorem_1(implies_2(implies_2(implies_2(not_1(x0),x0),x0),implies_2(a_0(),a_0())))
% U27: < d2 v5 dv3 f5 c0 t10 td5 > is_a_theorem_1(implies_2(implies_2(implies_2(not_1(x0),x1),x2),implies_2(x0,x2)))
% --------------- Start of Proof ---------------
% Derivation of unit clause U2:
% is_a_theorem_1(implies_2(x0,implies_2(not_1(x0),x1))) ....... U2
% Derivation of unit clause U3:
% is_a_theorem_1(implies_2(implies_2(not_1(x0),x0),x0)) ....... U3
% Derivation of unit clause U6:
% ~is_a_theorem_1(implies_2(a_0(),a_0())) ....... B0
% ~is_a_theorem_1(x0) | ~is_a_theorem_1(implies_2(x0,x1)) | is_a_theorem_1(x1) ....... B4
% ~is_a_theorem_1(x0) | ~is_a_theorem_1(implies_2(x0, implies_2(a_0(), a_0()))) ....... R1 [B0:L0, B4:L2]
% is_a_theorem_1(implies_2(implies_2(not_1(x0),x0),x0)) ....... U3
% ~is_a_theorem_1(implies_2(implies_2(implies_2(not_1(x0), x0), x0), implies_2(a_0(), a_0()))) ....... R2 [R1:L0, U3:L0]
% Derivation of unit clause U27:
% is_a_theorem_1(implies_2(implies_2(x0,x1),implies_2(implies_2(x1,x2),implies_2(x0,x2)))) ....... B1
% ~is_a_theorem_1(x0) | ~is_a_theorem_1(implies_2(x0,x1)) | is_a_theorem_1(x1) ....... B4
% ~is_a_theorem_1(implies_2(x0, x1)) | is_a_theorem_1(implies_2(implies_2(x1, x2), implies_2(x0, x2))) ....... R1 [B1:L0, B4:L1]
% is_a_theorem_1(implies_2(x0,implies_2(not_1(x0),x1))) ....... U2
% is_a_theorem_1(implies_2(implies_2(implies_2(not_1(x0), x1), x2), implies_2(x0, x2))) ....... R2 [R1:L0, U2:L0]
% Derivation of the empty clause:
% is_a_theorem_1(implies_2(implies_2(implies_2(not_1(x0),x1),x2),implies_2(x0,x2))) ....... U27
% ~is_a_theorem_1(implies_2(implies_2(implies_2(not_1(x0),x0),x0),implies_2(a_0(),a_0()))) ....... U6
% [] ....... R1 [U27:L0, U6:L0]
% --------------- End of Proof ---------------
% PROOF FOUND!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 36
% resolvents: 36 factors: 0
% Number of unit clauses generated: 26
% % unit clauses generated to total clauses generated: 72.22
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 4 [2] = 24
% Total = 28
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 26 [2] = 10
% Average size of a generated clause: 2.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] is_a_theorem_1 (+)10 (-)18
% ------------------
% Total: (+)10 (-)18
% Total number of unit clauses retained: 28
% Number of clauses skipped because of their length: 2
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 0
% Number of successful unifications: 40
% Number of unification failures: 11
% Number of unit to unit unification failures: 165
% N literal unification failure due to lookup root_id table: 7
% N base clause resolution failure due to lookup table: 0
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 5
% N unit clauses dropped because they exceeded max values: 2
% N unit clauses dropped because too much nesting: 0
% 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: 56
% Max term depth in a unit clause: 8
% Number of states in UCFA table: 228
% Total number of terms of all unit clauses in table: 653
% 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.35
% Number of symbols (columns) in UCFA: 38
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 51
% ConstructUnitClause() = 26
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% | |
% Inferences per sec: inf
% | |
% --------------------------------------------------------
% Elapsed time: 0 secs
% CPU time: 0.35 secs
%
%------------------------------------------------------------------------------