TSTP Solution File: RNG026-7 by Gandalf---c-2.6

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : RNG026-7 : 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 60.0s
% Output   : Assurance 60.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/RNG/RNG026-7+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: ueq
% 
% strategies selected: 
% (binary-posweight-kb-big-order 60 #f 7 1)
% (binary-posweight-lex-big-order 30 #f 7 1)
% (binary 30 #t)
% (binary-posweight-kb-big-order 180 #f)
% (binary-posweight-lex-big-order 120 #f)
% (binary-posweight-firstpref-order 60 #f)
% (binary-posweight-kb-small-order 60 #f)
% (binary-posweight-lex-small-order 60 #f)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(24,40,1,48,0,1,107195,3,3010,151155,4,4549,225892,5,6042,225892,1,6042,225892,50,6048,225892,40,6048,225916,0,6048)
% 
% 
% START OF PROOF
% 225893 [] equal(X,X).
% 225894 [] equal(add(additive_identity,X),X).
% 225896 [] equal(multiply(additive_identity,X),additive_identity).
% 225897 [] equal(multiply(X,additive_identity),additive_identity).
% 225898 [] equal(add(additive_inverse(X),X),additive_identity).
% 225899 [] equal(add(X,additive_inverse(X)),additive_identity).
% 225901 [] equal(multiply(X,add(Y,Z)),add(multiply(X,Y),multiply(X,Z))).
% 225902 [] equal(multiply(add(X,Y),Z),add(multiply(X,Z),multiply(Y,Z))).
% 225903 [] equal(add(X,Y),add(Y,X)).
% 225904 [] equal(add(X,add(Y,Z)),add(add(X,Y),Z)).
% 225909 [] equal(multiply(additive_inverse(X),additive_inverse(Y)),multiply(X,Y)).
% 225910 [] equal(multiply(additive_inverse(X),Y),additive_inverse(multiply(X,Y))).
% 225911 [] equal(multiply(X,additive_inverse(Y)),multiply(additive_inverse(X),Y)).
% 225916 [] -equal(add(multiply(multiply(multiply(a,b),c),d),add(multiply(multiply(additive_inverse(a),b),multiply(c,d)),add(multiply(multiply(a,b),multiply(c,d)),add(multiply(additive_inverse(a),multiply(b,multiply(c,d))),additive_inverse(add(multiply(multiply(a,multiply(b,c)),d),add(multiply(additive_inverse(a),multiply(multiply(b,c),d)),add(multiply(a,multiply(multiply(b,c),d)),add(multiply(a,multiply(additive_inverse(b),multiply(c,d))),add(multiply(multiply(multiply(a,b),c),d),multiply(multiply(additive_inverse(a),multiply(b,c)),d))))))))))),additive_identity).
% 225919 [para:225899.1.1,225901.1.1.2,demod:225897] equal(additive_identity,add(multiply(X,Y),multiply(X,additive_inverse(Y)))).
% 225921 [para:225910.1.2,225898.1.1.1] equal(add(multiply(additive_inverse(X),Y),multiply(X,Y)),additive_identity).
% 225925 [para:225910.1.2,225909.1.1.2] equal(multiply(additive_inverse(X),multiply(additive_inverse(Y),Z)),multiply(X,multiply(Y,Z))).
% 225928 [para:225910.1.2,225911.1.2.1] equal(multiply(multiply(X,Y),additive_inverse(Z)),multiply(multiply(additive_inverse(X),Y),Z)).
% 225945 [para:225919.1.2,225902.1.1.1,demod:225896] equal(additive_identity,add(multiply(multiply(X,Y),Z),multiply(multiply(X,additive_inverse(Y)),Z))).
% 225953 [para:225898.1.1,225904.1.2.1,demod:225894] equal(add(additive_inverse(X),add(X,Y)),Y).
% 225956 [para:225904.1.2,225903.1.1] equal(add(X,add(Y,Z)),add(Z,add(X,Y))).
% 225960 [para:225919.1.2,225904.1.2.1,demod:225894] equal(add(multiply(X,Y),add(multiply(X,additive_inverse(Y)),Z)),Z).
% 225961 [para:225921.1.1,225904.1.2.1,demod:225894] equal(add(multiply(additive_inverse(X),Y),add(multiply(X,Y),Z)),Z).
% 225964 [para:225903.1.1,225953.1.1.2] equal(add(additive_inverse(X),add(Y,X)),Y).
% 225983 [para:225910.1.2,225964.1.1.1] equal(add(multiply(additive_inverse(X),Y),add(Z,multiply(X,Y))),Z).
% 225986 [para:225953.1.1,225964.1.1.2] equal(add(additive_inverse(add(X,Y)),Y),additive_inverse(X)).
% 225995 [para:225986.1.1,225964.1.1.2] equal(add(additive_inverse(X),additive_inverse(Y)),additive_inverse(add(Y,X))).
% 226103 [para:225956.1.2,225960.1.1.2] equal(add(multiply(X,Y),add(Z,add(U,multiply(X,additive_inverse(Y))))),add(Z,U)).
% 226106 [para:225910.1.2,225961.1.1.1.1] equal(add(multiply(multiply(additive_inverse(X),Y),Z),add(multiply(multiply(X,Y),Z),U)),U).
% 226224 [para:225928.1.2,225916.1.1.2.2.2.2.1.2.2.2.2.2,demod:226106,225983,225925,225910,225995,226103,225961] -equal(add(multiply(multiply(multiply(a,b),c),d),multiply(multiply(multiply(additive_inverse(a),b),c),d)),additive_identity).
% 226374 [para:225928.1.2,226224.1.1.2.1,demod:225945,cut:225893] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% using first neg lit preferred strategy
% not using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using lex ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% clause length limited to 1
% clause depth limited to 7
% seconds given: 30
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    1534
%  derived clauses:   1321744
%  kept clauses:      77573
%  kept size sum:     9820
%  kept mid-nuclei:   0
%  kept new demods:   44558
%  forw unit-subs:    999515
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     49
%  fast unit cutoff:  1
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  60.56
%  process. runtime:  60.55
% specific non-discr-tree subsumption statistics: 
%  tried:           0
%  length fails:    0
%  strength fails:  0
%  predlist fails:  0
%  aux str. fails:  0
%  by-lit fails:    0
%  full subs tried: 0
%  full subs fail:  0
% 
% ; 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/RNG/RNG026-7+eq_r.in")
% 
%------------------------------------------------------------------------------