%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET055-6 : TPTP v3.4.2. Released v1.0.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art01.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/SET055-6+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: nne
% detected subclass: big
%
% strategies selected:
% (hyper 30 #f 6 9)
% (binary-unit 30 #f 6 9)
% (binary-double 18 #f 6 9)
% (binary 90 #t 6 9)
% (binary-order 30 #f 6 9)
% (binary-posweight-order 54 #f)
% (binary-order-sos 30 #t)
% (binary-unit-uniteq 30 #f)
% (binary-weightorder 30 #f)
% (binary-weightorder-sos 30 #f)
% (binary-order 30 #f)
% (hyper-order 30 #f)
% (binary 168 #t)
%
%
% **** EMPTY CLAUSE DERIVED ****
%
%
% timer checkpoints: c(159,40,0,318,0,1)
%
%
% START OF PROOF
% 227 [] -subclass(X,Y) | -member(Z,X) | member(Z,Y).
% 228 [] member(not_subclass_element(X,Y),X) | subclass(X,Y).
% 229 [] -member(not_subclass_element(X,Y),Y) | subclass(X,Y).
% 233 [] -subclass(X,Y) | -subclass(Y,X) | equalish(Y,X).
% 318 [] -equalish(x,x).
% 13895 [hyper:227,228,228,factor:binarycut:229] subclass(X,X).
% 14211 [hyper:233,13895,cut:13895,slowcut:318] 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 9
% clause depth limited to 6
% seconds given: 30
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 341
% derived clauses: 24258
% kept clauses: 12515
% kept size sum: 136031
% kept mid-nuclei: 1294
% kept new demods: 0
% forw unit-subs: 6516
% forw double-subs: 1045
% forw overdouble-subs: 6
% backward subs: 2
% fast unit cutoff: 12
% full unit cutoff: 0
% dbl unit cutoff: 1
% real runtime : 0.67
% process. runtime: 0.66
% specific non-discr-tree subsumption statistics:
% tried: 15
% length fails: 0
% strength fails: 2
% predlist fails: 4
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 9
% full subs fail: 3
%
% ; 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/SET055-6+noeq.in")
%
%------------------------------------------------------------------------------