TSTP Solution File: CAT008-1 by Gandalf---c-2.6

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : CAT008-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 : art10.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 50.0s
% Output   : Assurance 50.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/CAT008-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(21,40,0,42,0,0,689,50,3,710,0,3,37563,50,237,37584,0,237,140446,50,1157,140467,0,1157,294268,50,2772,294289,0,2772,470408,4,5032)
% 
% 
% START OF PROOF
% 294269 [] equal(X,X).
% 294270 [] product(X,Y,compose(X,Y)) | -defined(X,Y).
% 294272 [] -product(X,Y,Z) | -defined(Z,U) | defined(Y,U).
% 294275 [] -product(X,Y,Z) | -defined(U,Z) | defined(U,X).
% 294279 [] identity_map(domain(X)).
% 294280 [] identity_map(codomain(X)).
% 294281 [] defined(X,domain(X)).
% 294283 [] product(X,domain(X),X).
% 294284 [] product(codomain(X),X,X).
% 294285 [] product(X,Y,Y) | -defined(X,Y) | -identity_map(X).
% 294286 [] product(X,Y,X) | -defined(X,Y) | -identity_map(Y).
% 294287 [] -product(X,Y,U) | -product(X,Y,Z) | equal(Z,U).
% 294288 [] defined(a,b).
% 294289 [] -equal(domain(a),codomain(b)).
% 294305 [hyper:294270,294281] product(X,domain(X),compose(X,domain(X))).
% 294316 [hyper:294285,294281,294279] product(domain(X),domain(domain(X)),domain(domain(X))).
% 294317 [hyper:294285,294281,294280] product(codomain(X),domain(codomain(X)),domain(codomain(X))).
% 294336 [hyper:294272,294283,294288] defined(domain(a),b).
% 294393 [hyper:294275,294284,294336] defined(domain(a),codomain(b)).
% 294680 [hyper:294285,294393,cut:294279] product(domain(a),codomain(b),codomain(b)).
% 294681 [hyper:294286,294393,cut:294280] product(domain(a),codomain(b),domain(a)).
% 298226 [hyper:294287,294316,294283] equal(domain(X),domain(domain(X))).
% 298227 [hyper:294287,294316,294305,demod:298226] equal(compose(domain(X),domain(X)),domain(X)).
% 298565 [hyper:294287,294317,294283] equal(codomain(X),domain(codomain(X))).
% 298566 [hyper:294287,294317,294305,demod:298565] equal(compose(codomain(X),codomain(X)),codomain(X)).
% 309248 [hyper:294287,294681,294680] equal(codomain(b),domain(a)).
% 470409 [para:298566.1.2,294289.1.2,demod:298227,309248,cut:294269] 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 6
% seconds given: 58
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    2481
%  derived clauses:   3629535
%  kept clauses:      2385
%  kept size sum:     20634
%  kept mid-nuclei:   467837
%  kept new demods:   62
%  forw unit-subs:    2286505
%  forw double-subs: 150547
%  forw overdouble-subs: 0
%  backward subs:     0
%  fast unit cutoff:  2285
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  50.37
%  process. runtime:  50.32
% specific non-discr-tree subsumption statistics: 
%  tried:           40954
%  length fails:    20
%  strength fails:  464
%  predlist fails:  31108
%  aux str. fails:  7224
%  by-lit fails:    0
%  full subs tried: 2138
%  full subs fail:  2138
% 
% ; 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/CAT008-1+eq_r.in")
% 
%------------------------------------------------------------------------------