%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET082-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 : 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/SET082-6+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: neq
% detected subclass: medium
%
% strategies selected:
% (hyper 25 #f 6 9)
% (binary-unit 9 #f 6 9)
% (binary-double 9 #f 6 9)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 6 9)
% (binary-order 25 #f 6 9)
% (binary-posweight-order 101 #f)
% (binary-posweight-lex-big-order 25 #f)
% (binary-posweight-lex-small-order 9 #f)
% (binary-order-sos 50 #t)
% (binary-unit-uniteq 25 #f)
% (binary-weightorder 50 #f)
% (binary-order 50 #f)
% (hyper-order 30 #f)
% (binary 112 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(94,40,0,188,0,1)
%
%
% START OF PROOF
% 96 [] -member(X,Y) | -subclass(Y,Z) | member(X,Z).
% 99 [] subclass(X,universal_class).
% 101 [] -equal(X,Y) | subclass(Y,X).
% 103 [] -member(X,unordered_pair(Y,Z)) | equal(X,Y) | equal(X,Z).
% 107 [] equal(unordered_pair(X,X),singleton(X)).
% 161 [] member(regular(X),X) | equal(X,null_class).
% 187 [] -member(x,universal_class).
% 188 [] -equal(singleton(x),null_class).
% 1600 [hyper:101,107] subclass(singleton(X),unordered_pair(X,X)).
% 10581 [hyper:188,161] member(regular(singleton(x)),singleton(x)).
% 10817 [hyper:96,10581,1600] member(regular(singleton(x)),unordered_pair(x,x)).
% 76598 [hyper:103,10817] equal(regular(singleton(x)),x).
% 77126 [hyper:96,10817,99,demod:76598,cut:187] 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: 25
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 372
% derived clauses: 156058
% kept clauses: 72763
% kept size sum: 0
% kept mid-nuclei: 4101
% kept new demods: 67
% forw unit-subs: 69038
% forw double-subs: 9588
% forw overdouble-subs: 378
% backward subs: 1
% fast unit cutoff: 33
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 5.15
% process. runtime: 5.13
% specific non-discr-tree subsumption statistics:
% tried: 1066
% length fails: 7
% strength fails: 19
% predlist fails: 402
% aux str. fails: 13
% by-lit fails: 4
% full subs tried: 615
% full subs fail: 242
%
% ; 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/SET082-6+eq_r.in")
%
%------------------------------------------------------------------------------