TSTP Solution File: MSC001-1 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : MSC001-1 : TPTP v5.0.0. Released v1.0.0.
% Transfm : add_equality
% Format : carine
% Command : carine %s t=%d xo=off uct=32000
% Computer : art09.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 02:00:12 EST 2010
% Result : Unsatisfiable 0.24s
% Output : Refutation 0.24s
% 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/SystemOnTPTP11205/MSC/MSC001-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 = 203] [nf = 0] [nu = 157] [ut = 85]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 2273] [nf = 1] [nu = 1551] [ut = 116]
% Looking for a proof at depth = 3 ...
% +================================================+
% | |
% | Congratulations!!! ........ A proof was found. |
% | |
% +================================================+
% Base Clauses and Unit Clauses used in proof:
% ============================================
% Base Clauses:
% -------------
% B0: ~answer_1(x0)
% B1: ~hold_2(thing_1(x0),do_2(let_go_0(),x1))
% B2: at_3(hand_0(),x0,do_2(go_1(x0),x1))
% B4: at_3(thing_1(s_0()),here_0(),now_0())
% B5: ~at_3(x0,x1,x2) | at_3(x0,x1,do_2(let_go_0(),x2))
% B7: ~at_3(x0,x1,do_2(let_go_0(),x2)) | at_3(x0,x1,x2)
% B8: ~hold_2(thing_1(x0),x1) | hold_2(thing_1(x0),do_2(go_1(x2),x1))
% B9: ~at_3(thing_1(x0),x1,x2) | at_3(thing_1(x0),x1,do_2(go_1(x1),x2))
% B11: ~at_3(hand_0(),x0,x1) | at_3(thing_1(taken_1(x1)),x0,x1)
% B13: ~hold_2(thing_1(x0),x1) | ~at_3(hand_0(),x2,x1) | at_3(thing_1(x0),x2,x1)
% B15: ~at_3(thing_1(x2),x0,x1) | ~at_3(hand_0(),x0,x1) | hold_2(thing_1(taken_1(x1)),do_2(pick_up_0(),x1))
% B16: ~at_3(thing_1(x0),x1,do_2(go_1(x1),x2)) | hold_2(thing_1(x0),x2) | at_3(thing_1(x0),x1,x2)
% B17: ~red_1(x0) | ~at_3(x0,there_0(),x1) | answer_1(x1)
% Unit Clauses:
% --------------
% U0: < d0 v1 dv1 f0 c0 t1 td1 b nc > ~answer_1(x0)
% U2: < d0 v3 dv2 f2 c1 t6 td3 b > at_3(hand_0(),x0,do_2(go_1(x0),x1))
% U9: < d1 v5 dv2 f6 c0 t11 td5 > at_3(thing_1(taken_1(do_2(go_1(x0),x1))),x0,do_2(go_1(x0),x1))
% U11: < d1 v0 dv0 f2 c4 t6 td2 > at_3(thing_1(s_0()),here_0(),do_2(let_go_0(),now_0()))
% U118: < d3 v4 dv2 f5 c1 t10 td5 > at_3(thing_1(taken_1(do_2(go_1(x0),do_2(let_go_0(),x1)))),x0,x1)
% U127: < d3 v0 dv0 f5 c3 t8 td5 > red_1(thing_1(taken_1(do_2(go_1(here_0()),do_2(let_go_0(),now_0())))))
% U149: < d3 v1 dv1 f5 c4 t10 td5 > ~at_3(thing_1(taken_1(do_2(go_1(here_0()),do_2(let_go_0(),now_0())))),there_0(),x0)
% U175: < d3 v1 dv1 f5 c3 t9 td5 > ~hold_2(thing_1(taken_1(do_2(go_1(here_0()),do_2(let_go_0(),now_0())))),x0)
% U177: < d3 v0 dv0 f3 c5 t8 td3 > ~at_3(hand_0(),here_0(),do_2(go_1(here_0()),do_2(let_go_0(),now_0())))
% --------------- Start of Proof ---------------
% Derivation of unit clause U0:
% ~answer_1(x0) ....... U0
% Derivation of unit clause U2:
% at_3(hand_0(),x0,do_2(go_1(x0),x1)) ....... U2
% Derivation of unit clause U9:
% at_3(hand_0(),x0,do_2(go_1(x0),x1)) ....... B2
% ~at_3(hand_0(),x0,x1) | at_3(thing_1(taken_1(x1)),x0,x1) ....... B11
% at_3(thing_1(taken_1(do_2(go_1(x0), x1))), x0, do_2(go_1(x0), x1)) ....... R1 [B2:L0, B11:L0]
% Derivation of unit clause U11:
% at_3(thing_1(s_0()),here_0(),now_0()) ....... B4
% ~at_3(x0,x1,x2) | at_3(x0,x1,do_2(let_go_0(),x2)) ....... B5
% at_3(thing_1(s_0()), here_0(), do_2(let_go_0(), now_0())) ....... R1 [B4:L0, B5:L0]
% Derivation of unit clause U118:
% ~hold_2(thing_1(x0),do_2(let_go_0(),x1)) ....... B1
% ~at_3(thing_1(x0),x1,do_2(go_1(x1),x2)) | hold_2(thing_1(x0),x2) | at_3(thing_1(x0),x1,x2) ....... B16
% ~at_3(thing_1(x0), x1, do_2(go_1(x1), do_2(let_go_0(), x2))) | at_3(thing_1(x0), x1, do_2(let_go_0(), x2)) ....... R1 [B1:L0, B16:L1]
% ~at_3(x0,x1,do_2(let_go_0(),x2)) | at_3(x0,x1,x2) ....... B7
% ~at_3(thing_1(x0), x1, do_2(go_1(x1), do_2(let_go_0(), x2))) | at_3(thing_1(x0), x1, x2) ....... R2 [R1:L1, B7:L0]
% at_3(thing_1(taken_1(do_2(go_1(x0),x1))),x0,do_2(go_1(x0),x1)) ....... U9
% at_3(thing_1(taken_1(do_2(go_1(x0), do_2(let_go_0(), x1)))), x0, x1) ....... R3 [R2:L0, U9:L0]
% Derivation of unit clause U127:
% ~at_3(x0,x1,x2) | at_3(x0,x1,do_2(let_go_0(),x2)) ....... B5
% ~at_3(x0,x1,do_2(let_go_0(),x2)) | at_3(x0,x1,x2) ....... B7
% ~at_3(x0, x1, x2) | at_3(x0, x1, x2) ....... R1 [B5:L1, B7:L0]
% ~at_3(x0,here_0(),now_0()) | red_1(x0) ....... B12
% ~at_3(x0, here_0(), now_0()) | red_1(x0) ....... R2 [R1:L1, B12:L0]
% at_3(thing_1(taken_1(do_2(go_1(x0),do_2(let_go_0(),x1)))),x0,x1) ....... U118
% red_1(thing_1(taken_1(do_2(go_1(here_0()), do_2(let_go_0(), now_0()))))) ....... R3 [R2:L0, U118:L0]
% Derivation of unit clause U149:
% ~at_3(x0,x1,x2) | at_3(x0,x1,do_2(let_go_0(),x2)) ....... B5
% ~red_1(x0) | ~at_3(x0,there_0(),x1) | answer_1(x1) ....... B17
% ~at_3(x0, there_0(), x1) | ~red_1(x0) | answer_1(do_2(let_go_0(), x1)) ....... R1 [B5:L1, B17:L1]
% red_1(thing_1(taken_1(do_2(go_1(here_0()),do_2(let_go_0(),now_0()))))) ....... U127
% ~at_3(thing_1(taken_1(do_2(go_1(here_0()), do_2(let_go_0(), now_0())))), there_0(), x0) | answer_1(do_2(let_go_0(), x0)) ....... R2 [R1:L1, U127:L0]
% ~answer_1(x0) ....... U0
% ~at_3(thing_1(taken_1(do_2(go_1(here_0()), do_2(let_go_0(), now_0())))), there_0(), x0) ....... R3 [R2:L1, U0:L0]
% Derivation of unit clause U175:
% ~hold_2(thing_1(x0),x1) | hold_2(thing_1(x0),do_2(go_1(x2),x1)) ....... B8
% ~hold_2(thing_1(x0),x1) | ~at_3(hand_0(),x2,x1) | at_3(thing_1(x0),x2,x1) ....... B13
% ~hold_2(thing_1(x0), x1) | ~at_3(hand_0(), x2, do_2(go_1(x3), x1)) | at_3(thing_1(x0), x2, do_2(go_1(x3), x1)) ....... R1 [B8:L1, B13:L0]
% at_3(hand_0(),x0,do_2(go_1(x0),x1)) ....... U2
% ~hold_2(thing_1(x0), x1) | at_3(thing_1(x0), x2, do_2(go_1(x2), x1)) ....... R2 [R1:L1, U2:L0]
% ~at_3(thing_1(taken_1(do_2(go_1(here_0()),do_2(let_go_0(),now_0())))),there_0(),x0) ....... U149
% ~hold_2(thing_1(taken_1(do_2(go_1(here_0()), do_2(let_go_0(), now_0())))), x0) ....... R3 [R2:L1, U149:L0]
% Derivation of unit clause U177:
% ~at_3(thing_1(x0),x1,x2) | at_3(thing_1(x0),x1,do_2(go_1(x1),x2)) ....... B9
% ~at_3(thing_1(x2),x0,x1) | ~at_3(hand_0(),x0,x1) | hold_2(thing_1(taken_1(x1)),do_2(pick_up_0(),x1)) ....... B15
% ~at_3(thing_1(x0), x1, x2) | ~at_3(hand_0(), x1, do_2(go_1(x1), x2)) | hold_2(thing_1(taken_1(do_2(go_1(x1), x2))), do_2(pick_up_0(), do_2(go_1(x1), x2))) ....... R1 [B9:L1, B15:L0]
% at_3(thing_1(s_0()),here_0(),do_2(let_go_0(),now_0())) ....... U11
% ~at_3(hand_0(), here_0(), do_2(go_1(here_0()), do_2(let_go_0(), now_0()))) | hold_2(thing_1(taken_1(do_2(go_1(here_0()), do_2(let_go_0(), now_0())))), do_2(pick_up_0(), do_2(go_1(here_0()), do_2(let_go_0(), now_0())))) ....... R2 [R1:L0, U11:L0]
% ~hold_2(thing_1(taken_1(do_2(go_1(here_0()),do_2(let_go_0(),now_0())))),x0) ....... U175
% ~at_3(hand_0(), here_0(), do_2(go_1(here_0()), do_2(let_go_0(), now_0()))) ....... R3 [R2:L1, U175:L0]
% Derivation of the empty clause:
% ~at_3(hand_0(),here_0(),do_2(go_1(here_0()),do_2(let_go_0(),now_0()))) ....... U177
% at_3(hand_0(),x0,do_2(go_1(x0),x1)) ....... U2
% [] ....... R1 [U177:L0, U2:L0]
% --------------- End of Proof ---------------
% PROOF FOUND!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 24514
% resolvents: 24510 factors: 4
% Number of unit clauses generated: 14280
% % unit clauses generated to total clauses generated: 58.25
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 5 [1] = 80 [2] = 31 [3] = 62
% Total = 178
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 14280 [2] = 9633 [3] = 601
% Average size of a generated clause: 2.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] answer_1 (+)0 (-)1
% [1] red_1 (+)2 (-)3
% [2] hold_2 (+)0 (-)42
% [3] at_3 (+)43 (-)87
% ------------------
% Total: (+)45 (-)133
% Total number of unit clauses retained: 178
% Number of clauses skipped because of their length: 8574
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 0
% Number of successful unifications: 24531
% Number of unification failures: 89894
% Number of unit to unit unification failures: 3704
% N literal unification failure due to lookup root_id table: 63872
% N base clause resolution failure due to lookup table: 4743
% N UC-BCL resolution dropped due to lookup table: 2674
% Max entries in substitution set: 9
% N unit clauses dropped because they exceeded max values: 12204
% N unit clauses dropped because too much nesting: 2646
% 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: 11
% Max term depth in a unit clause: 5
% Number of states in UCFA table: 354
% Total number of terms of all unit clauses in table: 1583
% Max allowed number of states in UCFA: 104000
% Ratio n states used/total allowed states: 0.00
% Ratio n states used/total unit clauses terms: 0.22
% Number of symbols (columns) in UCFA: 49
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 114425
% ConstructUnitClause() = 12377
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.01 secs
% --------------------------------------------------------
% | |
% Inferences per sec: inf
% | |
% --------------------------------------------------------
% Elapsed time: 0 secs
% CPU time: 0.23 secs
%
%------------------------------------------------------------------------------