TSTP Solution File: NLP117-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : NLP117-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 : art08.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/NLP117-1+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: nne
% detected subclass: medium
%
% strategies selected:
% (hyper 27 #f 1 35)
% (binary-unit 10 #f 1 35)
% (binary-double 16 #f 1 35)
% (binary 54 #t 1 35)
% (binary-order 27 #f 1 35)
% (binary-posweight-order 125 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 27 #f)
% (binary-weightorder 54 #f)
% (binary-order 54 #f)
% (hyper-order 43 #f)
% (binary 109 #t)
%
%
% SOS clause
% -agent(X,Y,Z) | -old(X,Z) | -dirty(X,Z) | -white(X,Z) | -chevy(X,Z) | -barrel(X,Y) | -present(X,Y) | -event(X,Y) | -hollywood_placename(X,U) | -placename(X,U) | -in(X,Y,V) | -city(X,V) | -of(X,U,V) | -street(X,W) | -lonely(X,W) | -down(X,Y,W) | -actual_world(X) | -ss^sk^c0(0).
% was split for some strategies as:
% -agent(X,Y,Z) | -old(X,Z) | -dirty(X,Z) | -white(X,Z) | -chevy(X,Z) | -barrel(X,Y) | -present(X,Y) | -event(X,Y) | -hollywood_placename(X,U) | -placename(X,U) | -in(X,Y,V) | -city(X,V) | -of(X,U,V) | -street(X,W) | -lonely(X,W) | -down(X,Y,W) | -actual_world(X).
% -ss^sk^c0(0).
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(36,40,1,72,0,1)
%
%
% START OF PROOF
% 37 [] ss^sk^c0(0) | -down(X,Y,Z) | -of(X,U,V) | -in(X,Y,V) | -agent(X,Y,W) | -lonely(X,Z) | -street(X,Z) | -city(X,V) | -placename(X,U) | -hollywood_placename(X,U) | -event(X,Y) | -present(X,Y) | -barrel(X,Y) | -chevy(X,W) | -white(X,W) | -dirty(X,W) | -old(X,W) | -actual_world(X).
% 38 [] agent(skc12,skc13,skc14) | -ss^sk^c0(0).
% 39 [] of(skc12,skc15,skc16) | -ss^sk^c0(0).
% 40 [] in(skc12,skc13,skc16) | -ss^sk^c0(0).
% 41 [] down(skc12,skc13,skc17) | -ss^sk^c0(0).
% 42 [] down(skc18,skc19,skc20) | ss^sk^c0(0).
% 43 [] of(skc18,skc21,skc22) | ss^sk^c0(0).
% 44 [] in(skc18,skc19,skc22) | ss^sk^c0(0).
% 45 [] agent(skc18,skc19,skc23) | ss^sk^c0(0).
% 46 [] old(skc12,skc14) | -ss^sk^c0(0).
% 47 [] dirty(skc12,skc14) | -ss^sk^c0(0).
% 48 [] white(skc12,skc14) | -ss^sk^c0(0).
% 49 [] chevy(skc12,skc14) | -ss^sk^c0(0).
% 50 [] city(skc12,skc16) | -ss^sk^c0(0).
% 51 [] placename(skc12,skc15) | -ss^sk^c0(0).
% 52 [] hollywood_placename(skc12,skc15) | -ss^sk^c0(0).
% 53 [] event(skc12,skc13) | -ss^sk^c0(0).
% 54 [] present(skc12,skc13) | -ss^sk^c0(0).
% 55 [] barrel(skc12,skc13) | -ss^sk^c0(0).
% 56 [] street(skc12,skc17) | -ss^sk^c0(0).
% 57 [] lonely(skc12,skc17) | -ss^sk^c0(0).
% 58 [] lonely(skc18,skc20) | ss^sk^c0(0).
% 59 [] street(skc18,skc20) | ss^sk^c0(0).
% 60 [] city(skc18,skc22) | ss^sk^c0(0).
% 61 [] placename(skc18,skc21) | ss^sk^c0(0).
% 62 [] hollywood_placename(skc18,skc21) | ss^sk^c0(0).
% 63 [] event(skc18,skc19) | ss^sk^c0(0).
% 64 [] present(skc18,skc19) | ss^sk^c0(0).
% 65 [] barrel(skc18,skc19) | ss^sk^c0(0).
% 66 [] chevy(skc18,skc23) | ss^sk^c0(0).
% 67 [] white(skc18,skc23) | ss^sk^c0(0).
% 68 [] dirty(skc18,skc23) | ss^sk^c0(0).
% 69 [] old(skc18,skc23) | ss^sk^c0(0).
% 70 [] actual_world(skc12).
% 71 [] actual_world(skc18).
% 72 [] -ss^sk^c0(0) | -down(X,Y,Z) | -of(X,U,V) | -in(X,Y,V) | -agent(X,Y,W) | -lonely(X,Z) | -street(X,Z) | -city(X,V) | -placename(X,U) | -hollywood_placename(X,U) | -event(X,Y) | -present(X,Y) | -barrel(X,Y) | -chevy(X,W) | -white(X,W) | -dirty(X,W) | -old(X,W) | -actual_world(X).
% 477 [hyper:37,45,42,43,cut:71,binarycut:63,binarycut:64,binarycut:65,binarycut:66,binarycut:67,binarycut:68,binarycut:69,binarycut:58,binarycut:59,binarycut:44,binarycut:60,binarycut:61,binarycut:62] ss^sk^c0(0).
% 496 [hyper:38,477] agent(skc12,skc13,skc14).
% 497 [hyper:39,477] of(skc12,skc15,skc16).
% 498 [hyper:40,477] in(skc12,skc13,skc16).
% 499 [hyper:41,477] down(skc12,skc13,skc17).
% 500 [hyper:46,477] old(skc12,skc14).
% 501 [hyper:47,477] dirty(skc12,skc14).
% 502 [hyper:48,477] white(skc12,skc14).
% 503 [hyper:49,477] chevy(skc12,skc14).
% 504 [hyper:50,477] city(skc12,skc16).
% 505 [hyper:51,477] placename(skc12,skc15).
% 506 [hyper:52,477] hollywood_placename(skc12,skc15).
% 507 [hyper:53,477] event(skc12,skc13).
% 508 [hyper:54,477] present(skc12,skc13).
% 509 [hyper:55,477] barrel(skc12,skc13).
% 510 [hyper:56,477] street(skc12,skc17).
% 511 [hyper:57,477] lonely(skc12,skc17).
% 562 [hyper:72,499,498,497,496,cut:477,cut:511,cut:510,cut:507,cut:508,cut:509,cut:70,cut:504,cut:505,cut:506,cut:503,cut:502,cut:501,cut:500] 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 35
% clause depth limited to 1
% seconds given: 9
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 53
% derived clauses: 738
% kept clauses: 273
% kept size sum: 1718
% kept mid-nuclei: 135
% kept new demods: 0
% forw unit-subs: 0
% forw double-subs: 263
% forw overdouble-subs: 0
% backward subs: 70
% fast unit cutoff: 88
% full unit cutoff: 0
% dbl unit cutoff: 47
% real runtime : 0.4
% process. runtime: 0.3
% specific non-discr-tree subsumption statistics:
% tried: 42
% length fails: 0
% strength fails: 42
% 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/NLP117-1+noeq.in")
%
%------------------------------------------------------------------------------