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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : RNG026-6 : 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 : art06.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 59.4s
% Output   : Assurance 59.4s
% 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-6+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(17,40,1,34,0,1,92824,3,3004,136958,4,4502,182300,5,6021,182300,1,6021,182300,50,6027,182300,40,6027,182317,0,6027)
% 
% 
% START OF PROOF
% 182301 [] equal(X,X).
% 182302 [] equal(add(additive_identity,X),X).
% 182303 [] equal(add(X,additive_identity),X).
% 182304 [] equal(multiply(additive_identity,X),additive_identity).
% 182305 [] equal(multiply(X,additive_identity),additive_identity).
% 182306 [] equal(add(additive_inverse(X),X),additive_identity).
% 182307 [] equal(add(X,additive_inverse(X)),additive_identity).
% 182309 [] equal(multiply(X,add(Y,Z)),add(multiply(X,Y),multiply(X,Z))).
% 182310 [] equal(multiply(add(X,Y),Z),add(multiply(X,Z),multiply(Y,Z))).
% 182311 [] equal(add(X,Y),add(Y,X)).
% 182312 [] equal(add(X,add(Y,Z)),add(add(X,Y),Z)).
% 182317 [] -equal(add(multiply(multiply(multiply(a,b),c),d),add(additive_inverse(multiply(multiply(a,b),multiply(c,d))),add(multiply(multiply(a,b),multiply(c,d)),add(additive_inverse(multiply(a,multiply(b,multiply(c,d)))),additive_inverse(add(multiply(multiply(a,multiply(b,c)),d),add(additive_inverse(multiply(a,multiply(multiply(b,c),d))),add(multiply(a,multiply(multiply(b,c),d)),add(multiply(a,additive_inverse(multiply(b,multiply(c,d)))),add(multiply(multiply(multiply(a,b),c),d),multiply(additive_inverse(multiply(a,multiply(b,c))),d))))))))))),additive_identity).
% 182319 [para:182306.1.1,182309.1.1.2,demod:182305] equal(additive_identity,add(multiply(X,additive_inverse(Y)),multiply(X,Y))).
% 182320 [para:182307.1.1,182309.1.1.2,demod:182305] equal(additive_identity,add(multiply(X,Y),multiply(X,additive_inverse(Y)))).
% 182321 [para:182319.1.2,182309.1.1.2,demod:182305] equal(additive_identity,add(multiply(X,multiply(Y,additive_inverse(Z))),multiply(X,multiply(Y,Z)))).
% 182325 [para:182306.1.1,182312.1.2.1,demod:182302] equal(add(additive_inverse(X),add(X,Y)),Y).
% 182328 [para:182312.1.2,182311.1.1] equal(add(X,add(Y,Z)),add(Z,add(X,Y))).
% 182334 [para:182311.1.1,182325.1.1.2] equal(add(additive_inverse(X),add(Y,X)),Y).
% 182335 [para:182319.1.2,182325.1.1.2,demod:182303] equal(additive_inverse(multiply(X,additive_inverse(Y))),multiply(X,Y)).
% 182336 [para:182320.1.2,182325.1.1.2,demod:182303] equal(additive_inverse(multiply(X,Y)),multiply(X,additive_inverse(Y))).
% 182357 [para:182325.1.1,182334.1.1.2] equal(add(additive_inverse(add(X,Y)),Y),additive_inverse(X)).
% 182372 [para:182357.1.1,182334.1.1.2] equal(add(additive_inverse(X),additive_inverse(Y)),additive_inverse(add(Y,X))).
% 182419 [para:182311.1.1,182328.1.2.2] equal(add(X,add(Y,Z)),add(Z,add(Y,X))).
% 182435 [para:182321.1.2,182309.1.1.2,demod:182305] equal(additive_identity,add(multiply(X,multiply(Y,multiply(Z,additive_inverse(U)))),multiply(X,multiply(Y,multiply(Z,U))))).
% 182437 [para:182321.1.2,182312.1.2.1,demod:182302] equal(add(multiply(X,multiply(Y,additive_inverse(Z))),add(multiply(X,multiply(Y,Z)),U)),U).
% 182438 [para:182321.1.2,182310.1.1.1,demod:182304] equal(additive_identity,add(multiply(multiply(X,multiply(Y,additive_inverse(Z))),U),multiply(multiply(X,multiply(Y,Z)),U))).
% 182447 [para:182419.1.1,182317.1.1.2.2.2.2.1.2.2.2,demod:182303,182438,182312,182335,182372,182437,182336] -equal(add(multiply(multiply(multiply(a,b),c),d),add(multiply(a,multiply(b,multiply(c,additive_inverse(d)))),add(multiply(a,multiply(b,multiply(c,d))),multiply(multiply(multiply(a,b),c),additive_inverse(d))))),additive_identity).
% 182453 [para:182311.1.1,182447.1.1,demod:182435,182303,182319,182312,cut:182301] 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:    1332
%  derived clauses:   1197979
%  kept clauses:      77177
%  kept size sum:     2130
%  kept mid-nuclei:   0
%  kept new demods:   41581
%  forw unit-subs:    933364
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     25
%  fast unit cutoff:  1
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  60.89
%  process. runtime:  60.28
% 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-6+eq_r.in")
% 
%------------------------------------------------------------------------------