TSTP Solution File: RNG008-7 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : RNG008-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 : art02.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/RNG008-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 3 1)
% (binary-posweight-lex-big-order 30 #f 3 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(13,40,0,26,0,0,70,50,1,83,0,1)
%
%
% START OF PROOF
% 72 [] equal(add(additive_identity,X),X).
% 73 [] equal(add(X,additive_identity),X).
% 74 [] equal(add(additive_inverse(X),X),additive_identity).
% 75 [] equal(add(X,additive_inverse(X)),additive_identity).
% 76 [] equal(add(X,add(Y,Z)),add(add(X,Y),Z)).
% 77 [] equal(add(X,Y),add(Y,X)).
% 79 [] equal(multiply(X,add(Y,Z)),add(multiply(X,Y),multiply(X,Z))).
% 80 [] equal(multiply(add(X,Y),Z),add(multiply(X,Z),multiply(Y,Z))).
% 81 [] equal(multiply(X,X),X).
% 82 [] equal(multiply(a,b),c).
% 83 [] -equal(multiply(b,a),c).
% 85 [para:74.1.1,76.1.2.1,demod:72] equal(add(additive_inverse(X),add(X,Y)),Y).
% 86 [para:75.1.1,76.1.2.1,demod:72] equal(add(X,add(additive_inverse(X),Y)),Y).
% 87 [para:76.1.2,77.1.1] equal(add(X,add(Y,Z)),add(Z,add(X,Y))).
% 93 [para:74.1.1,85.1.1.2,demod:73] equal(additive_inverse(additive_inverse(X)),X).
% 94 [para:85.1.1,77.1.1,demod:76] equal(X,add(Y,add(X,additive_inverse(Y)))).
% 95 [para:77.1.1,85.1.1.2] equal(add(additive_inverse(X),add(Y,X)),Y).
% 100 [para:95.1.1,95.1.1.2] equal(add(additive_inverse(add(X,Y)),X),additive_inverse(Y)).
% 101 [para:81.1.1,79.1.2.1] equal(multiply(X,add(X,Y)),add(X,multiply(X,Y))).
% 102 [para:81.1.1,79.1.2.2] equal(multiply(X,add(Y,X)),add(multiply(X,Y),X)).
% 125 [para:81.1.1,80.1.2.1] equal(multiply(add(X,Y),X),add(X,multiply(Y,X))).
% 145 [para:100.1.1,77.1.1] equal(additive_inverse(X),add(Y,additive_inverse(add(Y,X)))).
% 195 [para:73.1.1,101.1.1.2,demod:81] equal(X,add(X,multiply(X,additive_identity))).
% 197 [para:75.1.1,101.1.1.2] equal(multiply(X,additive_identity),add(X,multiply(X,additive_inverse(X)))).
% 207 [para:195.1.2,85.1.1.2,demod:74] equal(additive_identity,multiply(X,additive_identity)).
% 213 [para:197.1.2,86.1.1.2,demod:93,73,207] equal(X,multiply(additive_inverse(X),X)).
% 218 [para:213.1.2,80.1.2.2] equal(multiply(add(X,additive_inverse(Y)),Y),add(multiply(X,Y),Y)).
% 253 [para:94.1.2,102.1.1.2,demod:94,76,218,125] equal(add(X,multiply(additive_inverse(Y),X)),add(multiply(X,Y),X)).
% 282 [para:73.1.1,125.1.1.1,demod:81] equal(X,add(X,multiply(additive_identity,X))).
% 284 [para:75.1.1,125.1.1.1,demod:213] equal(multiply(additive_identity,X),add(X,X)).
% 295 [para:145.1.2,125.1.1.1,demod:76,101,253] equal(multiply(additive_inverse(X),Y),add(Y,add(multiply(Y,X),Y))).
% 306 [para:282.1.2,85.1.1.2,demod:74] equal(additive_identity,multiply(additive_identity,X)).
% 310 [para:284.1.2,85.1.1.2,demod:73,306] equal(additive_inverse(X),X).
% 311 [para:284.1.2,87.1.1.2,demod:73,306] equal(X,add(Y,add(X,Y))).
% 317 [para:311.1.2,101.1.1.2,demod:310,295,102] equal(multiply(X,Y),multiply(Y,X)).
% 319 [para:317.1.1,82.1.1,cut:83] 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 kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% clause length limited to 1
% clause depth limited to 4
% seconds given: 60
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 126
% derived clauses: 4706
% kept clauses: 279
% kept size sum: 3387
% kept mid-nuclei: 0
% kept new demods: 246
% forw unit-subs: 3220
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.5
% process. runtime: 0.4
% 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/RNG008-7+eq_r.in")
%
%------------------------------------------------------------------------------