%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : CAT016-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 : 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 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/CAT016-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,2,40,0,2,27803,4,1914)
%
%
% START OF PROOF
% 27 [] -there_exists(compose(X,Y)) | there_exists(domain(X)).
% 31 [] equal(compose(X,domain(X)),X).
% 39 [] there_exists(a).
% 40 [] -there_exists(domain(a)).
% 30646 [binary:27.2,40] -there_exists(compose(a,X)).
% 33950 [para:31.1.1,30646.1.1,cut:39] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 7
% clause depth limited to 3
% seconds given: 25
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 410
% derived clauses: 179645
% kept clauses: 25722
% kept size sum: 783941
% kept mid-nuclei: 1804
% kept new demods: 6
% forw unit-subs: 10530
% forw double-subs: 4828
% forw overdouble-subs: 31782
% backward subs: 127
% fast unit cutoff: 644
% full unit cutoff: 0
% dbl unit cutoff: 624
% real runtime : 20.48
% process. runtime: 20.47
% specific non-discr-tree subsumption statistics:
% tried: 10485855
% length fails: 883257
% strength fails: 1709089
% predlist fails: 775518
% aux str. fails: 620739
% by-lit fails: 913005
% full subs tried: 4428372
% full subs fail: 4396510
%
% ; 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/CAT016-3+eq_r.in")
%
%------------------------------------------------------------------------------