%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET022-3 : 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 : 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 30.0s
% Output : Assurance 30.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/SET022-3+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 4 15)
% (binary-unit 28 #f 4 15)
% (binary-double 11 #f 4 15)
% (binary-double 17 #f)
% (binary-double 17 #t)
% (binary 87 #t 4 15)
% (binary-order 28 #f 4 15)
% (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,1,300,0,1,506520,4,2800,506520,5,2807,506521,1,2807,506521,50,2809,506521,40,2809,506671,0,2809)
%
%
% START OF PROOF
% 506533 [] little_set(f2(X)) | -ordered_pair_predicate(X).
% 506534 [] little_set(f3(X)) | -ordered_pair_predicate(X).
% 506535 [] equal(X,ordered_pair(f2(X),f3(X))) | -ordered_pair_predicate(X).
% 506668 [] equal(first(ordered_pair(X,Y)),X) | -little_set(Y) | -little_set(X).
% 506670 [] ordered_pair_predicate(a).
% 506671 [] -little_set(first(a)).
% 506857 [binary:506670,506533.2] little_set(f2(a)).
% 506859 [binary:506670,506534.2] little_set(f3(a)).
% 506987 [binary:506670,506535.2] equal(a,ordered_pair(f2(a),f3(a))).
% 528271 [para:506987.1.2,506668.1.1.1,cut:506859,cut:506857] equal(first(a),f2(a)).
% 528869 [para:528271.1.1,506671.1.1,cut:506857] 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 15
% clause depth limited to 4
% seconds given: 28
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 1557
% derived clauses: 1525645
% kept clauses: 96830
% kept size sum: 373938
% kept mid-nuclei: 59482
% kept new demods: 483
% forw unit-subs: 16526
% forw double-subs: 8914
% forw overdouble-subs: 27102
% backward subs: 27
% fast unit cutoff: 2542
% full unit cutoff: 49
% dbl unit cutoff: 0
% real runtime : 32.78
% process. runtime: 32.77
% specific non-discr-tree subsumption statistics:
% tried: 1668666
% length fails: 24395
% strength fails: 239080
% predlist fails: 417972
% aux str. fails: 53724
% by-lit fails: 48905
% full subs tried: 864201
% full subs fail: 836525
%
% ; 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/SET022-3+eq_r.in")
%
%------------------------------------------------------------------------------