%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SET023-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 : art01.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/SET023-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(151,40,1,302,0,1,343270,4,2102)
% 
% 
% START OF PROOF
% 163 [] little_set(f2(X)) | -ordered_pair_predicate(X).
% 164 [] little_set(f3(X)) | -ordered_pair_predicate(X).
% 165 [] equal(X,ordered_pair(f2(X),f3(X))) | -ordered_pair_predicate(X).
% 299 [] equal(second(ordered_pair(X,Y)),Y) | -little_set(Y) | -little_set(X).
% 301 [] ordered_pair_predicate(a).
% 302 [] -little_set(second(a)).
% 303 [hyper:163,301] little_set(f2(a)).
% 304 [hyper:164,301] little_set(f3(a)).
% 305 [hyper:165,301] equal(a,ordered_pair(f2(a),f3(a))).
% 543 [hyper:299,304,303,demod:305] equal(second(a),f3(a)).
% 360433 [para:543.1.1,302.1.1,cut:304] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% not using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 15
% clause depth limited to 4
% seconds given: 28
% 
% 
% old unit clauses discarded
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    119
%  derived clauses:   784652
%  kept clauses:      75035
%  kept size sum:     0
%  kept mid-nuclei:   48408
%  kept new demods:   380
%  forw unit-subs:    8165
%  forw double-subs: 14007
%  forw overdouble-subs: 36045
%  backward subs:     0
%  fast unit cutoff:  890
%  full unit cutoff:  1010
%  dbl  unit cutoff:  5
%  real runtime  :  21.73
%  process. runtime:  21.73
% specific non-discr-tree subsumption statistics: 
%  tried:           1463354
%  length fails:    8527
%  strength fails:  118490
%  predlist fails:  336411
%  aux str. fails:  56614
%  by-lit fails:    51541
%  full subs tried: 868401
%  full subs fail:  833890
% 
% ; 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/SET023-3+eq_r.in")
% 
%------------------------------------------------------------------------------