TSTP Solution File: RNG008-3 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : RNG008-3 : 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/RNG008-3+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(20,40,0,40,0,0)
%
%
% START OF PROOF
% 22 [] equal(add(additive_identity,X),X).
% 23 [] equal(add(additive_inverse(X),X),additive_identity).
% 24 [] equal(multiply(X,add(Y,Z)),add(multiply(X,Y),multiply(X,Z))).
% 25 [] equal(multiply(add(X,Y),Z),add(multiply(X,Z),multiply(Y,Z))).
% 27 [] equal(additive_inverse(additive_inverse(X)),X).
% 31 [] equal(multiply(X,additive_inverse(Y)),additive_inverse(multiply(X,Y))).
% 32 [] equal(multiply(additive_inverse(X),Y),additive_inverse(multiply(X,Y))).
% 33 [] equal(add(add(X,Y),Z),add(X,add(Y,Z))).
% 34 [] equal(add(X,Y),add(Y,X)).
% 38 [] equal(multiply(X,X),X).
% 39 [] equal(multiply(a,b),c).
% 40 [] -equal(multiply(b,a),c).
% 42 [para:38.1.1,24.1.2.2] equal(multiply(X,add(Y,X)),add(multiply(X,Y),X)).
% 46 [para:31.1.1,38.1.1,demod:27,38,32] equal(X,additive_inverse(X)).
% 48 [para:38.1.1,25.1.2.1] equal(multiply(add(X,Y),X),add(X,multiply(Y,X))).
% 49 [para:38.1.1,25.1.2.2] equal(multiply(add(X,Y),Y),add(multiply(X,Y),Y)).
% 53 [para:23.1.1,33.1.1.1,demod:46,22] equal(X,add(Y,add(Y,X))).
% 57 [para:53.1.2,34.1.1,demod:33] equal(X,add(Y,add(X,Y))).
% 72 [para:57.1.2,42.1.1.2,demod:57,33,49,48] equal(add(X,multiply(Y,X)),add(multiply(X,Y),X)).
% 80 [para:72.1.2,57.1.2.2,demod:53] equal(multiply(X,Y),multiply(Y,X)).
% 83 [para:80.1.1,39.1.1,cut:40] 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 3
% seconds given: 60
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 44
% derived clauses: 1099
% kept clauses: 42
% kept size sum: 413
% kept mid-nuclei: 0
% kept new demods: 48
% forw unit-subs: 693
% 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.2
% process. runtime: 0.1
% 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-3+eq_r.in")
%
%------------------------------------------------------------------------------