TSTP Solution File: PLA001-1 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : PLA001-1 : TPTP v5.0.0. Released v1.0.0.
% Transfm : add_equality
% Format : carine
% Command : carine %s t=%d xo=off uct=32000
% Computer : art04.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:33:03 EST 2010
% Result : Unsatisfiable 0.18s
% Output : Refutation 0.18s
% 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/SystemOnTPTP20598/PLA/PLA001-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 = 64] [nf = 0] [nu = 34] [ut = 30]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 800] [nf = 0] [nu = 488] [ut = 70]
% Looking for a proof at depth = 3 ...
% +================================================+
% | |
% | Congratulations!!! ........ A proof was found. |
% | |
% +================================================+
% Base Clauses and Unit Clauses used in proof:
% ============================================
% Base Clauses:
% -------------
% B0: ~at_4(desMoines_0(),s_1(none_0()),x0,x1)
% B6: next_to_2(cheyenne_0(),northPlatte_0())
% B7: next_to_2(northPlatte_0(),grandIsland_0())
% B8: next_to_2(grandIsland_0(),lincoln_0())
% B9: next_to_2(lincoln_0(),omaha_0())
% B12: ~at_4(x0,x1,x2,x3) | at_4(x0,x1,s_1(x2),wait_at_1(x3))
% B13: ~at_4(x0,x1,x2,x3) | at_4(x0,s_1(x1),s_1(x2),buy_1(x3))
% B14: ~next_to_2(x0,x4) | ~at_4(x0,x1,x2,x3) | at_4(x4,x1,s_1(s_1(x2)),drive_2(x4,x3))
% Unit Clauses:
% --------------
% U10: < d0 v0 dv0 f0 c2 t2 td1 b > next_to_2(omaha_0(),desMoines_0())
% U11: < d0 v0 dv0 f0 c4 t4 td1 b > at_4(cheyenne_0(),none_0(),start_0(),initial_situation_0())
% U30: < d2 v2 dv2 f1 c2 t5 td2 > ~at_4(omaha_0(),s_1(none_0()),x0,x1)
% U40: < d2 v0 dv0 f3 c5 t8 td3 > at_4(northPlatte_0(),none_0(),s_1(s_1(start_0())),drive_2(northPlatte_0(),initial_situation_0()))
% U48: < d2 v0 dv0 f6 c6 t12 td5 > at_4(grandIsland_0(),none_0(),s_1(s_1(s_1(s_1(start_0())))),drive_2(grandIsland_0(),drive_2(northPlatte_0(),initial_situation_0())))
% U49: < d2 v2 dv2 f1 c2 t5 td2 > ~at_4(lincoln_0(),s_1(none_0()),x0,x1)
% U60: < d2 v2 dv2 f0 c2 t4 td1 > ~at_4(lincoln_0(),none_0(),x0,x1)
% U89: < d3 v2 dv2 f0 c2 t4 td1 > ~at_4(grandIsland_0(),none_0(),x0,x1)
% --------------- Start of Proof ---------------
% Derivation of unit clause U10:
% next_to_2(omaha_0(),desMoines_0()) ....... U10
% Derivation of unit clause U11:
% at_4(cheyenne_0(),none_0(),start_0(),initial_situation_0()) ....... U11
% Derivation of unit clause U30:
% ~at_4(desMoines_0(),s_1(none_0()),x0,x1) ....... B0
% ~next_to_2(x0,x4) | ~at_4(x0,x1,x2,x3) | at_4(x4,x1,s_1(s_1(x2)),drive_2(x4,x3)) ....... B14
% ~next_to_2(x0, desMoines_0()) | ~at_4(x0, s_1(none_0()), x1, x2) ....... R1 [B0:L0, B14:L2]
% next_to_2(omaha_0(),desMoines_0()) ....... U10
% ~at_4(omaha_0(), s_1(none_0()), x0, x1) ....... R2 [R1:L0, U10:L0]
% Derivation of unit clause U40:
% next_to_2(cheyenne_0(),northPlatte_0()) ....... B6
% ~next_to_2(x0,x4) | ~at_4(x0,x1,x2,x3) | at_4(x4,x1,s_1(s_1(x2)),drive_2(x4,x3)) ....... B14
% ~at_4(cheyenne_0(), x0, x1, x2) | at_4(northPlatte_0(), x0, s_1(s_1(x1)), drive_2(northPlatte_0(), x2)) ....... R1 [B6:L0, B14:L0]
% at_4(cheyenne_0(),none_0(),start_0(),initial_situation_0()) ....... U11
% at_4(northPlatte_0(), none_0(), s_1(s_1(start_0())), drive_2(northPlatte_0(), initial_situation_0())) ....... R2 [R1:L0, U11:L0]
% Derivation of unit clause U48:
% next_to_2(northPlatte_0(),grandIsland_0()) ....... B7
% ~next_to_2(x0,x4) | ~at_4(x0,x1,x2,x3) | at_4(x4,x1,s_1(s_1(x2)),drive_2(x4,x3)) ....... B14
% ~at_4(northPlatte_0(), x0, x1, x2) | at_4(grandIsland_0(), x0, s_1(s_1(x1)), drive_2(grandIsland_0(), x2)) ....... R1 [B7:L0, B14:L0]
% at_4(northPlatte_0(),none_0(),s_1(s_1(start_0())),drive_2(northPlatte_0(),initial_situation_0())) ....... U40
% at_4(grandIsland_0(), none_0(), s_1(s_1(s_1(s_1(start_0())))), drive_2(grandIsland_0(), drive_2(northPlatte_0(), initial_situation_0()))) ....... R2 [R1:L0, U40:L0]
% Derivation of unit clause U49:
% next_to_2(lincoln_0(),omaha_0()) ....... B9
% ~next_to_2(x0,x4) | ~at_4(x0,x1,x2,x3) | at_4(x4,x1,s_1(s_1(x2)),drive_2(x4,x3)) ....... B14
% ~at_4(lincoln_0(), x0, x1, x2) | at_4(omaha_0(), x0, s_1(s_1(x1)), drive_2(omaha_0(), x2)) ....... R1 [B9:L0, B14:L0]
% ~at_4(omaha_0(),s_1(none_0()),x0,x1) ....... U30
% ~at_4(lincoln_0(), s_1(none_0()), x0, x1) ....... R2 [R1:L1, U30:L0]
% Derivation of unit clause U60:
% ~at_4(x0,x1,x2,x3) | at_4(x0,x1,s_1(x2),wait_at_1(x3)) ....... B12
% ~at_4(x0,x1,x2,x3) | at_4(x0,s_1(x1),s_1(x2),buy_1(x3)) ....... B13
% ~at_4(x0, x1, x2, x3) | at_4(x0, s_1(x1), s_1(s_1(x2)), buy_1(wait_at_1(x3))) ....... R1 [B12:L1, B13:L0]
% ~at_4(lincoln_0(),s_1(none_0()),x0,x1) ....... U49
% ~at_4(lincoln_0(), none_0(), x0, x1) ....... R2 [R1:L1, U49:L0]
% Derivation of unit clause U89:
% next_to_2(grandIsland_0(),lincoln_0()) ....... B8
% ~next_to_2(x0,x4) | ~at_4(x0,x1,x2,x3) | at_4(x4,x1,s_1(s_1(x2)),drive_2(x4,x3)) ....... B14
% ~at_4(grandIsland_0(), x0, x1, x2) | at_4(lincoln_0(), x0, s_1(s_1(x1)), drive_2(lincoln_0(), x2)) ....... R1 [B8:L0, B14:L0]
% ~at_4(x0,x1,x2,x3) | at_4(x0,x1,s_1(x2),wait_at_1(x3)) ....... B12
% ~at_4(grandIsland_0(), x0, x1, x2) | at_4(lincoln_0(), x0, s_1(s_1(s_1(x1))), wait_at_1(drive_2(lincoln_0(), x2))) ....... R2 [R1:L1, B12:L0]
% ~at_4(lincoln_0(),none_0(),x0,x1) ....... U60
% ~at_4(grandIsland_0(), none_0(), x0, x1) ....... R3 [R2:L1, U60:L0]
% Derivation of the empty clause:
% ~at_4(grandIsland_0(),none_0(),x0,x1) ....... U89
% at_4(grandIsland_0(),none_0(),s_1(s_1(s_1(s_1(start_0())))),drive_2(grandIsland_0(),drive_2(northPlatte_0(),initial_situation_0()))) ....... U48
% [] ....... R1 [U89:L0, U48:L0]
% --------------- End of Proof ---------------
% PROOF FOUND!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 1848
% resolvents: 1844 factors: 4
% Number of unit clauses generated: 1164
% % unit clauses generated to total clauses generated: 62.99
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 12 [1] = 18 [2] = 40 [3] = 20
% Total = 90
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 1164 [2] = 616 [3] = 68
% Average size of a generated clause: 2.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] next_to_2 (+)10 (-)10
% [1] at_4 (+)62 (-)8
% ------------------
% Total: (+)72 (-)18
% Total number of unit clauses retained: 90
% Number of clauses skipped because of their length: 252
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 0
% Number of successful unifications: 1861
% Number of unification failures: 4609
% Number of unit to unit unification failures: 567
% N literal unification failure due to lookup root_id table: 743
% N base clause resolution failure due to lookup table: 56
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 12
% N unit clauses dropped because they exceeded max values: 835
% N unit clauses dropped because too much nesting: 675
% 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: 14
% Max term depth in a unit clause: 5
% Number of states in UCFA table: 325
% Total number of terms of all unit clauses in table: 805
% Max allowed number of states in UCFA: 128000
% Ratio n states used/total allowed states: 0.00
% Ratio n states used/total unit clauses terms: 0.40
% Number of symbols (columns) in UCFA: 54
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 6470
% ConstructUnitClause() = 913
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% | |
% Inferences per sec: inf
% | |
% --------------------------------------------------------
% Elapsed time: 0 secs
% CPU time: 0.18 secs
%
%------------------------------------------------------------------------------