TSTP Solution File: NLP011-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : NLP011-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 : art04.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/NLP011-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 59)
% (binary-unit 9 #f 1 59)
% (binary-double 9 #f 1 59)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 1 59)
% (binary-order 25 #f 1 59)
% (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(61,40,1,134,0,1)
%
%
% START OF PROOF
% 63 [] -ss^sk^c0(0) | -in(Z,U) | -in(V,W) | -in(X,Y) | -barrel(X,X1) | -down(X,X2) | equal(Z,V) | -furniture(U) | -furniture(W) | -man(Z) | -man(V) | -hollywood(Y) | -way(X2) | -street(X2) | -car(X1) | -white(X1) | -dirty(X1) | -old(X1) | -young(Z) | -young(V) | -fellow(Z) | -fellow(V) | -front(U) | -front(W) | -seat(U) | -seat(W) | -chevy(X1) | -lonely(X2) | -event(X) | -city(Y).
% 64 [] ss^sk^c0(0) | -in(Z,U) | -in(V,W) | -in(X,Y) | -barrel(X,X1) | -down(X,X2) | equal(Z,V) | -furniture(U) | -furniture(W) | -man(Z) | -man(V) | -hollywood(Y) | -way(X2) | -street(X2) | -car(X1) | -white(X1) | -dirty(X1) | -old(X1) | -young(Z) | -young(V) | -fellow(Z) | -fellow(V) | -front(U) | -front(W) | -seat(U) | -seat(W) | -chevy(X1) | -lonely(X2) | -event(X) | -city(Y).
% 65 [] -equal(skc17,skc16) | -ss^sk^c0(0).
% 66 [] -equal(skc25,skc24) | ss^sk^c0(0).
% 67 [] in(skc17,skc18) | -ss^sk^c0(0).
% 68 [] in(skc16,skc19) | -ss^sk^c0(0).
% 69 [] in(skc22,skc23) | -ss^sk^c0(0).
% 70 [] barrel(skc22,skc20) | -ss^sk^c0(0).
% 71 [] down(skc22,skc21) | -ss^sk^c0(0).
% 72 [] in(skc25,skc26) | ss^sk^c0(0).
% 73 [] in(skc24,skc27) | ss^sk^c0(0).
% 74 [] in(skc30,skc31) | ss^sk^c0(0).
% 75 [] barrel(skc30,skc28) | ss^sk^c0(0).
% 76 [] down(skc30,skc29) | ss^sk^c0(0).
% 77 [] -ss^sk^c0(0) | man(skc17).
% 78 [] -ss^sk^c0(0) | young(skc17).
% 79 [] -ss^sk^c0(0) | furniture(skc18).
% 80 [] -ss^sk^c0(0) | front(skc18).
% 81 [] -ss^sk^c0(0) | man(skc16).
% 82 [] -ss^sk^c0(0) | fellow(skc16).
% 83 [] -ss^sk^c0(0) | furniture(skc19).
% 84 [] -ss^sk^c0(0) | seat(skc19).
% 85 [] -ss^sk^c0(0) | hollywood(skc23).
% 86 [] -ss^sk^c0(0) | way(skc21).
% 87 [] -ss^sk^c0(0) | street(skc21).
% 88 [] -ss^sk^c0(0) | car(skc20).
% 89 [] -ss^sk^c0(0) | white(skc20).
% 90 [] -ss^sk^c0(0) | dirty(skc20).
% 91 [] -ss^sk^c0(0) | old(skc20).
% 92 [] furniture(skc26) | ss^sk^c0(0).
% 93 [] ss^sk^c0(0) | seat(skc26).
% 94 [] man(skc25) | ss^sk^c0(0).
% 95 [] ss^sk^c0(0) | young(skc25).
% 96 [] furniture(skc27) | ss^sk^c0(0).
% 97 [] ss^sk^c0(0) | front(skc27).
% 98 [] man(skc24) | ss^sk^c0(0).
% 99 [] ss^sk^c0(0) | fellow(skc24).
% 100 [] hollywood(skc31) | ss^sk^c0(0).
% 101 [] way(skc29) | ss^sk^c0(0).
% 102 [] street(skc29) | ss^sk^c0(0).
% 103 [] car(skc28) | ss^sk^c0(0).
% 104 [] white(skc28) | ss^sk^c0(0).
% 105 [] dirty(skc28) | ss^sk^c0(0).
% 106 [] old(skc28) | ss^sk^c0(0).
% 107 [] young(skc16).
% 108 [] fellow(skc17).
% 109 [] seat(skc18).
% 110 [] front(skc19).
% 111 [] chevy(skc20).
% 112 [] lonely(skc21).
% 113 [] event(skc22).
% 114 [] city(skc23).
% 115 [] young(skc24).
% 116 [] fellow(skc25).
% 117 [] front(skc26).
% 118 [] seat(skc27).
% 119 [] chevy(skc28).
% 120 [] lonely(skc29).
% 121 [] event(skc30).
% 122 [] city(skc31).
% 43245 [hyper:64,76,74,75,98,99,73,97,94,95,72,93,cut:120,cut:121,binarycut:101,binarycut:102,cut:122,binarycut:100,cut:119,binarycut:103,binarycut:104,binarycut:105,binarycut:106,cut:115,cut:118,binarycut:96,cut:116,cut:117,binarycut:92,binarycut:66] ss^sk^c0(0).
% 43272 [hyper:67,43245] in(skc17,skc18).
% 43273 [hyper:68,43245] in(skc16,skc19).
% 43274 [hyper:69,43245] in(skc22,skc23).
% 43275 [hyper:70,43245] barrel(skc22,skc20).
% 43276 [hyper:71,43245] down(skc22,skc21).
% 43277 [hyper:77,43245] man(skc17).
% 43278 [hyper:78,43245] young(skc17).
% 43279 [hyper:79,43245] furniture(skc18).
% 43280 [hyper:80,43245] front(skc18).
% 43281 [hyper:81,43245] man(skc16).
% 43282 [hyper:82,43245] fellow(skc16).
% 43283 [hyper:83,43245] furniture(skc19).
% 43284 [hyper:84,43245] seat(skc19).
% 43285 [hyper:85,43245] hollywood(skc23).
% 43286 [hyper:86,43245] way(skc21).
% 43287 [hyper:87,43245] street(skc21).
% 43288 [hyper:88,43245] car(skc20).
% 43289 [hyper:89,43245] white(skc20).
% 43290 [hyper:90,43245] dirty(skc20).
% 43291 [hyper:91,43245] old(skc20).
% 43529 [hyper:63,43276,43274,43275,43279,43272,43273,cut:43245,cut:43286,cut:43287,cut:112,cut:113,cut:43285,cut:114,cut:43288,cut:43289,cut:43290,cut:43291,cut:111,cut:43280,cut:109,cut:43277,cut:43278,cut:108,cut:43283,cut:43281,cut:107,cut:43282,cut:110,cut:43284] equal(skc17,skc16).
% 43665 [hyper:65,43529,cut:43245] 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 59
% clause depth limited to 1
% seconds given: 25
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 117
% derived clauses: 35110
% kept clauses: 454
% kept size sum: 1975
% kept mid-nuclei: 33015
% kept new demods: 2
% forw unit-subs: 919
% forw double-subs: 580
% forw overdouble-subs: 0
% backward subs: 95
% fast unit cutoff: 10511
% full unit cutoff: 0
% dbl unit cutoff: 9999
% real runtime : 2.39
% process. runtime: 2.39
% specific non-discr-tree subsumption statistics:
% tried: 12078
% length fails: 0
% strength fails: 11923
% predlist fails: 4
% aux str. fails: 0
% by-lit fails: 27
% full subs tried: 124
% full subs fail: 124
%
% ; 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/NLP011-1+eq_r.in")
%
%------------------------------------------------------------------------------