TSTP Solution File: RNG020-7 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : RNG020-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 : art09.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 268.8s
% Output : Assurance 268.8s
% 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/RNG020-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 5 1)
% (binary-posweight-lex-big-order 30 #f 5 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,36042,3,3006,43853,4,4508,46789,5,6002,46789,1,6002,46789,50,6006,46789,40,6006,46813,0,6006,49997,3,7509,51270,4,8257,51538,5,9007,51538,1,9007,51538,50,9007,51538,40,9007,51562,0,9007,51565,50,9007,51565,40,9007,51589,0,9021,510021,3,18027,736747,4,22595,1067712,5,27022,1067718,1,27022,1067718,50,27027,1067718,40,27027,1067742,0,27028)
%
%
% START OF PROOF
% 1067727 [] equal(multiply(X,add(Y,Z)),add(multiply(X,Y),multiply(X,Z))).
% 1067729 [] equal(add(X,Y),add(Y,X)).
% 1067730 [] equal(add(X,add(Y,Z)),add(add(X,Y),Z)).
% 1067736 [] equal(multiply(additive_inverse(X),Y),additive_inverse(multiply(X,Y))).
% 1067742 [] -equal(add(multiply(multiply(x,u),y),add(multiply(multiply(x,v),y),additive_inverse(add(multiply(x,multiply(u,y)),multiply(x,multiply(v,y)))))),add(multiply(multiply(x,u),y),add(multiply(additive_inverse(x),multiply(u,y)),add(multiply(multiply(x,v),y),multiply(additive_inverse(x),multiply(v,y)))))).
% 1067744 [para:1067729.1.1,1067742.1.1,demod:1067730] -equal(add(multiply(multiply(x,v),y),add(additive_inverse(add(multiply(x,multiply(u,y)),multiply(x,multiply(v,y)))),multiply(multiply(x,u),y))),add(multiply(multiply(x,u),y),add(multiply(additive_inverse(x),multiply(u,y)),add(multiply(multiply(x,v),y),multiply(additive_inverse(x),multiply(v,y)))))).
% 1067755 [para:1067727.1.1,1067736.1.2.1,demod:1067727] equal(add(multiply(additive_inverse(X),Y),multiply(additive_inverse(X),Z)),additive_inverse(add(multiply(X,Y),multiply(X,Z)))).
% 1067790 [para:1067729.1.1,1067744.1.2,demod:1067730,1067755] -equal(add(multiply(multiply(x,v),y),add(multiply(additive_inverse(x),multiply(u,y)),add(multiply(additive_inverse(x),multiply(v,y)),multiply(multiply(x,u),y)))),add(multiply(additive_inverse(x),multiply(u,y)),add(multiply(multiply(x,v),y),add(multiply(additive_inverse(x),multiply(v,y)),multiply(multiply(x,u),y))))).
% 1067801 [para:1067729.1.1,1067730.1.2.1,demod:1067730,slowcut:1067790] 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
% seconds given: 120
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 4405
% derived clauses: 6875302
% kept clauses: 127517
% kept size sum: 1400
% kept mid-nuclei: 0
% kept new demods: 69587
% forw unit-subs: 3666285
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 453
% fast unit cutoff: 0
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 271.76
% process. runtime: 270.27
% 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/RNG020-7+eq_r.in")
%
%------------------------------------------------------------------------------