TSTP Solution File: NLP122-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : NLP122-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 : art03.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/NLP122-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
% -city(X,Y) | -chevy(X,Y) | -white(X,Y) | -dirty(X,Y) | -old(X,Y) | -agent(X,Z,Y) | -in(X,Z,Y) | -placename(X,U) | -hollywood_placename(X,U) | -of(X,U,Y) | -event(X,Z) | -present(X,Z) | -barrel(X,Z) | -down(X,Z,V) | -lonely(X,V) | -street(X,V) | -actual_world(X) | -ss^sk^c0(0).
% was split for some strategies as:
% -city(X,Y) | -chevy(X,Y) | -white(X,Y) | -dirty(X,Y) | -old(X,Y) | -agent(X,Z,Y) | -in(X,Z,Y) | -placename(X,U) | -hollywood_placename(X,U) | -of(X,U,Y) | -event(X,Z) | -present(X,Z) | -barrel(X,Z) | -down(X,Z,V) | -lonely(X,V) | -street(X,V) | -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,V) | -street(X,Z) | -lonely(X,Z) | -barrel(X,Y) | -present(X,Y) | -event(X,Y) | -hollywood_placename(X,U) | -placename(X,U) | -old(X,V) | -dirty(X,V) | -white(X,V) | -chevy(X,V) | -city(X,V) | -actual_world(X).
% 38 [] of(skc10,skc13,skc12) | -ss^sk^c0(0).
% 39 [] agent(skc10,skc11,skc12) | -ss^sk^c0(0).
% 40 [] in(skc10,skc11,skc12) | -ss^sk^c0(0).
% 41 [] down(skc10,skc11,skc14) | -ss^sk^c0(0).
% 42 [] down(skc15,skc16,skc17) | ss^sk^c0(0).
% 43 [] of(skc15,skc19,skc18) | ss^sk^c0(0).
% 44 [] in(skc15,skc16,skc18) | ss^sk^c0(0).
% 45 [?] ?
% 46 [] placename(skc10,skc13) | -ss^sk^c0(0).
% 47 [] hollywood_placename(skc10,skc13) | -ss^sk^c0(0).
% 48 [] city(skc10,skc12) | -ss^sk^c0(0).
% 49 [] chevy(skc10,skc12) | -ss^sk^c0(0).
% 50 [] white(skc10,skc12) | -ss^sk^c0(0).
% 51 [] dirty(skc10,skc12) | -ss^sk^c0(0).
% 52 [] old(skc10,skc12) | -ss^sk^c0(0).
% 53 [] street(skc10,skc14) | -ss^sk^c0(0).
% 54 [] lonely(skc10,skc14) | -ss^sk^c0(0).
% 55 [] barrel(skc10,skc11) | -ss^sk^c0(0).
% 56 [] present(skc10,skc11) | -ss^sk^c0(0).
% 57 [] event(skc10,skc11) | -ss^sk^c0(0).
% 58 [] street(skc15,skc17) | ss^sk^c0(0).
% 59 [] lonely(skc15,skc17) | ss^sk^c0(0).
% 60 [] barrel(skc15,skc16) | ss^sk^c0(0).
% 61 [] present(skc15,skc16) | ss^sk^c0(0).
% 62 [] event(skc15,skc16) | ss^sk^c0(0).
% 63 [] hollywood_placename(skc15,skc19) | ss^sk^c0(0).
% 64 [] placename(skc15,skc19) | ss^sk^c0(0).
% 65 [] old(skc15,skc18) | ss^sk^c0(0).
% 66 [] dirty(skc15,skc18) | ss^sk^c0(0).
% 67 [] white(skc15,skc18) | ss^sk^c0(0).
% 68 [] chevy(skc15,skc18) | ss^sk^c0(0).
% 69 [] city(skc15,skc18) | ss^sk^c0(0).
% 70 [] actual_world(skc10).
% 71 [] actual_world(skc15).
% 72 [] -ss^sk^c0(0) | -down(X,Y,Z) | -of(X,U,V) | -in(X,Y,V) | -agent(X,Y,V) | -street(X,Z) | -lonely(X,Z) | -barrel(X,Y) | -present(X,Y) | -event(X,Y) | -hollywood_placename(X,U) | -placename(X,U) | -old(X,V) | -dirty(X,V) | -white(X,V) | -chevy(X,V) | -city(X,V) | -actual_world(X).
% 434 [hyper:37,44,42,43,cut:71,binarycut:45,binarycut:60,binarycut:61,binarycut:62,binarycut:65,binarycut:66,binarycut:67,binarycut:68,binarycut:69,binarycut:58,binarycut:59,binarycut:63,binarycut:64] ss^sk^c0(0).
% 453 [hyper:38,434] of(skc10,skc13,skc12).
% 454 [hyper:39,434] agent(skc10,skc11,skc12).
% 455 [hyper:40,434] in(skc10,skc11,skc12).
% 456 [hyper:41,434] down(skc10,skc11,skc14).
% 457 [hyper:46,434] placename(skc10,skc13).
% 458 [hyper:47,434] hollywood_placename(skc10,skc13).
% 459 [hyper:48,434] city(skc10,skc12).
% 460 [hyper:49,434] chevy(skc10,skc12).
% 461 [hyper:50,434] white(skc10,skc12).
% 462 [hyper:51,434] dirty(skc10,skc12).
% 463 [hyper:52,434] old(skc10,skc12).
% 464 [hyper:53,434] street(skc10,skc14).
% 465 [hyper:54,434] lonely(skc10,skc14).
% 466 [hyper:55,434] barrel(skc10,skc11).
% 467 [hyper:56,434] present(skc10,skc11).
% 468 [hyper:57,434] event(skc10,skc11).
% 503 [hyper:72,456,453,cut:434,cut:464,cut:465,cut:466,cut:467,cut:468,cut:70,cut:454,cut:455,cut:458,cut:457,cut:463,cut:462,cut:461,cut:460,cut:459] 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: 52
% derived clauses: 670
% kept clauses: 257
% kept size sum: 1602
% kept mid-nuclei: 104
% kept new demods: 0
% forw unit-subs: 0
% forw double-subs: 245
% forw overdouble-subs: 0
% backward subs: 69
% fast unit cutoff: 68
% full unit cutoff: 0
% dbl unit cutoff: 36
% real runtime : 0.4
% process. runtime: 0.3
% specific non-discr-tree subsumption statistics:
% tried: 36
% length fails: 0
% strength fails: 36
% 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/NLP122-1+noeq.in")
%
%------------------------------------------------------------------------------