TSTP Solution File: RNG025-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : RNG025-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 : 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 0.0s
% Output : Assurance 0.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/RNG025-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: peq
%
% strategies selected:
% (hyper 30 #f 3 3)
% (binary-unit 12 #f)
% (binary-unit-uniteq 12 #f)
% (binary-posweight-kb-big-order 60 #f 3 3)
% (binary-posweight-lex-big-order 30 #f 3 3)
% (binary 30 #t)
% (binary-posweight-kb-big-order 156 #f)
% (binary-posweight-lex-big-order 102 #f)
% (binary-posweight-firstpref-order 60 #f)
% (binary-order 30 #f)
% (binary-posweight-kb-small-order 48 #f)
% (binary-posweight-lex-small-order 30 #f)
%
%
% **** EMPTY CLAUSE DERIVED ****
%
%
% timer checkpoints: c(19,40,1,38,0,1,56,50,2,75,0,2)
%
%
% START OF PROOF
% 58 [] equal(add(additive_identity,X),X).
% 61 [] equal(add(additive_inverse(X),X),additive_identity).
% 62 [] equal(additive_inverse(add(X,Y)),add(additive_inverse(X),additive_inverse(Y))).
% 63 [] equal(additive_inverse(additive_inverse(X)),X).
% 64 [] equal(multiply(X,add(Y,Z)),add(multiply(X,Y),multiply(X,Z))).
% 65 [] equal(multiply(add(X,Y),Z),add(multiply(X,Z),multiply(Y,Z))).
% 66 [] equal(multiply(multiply(X,Y),Y),multiply(X,multiply(Y,Y))).
% 67 [] equal(multiply(multiply(X,X),Y),multiply(X,multiply(X,Y))).
% 68 [] equal(multiply(additive_inverse(X),Y),additive_inverse(multiply(X,Y))).
% 69 [] equal(multiply(X,additive_inverse(Y)),multiply(additive_inverse(X),Y)).
% 71 [] equal(add(X,Y),add(Y,X)).
% 72 [] equal(add(X,add(Y,Z)),add(add(X,Y),Z)).
% 75 [] -equal(multiply(multiply(cy,cx),cy),multiply(cy,multiply(cx,cy))).
% 83 [para:68.1.2,69.1.2.1,demod:69] equal(multiply(multiply(X,Y),additive_inverse(Z)),multiply(multiply(X,additive_inverse(Y)),Z)).
% 97 [para:66.1.1,64.1.2.1] equal(multiply(multiply(X,Y),add(Y,Z)),add(multiply(X,multiply(Y,Y)),multiply(multiply(X,Y),Z))).
% 106 [para:66.1.1,65.1.2.1] equal(multiply(add(multiply(X,Y),Z),Y),add(multiply(X,multiply(Y,Y)),multiply(Z,Y))).
% 110 [para:61.1.1,72.1.2.1,demod:58] equal(add(additive_inverse(X),add(X,Y)),Y).
% 121 [para:110.1.1,71.1.1,demod:72] equal(X,add(Y,add(X,additive_inverse(Y)))).
% 122 [para:71.1.1,110.1.1.2] equal(add(additive_inverse(X),add(Y,X)),Y).
% 130 [para:110.1.1,122.1.1.2] equal(add(additive_inverse(add(X,Y)),Y),additive_inverse(X)).
% 261 [para:67.1.1,106.1.2.2] equal(multiply(add(multiply(X,Y),multiply(Z,Z)),Y),add(multiply(X,multiply(Y,Y)),multiply(Z,multiply(Z,Y)))).
% 710 [para:261.1.2,64.1.2,demod:64,65] equal(multiply(X,multiply(add(Y,X),Y)),multiply(multiply(X,add(Y,X)),Y)).
% 712 [para:62.1.2,710.1.2.1.2,demod:68,63,69,62] equal(multiply(X,multiply(add(Y,X),additive_inverse(Y))),multiply(multiply(X,add(Y,X)),additive_inverse(Y))).
% 733 [para:712.1.2,97.1.2.2,demod:64,121,72] equal(multiply(multiply(X,add(Y,X)),X),multiply(X,multiply(add(Y,X),X))).
% 736 [para:130.1.1,733.1.1.1.2,demod:69,130,83] equal(multiply(multiply(X,Y),additive_inverse(X)),multiply(X,multiply(Y,additive_inverse(X)))).
% 738 [para:736.1.1,68.1.2.1,demod:63,83,69,68,slowcut:75] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 3
% clause depth limited to 4
% seconds given: 30
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 316
% derived clauses: 181762
% kept clauses: 675
% kept size sum: 12692
% kept mid-nuclei: 0
% kept new demods: 169
% forw unit-subs: 31207
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 11
% fast unit cutoff: 0
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 2.27
% process. runtime: 2.25
% 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/RNG025-1+eq_r.in")
%
%------------------------------------------------------------------------------