TSTP Solution File: RNG021-7 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : RNG021-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 : art05.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.3s
% Output : Assurance 268.3s
% 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-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 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(24,40,0,48,0,0,35872,3,3001,43820,4,4502,46666,5,6001,46667,1,6001,46667,50,6004,46667,40,6004,46691,0,6004,49902,3,7505,51149,4,8256,51432,5,9005,51432,1,9005,51432,50,9005,51432,40,9005,51456,0,9005,51459,50,9005,51459,40,9005,51483,0,9019,518601,3,18021,741405,4,22532,1084481,5,27020,1084485,1,27020,1084485,50,27026,1084485,40,27026,1084509,0,27026)
%
%
% START OF PROOF
% 1084486 [] equal(X,X).
% 1084487 [] equal(add(additive_identity,X),X).
% 1084491 [] equal(add(additive_inverse(X),X),additive_identity).
% 1084495 [] equal(multiply(add(X,Y),Z),add(multiply(X,Z),multiply(Y,Z))).
% 1084496 [] equal(add(X,Y),add(Y,X)).
% 1084497 [] equal(add(X,add(Y,Z)),add(add(X,Y),Z)).
% 1084503 [] equal(multiply(additive_inverse(X),Y),additive_inverse(multiply(X,Y))).
% 1084509 [] -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(multiply(additive_inverse(u),multiply(x,y)),add(multiply(multiply(v,x),y),multiply(additive_inverse(v),multiply(x,y)))))).
% 1084538 [para:1084495.1.1,1084503.1.2.1] equal(multiply(additive_inverse(add(X,Y)),Z),additive_inverse(add(multiply(X,Z),multiply(Y,Z)))).
% 1084562 [para:1084491.1.1,1084497.1.2.1,demod:1084487] equal(add(additive_inverse(X),add(X,Y)),Y).
% 1084565 [para:1084497.1.2,1084496.1.1] equal(add(X,add(Y,Z)),add(Z,add(X,Y))).
% 1084583 [para:1084496.1.1,1084562.1.1.2] equal(add(additive_inverse(X),add(Y,X)),Y).
% 1084595 [para:1084562.1.1,1084583.1.1.2] equal(add(additive_inverse(add(X,Y)),Y),additive_inverse(X)).
% 1084604 [para:1084595.1.1,1084583.1.1.2] equal(add(additive_inverse(X),additive_inverse(Y)),additive_inverse(add(Y,X))).
% 1084634 [para:1084565.1.2,1084509.1.2.2,demod:1084495,1084604,1084538,cut:1084486] 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: 4428
% derived clauses: 6920059
% kept clauses: 127457
% kept size sum: 2948
% kept mid-nuclei: 0
% kept new demods: 69592
% forw unit-subs: 3682731
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 453
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 272.23
% 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/RNG021-7+eq_r.in")
%
%------------------------------------------------------------------------------