%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : NLP001-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 : art06.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/NLP001-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 29)
% (binary-unit 10 #f 1 29)
% (binary-double 16 #f 1 29)
% (binary 54 #t 1 29)
% (binary-order 27 #f 1 29)
% (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
% -chevy(X) | -car(X) | -white(X) | -dirty(X) | -old(X) | -lonely(Y) | -way(Y) | -street(Y) | -event(Z) | -barrel(Z,X) | -down(Z,Y) | -in(Z,U) | -city(U) | -hollywood(U) | -ss^sk^c0(0).
% was split for some strategies as:
% -chevy(X) | -car(X) | -white(X) | -dirty(X) | -old(X) | -barrel(Z,X) | -event(Z) | -down(Z,Y) | -lonely(Y) | -way(Y) | -street(Y) | -in(Z,U) | -city(U) | -hollywood(U).
% -ss^sk^c0(0).
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(30,40,0,65,0,0)
%
%
% START OF PROOF
% 31 [] ss^sk^c0(0) | -in(X,Y) | -down(X,Z) | -barrel(X,U) | -city(Y) | -way(Z) | -dirty(U) | -white(U) | -car(U) | -lonely(Z) | -chevy(U) | -old(U) | -street(Z) | -event(X) | -hollywood(Y).
% 32 [] in(skc10,skc11) | -ss^sk^c0(0).
% 33 [] down(skc10,skc8) | -ss^sk^c0(0).
% 34 [] barrel(skc10,skc9) | -ss^sk^c0(0).
% 35 [] in(skc14,skc15) | ss^sk^c0(0).
% 36 [] down(skc14,skc13) | ss^sk^c0(0).
% 37 [] barrel(skc14,skc12) | ss^sk^c0(0).
% 38 [] -ss^sk^c0(0) | city(skc11).
% 39 [] -ss^sk^c0(0) | car(skc9).
% 40 [] -ss^sk^c0(0) | white(skc9).
% 41 [] -ss^sk^c0(0) | dirty(skc9).
% 42 [] -ss^sk^c0(0) | old(skc9).
% 43 [] -ss^sk^c0(0) | way(skc8).
% 44 [] -ss^sk^c0(0) | street(skc8).
% 45 [] city(skc15) | ss^sk^c0(0).
% 46 [] way(skc13) | ss^sk^c0(0).
% 47 [] ss^sk^c0(0) | lonely(skc13).
% 48 [] dirty(skc12) | ss^sk^c0(0).
% 49 [] white(skc12) | ss^sk^c0(0).
% 50 [] car(skc12) | ss^sk^c0(0).
% 51 [] ss^sk^c0(0) | chevy(skc12).
% 52 [] lonely(skc8).
% 53 [] chevy(skc9).
% 54 [] event(skc10).
% 55 [] hollywood(skc11).
% 56 [] old(skc12).
% 57 [] street(skc13).
% 58 [] event(skc14).
% 59 [] hollywood(skc15).
% 60 [] -ss^sk^c0(0) | -in(X,Y) | -down(X,Z) | -barrel(X,U) | -city(Y) | -way(Z) | -dirty(U) | -white(U) | -car(U) | -lonely(Z) | -chevy(U) | -old(U) | -street(Z) | -event(X) | -hollywood(Y).
% 31271 [hyper:31,37,51,35,36,47,cut:56,cut:58,binarycut:48,binarycut:49,binarycut:50,cut:59,binarycut:45,cut:57,binarycut:46] ss^sk^c0(0).
% 31286 [hyper:32,31271] in(skc10,skc11).
% 31287 [hyper:33,31271] down(skc10,skc8).
% 31288 [hyper:34,31271] barrel(skc10,skc9).
% 31289 [hyper:38,31271] city(skc11).
% 31290 [hyper:39,31271] car(skc9).
% 31291 [hyper:40,31271] white(skc9).
% 31292 [hyper:41,31271] dirty(skc9).
% 31293 [hyper:42,31271] old(skc9).
% 31294 [hyper:43,31271] way(skc8).
% 31295 [hyper:44,31271] street(skc8).
% 31342 [hyper:60,31288,31286,31287,cut:31271,cut:31292,cut:31291,cut:31290,cut:53,cut:31293,cut:54,cut:31289,cut:55,cut:31294,cut:52,cut:31295] 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 29
% clause depth limited to 1
% seconds given: 9
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 77
% derived clauses: 30012
% kept clauses: 117
% kept size sum: 507
% kept mid-nuclei: 29559
% kept new demods: 0
% forw unit-subs: 12
% forw double-subs: 243
% forw overdouble-subs: 0
% backward subs: 73
% fast unit cutoff: 447
% full unit cutoff: 0
% dbl unit cutoff: 1544
% real runtime : 2.53
% process. runtime: 2.51
% specific non-discr-tree subsumption statistics:
% tried: 4384
% length fails: 0
% strength fails: 4384
% 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/NLP001-1+noeq.in")
%
%------------------------------------------------------------------------------