TSTP Solution File: PUZ009-1 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : PUZ009-1 : TPTP v5.0.0. Released v1.0.0.
% Transfm : add_equality
% Format : carine
% Command : carine %s t=%d xo=off uct=32000
% Computer : art05.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 : Sun Nov 28 03:53:05 EST 2010
% Result : Unsatisfiable 0.14s
% Output : Refutation 0.14s
% 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/SystemOnTPTP23018/PUZ/PUZ009-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 = 30] [nf = 0] [nu = 7] [ut = 4]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 221] [nf = 3] [nu = 37] [ut = 5]
% Looking for a proof at depth = 3 ...
% +================================================+
% | |
% | Congratulations!!! ........ A proof was found. |
% | |
% +================================================+
% Base Clauses and Unit Clauses used in proof:
% ============================================
% Base Clauses:
% -------------
% B0: b_is_a_knight
% B1: ~a_is_a_knight | ~b_is_a_knight
% B6: a_is_a_knight | e_is_a_knight
% B7: ~c_is_a_knight | a_is_a_knight
% B15: ~b_is_a_knight | c_is_a_knight | d_is_a_knight
% B17: ~d_is_a_knight | ~e_is_a_knight | c_is_a_knight
% Unit Clauses:
% --------------
% U1: < d1 v0 dv0 f0 c0 t0 td0 > ~a_is_a_knight
% U3: < d1 v0 dv0 f0 c0 t0 td0 > ~c_is_a_knight
% U4: < d2 v0 dv0 f0 c0 t0 td0 > d_is_a_knight
% U5: < d3 v0 dv0 f0 c0 t0 td0 > c_is_a_knight
% --------------- Start of Proof ---------------
% Derivation of unit clause U1:
% b_is_a_knight ....... B0
% ~a_is_a_knight | ~b_is_a_knight ....... B1
% ~a_is_a_knight ....... R1 [B0:L0, B1:L1]
% Derivation of unit clause U3:
% ~c_is_a_knight | a_is_a_knight ....... B7
% ~a_is_a_knight ....... U1
% ~c_is_a_knight ....... R1 [B7:L1, U1:L0]
% Derivation of unit clause U4:
% b_is_a_knight ....... B0
% ~b_is_a_knight | c_is_a_knight | d_is_a_knight ....... B15
% c_is_a_knight | d_is_a_knight ....... R1 [B0:L0, B15:L0]
% ~c_is_a_knight ....... U3
% d_is_a_knight ....... R2 [R1:L0, U3:L0]
% Derivation of unit clause U5:
% a_is_a_knight | e_is_a_knight ....... B6
% ~d_is_a_knight | ~e_is_a_knight | c_is_a_knight ....... B17
% a_is_a_knight | ~d_is_a_knight | c_is_a_knight ....... R1 [B6:L1, B17:L1]
% ~a_is_a_knight ....... U1
% ~d_is_a_knight | c_is_a_knight ....... R2 [R1:L0, U1:L0]
% d_is_a_knight ....... U4
% c_is_a_knight ....... R3 [R2:L0, U4:L0]
% Derivation of the empty clause:
% c_is_a_knight ....... U5
% ~c_is_a_knight ....... U3
% [] ....... R1 [U5:L0, U3:L0]
% --------------- End of Proof ---------------
% PROOF FOUND!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 1183
% resolvents: 1155 factors: 28
% Number of unit clauses generated: 154
% % unit clauses generated to total clauses generated: 13.02
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 1 [1] = 3 [2] = 1 [3] = 1
% Total = 6
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 154 [2] = 754 [3] = 275
% Average size of a generated clause: 3.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] a_is_a_knight (+)0 (-)1
% [1] b_is_a_knight (+)1 (-)0
% [2] c_is_a_knight (+)1 (-)1
% [3] d_is_a_knight (+)1 (-)0
% [4] e_is_a_knight (+)1 (-)0
% ------------------
% Total: (+)4 (-)2
% Total number of unit clauses retained: 6
% Number of clauses skipped because of their length: 944
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 30
% Number of successful unifications: 1190
% Number of unification failures: 0
% Number of unit to unit unification failures: 0
% N literal unification failure due to lookup root_id table: 3157
% N base clause resolution failure due to lookup table: 2532
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 0
% N unit clauses dropped because they exceeded max values: 111
% 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: 0
% Max term depth in a unit clause: 0
% Number of states in UCFA table: 3
% Total number of terms of all unit clauses in table: 0
% Max allowed number of states in UCFA: 80000
% Ratio n states used/total allowed states: 0.00
% Ratio n states used/total unit clauses terms: inf
% Number of symbols (columns) in UCFA: 39
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 1190
% ConstructUnitClause() = 116
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% | |
% Inferences per sec: inf
% | |
% --------------------------------------------------------
% Elapsed time: 0 secs
% CPU time: 0.14 secs
%
%------------------------------------------------------------------------------