TSTP Solution File: LCL035-1 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : LCL035-1 : TPTP v5.0.0. Released v1.0.0.
% Transfm : add_equality
% Format : carine
% Command : carine %s t=%d xo=off uct=32000
% Computer : art01.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:27:14 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/SystemOnTPTP9003/LCL/LCL035-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 = 3] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 30] [nf = 0] [nu = 10] [ut = 9]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 74] [nf = 5] [nu = 29] [ut = 9]
% Looking for a proof at depth = 4 ...
% +================================================+
% | |
% | Congratulations!!! ........ A proof was found. |
% | |
% +================================================+
% Base Clauses and Unit Clauses used in proof:
% ============================================
% Base Clauses:
% -------------
% B0: ~is_a_theorem_1(implies_2(falsehood_0(),a_0()))
% B1: is_a_theorem_1(implies_2(implies_2(implies_2(implies_2(implies_2(x0,x1),implies_2(x2,falsehood_0())),x3),x4),implies_2(implies_2(x4,x0),implies_2(x2,x0))))
% B2: ~is_a_theorem_1(x0) | ~is_a_theorem_1(implies_2(x0,x1)) | is_a_theorem_1(x1)
% Unit Clauses:
% --------------
% U1: < d0 v9 dv5 f9 c1 t19 td6 b > is_a_theorem_1(implies_2(implies_2(implies_2(implies_2(implies_2(x0,x1),implies_2(x2,falsehood_0())),x3),x4),implies_2(implies_2(x4,x0),implies_2(x2,x0))))
% U2: < d2 v9 dv5 f11 c3 t23 td7 > ~is_a_theorem_1(implies_2(implies_2(implies_2(implies_2(implies_2(implies_2(x0,x1),implies_2(x2,falsehood_0())),x3),x4),implies_2(implies_2(x4,x0),implies_2(x2,x0))),implies_2(falsehood_0(),a_0())))
% U3: < d2 v9 dv5 f8 c0 t17 td5 > is_a_theorem_1(implies_2(implies_2(implies_2(implies_2(x0,x1),implies_2(x2,x1)),implies_2(x1,x3)),implies_2(x4,implies_2(x1,x3))))
% U4: < d2 v18 dv10 f21 c4 t43 td8 > ~is_a_theorem_1(implies_2(implies_2(implies_2(implies_2(implies_2(implies_2(x0,x1),implies_2(x2,falsehood_0())),x3),x4),implies_2(implies_2(x4,x0),implies_2(x2,x0))),implies_2(implies_2(implies_2(implies_2(implies_2(implies_2(x5,x6),implies_2(x7,falsehood_0())),x8),x9),implies_2(implies_2(x9,x5),implies_2(x7,x5))),implies_2(falsehood_0(),a_0()))))
% U6: < d2 v5 dv4 f5 c1 t11 td5 > is_a_theorem_1(implies_2(implies_2(implies_2(x0,implies_2(falsehood_0(),x1)),x2),implies_2(x3,x2)))
% U82: < d4 v3 dv3 f3 c1 t7 td4 > is_a_theorem_1(implies_2(x0,implies_2(x1,implies_2(falsehood_0(),x2))))
% --------------- Start of Proof ---------------
% Derivation of unit clause U1:
% is_a_theorem_1(implies_2(implies_2(implies_2(implies_2(implies_2(x0,x1),implies_2(x2,falsehood_0())),x3),x4),implies_2(implies_2(x4,x0),implies_2(x2,x0)))) ....... U1
% Derivation of unit clause U2:
% ~is_a_theorem_1(implies_2(falsehood_0(),a_0())) ....... B0
% ~is_a_theorem_1(x0) | ~is_a_theorem_1(implies_2(x0,x1)) | is_a_theorem_1(x1) ....... B2
% ~is_a_theorem_1(x0) | ~is_a_theorem_1(implies_2(x0, implies_2(falsehood_0(), a_0()))) ....... R1 [B0:L0, B2:L2]
% is_a_theorem_1(implies_2(implies_2(implies_2(implies_2(implies_2(x0,x1),implies_2(x2,falsehood_0())),x3),x4),implies_2(implies_2(x4,x0),implies_2(x2,x0)))) ....... U1
% ~is_a_theorem_1(implies_2(implies_2(implies_2(implies_2(implies_2(implies_2(x0, x1), implies_2(x2, falsehood_0())), x3), x4), implies_2(implies_2(x4, x0), implies_2(x2, x0))), implies_2(falsehood_0(), a_0()))) ....... R2 [R1:L0, U1:L0]
% Derivation of unit clause U3:
% is_a_theorem_1(implies_2(implies_2(implies_2(implies_2(implies_2(x0,x1),implies_2(x2,falsehood_0())),x3),x4),implies_2(implies_2(x4,x0),implies_2(x2,x0)))) ....... B1
% ~is_a_theorem_1(x0) | ~is_a_theorem_1(implies_2(x0,x1)) | is_a_theorem_1(x1) ....... B2
% ~is_a_theorem_1(implies_2(implies_2(implies_2(implies_2(implies_2(implies_2(x0, x1), implies_2(x2, falsehood_0())), x3), x4), implies_2(implies_2(x4, x0), implies_2(x2, x0))), x5)) | is_a_theorem_1(x5) ....... R1 [B1:L0, B2:L0]
% is_a_theorem_1(implies_2(implies_2(implies_2(implies_2(implies_2(x0,x1),implies_2(x2,falsehood_0())),x3),x4),implies_2(implies_2(x4,x0),implies_2(x2,x0)))) ....... U1
% is_a_theorem_1(implies_2(implies_2(implies_2(implies_2(x0, x1), implies_2(x2, x1)), implies_2(x1, x3)), implies_2(x4, implies_2(x1, x3)))) ....... R2 [R1:L0, U1:L0]
% Derivation of unit clause U4:
% is_a_theorem_1(implies_2(implies_2(implies_2(implies_2(implies_2(x0,x1),implies_2(x2,falsehood_0())),x3),x4),implies_2(implies_2(x4,x0),implies_2(x2,x0)))) ....... B1
% ~is_a_theorem_1(x0) | ~is_a_theorem_1(implies_2(x0,x1)) | is_a_theorem_1(x1) ....... B2
% ~is_a_theorem_1(implies_2(implies_2(implies_2(implies_2(implies_2(implies_2(x0, x1), implies_2(x2, falsehood_0())), x3), x4), implies_2(implies_2(x4, x0), implies_2(x2, x0))), x5)) | is_a_theorem_1(x5) ....... R1 [B1:L0, B2:L0]
% ~is_a_theorem_1(implies_2(implies_2(implies_2(implies_2(implies_2(implies_2(x0,x1),implies_2(x2,falsehood_0())),x3),x4),implies_2(implies_2(x4,x0),implies_2(x2,x0))),implies_2(falsehood_0(),a_0()))) ....... U2
% ~is_a_theorem_1(implies_2(implies_2(implies_2(implies_2(implies_2(implies_2(x0, x1), implies_2(x2, falsehood_0())), x3), x4), implies_2(implies_2(x4, x0), implies_2(x2, x0))), implies_2(implies_2(implies_2(implies_2(implies_2(implies_2(x5, x6), implies_2(x7, falsehood_0())), x8), x9), implies_2(implies_2(x9, x5), implies_2(x7, x5))), implies_2(falsehood_0(), a_0())))) ....... R2 [R1:L1, U2:L0]
% Derivation of unit clause U6:
% is_a_theorem_1(implies_2(implies_2(implies_2(implies_2(implies_2(x0,x1),implies_2(x2,falsehood_0())),x3),x4),implies_2(implies_2(x4,x0),implies_2(x2,x0)))) ....... B1
% ~is_a_theorem_1(x0) | ~is_a_theorem_1(implies_2(x0,x1)) | is_a_theorem_1(x1) ....... B2
% ~is_a_theorem_1(implies_2(implies_2(implies_2(implies_2(x0, x1), implies_2(x2, falsehood_0())), x3), x4)) | is_a_theorem_1(implies_2(implies_2(x4, x0), implies_2(x2, x0))) ....... R1 [B1:L0, B2:L1]
% is_a_theorem_1(implies_2(implies_2(implies_2(implies_2(x0,x1),implies_2(x2,x1)),implies_2(x1,x3)),implies_2(x4,implies_2(x1,x3)))) ....... U3
% is_a_theorem_1(implies_2(implies_2(implies_2(x0, implies_2(falsehood_0(), x1)), x2), implies_2(x3, x2))) ....... R2 [R1:L0, U3:L0]
% Derivation of unit clause U82:
% is_a_theorem_1(implies_2(implies_2(implies_2(implies_2(implies_2(x0,x1),implies_2(x2,falsehood_0())),x3),x4),implies_2(implies_2(x4,x0),implies_2(x2,x0)))) ....... B1
% ~is_a_theorem_1(x0) | ~is_a_theorem_1(implies_2(x0,x1)) | is_a_theorem_1(x1) ....... B2
% ~is_a_theorem_1(implies_2(implies_2(implies_2(implies_2(implies_2(implies_2(x0, x1), implies_2(x2, falsehood_0())), x3), x4), implies_2(implies_2(x4, x0), implies_2(x2, x0))), x5)) | is_a_theorem_1(x5) ....... R1 [B1:L0, B2:L0]
% ~is_a_theorem_1(x0) | ~is_a_theorem_1(implies_2(x0,x1)) | is_a_theorem_1(x1) ....... B2
% ~is_a_theorem_1(implies_2(implies_2(implies_2(implies_2(implies_2(implies_2(x0, x1), implies_2(x2, falsehood_0())), x3), x4), implies_2(implies_2(x4, x0), implies_2(x2, x0))), x5)) | ~is_a_theorem_1(implies_2(x5, x6)) | is_a_theorem_1(x6) ....... R2 [R1:L1, B2:L0]
% is_a_theorem_1(implies_2(implies_2(implies_2(implies_2(implies_2(x0,x1),implies_2(x2,falsehood_0())),x3),x4),implies_2(implies_2(x4,x0),implies_2(x2,x0)))) ....... U1
% ~is_a_theorem_1(implies_2(implies_2(implies_2(implies_2(implies_2(x0, x1), implies_2(x2, x1)), implies_2(x1, x3)), implies_2(x4, implies_2(x1, x3))), x5)) | is_a_theorem_1(x5) ....... R3 [R2:L0, U1:L0]
% is_a_theorem_1(implies_2(implies_2(implies_2(x0,implies_2(falsehood_0(),x1)),x2),implies_2(x3,x2))) ....... U6
% is_a_theorem_1(implies_2(x0, implies_2(x1, implies_2(falsehood_0(), x2)))) ....... R4 [R3:L0, U6:L0]
% Derivation of the empty clause:
% is_a_theorem_1(implies_2(x0,implies_2(x1,implies_2(falsehood_0(),x2)))) ....... U82
% ~is_a_theorem_1(implies_2(implies_2(implies_2(implies_2(implies_2(implies_2(x0,x1),implies_2(x2,falsehood_0())),x3),x4),implies_2(implies_2(x4,x0),implies_2(x2,x0))),implies_2(implies_2(implies_2(implies_2(implies_2(implies_2(x5,x6),implies_2(x7,falsehood_0())),x8),x9),implies_2(implies_2(x9,x5),implies_2(x7,x5))),implies_2(falsehood_0(),a_0())))) ....... U4
% [] ....... R1 [U82:L0, U4:L0]
% --------------- End of Proof ---------------
% PROOF FOUND!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 391
% resolvents: 382 factors: 9
% Number of unit clauses generated: 303
% % unit clauses generated to total clauses generated: 77.49
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 2 [2] = 7 [4] = 74
% Total = 83
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 303 [2] = 77 [3] = 11
% Average size of a generated clause: 2.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] is_a_theorem_1 (+)8 (-)75
% ------------------
% Total: (+)8 (-)75
% Total number of unit clauses retained: 83
% Number of clauses skipped because of their length: 43
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 0
% Number of successful unifications: 403
% Number of unification failures: 254
% Number of unit to unit unification failures: 527
% N literal unification failure due to lookup root_id table: 26
% 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: 16
% N unit clauses dropped because they exceeded max values: 117
% 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: 63
% Max term depth in a unit clause: 9
% Number of states in UCFA table: 673
% Total number of terms of all unit clauses in table: 1725
% 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.39
% Number of symbols (columns) in UCFA: 38
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 657
% ConstructUnitClause() = 198
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% | |
% Inferences per sec: inf
% | |
% --------------------------------------------------------
% Elapsed time: 0 secs
% CPU time: 0.35 secs
%
%------------------------------------------------------------------------------