%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET105-7 : TPTP v3.4.2. Bugfixed v2.1.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art03.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 30.0s
% Output : Assurance 30.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/SET105-7+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 6 9)
% (binary-unit 28 #f 6 9)
% (binary-double 11 #f 6 9)
% (binary-double 17 #f)
% (binary-double 17 #t)
% (binary 87 #t 6 9)
% (binary-order 28 #f 6 9)
% (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,395613,4,2104,515056,5,2802,515056,1,2802,515056,50,2808,515056,40,2808,515207,0,2808)
%
%
% START OF PROOF
% 515058 [] -member(X,Y) | -subclass(Y,Z) | member(X,Z).
% 515061 [] subclass(X,universal_class).
% 515064 [] -subclass(Y,X) | -subclass(X,Y) | equal(X,Y).
% 515065 [] -member(X,unordered_pair(Y,Z)) | equal(X,Y) | equal(X,Z).
% 515067 [] member(X,unordered_pair(Y,X)) | -member(X,universal_class).
% 515068 [] member(unordered_pair(X,Y),universal_class).
% 515069 [] equal(unordered_pair(X,X),singleton(X)).
% 515070 [] equal(unordered_pair(singleton(X),unordered_pair(X,singleton(Y))),ordered_pair(X,Y)).
% 515161 [] subclass(null_class,X).
% 515167 [] subclass(singleton(X),unordered_pair(Y,X)).
% 515168 [] equal(unordered_pair(X,Y),singleton(X)) | member(Y,universal_class).
% 515169 [] equal(unordered_pair(X,Y),singleton(Y)) | member(X,universal_class).
% 515170 [] equal(unordered_pair(X,Y),null_class) | member(X,universal_class) | member(Y,universal_class).
% 515205 [] -equal(unordered_pair(null_class,singleton(null_class)),ordered_pair(x,y)).
% 515206 [] -member(x,universal_class).
% 515207 [] -member(y,universal_class).
% 515221 [binary:515206,515058.3,cut:515061] -member(x,X).
% 515222 [binary:515207,515058.3,cut:515061] -member(y,X).
% 515260 [binary:515205,515065.2] -member(unordered_pair(null_class,singleton(null_class)),unordered_pair(ordered_pair(x,y),X)) | equal(unordered_pair(null_class,singleton(null_class)),X).
% 515281 [binary:515068,515067.2] member(unordered_pair(X,Y),unordered_pair(Z,unordered_pair(X,Y))).
% 515302 [para:515260.2.1,515205.1.1] -member(unordered_pair(null_class,singleton(null_class)),unordered_pair(ordered_pair(x,y),X)) | -equal(X,ordered_pair(x,y)).
% 518218 [binary:515221,515168.2] equal(unordered_pair(X,x),singleton(X)).
% 518219 [binary:515222,515168.2] equal(unordered_pair(X,y),singleton(X)).
% 518314 [binary:515221,515169.2] equal(unordered_pair(x,X),singleton(X)).
% 518315 [binary:515222,515169.2] equal(unordered_pair(y,X),singleton(X)).
% 518354 [para:518218.1.1,515167.1.2] subclass(singleton(x),singleton(X)).
% 518358 [para:515069.1.2,518354.1.2] subclass(singleton(x),unordered_pair(X,X)).
% 518579 [para:518314.1.1,518219.1.1] equal(singleton(y),singleton(x)).
% 518581 [para:518579.1.2,515070.1.1.1,demod:518314] equal(unordered_pair(singleton(y),singleton(singleton(X))),ordered_pair(x,X)).
% 518751 [para:518315.1.1,515070.1.1.2,demod:518581] equal(ordered_pair(x,X),ordered_pair(y,X)).
% 518759 [para:515170.1.1,518358.1.2,demod:518579,slowcut:515222] subclass(singleton(y),null_class).
% 518774 [binary:515064,518759,cut:515161] equal(null_class,singleton(y)).
% 528603 [binary:515070,515302.2,demod:518314,518774,518579,518751,cut:515281] 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 9
% clause depth limited to 6
% seconds given: 28
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 1649
% derived clauses: 732884
% kept clauses: 90271
% kept size sum: 151687
% kept mid-nuclei: 131650
% kept new demods: 744
% forw unit-subs: 169031
% forw double-subs: 20147
% forw overdouble-subs: 6412
% backward subs: 16
% fast unit cutoff: 2007
% full unit cutoff: 144
% dbl unit cutoff: 163
% real runtime : 29.95
% process. runtime: 29.95
% specific non-discr-tree subsumption statistics:
% tried: 293924
% length fails: 51669
% strength fails: 10505
% predlist fails: 105670
% aux str. fails: 23732
% by-lit fails: 5853
% full subs tried: 75716
% full subs fail: 69511
%
% ; 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/SET105-7+eq_r.in")
%
%------------------------------------------------------------------------------