TSTP Solution File: SYN001-1.005 by Gandalf---c-2.6

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SYN001-1.005 : 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 : 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/SYN/SYN001-1.005+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 9)
% (binary-unit 10 #f 1 9)
% (binary-double 16 #f 1 9)
% (binary 54 #t 1 9)
% (binary-order 27 #f 1 9)
% (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 
% -p_1(0) | -p_2(0) | -p_3(0) | -p_4(0) | -p_5(0).
% was split for some strategies as: 
% -p_1(0).
% -p_2(0).
% -p_3(0).
% -p_4(0).
% -p_5(0).
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(32,40,1,64,0,1)
% 
% 
% START OF PROOF
% 33 [] -p_4(0) | -p_3(0) | -p_2(0) | -p_1(0) | p_5(0).
% 34 [] -p_5(0) | -p_3(0) | -p_2(0) | -p_1(0) | p_4(0).
% 35 [] -p_3(0) | -p_2(0) | -p_1(0) | p_5(0) | p_4(0).
% 36 [] -p_5(0) | -p_4(0) | -p_2(0) | -p_1(0) | p_3(0).
% 37 [] -p_4(0) | -p_2(0) | -p_1(0) | p_5(0) | p_3(0).
% 38 [] -p_5(0) | -p_2(0) | -p_1(0) | p_4(0) | p_3(0).
% 39 [] -p_2(0) | -p_1(0) | p_5(0) | p_4(0) | p_3(0).
% 40 [] -p_5(0) | -p_4(0) | -p_3(0) | -p_1(0) | p_2(0).
% 41 [] -p_4(0) | -p_3(0) | -p_1(0) | p_5(0) | p_2(0).
% 42 [] -p_5(0) | -p_3(0) | -p_1(0) | p_4(0) | p_2(0).
% 43 [] -p_3(0) | -p_1(0) | p_5(0) | p_4(0) | p_2(0).
% 44 [] -p_5(0) | -p_4(0) | -p_1(0) | p_3(0) | p_2(0).
% 45 [] -p_4(0) | -p_1(0) | p_5(0) | p_3(0) | p_2(0).
% 46 [] -p_5(0) | -p_1(0) | p_4(0) | p_3(0) | p_2(0).
% 47 [] -p_1(0) | p_5(0) | p_4(0) | p_3(0) | p_2(0).
% 48 [] -p_5(0) | -p_4(0) | -p_3(0) | -p_2(0) | p_1(0).
% 49 [] -p_4(0) | -p_3(0) | -p_2(0) | p_5(0) | p_1(0).
% 50 [] -p_5(0) | -p_3(0) | -p_2(0) | p_4(0) | p_1(0).
% 51 [] -p_3(0) | -p_2(0) | p_5(0) | p_4(0) | p_1(0).
% 52 [] -p_5(0) | -p_4(0) | -p_2(0) | p_3(0) | p_1(0).
% 53 [] -p_4(0) | -p_2(0) | p_5(0) | p_3(0) | p_1(0).
% 54 [] -p_5(0) | -p_2(0) | p_4(0) | p_3(0) | p_1(0).
% 55 [] -p_2(0) | p_5(0) | p_4(0) | p_3(0) | p_1(0).
% 56 [] -p_5(0) | -p_4(0) | -p_3(0) | p_2(0) | p_1(0).
% 57 [] -p_4(0) | -p_3(0) | p_5(0) | p_2(0) | p_1(0).
% 58 [] -p_5(0) | -p_3(0) | p_4(0) | p_2(0) | p_1(0).
% 59 [] -p_3(0) | p_5(0) | p_4(0) | p_2(0) | p_1(0).
% 60 [] -p_5(0) | -p_4(0) | p_3(0) | p_2(0) | p_1(0).
% 61 [] -p_4(0) | p_5(0) | p_3(0) | p_2(0) | p_1(0).
% 62 [] -p_5(0) | p_4(0) | p_3(0) | p_2(0) | p_1(0).
% 63 [] p_5(0) | p_4(0) | p_3(0) | p_2(0) | p_1(0).
% 64 [] -p_5(0) | -p_4(0) | -p_3(0) | -p_2(0) | -p_1(0).
% 97 [hyper:47,63] p_5(0) | p_4(0) | p_3(0) | p_2(0).
% 98 [hyper:55,63] p_5(0) | p_4(0) | p_3(0) | p_1(0).
% 99 [hyper:59,63] p_5(0) | p_4(0) | p_2(0) | p_1(0).
% 100 [hyper:61,63] p_5(0) | p_3(0) | p_2(0) | p_1(0).
% 101 [hyper:62,63] p_4(0) | p_3(0) | p_2(0) | p_1(0).
% 113 [hyper:39,98,97] p_5(0) | p_4(0) | p_3(0).
% 141 [hyper:43,99,113] p_5(0) | p_4(0) | p_2(0).
% 143 [hyper:51,99,113] p_5(0) | p_4(0) | p_1(0).
% 169 [hyper:35,143,113,141] p_5(0) | p_4(0).
% 213 [hyper:45,100,169] p_5(0) | p_3(0) | p_2(0).
% 215 [hyper:53,100,169] p_5(0) | p_3(0) | p_1(0).
% 217 [hyper:57,100,169] p_5(0) | p_2(0) | p_1(0).
% 237 [hyper:46,101,binarycut:169] p_4(0) | p_3(0) | p_2(0).
% 239 [hyper:54,101,binarycut:169] p_4(0) | p_3(0) | p_1(0).
% 241 [hyper:58,101,binarycut:169] p_4(0) | p_2(0) | p_1(0).
% 243 [hyper:60,101,213] p_3(0) | p_2(0) | p_1(0).
% 248 [hyper:37,215,169,213] p_5(0) | p_3(0).
% 280 [hyper:41,217,169,248] p_5(0) | p_2(0).
% 284 [hyper:49,217,169,248] p_5(0) | p_1(0).
% 313 [hyper:33,284,169,248,280] p_5(0).
% 359 [hyper:38,239,237,cut:313] p_4(0) | p_3(0).
% 379 [hyper:42,241,359,cut:313] p_4(0) | p_2(0).
% 381 [hyper:50,241,359,cut:313] p_4(0) | p_1(0).
% 397 [hyper:44,243,cut:313,binarycut:359] p_3(0) | p_2(0).
% 399 [hyper:52,243,cut:313,binarycut:359] p_3(0) | p_1(0).
% 401 [hyper:56,243,cut:313,binarycut:379] p_2(0) | p_1(0).
% 406 [hyper:34,381,359,379,cut:313] p_4(0).
% 408 [hyper:48,381,cut:313,binarycut:399,binarycut:401] p_1(0).
% 412 [hyper:40,406,cut:313,cut:408,binarycut:397] p_2(0).
% 414 [hyper:36,406,cut:313,cut:412,cut:408] p_3(0).
% 415 [hyper:64,408,cut:412,cut:414,cut:406,cut:313] 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 9
% clause depth limited to 1
% seconds given: 9
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    57
%  derived clauses:   1736
%  kept clauses:      30
%  kept size sum:     150
%  kept mid-nuclei:   258
%  kept new demods:   0
%  forw unit-subs:    0
%  forw double-subs: 24
%  forw overdouble-subs: 19
%  backward subs:     84
%  fast unit cutoff:  46
%  full unit cutoff:  0
%  dbl  unit cutoff:  8
%  real runtime:  0.1
%  process. runtime:  0.2
% specific non-discr-tree subsumption statistics: 
%  tried:           1047
%  length fails:    0
%  strength fails:  28
%  predlist fails:  1000
%  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/SYN/SYN001-1.005+noeq.in")
% 
%------------------------------------------------------------------------------