TSTP Solution File: PLA001-1 by Gandalf---c-2.6

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : PLA001-1 : TPTP v3.4.2. Released v1.0.0.
% Transfm  : add_equality:r
% Format   : otter:hypothesis:set(auto),clear(print_given)
% Command  : gandalf-wrapper -time %d %s

% Computer : art10.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 10.0s
% Output   : Assurance 10.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/PLA/PLA001-1+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: hne
% detected subclass: medium
% detected subclass: short
% 
% strategies selected: 
% (hyper 12 #t 3 5)
% (binary-unit 30 #f 3 5)
% (binary-posweight-order 90 #f 3 5)
% (binary-double 30 #f)
% (binary 48 #t 3 5)
% (hyper 30 #f)
% (binary-posweight-order 180 #f)
% (binary-weightorder 42 #f)
% (binary-order 30 #f)
% (binary-unit 48 #f)
% (binary 60 #t)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(16,40,1,32,0,1,62,50,1,78,0,1,128,50,1,144,0,1,250,50,2,266,0,2,524,50,3,540,0,3,1214,50,7,1230,0,7,3040,50,26,3056,0,26,7970,50,399,7986,0,399,20098,4,1000)
% 
% 
% START OF PROOF
% 7971 [] at(X,Y,s(s(Z)),drive(X,U)) | -at(V,Y,Z,U) | -next_to(V,X).
% 7974 [] at(X,s(Y),s(Z),buy(U)) | -at(X,Y,Z,U).
% 7980 [] next_to(cheyenne,north^platte).
% 7981 [] next_to(north^platte,grand^island).
% 7982 [] next_to(grand^island,lincoln).
% 7983 [] next_to(lincoln,omaha).
% 7984 [] next_to(omaha,des^moines).
% 7985 [] at(cheyenne,none,start,initial_situation).
% 7986 [] -at(des^moines,s(none),X,Y).
% 8008 [hyper:7971,7985,7980] at(north^platte,none,s(s(start)),drive(north^platte,initial_situation)).
% 8032 [hyper:7971,8008,7981] at(grand^island,none,s(s(s(s(start)))),drive(grand^island,drive(north^platte,initial_situation))).
% 8176 [hyper:7971,8032,7982] at(lincoln,none,s(s(s(s(s(s(start)))))),drive(lincoln,drive(grand^island,drive(north^platte,initial_situation)))).
% 9124 [hyper:7971,8176,7983] at(omaha,none,s(s(s(s(s(s(s(s(start)))))))),drive(omaha,drive(lincoln,drive(grand^island,drive(north^platte,initial_situation))))).
% 14440 [hyper:7974,9124] at(omaha,s(none),s(s(s(s(s(s(s(s(s(start))))))))),buy(drive(omaha,drive(lincoln,drive(grand^island,drive(north^platte,initial_situation)))))).
% 22074 [binary:7971,7986] -at(X,s(none),Y,Z) | -next_to(X,des^moines).
% 22689 [binary:14440,22074,cut:7984] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 5
% clause depth limited to 10
% seconds given: 12
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    9934
%  derived clauses:   46584
%  kept clauses:      15345
%  kept size sum:     348552
%  kept mid-nuclei:   7199
%  kept new demods:   0
%  forw unit-subs:    1
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     0
%  fast unit cutoff:  1
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  10.5
%  process. runtime:  10.5
% specific non-discr-tree subsumption statistics: 
%  tried:           0
%  length fails:    0
%  strength fails:  0
%  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/PLA/PLA001-1+noeq.in")
% 
%------------------------------------------------------------------------------