%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET252-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 : art06.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 40.0s
% Output : Assurance 40.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/SET252-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(114,40,0,228,0,0,376292,4,2114,377093,5,2803,377093,1,2803,377093,50,2809,377093,40,2809,377207,0,2809)
%
%
% START OF PROOF
% 377096 [] member(not_subclass_element(X,Y),X) | subclass(X,Y).
% 377097 [] -member(not_subclass_element(X,Y),Y) | subclass(X,Y).
% 377115 [] -member(X,intersection(Y,Z)) | member(X,Y).
% 377122 [] equal(intersection(X,cross_product(Y,Z)),restrict(X,Y,Z)).
% 377207 [] -subclass(restrict(x,y,z),x).
% 377230 [binary:377207,377096.2] member(not_subclass_element(restrict(x,y,z),x),restrict(x,y,z)).
% 377238 [binary:377207,377097.2] -member(not_subclass_element(restrict(x,y,z),x),x).
% 377467 [binary:377238,377115.2] -member(not_subclass_element(restrict(x,y,z),x),intersection(x,X)).
% 397231 [para:377122.1.1,377467.1.2,slowcut:377230] 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: 1956
% derived clauses: 534439
% kept clauses: 96780
% kept size sum: 213920
% kept mid-nuclei: 8487
% kept new demods: 123
% forw unit-subs: 96547
% forw double-subs: 11678
% forw overdouble-subs: 373
% backward subs: 35
% fast unit cutoff: 266
% full unit cutoff: 0
% dbl unit cutoff: 47
% real runtime : 40.11
% process. runtime: 40.11
% specific non-discr-tree subsumption statistics:
% tried: 19091
% length fails: 1063
% strength fails: 24
% predlist fails: 12570
% aux str. fails: 127
% by-lit fails: 2
% full subs tried: 5265
% full subs fail: 4897
%
% ; 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/SET252-6+eq_r.in")
%
%------------------------------------------------------------------------------