%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SYN095-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/SYN095-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 *********
% 
% 
% timer checkpoints: c(13,40,0,26,0,0,26,50,0,39,0,0,39,50,0,52,0,0,52,50,0,65,0,0,65,50,0,78,0,0,78,50,0,91,0,0,91,50,0,104,0,0,104,50,0,117,0,0,117,50,0,130,0,0,130,50,0,143,0,0,143,50,0,156,0,0,156,50,0,169,0,0,169,50,0,182,0,0,182,50,0,195,0,0,195,50,0,208,0,0,208,50,0,221,0,0,221,50,0,234,0,0,234,50,0,247,0,0,247,50,0,260,0,0,260,50,0,273,0,0,273,50,0,286,0,0,286,50,0,286,40,0,299,0,0)
% 
% 
% START OF PROOF
% 287 [?] ?
% 295 [] p_1_1(a).
% 297 [] p_2_2(a).
% 299 [] -p_1_2(X).
% 300 [input:287,cut:299] -p_1_1(X) | -p_2_2(X).
% 301 [binary:295,300,cut:297] 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:   2
%  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:  2
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime:  0.2
%  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/SYN/SYN095-1.002+noeq.in")
% 
%------------------------------------------------------------------------------