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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : GRP019-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 39.5s
% Output   : Assurance 39.5s
% 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/GRP/GRP019-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: heq
% detected subclass: small
% detected subclass: long
% 
% strategies selected: 
% (hyper 57 #f 2 7)
% (binary-posweight-order 28 #f 2 7)
% (binary-unit 28 #f 2 7)
% (hyper 188 #f)
% (binary-unit-uniteq 16 #f)
% (binary-weightorder 22 #f)
% (binary-posweight-order 114 #f)
% (binary-posweight-lex-big-order 28 #f)
% (binary-posweight-lex-small-order 11 #f)
% (binary-order 28 #f)
% (binary 22 #t)
% (binary-unit 58 #f)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(10,40,1,20,0,1,349,50,3,359,0,3,7414,50,44,7424,0,44,163500,4,4303)
% 
% 
% START OF PROOF
% 7415 [] equal(X,X).
% 7416 [] product(identity,X,X).
% 7419 [] product(X,inverse(X),identity).
% 7420 [] product(X,Y,multiply(X,Y)).
% 7421 [] -product(X,Y,U) | -product(X,Y,Z) | equal(Z,U).
% 7424 [] -equal(multiply(identity,a),a).
% 7529 [hyper:7421,7420,7416] equal(X,multiply(identity,X)).
% 7532 [hyper:7421,7420,7419] equal(identity,multiply(X,inverse(X))).
% 163501 [para:7532.1.1,7424.1.1.1,demod:7529,7532,cut:7415] 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 4
% seconds given: 57
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    280
%  derived clauses:   3915067
%  kept clauses:      292
%  kept size sum:     3594
%  kept mid-nuclei:   163159
%  kept new demods:   32
%  forw unit-subs:    2974352
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     8
%  fast unit cutoff:  1
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  43.56
%  process. runtime:  43.2
% specific non-discr-tree subsumption statistics: 
%  tried:           1059
%  length fails:    0
%  strength fails:  129
%  predlist fails:  86
%  aux str. fails:  222
%  by-lit fails:    0
%  full subs tried: 622
%  full subs fail:  622
% 
% ; 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/GRP/GRP019-1+eq_r.in")
% 
%------------------------------------------------------------------------------