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

% Computer : art03.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/SYN089-1.002+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 1 5)
% (binary-unit 30 #f 1 5)
% (binary-posweight-order 90 #f 1 5)
% (binary-double 30 #f)
% (binary 48 #t 1 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 *********
% 
% **** EMPTY CLAUSE DERIVED ****
% By given clause simplification.
% 
% 
% timer checkpoints: c(13,40,0,26,0,1,26,50,1,39,0,1,39,50,1,52,0,1,52,50,1,65,0,1,65,50,1,78,0,1,78,50,1,91,0,1,91,50,1,104,0,1,104,50,1,117,0,1,117,50,1,130,0,1,130,50,1,143,0,1,143,50,1,156,0,1,156,50,1,169,0,1,169,50,1,182,0,1,182,50,1,195,0,1,195,50,1,208,0,1,208,50,1,221,0,1,221,50,1,234,0,1,234,50,1,247,0,1,247,50,1,260,0,1,260,50,1,273,0,1,273,50,1,286,0,1,286,50,1,286,40,1,299,0,1)
% 
% 
% START OF PROOF
% 287 [] -p_1_1(0) | -p_2_2(0) | p_1_2(0).
% 295 [] p_1_1(0).
% 297 [] p_2_2(0).
% 299 [] -p_1_2(0).
% 300 [input:287,cut:295,cut:297,cut:299] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% not using sos strategy
% using unit strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% clause length limited to 5
% clause depth limited to 1
% seconds given: 30
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    27
%  derived clauses:   1
%  kept clauses:      0
%  kept size sum:     0
%  kept mid-nuclei:   0
%  kept new demods:   0
%  forw unit-subs:    0
%  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:  0.1
%  process. runtime:  0.1
% 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/SYN/SYN089-1.002+noeq.in")
% 
%------------------------------------------------------------------------------