TSTP Solution File: RNG025-5 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : RNG025-5 : 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 : art03.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 318.8s
% Output : Assurance 318.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/RNG025-5+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,1,48,0,2,29625,3,3003,44212,4,4506,48247,5,6013,48247,1,6013,48247,50,6017,48247,40,6017,48271,0,6017,51514,3,7520,52763,4,8272,53036,5,9018,53036,1,9018,53036,50,9018,53036,40,9018,53060,0,9018,53061,50,9018,53061,40,9018,53085,0,9032,518585,3,18033,732660,4,22548,1070752,5,27033,1070756,1,27033,1070756,50,27039,1070756,40,27039,1070780,0,27039)
%
%
% START OF PROOF
% 1070758 [] equal(add(additive_identity,X),X).
% 1070762 [] equal(add(additive_inverse(X),X),additive_identity).
% 1070763 [] equal(add(X,additive_inverse(X)),additive_identity).
% 1070765 [] equal(multiply(X,add(Y,Z)),add(multiply(X,Y),multiply(X,Z))).
% 1070766 [] equal(multiply(add(X,Y),Z),add(multiply(X,Z),multiply(Y,Z))).
% 1070767 [] equal(add(X,Y),add(Y,X)).
% 1070768 [] equal(add(X,add(Y,Z)),add(add(X,Y),Z)).
% 1070769 [] equal(multiply(multiply(X,Y),Y),multiply(X,multiply(Y,Y))).
% 1070773 [] equal(multiply(additive_inverse(X),additive_inverse(Y)),multiply(X,Y)).
% 1070774 [] equal(multiply(additive_inverse(X),Y),additive_inverse(multiply(X,Y))).
% 1070775 [] equal(multiply(X,additive_inverse(Y)),multiply(additive_inverse(X),Y)).
% 1070780 [] -equal(add(multiply(multiply(x,y),z),add(multiply(additive_inverse(x),multiply(y,z)),add(multiply(multiply(x,z),y),multiply(additive_inverse(x),multiply(z,y))))),additive_identity).
% 1070782 [para:1070767.1.1,1070780.1.1,demod:1070768] -equal(add(multiply(additive_inverse(x),multiply(y,z)),add(multiply(multiply(x,z),y),add(multiply(additive_inverse(x),multiply(z,y)),multiply(multiply(x,y),z)))),additive_identity).
% 1070788 [para:1070774.1.2,1070762.1.1.1] equal(add(multiply(additive_inverse(X),Y),multiply(X,Y)),additive_identity).
% 1070789 [para:1070774.1.2,1070763.1.1.2] equal(add(multiply(X,Y),multiply(additive_inverse(X),Y)),additive_identity).
% 1070790 [para:1070765.1.1,1070774.1.2.1,demod:1070765] equal(add(multiply(additive_inverse(X),Y),multiply(additive_inverse(X),Z)),additive_inverse(add(multiply(X,Y),multiply(X,Z)))).
% 1070795 [para:1070775.1.2,1070765.1.1] equal(multiply(X,additive_inverse(add(Y,Z))),add(multiply(additive_inverse(X),Y),multiply(additive_inverse(X),Z))).
% 1070822 [para:1070767.1.1,1070782.1.1,demod:1070768] -equal(add(multiply(multiply(x,z),y),add(multiply(additive_inverse(x),multiply(z,y)),add(multiply(multiply(x,y),z),multiply(additive_inverse(x),multiply(y,z))))),additive_identity).
% 1070827 [para:1070762.1.1,1070768.1.2.1,demod:1070758] equal(add(additive_inverse(X),add(X,Y)),Y).
% 1070828 [para:1070768.1.2,1070763.1.1] equal(add(X,add(Y,additive_inverse(add(X,Y)))),additive_identity).
% 1070830 [para:1070768.1.2,1070767.1.1] equal(add(X,add(Y,Z)),add(Z,add(X,Y))).
% 1070835 [para:1070788.1.1,1070768.1.2.1,demod:1070758] equal(add(multiply(additive_inverse(X),Y),add(multiply(X,Y),Z)),Z).
% 1070836 [para:1070789.1.1,1070768.1.2.1,demod:1070758] equal(add(multiply(X,Y),add(multiply(additive_inverse(X),Y),Z)),Z).
% 1070848 [para:1070767.1.1,1070827.1.1.2] equal(add(additive_inverse(X),add(Y,X)),Y).
% 1070860 [para:1070827.1.1,1070848.1.1.2] equal(add(additive_inverse(add(X,Y)),Y),additive_inverse(X)).
% 1070869 [para:1070860.1.1,1070848.1.1.2] equal(add(additive_inverse(X),additive_inverse(Y)),additive_inverse(add(Y,X))).
% 1070895 [para:1070830.1.1,1070768.1.2,demod:1070768] equal(add(X,add(Y,add(Z,U))),add(U,add(X,add(Y,Z)))).
% 1070897 [para:1070830.1.1,1070768.1.2.1,demod:1070768] equal(add(X,add(Y,add(Z,U))),add(Z,add(X,add(Y,U)))).
% 1071000 [para:1070835.1.1,1070830.1.1.2,demod:1070768] equal(add(X,Y),add(multiply(Z,U),add(Y,add(X,multiply(additive_inverse(Z),U))))).
% 1071181 [para:1070795.1.1,1070769.1.1,demod:1070768,1070769,1070766,1070773,1070790,1070765,1070869] equal(add(multiply(multiply(X,Y),Z),add(multiply(X,multiply(Z,Z)),add(multiply(X,multiply(Y,Y)),multiply(multiply(X,Z),Y)))),add(multiply(X,multiply(Y,Y)),add(multiply(X,multiply(Y,Z)),add(multiply(X,multiply(Z,Y)),multiply(X,multiply(Z,Z)))))).
% 1071252 [para:1070767.1.1,1070822.1.1.2,demod:1070768] -equal(add(multiply(multiply(x,z),y),add(multiply(multiply(x,y),z),add(multiply(additive_inverse(x),multiply(y,z)),multiply(additive_inverse(x),multiply(z,y))))),additive_identity).
% 1072153 [para:1070897.1.2,1070836.1.1.2] equal(add(multiply(X,Y),add(Z,add(U,add(multiply(additive_inverse(X),Y),V)))),add(Z,add(U,V))).
% 1074588 [para:1071000.1.1,1070895.1.2,demod:1070768] equal(add(X,add(Y,add(Z,U))),add(multiply(V,W),add(X,add(Y,add(Z,add(U,multiply(additive_inverse(V),W))))))).
% 1192718 [para:1071181.1.1,1070828.1.1.2.2.1,demod:1072153,1074588,1070768,1070774,1070790,1070869,slowcut:1071252] 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
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 5149
% derived clauses: 8501123
% kept clauses: 180901
% kept size sum: 0
% kept mid-nuclei: 0
% kept new demods: 72824
% forw unit-subs: 5124228
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 706
% fast unit cutoff: 0
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 329.99
% process. runtime: 328.44
% 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/RNG025-5+eq_r.in")
%
%------------------------------------------------------------------------------