TSTP Solution File: NLP009-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : NLP009-1 : TPTP v3.4.2. Released v2.4.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art01.cs.miami.edu
% Model : i686 unknown
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 1000MB
% OS : Linux 2.4.22-21mdk-i686-up-4GB
% CPULimit : 600s
% Result : Unsatisfiable 0.0s
% Output : Assurance 0.0s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----NO SOLUTION OUTPUT BY SYSTEM
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
%
% Gandalf c-2.6 r1 starting to prove: /home/graph/tptp/TSTP/PreparedTPTP/otter:hypothesis:set(auto),clear(print_given)---add_equality:r/NLP/NLP009-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: neq
% detected subclass: medium
%
% strategies selected:
% (hyper 25 #f 1 53)
% (binary-unit 9 #f 1 53)
% (binary-double 9 #f 1 53)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 1 53)
% (binary-order 25 #f 1 53)
% (binary-posweight-order 101 #f)
% (binary-posweight-lex-big-order 25 #f)
% (binary-posweight-lex-small-order 9 #f)
% (binary-order-sos 50 #t)
% (binary-unit-uniteq 25 #f)
% (binary-weightorder 50 #f)
% (binary-order 50 #f)
% (hyper-order 30 #f)
% (binary 112 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(55,40,0,117,0,0)
%
%
% START OF PROOF
% 57 [] -ss^sk^c0(0) | -in(Z,U) | -in(V,U) | -in(X,Y) | -down(X,W) | -barrel(X,X1) | equal(Z,V) | -furniture(U) | -front(U) | -man(Z) | -man(V) | -city(Y) | -way(W) | -dirty(X1) | -white(X1) | -car(X1) | -lonely(W) | -chevy(X1) | -fellow(V) | -fellow(Z) | -young(Z) | -young(V) | -seat(U) | -old(X1) | -street(W) | -event(X) | -hollywood(Y).
% 58 [] ss^sk^c0(0) | -in(Z,U) | -in(V,U) | -in(X,Y) | -down(X,W) | -barrel(X,X1) | equal(Z,V) | -furniture(U) | -front(U) | -man(Z) | -man(V) | -city(Y) | -way(W) | -dirty(X1) | -white(X1) | -car(X1) | -lonely(W) | -chevy(X1) | -fellow(V) | -fellow(Z) | -young(Z) | -young(V) | -seat(U) | -old(X1) | -street(W) | -event(X) | -hollywood(Y).
% 59 [] -equal(skc15,skc14) | -ss^sk^c0(0).
% 60 [] -equal(skc22,skc21) | ss^sk^c0(0).
% 61 [] in(skc15,skc16) | -ss^sk^c0(0).
% 62 [] in(skc14,skc16) | -ss^sk^c0(0).
% 63 [] in(skc19,skc20) | -ss^sk^c0(0).
% 64 [] down(skc19,skc17) | -ss^sk^c0(0).
% 65 [] barrel(skc19,skc18) | -ss^sk^c0(0).
% 66 [] in(skc22,skc23) | ss^sk^c0(0).
% 67 [] in(skc21,skc23) | ss^sk^c0(0).
% 68 [] in(skc26,skc27) | ss^sk^c0(0).
% 69 [] down(skc26,skc25) | ss^sk^c0(0).
% 70 [] barrel(skc26,skc24) | ss^sk^c0(0).
% 71 [] -ss^sk^c0(0) | furniture(skc16).
% 72 [] -ss^sk^c0(0) | front(skc16).
% 73 [] -ss^sk^c0(0) | man(skc15).
% 74 [] -ss^sk^c0(0) | fellow(skc15).
% 75 [] -ss^sk^c0(0) | man(skc14).
% 76 [] -ss^sk^c0(0) | young(skc14).
% 77 [] -ss^sk^c0(0) | city(skc20).
% 78 [] -ss^sk^c0(0) | car(skc18).
% 79 [] -ss^sk^c0(0) | white(skc18).
% 80 [] -ss^sk^c0(0) | dirty(skc18).
% 81 [] -ss^sk^c0(0) | old(skc18).
% 82 [] -ss^sk^c0(0) | way(skc17).
% 83 [] -ss^sk^c0(0) | street(skc17).
% 84 [] furniture(skc23) | ss^sk^c0(0).
% 85 [] front(skc23) | ss^sk^c0(0).
% 86 [] man(skc22) | ss^sk^c0(0).
% 87 [] ss^sk^c0(0) | fellow(skc22).
% 88 [] man(skc21) | ss^sk^c0(0).
% 89 [] ss^sk^c0(0) | young(skc21).
% 90 [] city(skc27) | ss^sk^c0(0).
% 91 [] way(skc25) | ss^sk^c0(0).
% 92 [] ss^sk^c0(0) | lonely(skc25).
% 93 [] dirty(skc24) | ss^sk^c0(0).
% 94 [] white(skc24) | ss^sk^c0(0).
% 95 [] car(skc24) | ss^sk^c0(0).
% 96 [] ss^sk^c0(0) | chevy(skc24).
% 97 [] fellow(skc14).
% 98 [] young(skc15).
% 99 [] seat(skc16).
% 100 [] lonely(skc17).
% 101 [] chevy(skc18).
% 102 [] event(skc19).
% 103 [] hollywood(skc20).
% 104 [] fellow(skc21).
% 105 [] young(skc22).
% 106 [] seat(skc23).
% 107 [] old(skc24).
% 108 [] street(skc25).
% 109 [] event(skc26).
% 110 [] hollywood(skc27).
% 22507 [hyper:58,70,96,68,69,92,86,87,66,67,89,cut:107,cut:109,binarycut:93,binarycut:94,binarycut:95,cut:110,binarycut:90,cut:108,binarycut:91,cut:105,cut:106,binarycut:84,binarycut:85,cut:104,binarycut:88,binarycut:60] ss^sk^c0(0).
% 22532 [hyper:61,22507] in(skc15,skc16).
% 22533 [hyper:62,22507] in(skc14,skc16).
% 22534 [hyper:63,22507] in(skc19,skc20).
% 22535 [hyper:64,22507] down(skc19,skc17).
% 22536 [hyper:65,22507] barrel(skc19,skc18).
% 22537 [hyper:71,22507] furniture(skc16).
% 22538 [hyper:72,22507] front(skc16).
% 22539 [hyper:73,22507] man(skc15).
% 22540 [hyper:74,22507] fellow(skc15).
% 22541 [hyper:75,22507] man(skc14).
% 22542 [hyper:76,22507] young(skc14).
% 22543 [hyper:77,22507] city(skc20).
% 22544 [hyper:78,22507] car(skc18).
% 22545 [hyper:79,22507] white(skc18).
% 22546 [hyper:80,22507] dirty(skc18).
% 22547 [hyper:81,22507] old(skc18).
% 22548 [hyper:82,22507] way(skc17).
% 22549 [hyper:83,22507] street(skc17).
% 22744 [hyper:57,22536,22534,22535,22537,22533,22532,cut:22507,cut:22546,cut:22545,cut:22544,cut:101,cut:22547,cut:102,cut:22543,cut:103,cut:22548,cut:100,cut:22549,cut:22538,cut:99,cut:22541,cut:97,cut:22542,cut:22539,cut:22540,cut:98] equal(skc15,skc14).
% 22816 [hyper:59,22744,cut:22507] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 53
% clause depth limited to 1
% seconds given: 25
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 106
% derived clauses: 19428
% kept clauses: 356
% kept size sum: 1567
% kept mid-nuclei: 17371
% kept new demods: 2
% forw unit-subs: 1083
% forw double-subs: 479
% forw overdouble-subs: 0
% backward subs: 97
% fast unit cutoff: 5345
% full unit cutoff: 0
% dbl unit cutoff: 4905
% real runtime : 1.24
% process. runtime: 1.22
% specific non-discr-tree subsumption statistics:
% tried: 5159
% length fails: 0
% strength fails: 5159
% predlist fails: 0
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 0
% full subs fail: 0
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/home/graph/tptp/TSTP/PreparedTPTP/otter:hypothesis:set(auto),clear(print_given)---add_equality:r/NLP/NLP009-1+eq_r.in")
%
%------------------------------------------------------------------------------