%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET072-7 : 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 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/SET072-7+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(118,40,1,236,0,1)
%
%
% START OF PROOF
% 124 [] -equal(X,Y) | subclass(X,Y).
% 125 [] -equal(X,Y) | subclass(Y,X).
% 126 [] -subclass(Y,X) | -subclass(X,Y) | equal(X,Y).
% 127 [] -member(X,unordered_pair(Y,Z)) | equal(X,Y) | equal(X,Z).
% 128 [] member(X,unordered_pair(X,Y)) | -member(X,universal_class).
% 133 [] -member(ordered_pair(X,Y),cross_product(Z,U)) | member(X,Z).
% 134 [] -member(ordered_pair(X,Y),cross_product(Z,U)) | member(Y,U).
% 216 [] -subclass(Y,Z) | -subclass(X,Y) | subclass(X,Z).
% 234 [] equal(unordered_pair(x,z),unordered_pair(y,z)).
% 235 [] member(ordered_pair(x,y),cross_product(universal_class,universal_class)).
% 236 [] -equal(x,y).
% 259 [hyper:133,235] member(x,universal_class).
% 260 [hyper:134,235] member(y,universal_class).
% 341 [hyper:128,259] member(x,unordered_pair(x,X)).
% 368 [hyper:128,260] member(y,unordered_pair(y,X)).
% 1230 [para:234.1.2,368.1.2] member(y,unordered_pair(x,z)).
% 3879 [hyper:127,1230] equal(y,x) | equal(y,z).
% 6439 [hyper:124,3879] subclass(y,x) | equal(y,z).
% 6441 [hyper:125,3879] subclass(x,y) | equal(y,z).
% 20430 [hyper:124,6439] subclass(y,x) | subclass(y,z).
% 24730 [hyper:126,20430,6441,cut:236,binarycut:124] subclass(y,z).
% 24775 [hyper:126,6439,binarycut:6441,cut:236] equal(y,z).
% 24776 [hyper:125,24775] subclass(z,y).
% 24777 [para:24775.1.1,234.1.2.1] equal(unordered_pair(x,z),unordered_pair(z,z)).
% 159917 [para:24777.1.1,341.1.2] member(x,unordered_pair(z,z)).
% 161334 [hyper:127,159917] equal(x,z).
% 162763 [hyper:124,161334] subclass(x,z).
% 162764 [hyper:125,161334] subclass(z,x).
% 162811 [hyper:216,162763,24776] subclass(x,y).
% 162844 [hyper:216,162764,24730] subclass(y,x).
% 162903 [hyper:126,162811,cut:162844] equal(x,y).
% 164712 [hyper:236,162903] 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: 28
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 479
% derived clauses: 253555
% kept clauses: 77040
% kept size sum: 0
% kept mid-nuclei: 5434
% kept new demods: 71
% forw unit-subs: 82468
% forw double-subs: 6367
% forw overdouble-subs: 197
% backward subs: 18
% fast unit cutoff: 191
% full unit cutoff: 9
% dbl unit cutoff: 4
% real runtime : 8.68
% process. runtime: 8.67
% specific non-discr-tree subsumption statistics:
% tried: 2462
% length fails: 74
% strength fails: 18
% predlist fails: 340
% aux str. fails: 8
% by-lit fails: 3
% full subs tried: 2016
% full subs fail: 1822
%
% ; 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/SET072-7+eq_r.in")
%
%------------------------------------------------------------------------------