%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET199-6 : 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 : 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 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/SET199-6+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(116,40,0,232,0,0,390741,4,2111,397038,5,2802,397039,1,2804,397039,50,2811,397039,40,2811,397155,0,2811)
%
%
% START OF PROOF
% 397041 [] -member(X,Y) | -subclass(Y,Z) | member(X,Z).
% 397042 [] member(not_subclass_element(X,Y),X) | subclass(X,Y).
% 397043 [] -member(not_subclass_element(X,Y),Y) | subclass(X,Y).
% 397063 [] member(X,intersection(Y,Z)) | -member(X,Z) | -member(X,Y).
% 397153 [] subclass(z,x).
% 397154 [] subclass(z,y).
% 397155 [] -subclass(z,intersection(x,y)).
% 397168 [binary:397153,397041.2] -member(X,z) | member(X,x).
% 397169 [binary:397154,397041.2] -member(X,z) | member(X,y).
% 397178 [binary:397155,397042.2] member(not_subclass_element(z,intersection(x,y)),z).
% 397187 [binary:397155,397043.2] -member(not_subclass_element(z,intersection(x,y)),intersection(x,y)).
% 397331 [binary:397168,397178] member(not_subclass_element(z,intersection(x,y)),x).
% 397332 [binary:397169,397178] member(not_subclass_element(z,intersection(x,y)),y).
% 401426 [binary:397063,397187,cut:397332,cut:397331] 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: 1194
% derived clauses: 509431
% kept clauses: 81167
% kept size sum: 42250
% kept mid-nuclei: 8598
% kept new demods: 109
% forw unit-subs: 87672
% forw double-subs: 11133
% forw overdouble-subs: 350
% backward subs: 33
% fast unit cutoff: 213
% full unit cutoff: 50
% dbl unit cutoff: 395
% real runtime : 28.48
% process. runtime: 28.48
% specific non-discr-tree subsumption statistics:
% tried: 6374
% length fails: 19
% strength fails: 23
% predlist fails: 3704
% aux str. fails: 12
% by-lit fails: 20
% full subs tried: 2586
% full subs fail: 2241
%
% ; 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/SET199-6+eq_r.in")
%
%------------------------------------------------------------------------------