%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : CAT002-1 : 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 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/CAT/CAT002-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: heq
% detected subclass: medium
% detected subclass: long
%
% strategies selected:
% (hyper 58 #f 2 7)
% (binary-posweight-order 29 #f 2 7)
% (binary-unit 29 #f 2 7)
% (binary-double 29 #f 2 7)
% (binary 29 #t 2 7)
% (hyper 29 #t)
% (hyper 105 #f)
% (binary-unit-uniteq 17 #f)
% (binary-weightorder 23 #f)
% (binary-posweight-order 70 #f)
% (binary-posweight-lex-big-order 29 #f)
% (binary-posweight-lex-small-order 11 #f)
% (binary-order 29 #f)
% (binary-unit 46 #f)
% (binary 67 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(25,40,0,50,0,0)
%
%
% START OF PROOF
% 27 [] product(X,Y,compose(X,Y)) | -defined(X,Y).
% 28 [] -product(X,Y,Z) | defined(X,Y).
% 29 [] -product(X,Y,Z) | -defined(Z,U) | defined(Y,U).
% 31 [] -product(U,Y,V) | -product(W,U,X) | -product(X,Y,Z) | product(W,V,Z).
% 44 [] -product(X,Y,U) | -product(X,Y,Z) | equal(Z,U).
% 45 [] -product(a,Z,Y) | -product(a,X,Y) | equal(X,Z).
% 46 [] -product(b,Z,Y) | -product(b,X,Y) | equal(X,Z).
% 47 [] product(a,b,c).
% 48 [] product(c,h,d).
% 49 [] product(c,g,d).
% 50 [] -equal(h,g).
% 75 [hyper:28,47] defined(a,b).
% 98 [hyper:27,75] product(a,b,compose(a,b)).
% 115 [hyper:28,48] defined(c,h).
% 140 [hyper:29,115,47] defined(b,h).
% 150 [hyper:27,140] product(b,h,compose(b,h)).
% 184 [hyper:28,49] defined(c,g).
% 209 [hyper:29,184,47] defined(b,g).
% 219 [hyper:27,209] product(b,g,compose(b,g)).
% 259 [hyper:44,98,47] equal(c,compose(a,b)).
% 1454 [hyper:31,150,98,48,demod:259] product(a,compose(b,h),d).
% 1676 [hyper:31,219,98,49,demod:259] product(a,compose(b,g),d).
% 3041 [hyper:45,1676,1454] equal(compose(b,h),compose(b,g)).
% 6400 [para:3041.1.1,150.1.3] product(b,h,compose(b,g)).
% 6404 [hyper:46,6400,219,cut:50] 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 7
% clause depth limited to 2
% seconds given: 58
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 215
% derived clauses: 22145
% kept clauses: 196
% kept size sum: 1145
% kept mid-nuclei: 6143
% kept new demods: 13
% forw unit-subs: 5530
% forw double-subs: 387
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 270
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.26
% process. runtime: 0.26
% specific non-discr-tree subsumption statistics:
% tried: 3230
% length fails: 4
% strength fails: 136
% predlist fails: 2100
% aux str. fails: 804
% by-lit fails: 0
% full subs tried: 186
% full subs fail: 186
%
% ; 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-1+eq_r.in")
%
%------------------------------------------------------------------------------