%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : NUM051-1 : 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 : art10.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 188.4s
% Output : Assurance 188.4s
% 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/NUM/NUM051-1+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(160,40,1,320,0,1,206553,4,2187,224504,5,2803,224505,1,2806,224505,50,2812,224505,40,2812,224665,0,2812,252196,3,4213,256659,4,4915,272935,5,5613,272936,5,5614,272937,1,5614,272937,50,5617,272937,40,5617,273097,0,5618,300776,3,6169,304270,4,6444,312996,5,6719,312996,1,6719,312996,50,6721,312996,40,6721,313156,0,6722,340721,3,7573,344409,4,7999,354167,5,8423,354169,5,8423,354170,1,8423,354170,50,8426,354170,40,8426,354330,0,8426,384699,3,9277,392162,4,9702,397857,5,10128,397858,5,10128,397859,1,10128,397859,50,10129,397859,40,10129,398019,0,10129,504164,3,14480,505474,4,16655,507345,5,18831,507346,1,18831,507346,50,18834,507346,40,18834,507506,0,18834)
%
%
% START OF PROOF
% 507348 [] -member(X,Y) | -subclass(Y,Z) | member(X,Z).
% 507349 [] member(not_subclass_element(X,Y),X) | subclass(X,Y).
% 507350 [] -member(not_subclass_element(X,Y),Y) | subclass(X,Y).
% 507353 [] -equal(X,Y) | subclass(Y,X).
% 507361 [] -member(ordered_pair(X,Y),cross_product(Z,U)) | member(X,Z).
% 507364 [] equal(ordered_pair(first(X),second(X)),X) | -member(X,cross_product(Y,Z)).
% 507368 [] -member(X,intersection(Y,Z)) | member(X,Y).
% 507371 [] -member(X,complement(Y)) | -member(X,Y).
% 507414 [] equal(intersection(X,regular(X)),null_class) | equal(X,null_class).
% 507464 [] -subclass(cross_product(X,X),union(identity_relation,symmetrization_of(Y))) | connected(Y,X).
% 507506 [] -connected(x,null_class).
% 507699 [para:507364.1.1,507361.1.1,factor] -member(X,cross_product(Y,Z)) | member(first(X),Y).
% 507776 [binary:507349,507368] member(not_subclass_element(intersection(X,Y),Z),X) | subclass(intersection(X,Y),Z).
% 507951 [binary:507348.3,507371,factor] -subclass(X,complement(X)) | -member(Y,X).
% 531317 [binary:507350,507776] subclass(intersection(X,Y),X).
% 531407 [para:507414.1.1,531317.1.1,binarycut:507353] subclass(null_class,X).
% 531463 [binary:507951,531407] -member(X,null_class).
% 531489 [binary:507699.2,531463] -member(X,cross_product(null_class,Y)).
% 533099 [binary:507349,531489] subclass(cross_product(null_class,X),Y).
% 538828 [binary:507464,533099,slowcut:507506] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using term-depth-order strategy
% not using sos 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: 14151
% derived clauses: 1015427
% kept clauses: 305350
% kept size sum: 346132
% kept mid-nuclei: 57687
% kept new demods: 484
% forw unit-subs: 260203
% forw double-subs: 145627
% forw overdouble-subs: 68743
% backward subs: 1585
% fast unit cutoff: 12096
% full unit cutoff: 1810
% dbl unit cutoff: 1118
% real runtime : 197.64
% process. runtime: 195.93
% specific non-discr-tree subsumption statistics:
% tried: 8729738
% length fails: 573244
% strength fails: 1844767
% predlist fails: 4027453
% aux str. fails: 263246
% by-lit fails: 946989
% full subs tried: 577965
% full subs fail: 519486
%
% ; 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/NUM/NUM051-1+eq_r.in")
%
%------------------------------------------------------------------------------