%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : GRP162-1 : 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 : art09.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/GRP/GRP162-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: ueq
% 
% strategies selected: 
% (binary-posweight-kb-big-order 60 #f 3 1)
% (binary-posweight-lex-big-order 30 #f 3 1)
% (binary 30 #t)
% (binary-posweight-kb-big-order 180 #f)
% (binary-posweight-lex-big-order 120 #f)
% (binary-posweight-firstpref-order 60 #f)
% (binary-posweight-kb-small-order 60 #f)
% (binary-posweight-lex-small-order 60 #f)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(19,40,0,38,0,0)
% 
% 
% START OF PROOF
% 24 [] equal(greatest_lower_bound(X,Y),greatest_lower_bound(Y,X)).
% 25 [] equal(least_upper_bound(X,Y),least_upper_bound(Y,X)).
% 26 [] equal(greatest_lower_bound(X,greatest_lower_bound(Y,Z)),greatest_lower_bound(greatest_lower_bound(X,Y),Z)).
% 30 [] equal(least_upper_bound(X,greatest_lower_bound(X,Y)),X).
% 31 [] equal(greatest_lower_bound(X,least_upper_bound(X,Y)),X).
% 36 [] equal(least_upper_bound(a,b),b).
% 37 [] equal(least_upper_bound(b,c),c).
% 38 [] -equal(least_upper_bound(a,c),c).
% 41 [para:25.1.1,38.1.1] -equal(least_upper_bound(c,a),c).
% 45 [para:36.1.1,31.1.1.2] equal(greatest_lower_bound(a,b),a).
% 46 [para:37.1.1,31.1.1.2] equal(greatest_lower_bound(b,c),b).
% 54 [para:45.1.1,26.1.2.1] equal(greatest_lower_bound(a,greatest_lower_bound(b,X)),greatest_lower_bound(a,X)).
% 62 [para:46.1.1,54.1.1.2,demod:45] equal(a,greatest_lower_bound(a,c)).
% 63 [para:62.1.2,24.1.1] equal(a,greatest_lower_bound(c,a)).
% 73 [para:63.1.2,30.1.1.2,cut:41] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% using first neg lit preferred strategy
% not using sos 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 1
% clause depth limited to 3
% seconds given: 60
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    25
%  derived clauses:   187
%  kept clauses:      34
%  kept size sum:     271
%  kept mid-nuclei:   0
%  kept new demods:   42
%  forw unit-subs:    134
%  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.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/GRP/GRP162-1+eq_r.in")
% 
%------------------------------------------------------------------------------