%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET104-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 : art04.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/SET104-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(150,40,2,300,0,2)
%
%
% START OF PROOF
% 164 [] equal(unordered_pair(singleton(X),unordered_pair(X,singleton(Y))),ordered_pair(X,Y)).
% 259 [] equal(unordered_pair(X,Y),unordered_pair(Y,X)).
% 262 [] equal(unordered_pair(X,Y),singleton(X)) | member(Y,universal_class).
% 277 [] equal(singleton(X),null_class) | member(X,universal_class).
% 299 [] -equal(unordered_pair(null_class,singleton(singleton(y))),ordered_pair(x,y)).
% 300 [] -member(x,universal_class).
% 42843 [hyper:300,277] equal(singleton(x),null_class).
% 67292 [hyper:300,262] equal(unordered_pair(X,x),singleton(X)).
% 67829 [para:67292.1.1,259.1.1] equal(singleton(X),unordered_pair(x,X)).
% 68371 [para:67829.1.2,164.1.1.2,demod:42843,slowcut:299] 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: 437
% derived clauses: 171424
% kept clauses: 61977
% kept size sum: 0
% kept mid-nuclei: 5926
% kept new demods: 497
% forw unit-subs: 90966
% forw double-subs: 10038
% forw overdouble-subs: 1853
% backward subs: 3
% fast unit cutoff: 537
% full unit cutoff: 43
% dbl unit cutoff: 4
% real runtime : 5.9
% process. runtime: 5.9
% specific non-discr-tree subsumption statistics:
% tried: 25319
% length fails: 3729
% strength fails: 2023
% predlist fails: 2764
% aux str. fails: 3432
% by-lit fails: 261
% full subs tried: 9893
% full subs fail: 8057
%
% ; 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/SET104-7+eq_r.in")
%
%------------------------------------------------------------------------------