TSTP Solution File: BOO014-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : BOO014-2 : 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 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/BOO/BOO014-2+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(18,40,0,36,0,0,710,50,168,728,0,168)
%
%
% START OF PROOF
% 711 [] equal(X,X).
% 712 [] equal(add(X,Y),add(Y,X)).
% 713 [] equal(multiply(X,Y),multiply(Y,X)).
% 714 [] equal(add(multiply(X,Y),Z),multiply(add(X,Z),add(Y,Z))).
% 715 [] equal(add(X,multiply(Y,Z)),multiply(add(X,Y),add(X,Z))).
% 716 [] equal(multiply(add(X,Y),Z),add(multiply(X,Z),multiply(Y,Z))).
% 717 [] equal(multiply(X,add(Y,Z)),add(multiply(X,Y),multiply(X,Z))).
% 718 [] equal(add(X,inverse(X)),multiplicative_identity).
% 719 [] equal(add(inverse(X),X),multiplicative_identity).
% 720 [] equal(multiply(X,inverse(X)),additive_identity).
% 721 [] equal(multiply(inverse(X),X),additive_identity).
% 722 [] equal(multiply(X,multiplicative_identity),X).
% 723 [] equal(multiply(multiplicative_identity,X),X).
% 724 [] equal(add(X,additive_identity),X).
% 725 [] equal(add(additive_identity,X),X).
% 726 [] equal(add(a,b),c).
% 727 [] equal(multiply(inverse(a),inverse(b)),d).
% 728 [] -equal(inverse(c),d).
% 730 [para:712.1.1,726.1.1] equal(add(b,a),c).
% 732 [para:713.1.1,727.1.1] equal(multiply(inverse(b),inverse(a)),d).
% 733 [para:726.1.1,714.1.2.1] equal(add(multiply(a,X),b),multiply(c,add(X,b))).
% 735 [para:725.1.1,714.1.2.1] equal(add(multiply(additive_identity,X),Y),multiply(Y,add(X,Y))).
% 737 [para:718.1.1,714.1.2.1,demod:723] equal(add(multiply(X,Y),inverse(X)),add(Y,inverse(X))).
% 739 [para:719.1.1,714.1.2.1,demod:723] equal(add(multiply(inverse(X),Y),X),add(Y,X)).
% 746 [para:722.1.1,739.1.1.1,demod:719] equal(multiplicative_identity,add(multiplicative_identity,X)).
% 751 [para:721.1.1,739.1.1.1,demod:725] equal(X,add(X,X)).
% 752 [para:732.1.1,739.1.1.1] equal(add(d,b),add(inverse(a),b)).
% 764 [para:719.1.1,715.1.2.1,demod:723] equal(add(inverse(X),multiply(X,Y)),add(inverse(X),Y)).
% 766 [para:730.1.1,715.1.2.1] equal(add(b,multiply(a,X)),multiply(c,add(b,X))).
% 772 [para:751.1.2,715.1.2.2] equal(add(X,multiply(Y,X)),multiply(add(X,Y),X)).
% 785 [para:723.1.1,716.1.2.1,demod:723,746] equal(X,add(X,multiply(Y,X))).
% 790 [para:720.1.1,716.1.2.1,demod:725] equal(multiply(add(X,Y),inverse(X)),multiply(Y,inverse(X))).
% 801 [para:732.1.1,716.1.2.2] equal(multiply(add(X,inverse(b)),inverse(a)),add(multiply(X,inverse(a)),d)).
% 806 [para:785.1.2,725.1.1] equal(additive_identity,multiply(X,additive_identity)).
% 807 [para:727.1.1,785.1.2.2] equal(inverse(b),add(inverse(b),d)).
% 808 [para:713.1.1,785.1.2.2] equal(X,add(X,multiply(X,Y))).
% 816 [para:806.1.2,713.1.1] equal(additive_identity,multiply(additive_identity,X)).
% 821 [para:807.1.2,715.1.2.2,demod:785,772] equal(add(inverse(b),multiply(X,d)),inverse(b)).
% 864 [para:725.1.1,733.1.2.2,demod:725,806] equal(b,multiply(c,b)).
% 865 [para:752.1.2,733.1.2.2,demod:733,725,720] equal(b,add(multiply(a,d),b)).
% 873 [para:864.1.2,717.1.2.1,demod:766] equal(add(b,multiply(a,X)),add(b,multiply(c,X))).
% 875 [para:864.1.2,808.1.2.2] equal(c,add(c,b)).
% 902 [para:730.1.1,735.1.2.2,demod:725,816] equal(a,multiply(a,c)).
% 970 [para:902.1.2,737.1.1.1,demod:718] equal(multiplicative_identity,add(c,inverse(a))).
% 1135 [para:865.1.2,712.1.1,demod:873] equal(b,add(b,multiply(c,d))).
% 1570 [para:821.1.1,735.1.2.2,demod:725,816] equal(multiply(X,d),multiply(multiply(X,d),inverse(b))).
% 1984 [para:875.1.2,790.1.1.1,demod:720] equal(additive_identity,multiply(b,inverse(c))).
% 1989 [para:970.1.2,790.1.1.1,demod:723] equal(inverse(c),multiply(inverse(a),inverse(c))).
% 1997 [para:1135.1.2,790.1.1.1,demod:1570,720] equal(additive_identity,multiply(c,d)).
% 2067 [para:1997.1.2,764.1.1.2,demod:724] equal(inverse(c),add(inverse(c),d)).
% 2100 [para:1984.1.2,737.1.1.1,demod:725] equal(inverse(b),add(inverse(c),inverse(b))).
% 2565 [para:1989.1.2,713.1.1] equal(inverse(c),multiply(inverse(c),inverse(a))).
% 2664 [para:2100.1.2,801.1.1.1,demod:2067,2565,732] equal(d,inverse(c)).
% 2699 [para:2664.1.2,728.1.1,cut:711] 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 4
% seconds given: 60
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 1038
% derived clauses: 205542
% kept clauses: 2644
% kept size sum: 32151
% kept mid-nuclei: 0
% kept new demods: 2488
% forw unit-subs: 167867
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 9
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 2.18
% process. runtime: 2.16
% 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/BOO/BOO014-2+eq_r.in")
%
%------------------------------------------------------------------------------