%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SYN071-1 : 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/SYN/SYN071-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: peq
% 
% strategies selected: 
% (hyper 30 #f 1 3)
% (binary-unit 12 #f)
% (binary-unit-uniteq 12 #f)
% (binary-posweight-kb-big-order 60 #f 1 3)
% (binary-posweight-lex-big-order 30 #f 1 3)
% (binary 30 #t)
% (binary-posweight-kb-big-order 156 #f)
% (binary-posweight-lex-big-order 102 #f)
% (binary-posweight-firstpref-order 60 #f)
% (binary-order 30 #f)
% (binary-posweight-kb-small-order 48 #f)
% (binary-posweight-lex-small-order 30 #f)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(5,40,0,10,0,0,12,50,0,17,0,0,19,50,0,24,0,0,26,50,0,31,0,0,33,50,0,38,0,0,40,50,0,45,0,0,47,50,0,52,0,0,54,50,0,59,0,0,61,50,0,66,0,0,68,50,0,73,0,0,75,50,0,80,0,0,82,50,0,87,0,0,89,50,0,94,0,0,96,50,0,101,0,0,103,50,0,108,0,0,110,50,0,115,0,0,117,50,0,122,0,0,124,50,0,129,0,0,131,50,0,136,0,0,138,50,0,143,0,0,145,50,0,150,0,0,152,50,0,152,40,0,157,0,0)
% 
% 
% START OF PROOF
% 153 [] equal(X,X).
% 154 [] equal(a,b) | equal(c,d).
% 155 [] equal(a,c) | equal(b,d).
% 156 [] -equal(a,d).
% 157 [] -equal(b,c).
% 159 [para:154.2.2,156.1.2] -equal(a,c) | equal(a,b).
% 165 [para:159.2.2,157.1.1] -equal(a,c).
% 166 [para:155.1.2,165.1.2,cut:153] equal(b,d).
% 167 [para:166.1.2,156.1.2] -equal(a,b).
% 169 [para:154.2.2,166.1.2,cut:157,cut:167] 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
% seconds given: 12
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    113
%  derived clauses:   55
%  kept clauses:      8
%  kept size sum:     36
%  kept mid-nuclei:   0
%  kept new demods:   2
%  forw unit-subs:    1
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     3
%  fast unit cutoff:  3
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime:  0.1
%  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/SYN071-1+eq_r.in")
% 
%------------------------------------------------------------------------------