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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : CAT004-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 : art08.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/CAT004-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,1,50,0,1)
% 
% 
% START OF PROOF
% 27 [] product(X,Y,compose(X,Y)) | -defined(X,Y).
% 28 [] -product(X,Y,Z) | defined(X,Y).
% 32 [] -product(X,Y,Z) | -defined(U,Z) | defined(U,X).
% 34 [] -product(X,U,V) | -product(U,W,Y) | -product(X,Y,Z) | product(V,W,Z).
% 44 [] -product(X,Y,U) | -product(X,Y,Z) | equal(Z,U).
% 45 [] -product(Z,a,Y) | -product(X,a,Y) | equal(X,Z).
% 46 [] -product(Z,b,Y) | -product(X,b,Y) | equal(X,Z).
% 47 [] product(a,b,c).
% 48 [] product(h,c,d).
% 49 [] product(g,c,d).
% 50 [] -equal(h,g).
% 75 [hyper:28,47] defined(a,b).
% 96 [hyper:27,75] product(a,b,compose(a,b)).
% 113 [hyper:28,48] defined(h,c).
% 142 [hyper:32,113,47] defined(h,a).
% 150 [hyper:27,142] product(h,a,compose(h,a)).
% 184 [hyper:28,49] defined(g,c).
% 211 [hyper:32,184,47] defined(g,a).
% 219 [hyper:27,211] product(g,a,compose(g,a)).
% 259 [hyper:44,96,47] equal(c,compose(a,b)).
% 1479 [hyper:34,150,96,48,demod:259] product(compose(h,a),b,d).
% 1715 [hyper:34,219,96,49,demod:259] product(compose(g,a),b,d).
% 3027 [hyper:46,1715,1479] equal(compose(h,a),compose(g,a)).
% 5880 [para:3027.1.1,150.1.3] product(h,a,compose(g,a)).
% 5884 [hyper:45,5880,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:    206
%  derived clauses:   19902
%  kept clauses:      186
%  kept size sum:     1077
%  kept mid-nuclei:   5633
%  kept new demods:   13
%  forw unit-subs:    5078
%  forw double-subs: 369
%  forw overdouble-subs: 0
%  backward subs:     0
%  fast unit cutoff:  252
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.26
%  process. runtime:  0.25
% specific non-discr-tree subsumption statistics: 
%  tried:           3066
%  length fails:    4
%  strength fails:  136
%  predlist fails:  1982
%  aux str. fails:  772
%  by-lit fails:    0
%  full subs tried: 172
%  full subs fail:  172
% 
% ; 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/CAT004-1+eq_r.in")
% 
%------------------------------------------------------------------------------