TSTP Solution File: PUZ008-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : PUZ008-2 : 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 : 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/PUZ/PUZ008-2+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 3)
% (binary-unit 30 #f 3 3)
% (binary-posweight-order 90 #f 3 3)
% (binary-double 30 #f)
% (binary 48 #t 3 3)
% (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(32,40,0,64,0,0)
%
%
% START OF PROOF
% 38 [] -banks(west(m(n3),c(n3)),east(m(n0),c(n0)),boatonwest) | banks(west(m(n3),c(n1)),east(m(n0),c(n2)),boatoneast).
% 39 [] -banks(west(m(n0),c(n3)),east(m(n3),c(n0)),boatonwest) | banks(west(m(n0),c(n1)),east(m(n3),c(n2)),boatoneast).
% 40 [] -banks(west(m(n3),c(n2)),east(m(n0),c(n1)),boatonwest) | banks(west(m(n3),c(n0)),east(m(n0),c(n3)),boatoneast).
% 41 [] -banks(west(m(n0),c(n2)),east(m(n3),c(n1)),boatonwest) | banks(west(m(n0),c(n0)),east(m(n3),c(n3)),boatoneast).
% 42 [] -banks(west(m(n0),c(n2)),east(m(n3),c(n1)),boatoneast) | banks(west(m(n0),c(n3)),east(m(n3),c(n0)),boatonwest).
% 43 [] -banks(west(m(n0),c(n1)),east(m(n3),c(n2)),boatoneast) | banks(west(m(n0),c(n2)),east(m(n3),c(n1)),boatonwest).
% 44 [] -banks(west(m(n3),c(n0)),east(m(n0),c(n3)),boatoneast) | banks(west(m(n3),c(n1)),east(m(n0),c(n2)),boatonwest).
% 46 [] -banks(west(m(n3),c(n1)),east(m(n0),c(n2)),boatoneast) | banks(west(m(n3),c(n2)),east(m(n0),c(n1)),boatonwest).
% 52 [] -banks(west(m(n3),c(n1)),east(m(n0),c(n2)),boatonwest) | banks(west(m(n1),c(n1)),east(m(n2),c(n2)),boatoneast).
% 53 [] -banks(west(m(n2),c(n2)),east(m(n1),c(n1)),boatonwest) | banks(west(m(n0),c(n2)),east(m(n3),c(n1)),boatoneast).
% 61 [] -banks(west(m(n1),c(n1)),east(m(n2),c(n2)),boatoneast) | banks(west(m(n2),c(n2)),east(m(n1),c(n1)),boatonwest).
% 63 [] banks(west(m(n3),c(n3)),east(m(n0),c(n0)),boatonwest).
% 64 [] -banks(west(m(n0),c(n0)),east(m(n3),c(n3)),boatoneast).
% 65 [hyper:38,63] banks(west(m(n3),c(n1)),east(m(n0),c(n2)),boatoneast).
% 67 [hyper:46,65] banks(west(m(n3),c(n2)),east(m(n0),c(n1)),boatonwest).
% 68 [hyper:40,67] banks(west(m(n3),c(n0)),east(m(n0),c(n3)),boatoneast).
% 69 [hyper:44,68] banks(west(m(n3),c(n1)),east(m(n0),c(n2)),boatonwest).
% 70 [hyper:52,69] banks(west(m(n1),c(n1)),east(m(n2),c(n2)),boatoneast).
% 71 [hyper:61,70] banks(west(m(n2),c(n2)),east(m(n1),c(n1)),boatonwest).
% 72 [hyper:53,71] banks(west(m(n0),c(n2)),east(m(n3),c(n1)),boatoneast).
% 73 [hyper:42,72] banks(west(m(n0),c(n3)),east(m(n3),c(n0)),boatonwest).
% 74 [hyper:39,73] banks(west(m(n0),c(n1)),east(m(n3),c(n2)),boatoneast).
% 75 [hyper:43,74] banks(west(m(n0),c(n2)),east(m(n3),c(n1)),boatonwest).
% 77 [hyper:41,75,cut:64] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using hyperresolution
% 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 3
% clause depth limited to 3
% seconds given: 12
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 13
% derived clauses: 15
% kept clauses: 12
% kept size sum: 144
% kept mid-nuclei: 0
% kept new demods: 0
% forw unit-subs: 2
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 24
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.0
% process. runtime: 0.0
% 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/PUZ/PUZ008-2+noeq.in")
%
%------------------------------------------------------------------------------