%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SET041-3 : 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 : art06.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 20.0s
% Output   : Assurance 20.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/SET/SET041-3+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: neq
% detected subclass: big
% 
% strategies selected: 
% (hyper 28 #f 4 15)
% (binary-unit 28 #f 4 15)
% (binary-double 11 #f 4 15)
% (binary-double 17 #f)
% (binary-double 17 #t)
% (binary 87 #t 4 15)
% (binary-order 28 #f 4 15)
% (binary-posweight-order 58 #f)
% (binary-posweight-lex-big-order 28 #f)
% (binary-posweight-lex-small-order 11 #f)
% (binary-order-sos 28 #t)
% (binary-unit-uniteq 28 #f)
% (binary-weightorder 28 #f)
% (binary-weightorder-sos 17 #f)
% (binary-order 28 #f)
% (hyper-order 17 #f)
% (binary 141 #t)
% 
% 
% **** EMPTY CLAUSE DERIVED ****
% 
% 
% timer checkpoints: c(170,40,1,340,0,1,530879,4,2249,801892,5,2802,801893,1,2802,801893,50,2805,801893,40,2805,802063,0,2805)
% 
% 
% START OF PROOF
% 802039 [] -subset(Y,X) | -subset(X,Y) | equal(X,Y).
% 802059 [] subset(apply(X,apply(Y,Z)),apply(compose(X,Y),Z)) | -member(Z,domain_of(Y)) | -function(Y).
% 802060 [] subset(apply(compose(X,Y),Z),apply(X,apply(Y,Z))) | -function(Y).
% 802061 [] function(a_function).
% 802062 [] member(a,domain_of(a_function)).
% 802063 [] -equal(apply(another_function,apply(a_function,a)),apply(compose(another_function,a_function),a)).
% 809055 [binary:802063,802039.3,binarydemod:802060,cut:802061] -subset(apply(another_function,apply(a_function,a)),apply(compose(another_function,a_function),a)).
% 809814 [binary:802062,802059.2,cut:802061,slowcut:809055] 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 15
% clause depth limited to 4
% seconds given: 28
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    808
%  derived clauses:   1172006
%  kept clauses:      82723
%  kept size sum:     103854
%  kept mid-nuclei:   61375
%  kept new demods:   532
%  forw unit-subs:    9612
%  forw double-subs: 9814
%  forw overdouble-subs: 16690
%  backward subs:     3
%  fast unit cutoff:  469
%  full unit cutoff:  2271
%  dbl  unit cutoff:  12
%  real runtime  :  28.82
%  process. runtime:  28.81
% specific non-discr-tree subsumption statistics: 
%  tried:           1367019
%  length fails:    5375
%  strength fails:  67315
%  predlist fails:  483249
%  aux str. fails:  19666
%  by-lit fails:    37473
%  full subs tried: 744177
%  full subs fail:  727332
% 
% ; 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/SET/SET041-3+eq_r.in")
% 
%------------------------------------------------------------------------------