TSTP Solution File: RNG019-6 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : RNG019-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 269.6s
% Output : Assurance 269.6s
% 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/RNG019-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,1,34,0,1,35732,3,3005,41992,4,4508,46247,5,6002,46247,1,6002,46247,50,6005,46247,40,6005,46264,0,6005,49278,3,7513,50250,4,8261,50434,5,9006,50434,1,9006,50434,50,9006,50434,40,9006,50451,0,9006,50454,50,9006,50454,40,9006,50471,0,9019,363128,3,18967,541830,4,24031,684860,5,27021,684860,1,27021,684860,50,27027,684860,40,27027,684877,0,27027)
%
%
% START OF PROOF
% 684861 [] equal(X,X).
% 684862 [] equal(add(additive_identity,X),X).
% 684863 [] equal(add(X,additive_identity),X).
% 684865 [] equal(multiply(X,additive_identity),additive_identity).
% 684866 [] equal(add(additive_inverse(X),X),additive_identity).
% 684867 [] equal(add(X,additive_inverse(X)),additive_identity).
% 684869 [] equal(multiply(X,add(Y,Z)),add(multiply(X,Y),multiply(X,Z))).
% 684871 [] equal(add(X,Y),add(Y,X)).
% 684872 [] equal(add(X,add(Y,Z)),add(add(X,Y),Z)).
% 684877 [] -equal(add(multiply(multiply(x,y),u),add(multiply(multiply(x,y),v),additive_inverse(add(multiply(x,multiply(y,u)),multiply(x,multiply(y,v)))))),add(multiply(multiply(x,y),u),add(additive_inverse(multiply(x,multiply(y,u))),add(multiply(multiply(x,y),v),additive_inverse(multiply(x,multiply(y,v))))))).
% 684886 [para:684867.1.1,684869.1.1.2,demod:684865] equal(additive_identity,add(multiply(X,Y),multiply(X,additive_inverse(Y)))).
% 684891 [para:684866.1.1,684872.1.2.1,demod:684862] equal(add(additive_inverse(X),add(X,Y)),Y).
% 684894 [para:684872.1.2,684871.1.1] equal(add(X,add(Y,Z)),add(Z,add(X,Y))).
% 684900 [para:684871.1.1,684891.1.1.2] equal(add(additive_inverse(X),add(Y,X)),Y).
% 684902 [para:684886.1.2,684891.1.1.2,demod:684863] equal(additive_inverse(multiply(X,Y)),multiply(X,additive_inverse(Y))).
% 684923 [para:684891.1.1,684900.1.1.2] equal(add(additive_inverse(add(X,Y)),Y),additive_inverse(X)).
% 684937 [para:684869.1.1,684902.1.1.1] equal(additive_inverse(add(multiply(X,Y),multiply(X,Z))),multiply(X,additive_inverse(add(Y,Z)))).
% 684956 [para:684923.1.1,684900.1.1.2] equal(add(additive_inverse(X),additive_inverse(Y)),additive_inverse(add(Y,X))).
% 685007 [para:684894.1.2,684877.1.2.2,demod:684902,684869,684956,684937,cut:684861] 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: 4151
% derived clauses: 6005537
% kept clauses: 126685
% kept size sum: 2956
% kept mid-nuclei: 0
% kept new demods: 65418
% forw unit-subs: 3207150
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 265
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 270.94
% 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/RNG019-6+eq_r.in")
%
%------------------------------------------------------------------------------