TSTP Solution File: GRP177-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP177-2 : TPTP v3.4.2. Bugfixed v1.2.1.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art01.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 60.0s
% Output : Assurance 60.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/GRP/GRP177-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 4 1)
% (binary-posweight-lex-big-order 30 #f 4 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(20,40,2,40,0,2,39854,3,3003,45911,4,4504,51846,5,6018,51846,1,6018,51846,50,6022,51846,40,6022,51866,0,6022)
%
%
% START OF PROOF
% 51848 [] equal(multiply(identity,X),X).
% 51849 [] equal(multiply(inverse(X),X),identity).
% 51850 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 51851 [] equal(greatest_lower_bound(X,Y),greatest_lower_bound(Y,X)).
% 51852 [] equal(least_upper_bound(X,Y),least_upper_bound(Y,X)).
% 51853 [] equal(greatest_lower_bound(X,greatest_lower_bound(Y,Z)),greatest_lower_bound(greatest_lower_bound(X,Y),Z)).
% 51856 [] equal(greatest_lower_bound(X,X),X).
% 51857 [] equal(least_upper_bound(X,greatest_lower_bound(X,Y)),X).
% 51858 [] equal(greatest_lower_bound(X,least_upper_bound(X,Y)),X).
% 51860 [] equal(multiply(X,greatest_lower_bound(Y,Z)),greatest_lower_bound(multiply(X,Y),multiply(X,Z))).
% 51861 [] equal(multiply(least_upper_bound(X,Y),Z),least_upper_bound(multiply(X,Z),multiply(Y,Z))).
% 51862 [] equal(multiply(greatest_lower_bound(X,Y),Z),greatest_lower_bound(multiply(X,Z),multiply(Y,Z))).
% 51863 [] equal(greatest_lower_bound(identity,a),identity).
% 51864 [] equal(greatest_lower_bound(identity,b),identity).
% 51865 [] equal(greatest_lower_bound(identity,c),identity).
% 51866 [] -equal(greatest_lower_bound(a,greatest_lower_bound(multiply(b,c),multiply(greatest_lower_bound(a,b),greatest_lower_bound(a,c)))),greatest_lower_bound(a,multiply(b,c))).
% 51867 [para:51851.1.1,51863.1.1] equal(greatest_lower_bound(a,identity),identity).
% 51868 [para:51851.1.1,51864.1.1] equal(greatest_lower_bound(b,identity),identity).
% 51871 [para:51867.1.1,51857.1.1.2] equal(least_upper_bound(a,identity),a).
% 51872 [para:51868.1.1,51857.1.1.2] equal(least_upper_bound(b,identity),b).
% 51875 [para:51871.1.1,51852.1.1] equal(a,least_upper_bound(identity,a)).
% 51876 [para:51872.1.1,51852.1.1] equal(b,least_upper_bound(identity,b)).
% 51877 [para:51849.1.1,51850.1.1.1,demod:51848] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 51882 [para:51856.1.1,51853.1.2.1] equal(greatest_lower_bound(X,greatest_lower_bound(X,Y)),greatest_lower_bound(X,Y)).
% 51886 [para:51853.1.2,51851.1.1] equal(greatest_lower_bound(X,greatest_lower_bound(Y,Z)),greatest_lower_bound(Z,greatest_lower_bound(X,Y))).
% 51923 [para:51849.1.1,51877.1.2.2] equal(X,multiply(inverse(inverse(X)),identity)).
% 51925 [para:51877.1.2,51877.1.2.2] equal(multiply(X,Y),multiply(inverse(inverse(X)),Y)).
% 51951 [para:51860.1.2,51853.1.2.1] equal(greatest_lower_bound(multiply(X,Y),greatest_lower_bound(multiply(X,Z),U)),greatest_lower_bound(multiply(X,greatest_lower_bound(Y,Z)),U)).
% 51954 [para:51923.1.2,51860.1.2.1,demod:51925] equal(multiply(X,greatest_lower_bound(identity,Y)),greatest_lower_bound(X,multiply(X,Y))).
% 51958 [para:51848.1.1,51861.1.2.1] equal(multiply(least_upper_bound(identity,X),Y),least_upper_bound(Y,multiply(X,Y))).
% 51991 [para:51862.1.2,51853.1.2.1] equal(greatest_lower_bound(multiply(X,Y),greatest_lower_bound(multiply(Z,Y),U)),greatest_lower_bound(multiply(greatest_lower_bound(X,Z),Y),U)).
% 52051 [para:51851.1.1,51886.1.2.2] equal(greatest_lower_bound(X,greatest_lower_bound(Y,Z)),greatest_lower_bound(Z,greatest_lower_bound(Y,X))).
% 52149 [para:51925.1.2,51923.1.2] equal(X,multiply(X,identity)).
% 53296 [para:51865.1.1,51954.1.1.2,demod:52149] equal(X,greatest_lower_bound(X,multiply(X,c))).
% 53366 [para:53296.1.2,51886.1.1.2] equal(greatest_lower_bound(X,Y),greatest_lower_bound(multiply(Y,c),greatest_lower_bound(X,Y))).
% 53449 [para:51958.1.2,51858.1.1.2] equal(greatest_lower_bound(X,multiply(least_upper_bound(identity,Y),X)),X).
% 53863 [para:51875.1.2,53449.1.1.2.1] equal(greatest_lower_bound(X,multiply(a,X)),X).
% 53864 [para:51876.1.2,53449.1.1.2.1] equal(greatest_lower_bound(X,multiply(b,X)),X).
% 53879 [para:53863.1.1,51886.1.1.2] equal(greatest_lower_bound(X,Y),greatest_lower_bound(multiply(a,Y),greatest_lower_bound(X,Y))).
% 53888 [para:53864.1.1,51886.1.1.2] equal(greatest_lower_bound(X,Y),greatest_lower_bound(multiply(b,Y),greatest_lower_bound(X,Y))).
% 55823 [para:52051.1.1,51866.1.1,demod:53879,53366,53888,51882,51951,51991,cut:51851] 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
% clause length limited to 1
% clause depth limited to 4
% seconds given: 30
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 3977
% derived clauses: 2096232
% kept clauses: 55762
% kept size sum: 52005
% kept mid-nuclei: 0
% kept new demods: 54025
% forw unit-subs: 1463105
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 84
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 61.13
% process. runtime: 61.13
% 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/GRP/GRP177-2+eq_r.in")
%
%------------------------------------------------------------------------------