TSTP Solution File: BOO015-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : BOO015-2 : TPTP v3.4.2. Bugfixed v1.0.1.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art09.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/BOO015-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,774,50,172,792,0,172)
%
%
% START OF PROOF
% 775 [] equal(X,X).
% 776 [] equal(add(X,Y),add(Y,X)).
% 777 [] equal(multiply(X,Y),multiply(Y,X)).
% 778 [] equal(add(multiply(X,Y),Z),multiply(add(X,Z),add(Y,Z))).
% 779 [] equal(add(X,multiply(Y,Z)),multiply(add(X,Y),add(X,Z))).
% 780 [] equal(multiply(add(X,Y),Z),add(multiply(X,Z),multiply(Y,Z))).
% 782 [] equal(add(X,inverse(X)),multiplicative_identity).
% 783 [] equal(add(inverse(X),X),multiplicative_identity).
% 784 [] equal(multiply(X,inverse(X)),additive_identity).
% 785 [] equal(multiply(inverse(X),X),additive_identity).
% 786 [] equal(multiply(X,multiplicative_identity),X).
% 787 [] equal(multiply(multiplicative_identity,X),X).
% 788 [] equal(add(X,additive_identity),X).
% 789 [] equal(add(additive_identity,X),X).
% 790 [] equal(multiply(a,b),c).
% 791 [] equal(add(inverse(a),inverse(b)),d).
% 792 [] -equal(inverse(c),d).
% 794 [para:776.1.1,791.1.1] equal(add(inverse(b),inverse(a)),d).
% 796 [para:777.1.1,790.1.1] equal(multiply(b,a),c).
% 797 [para:789.1.1,778.1.2.1] equal(add(multiply(additive_identity,X),Y),multiply(Y,add(X,Y))).
% 799 [para:782.1.1,778.1.2.1,demod:787] equal(add(multiply(X,Y),inverse(X)),add(Y,inverse(X))).
% 800 [para:782.1.1,778.1.2.2,demod:786] equal(add(multiply(X,Y),inverse(Y)),add(X,inverse(Y))).
% 801 [para:783.1.1,778.1.2.1,demod:787] equal(add(multiply(inverse(X),Y),X),add(Y,X)).
% 803 [para:791.1.1,778.1.2.1] equal(add(multiply(inverse(a),X),inverse(b)),multiply(d,add(X,inverse(b)))).
% 809 [para:794.1.1,778.1.2.2] equal(add(multiply(X,inverse(b)),inverse(a)),multiply(add(X,inverse(a)),d)).
% 810 [para:786.1.1,801.1.1.1,demod:783] equal(multiplicative_identity,add(multiplicative_identity,X)).
% 812 [para:784.1.1,801.1.1.1,demod:789] equal(X,add(inverse(inverse(X)),X)).
% 823 [para:783.1.1,779.1.2.1,demod:787] equal(add(inverse(X),multiply(X,Y)),add(inverse(X),Y)).
% 834 [para:812.1.2,776.1.1] equal(X,add(X,inverse(inverse(X)))).
% 837 [para:787.1.1,780.1.2.1,demod:787,810] equal(X,add(X,multiply(Y,X))).
% 842 [para:784.1.1,780.1.2.1,demod:789] equal(multiply(add(X,Y),inverse(X)),multiply(Y,inverse(X))).
% 858 [para:790.1.1,837.1.2.2] equal(b,add(b,c)).
% 859 [para:837.1.2,789.1.1] equal(additive_identity,multiply(X,additive_identity)).
% 861 [para:796.1.1,837.1.2.2] equal(a,add(a,c)).
% 869 [para:859.1.2,777.1.1] equal(additive_identity,multiply(additive_identity,X)).
% 870 [para:859.1.2,803.1.1.1,demod:789] equal(inverse(b),multiply(d,inverse(b))).
% 916 [para:794.1.1,797.1.2.2,demod:789,869] equal(inverse(a),multiply(inverse(a),d)).
% 924 [para:858.1.2,797.1.2.2,demod:789,869] equal(c,multiply(c,b)).
% 959 [para:785.1.1,799.1.1.1,demod:834,789] equal(inverse(inverse(X)),X).
% 969 [para:924.1.2,799.1.1.1,demod:782] equal(multiplicative_identity,add(b,inverse(c))).
% 1012 [para:870.1.2,800.1.1.1,demod:783,959] equal(multiplicative_identity,add(d,b)).
% 1016 [para:1012.1.2,779.1.2.1,demod:787] equal(add(d,multiply(b,X)),add(d,X)).
% 1079 [para:916.1.2,801.1.1.1,demod:783] equal(multiplicative_identity,add(d,a)).
% 1645 [para:796.1.1,1016.1.1.2,demod:1079] equal(add(d,c),multiplicative_identity).
% 1666 [para:1645.1.1,776.1.1] equal(multiplicative_identity,add(c,d)).
% 1898 [para:861.1.2,842.1.1.1,demod:784] equal(additive_identity,multiply(c,inverse(a))).
% 1906 [para:969.1.2,842.1.1.1,demod:787] equal(inverse(b),multiply(inverse(c),inverse(b))).
% 1957 [para:1666.1.2,842.1.1.1,demod:787] equal(inverse(c),multiply(d,inverse(c))).
% 1989 [para:1898.1.2,823.1.1.2,demod:788] equal(inverse(c),add(inverse(c),inverse(a))).
% 2072 [para:1957.1.2,777.1.1] equal(inverse(c),multiply(inverse(c),d)).
% 2139 [para:1906.1.2,809.1.1.1,demod:2072,1989,794] equal(d,inverse(c)).
% 2140 [para:2139.1.2,792.1.1,cut:775] 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: 968
% derived clauses: 197986
% kept clauses: 2085
% kept size sum: 23875
% kept mid-nuclei: 0
% kept new demods: 1948
% forw unit-subs: 164889
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 38
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 1.97
% process. runtime: 1.95
% 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/BOO015-2+eq_r.in")
%
%------------------------------------------------------------------------------