TSTP Solution File: RNG021-6 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : RNG021-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 : 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 268.2s
% Output : Assurance 268.2s
% 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/RNG021-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 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(17,40,0,34,0,0,35750,3,3006,42010,4,4507,46126,5,6001,46126,1,6001,46126,50,6004,46126,40,6004,46143,0,6004,49157,3,7511,50129,4,8261,50313,5,9014,50313,1,9014,50313,50,9014,50313,40,9014,50330,0,9014,50333,50,9014,50333,40,9014,50350,0,9028,363007,3,19032,541709,4,24101,675804,5,27029,675804,1,27029,675804,50,27034,675804,40,27034,675821,0,27034)
%
%
% START OF PROOF
% 675805 [] equal(X,X).
% 675806 [] equal(add(additive_identity,X),X).
% 675807 [] equal(add(X,additive_identity),X).
% 675809 [] equal(multiply(X,additive_identity),additive_identity).
% 675810 [] equal(add(additive_inverse(X),X),additive_identity).
% 675811 [] equal(add(X,additive_inverse(X)),additive_identity).
% 675813 [] equal(multiply(X,add(Y,Z)),add(multiply(X,Y),multiply(X,Z))).
% 675814 [] equal(multiply(add(X,Y),Z),add(multiply(X,Z),multiply(Y,Z))).
% 675815 [] equal(add(X,Y),add(Y,X)).
% 675816 [] equal(add(X,add(Y,Z)),add(add(X,Y),Z)).
% 675821 [] -equal(add(multiply(multiply(u,x),y),add(multiply(multiply(v,x),y),additive_inverse(add(multiply(u,multiply(x,y)),multiply(v,multiply(x,y)))))),add(multiply(multiply(u,x),y),add(additive_inverse(multiply(u,multiply(x,y))),add(multiply(multiply(v,x),y),additive_inverse(multiply(v,multiply(x,y))))))).
% 675824 [para:675815.1.1,675821.1.1.2] -equal(add(multiply(multiply(u,x),y),add(additive_inverse(add(multiply(u,multiply(x,y)),multiply(v,multiply(x,y)))),multiply(multiply(v,x),y))),add(multiply(multiply(u,x),y),add(additive_inverse(multiply(u,multiply(x,y))),add(multiply(multiply(v,x),y),additive_inverse(multiply(v,multiply(x,y))))))).
% 675830 [para:675811.1.1,675813.1.1.2,demod:675809] equal(additive_identity,add(multiply(X,Y),multiply(X,additive_inverse(Y)))).
% 675835 [para:675810.1.1,675816.1.2.1,demod:675806] equal(add(additive_inverse(X),add(X,Y)),Y).
% 675846 [para:675830.1.2,675835.1.1.2,demod:675807] equal(additive_inverse(multiply(X,Y)),multiply(X,additive_inverse(Y))).
% 675882 [para:675814.1.1,675846.1.1.1,demod:675814] equal(additive_inverse(add(multiply(X,Y),multiply(Z,Y))),add(multiply(X,additive_inverse(Y)),multiply(Z,additive_inverse(Y)))).
% 675912 [para:675815.1.1,675824.1.2.2.2,demod:675816,675846,675882,cut:675805] 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: 4129
% derived clauses: 5988692
% kept clauses: 126525
% kept size sum: 2144
% kept mid-nuclei: 0
% kept new demods: 65283
% forw unit-subs: 3198065
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 266
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 272.47
% process. runtime: 270.35
% 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/RNG021-6+eq_r.in")
%
%------------------------------------------------------------------------------