%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : COM003-2 : TPTP v3.4.2. Released v1.1.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 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/COM/COM003-2+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 2 9)
% (binary-unit 10 #f 2 9)
% (binary-double 16 #f 2 9)
% (binary 54 #t 2 9)
% (binary-order 27 #f 2 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)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(43,40,0,90,0,0)
% 
% 
% START OF PROOF
% 47 [] -program_program_decides(X) | program(X).
% 54 [] -program_halts2(X,Y) | halts2(X,Y).
% 60 [] -program_not_halts2(X,Y) | -halts2(X,Y).
% 71 [] -program_halts2_halts2_outputs(X,Y,Z) | program_halts2(Y,Y).
% 74 [] -program_not_halts2_halts2_outputs(X,Y,Z) | program_not_halts2(Y,Y).
% 77 [] algorithm_program_decides(c4).
% 81 [] -program_not_halts2_halts3_outputs(X,f3(X),f3(X),bad) | -program_halts2_halts3_outputs(X,f3(X),f3(X),good) | program_not_halts2_halts2_outputs(c2,Y,bad) | -program(X).
% 82 [] -program_not_halts2_halts3_outputs(X,f3(X),f3(X),bad) | -program_halts2_halts3_outputs(X,f3(X),f3(X),good) | program_halts2_halts2_outputs(c2,Y,good) | -program(X).
% 84 [] program_not_halts2_halts3_outputs(X,Y,Z,bad) | -program_program_decides(X).
% 85 [] program_halts2_halts3_outputs(X,Y,Z,good) | -program_program_decides(X).
% 86 [] program_program_decides(c1) | -algorithm_program_decides(X).
% 91 [hyper:86,77] program_program_decides(c1).
% 94 [hyper:84,91] program_not_halts2_halts3_outputs(c1,X,Y,bad).
% 95 [hyper:85,91] program_halts2_halts3_outputs(c1,X,Y,good).
% 96 [hyper:47,91] program(c1).
% 104 [hyper:81,96,cut:95,cut:94] program_not_halts2_halts2_outputs(c2,X,bad).
% 105 [hyper:82,96,cut:95,cut:94] program_halts2_halts2_outputs(c2,X,good).
% 142 [hyper:74,104] program_not_halts2(X,X).
% 165 [hyper:71,105] program_halts2(X,X).
% 168 [hyper:54,165] halts2(X,X).
% 171 [hyper:60,168,cut:142] 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 2
% seconds given: 27
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    26
%  derived clauses:   99
%  kept clauses:      35
%  kept size sum:     128
%  kept mid-nuclei:   35
%  kept new demods:   0
%  forw unit-subs:    18
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     20
%  fast unit cutoff:  17
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.0
%  process. runtime:  0.1
% specific non-discr-tree subsumption statistics: 
%  tried:           18
%  length fails:    0
%  strength fails:  14
%  predlist fails:  4
%  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/COM/COM003-2+noeq.in")
% 
%------------------------------------------------------------------------------