TSTP Solution File: RNG020-6 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : RNG020-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 : 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 268.8s
% Output : Assurance 268.8s
% 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/RNG020-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,0,34,0,0,35719,3,3041,41884,4,4517,46090,5,6001,46090,1,6001,46090,50,6004,46090,40,6004,46107,0,6004,48965,3,7511,50093,4,8256,50253,5,9005,50253,1,9005,50253,50,9005,50253,40,9005,50270,0,9005,50273,50,9005,50273,40,9005,50290,0,9018,362837,3,19035,541539,4,24150,673649,5,27019,673651,1,27019,673651,50,27024,673651,40,27024,673668,0,27024)
%
%
% START OF PROOF
% 673652 [] equal(X,X).
% 673653 [] equal(add(additive_identity,X),X).
% 673654 [] equal(add(X,additive_identity),X).
% 673656 [] equal(multiply(X,additive_identity),additive_identity).
% 673657 [] equal(add(additive_inverse(X),X),additive_identity).
% 673658 [] equal(add(X,additive_inverse(X)),additive_identity).
% 673660 [] equal(multiply(X,add(Y,Z)),add(multiply(X,Y),multiply(X,Z))).
% 673661 [] equal(multiply(add(X,Y),Z),add(multiply(X,Z),multiply(Y,Z))).
% 673662 [] equal(add(X,Y),add(Y,X)).
% 673663 [] equal(add(X,add(Y,Z)),add(add(X,Y),Z)).
% 673668 [] -equal(add(multiply(multiply(x,u),y),add(multiply(multiply(x,v),y),additive_inverse(add(multiply(x,multiply(u,y)),multiply(x,multiply(v,y)))))),add(multiply(multiply(x,u),y),add(additive_inverse(multiply(x,multiply(u,y))),add(multiply(multiply(x,v),y),additive_inverse(multiply(x,multiply(v,y))))))).
% 673671 [para:673662.1.1,673668.1.1.2] -equal(add(multiply(multiply(x,u),y),add(additive_inverse(add(multiply(x,multiply(u,y)),multiply(x,multiply(v,y)))),multiply(multiply(x,v),y))),add(multiply(multiply(x,u),y),add(additive_inverse(multiply(x,multiply(u,y))),add(multiply(multiply(x,v),y),additive_inverse(multiply(x,multiply(v,y))))))).
% 673677 [para:673658.1.1,673660.1.1.2,demod:673656] equal(additive_identity,add(multiply(X,Y),multiply(X,additive_inverse(Y)))).
% 673682 [para:673657.1.1,673663.1.2.1,demod:673653] equal(add(additive_inverse(X),add(X,Y)),Y).
% 673693 [para:673677.1.2,673682.1.1.2,demod:673654] equal(additive_inverse(multiply(X,Y)),multiply(X,additive_inverse(Y))).
% 673728 [para:673660.1.1,673693.1.1.1] equal(additive_inverse(add(multiply(X,Y),multiply(X,Z))),multiply(X,additive_inverse(add(Y,Z)))).
% 673729 [para:673661.1.1,673693.1.1.1,demod:673661] equal(additive_inverse(add(multiply(X,Y),multiply(Z,Y))),add(multiply(X,additive_inverse(Y)),multiply(Z,additive_inverse(Y)))).
% 673759 [para:673662.1.1,673671.1.2.2.2,demod:673693,673663,673660,673729,673728,cut:673652] 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: 4103
% derived clauses: 5922877
% kept clauses: 126495
% kept size sum: 2144
% kept mid-nuclei: 0
% kept new demods: 65268
% forw unit-subs: 3164596
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 263
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 271.74
% process. runtime: 270.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/RNG020-6+eq_r.in")
%
%------------------------------------------------------------------------------