%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : CAT014-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 : art09.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 20.0s
% Output : Assurance 20.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/CAT/CAT014-3+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 3 7)
% (binary-unit 9 #f 3 7)
% (binary-double 9 #f 3 7)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 3 7)
% (binary-order 25 #f 3 7)
% (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(20,40,0,40,0,0,27666,4,1900,45706,5,2501,45706,1,2501,45706,50,2502,45706,40,2502,45726,0,2502)
%
%
% START OF PROOF
% 45707 [] equal(X,X).
% 45712 [] -there_exists(codomain(X)) | there_exists(X).
% 45714 [] equal(domain(X),codomain(Y)) | -there_exists(compose(X,Y)).
% 45717 [] equal(compose(X,domain(X)),X).
% 45718 [] equal(compose(codomain(X),X),X).
% 45725 [] there_exists(codomain(a)).
% 45726 [] -equal(codomain(codomain(a)),codomain(a)).
% 45731 [binary:45725,45712] there_exists(a).
% 45762 [para:45717.1.1,45714.2.1] equal(domain(X),codomain(domain(X))) | -there_exists(X).
% 45764 [para:45718.1.1,45714.2.1] equal(domain(codomain(X)),codomain(X)) | -there_exists(X).
% 45843 [binary:45731,45764.2] equal(domain(codomain(a)),codomain(a)).
% 45852 [para:45843.1.1,45762.1.2.1,demod:45843,cut:45725] equal(codomain(a),codomain(codomain(a))).
% 45857 [para:45852.1.2,45726.1.1,cut:45707] 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 7
% clause depth limited to 3
% seconds given: 9
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 405
% derived clauses: 206770
% kept clauses: 37534
% kept size sum: 904
% kept mid-nuclei: 1738
% kept new demods: 14
% forw unit-subs: 7617
% forw double-subs: 3605
% forw overdouble-subs: 35818
% backward subs: 2
% fast unit cutoff: 167
% full unit cutoff: 0
% dbl unit cutoff: 639
% real runtime : 25.6
% process. runtime: 25.6
% specific non-discr-tree subsumption statistics:
% tried: 15574543
% length fails: 1548014
% strength fails: 2007431
% predlist fails: 3018230
% aux str. fails: 726835
% by-lit fails: 1442352
% full subs tried: 5558000
% full subs fail: 5522117
%
% ; 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/CAT/CAT014-3+eq_r.in")
%
%------------------------------------------------------------------------------