%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : CAT002-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 : art07.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 19.6s
% Output : Assurance 19.6s
% 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/CAT002-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(24,40,0,48,0,0,35955,4,1903)
%
%
% START OF PROOF
% 25 [] equal(X,X).
% 34 [] equal(compose(X,compose(Y,Z)),compose(compose(X,Y),Z)).
% 41 [] equal(Y,f1(X,Y)) | equal(X,f1(X,Y)) | equal(X,Y).
% 44 [] -equal(compose(a,Z),Y) | -equal(compose(a,X),Y) | equal(X,Z).
% 45 [] -equal(compose(b,Z),Y) | -equal(compose(b,X),Y) | equal(X,Z).
% 47 [] equal(compose(a,compose(b,h)),compose(a,compose(b,g))).
% 48 [] -equal(g,h).
% 265 [hyper:44,34,47,demod:34] equal(compose(b,h),compose(b,g)).
% 326 [hyper:45,41,25] equal(compose(b,Y),f1(compose(b,Y),compose(b,X))) | equal(compose(b,X),f1(compose(b,Y),compose(b,X))) | equal(X,Y).
% 7259 [hyper:48,326,demod:265] equal(compose(b,h),f1(compose(b,h),compose(b,h))).
% 42362 [binary:45.3,48,demod:265,slowcut:7259] 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: 486
% derived clauses: 226371
% kept clauses: 31137
% kept size sum: 917164
% kept mid-nuclei: 2584
% kept new demods: 20
% forw unit-subs: 14205
% forw double-subs: 6978
% forw overdouble-subs: 36974
% backward subs: 54
% fast unit cutoff: 356
% full unit cutoff: 0
% dbl unit cutoff: 472
% real runtime : 20.10
% process. runtime: 19.68
% specific non-discr-tree subsumption statistics:
% tried: 11020420
% length fails: 626593
% strength fails: 2187424
% predlist fails: 1372585
% aux str. fails: 437736
% by-lit fails: 1376720
% full subs tried: 3951347
% full subs fail: 3913907
%
% ; 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/CAT002-3+eq_r.in")
%
%------------------------------------------------------------------------------