%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SET012-4 : 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 : 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/SET/SET012-4+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: neq
% detected subclass: medium
% 
% strategies selected: 
% (hyper 25 #f 2 5)
% (binary-unit 9 #f 2 5)
% (binary-double 9 #f 2 5)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 2 5)
% (binary-order 25 #f 2 5)
% (binary-posweight-order 101 #f)
% (binary-posweight-lex-big-order 25 #f)
% (binary-posweight-lex-small-order 9 #f)
% (binary-order-sos 50 #t)
% (binary-unit-uniteq 25 #f)
% (binary-weightorder 50 #f)
% (binary-order 50 #f)
% (hyper-order 30 #f)
% (binary 112 #t)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(12,40,0,24,0,0)
% 
% 
% START OF PROOF
% 15 [] little_set(f1(X,Y)) | equal(X,Y).
% 16 [] member(f1(X,Y),Y) | member(f1(X,Y),X) | equal(X,Y).
% 17 [] -member(f1(X,Y),Y) | -member(f1(X,Y),X) | equal(X,Y).
% 18 [] -member(X,complement(Y)) | -member(X,Y).
% 19 [] member(X,complement(Y)) | member(X,Y) | -little_set(X).
% 22 [] equal(complement(as),bs).
% 23 [] equal(complement(bs),cs).
% 24 [] -equal(as,cs).
% 28 [hyper:24,15] little_set(f1(as,cs)).
% 31 [hyper:19,28] member(f1(as,cs),complement(X)) | member(f1(as,cs),X).
% 43 [hyper:18,16,31,demod:23,22,cut:24] member(f1(as,cs),cs).
% 47 [hyper:17,43,31,demod:22,cut:24] member(f1(as,cs),bs).
% 49 [hyper:18,47,demod:23,cut:43] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 5
% clause depth limited to 2
% seconds given: 25
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    14
%  derived clauses:   69
%  kept clauses:      12
%  kept size sum:     95
%  kept mid-nuclei:   7
%  kept new demods:   2
%  forw unit-subs:    20
%  forw double-subs: 10
%  forw overdouble-subs: 0
%  backward subs:     0
%  fast unit cutoff:  7
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.1
%  process. runtime:  0.0
% specific non-discr-tree subsumption statistics: 
%  tried:           1
%  length fails:    0
%  strength fails:  0
%  predlist fails:  1
%  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/SET/SET012-4+eq_r.in")
% 
%------------------------------------------------------------------------------