TSTP Solution File: GRP315-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP315-1 : TPTP v3.4.2. Released v2.5.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art05.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 20.0s
% Output : Assurance 20.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/GRP315-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: peq
%
% strategies selected:
% (hyper 30 #f 3 17)
% (binary-unit 12 #f)
% (binary-unit-uniteq 12 #f)
% (binary-posweight-kb-big-order 60 #f 3 17)
% (binary-posweight-lex-big-order 30 #f 3 17)
% (binary 30 #t)
% (binary-posweight-kb-big-order 156 #f)
% (binary-posweight-lex-big-order 102 #f)
% (binary-posweight-firstpref-order 60 #f)
% (binary-order 30 #f)
% (binary-posweight-kb-small-order 48 #f)
% (binary-posweight-lex-small-order 30 #f)
%
%
% SOS clause
% -equal(multiply(sk_c6,sk_c7),sk_c5) | -equal(multiply(X,sk_c7),sk_c6) | -equal(inverse(X),sk_c7) | -equal(multiply(Y,sk_c6),sk_c5) | -equal(inverse(Y),sk_c6) | -equal(inverse(Z),sk_c7) | -equal(multiply(Z,sk_c6),sk_c7) | -equal(inverse(U),sk_c6) | -equal(multiply(U,sk_c5),sk_c6).
% was split for some strategies as:
% -equal(inverse(U),sk_c6) | -equal(multiply(U,sk_c5),sk_c6).
% -equal(inverse(Z),sk_c7) | -equal(multiply(Z,sk_c6),sk_c7).
% -equal(multiply(Y,sk_c6),sk_c5) | -equal(inverse(Y),sk_c6).
% -equal(multiply(X,sk_c7),sk_c6) | -equal(inverse(X),sk_c7).
% -equal(multiply(sk_c6,sk_c7),sk_c5).
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(22,40,1,49,0,2,826,50,9,853,0,9,1660,50,18,1687,0,18,2513,50,30,2540,0,31,3377,50,43,3404,0,43,4253,50,63,4280,0,63,5141,50,103,5168,0,103,6043,50,192,6070,0,192,6959,50,335,6986,0,335,7890,50,606,7917,0,606,8837,50,1150,8837,40,1150,8864,0,1151,20313,3,1452,20966,4,1602,21641,1,1752,21641,50,1752,21641,40,1752,21668,0,1752,21843,3,2066,21851,4,2215,21860,5,2353,21860,1,2353,21860,50,2353,21860,40,2353,21887,0,2353)
%
%
% START OF PROOF
% 21705 [?] ?
% 21861 [] equal(X,X).
% 21862 [] equal(multiply(identity,X),X).
% 21863 [] equal(multiply(inverse(X),X),identity).
% 21864 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 21866 [] equal(multiply(sk_c4,sk_c5),sk_c6) | equal(inverse(sk_c2),sk_c6).
% 21867 [] equal(inverse(sk_c2),sk_c6) | equal(inverse(sk_c4),sk_c6).
% 21868 [] equal(multiply(sk_c3,sk_c6),sk_c7) | equal(inverse(sk_c2),sk_c6).
% 21869 [] equal(inverse(sk_c2),sk_c6) | equal(inverse(sk_c3),sk_c7).
% 21870 [] equal(multiply(sk_c2,sk_c6),sk_c5) | equal(multiply(sk_c4,sk_c5),sk_c6).
% 21871 [] equal(multiply(sk_c2,sk_c6),sk_c5) | equal(inverse(sk_c4),sk_c6).
% 21872 [] equal(multiply(sk_c2,sk_c6),sk_c5) | equal(multiply(sk_c3,sk_c6),sk_c7).
% 21873 [] equal(multiply(sk_c2,sk_c6),sk_c5) | equal(inverse(sk_c3),sk_c7).
% 21874 [] equal(multiply(sk_c4,sk_c5),sk_c6) | equal(inverse(sk_c1),sk_c7).
% 21875 [] equal(inverse(sk_c1),sk_c7) | equal(inverse(sk_c4),sk_c6).
% 21876 [] equal(multiply(sk_c3,sk_c6),sk_c7) | equal(inverse(sk_c1),sk_c7).
% 21877 [] equal(inverse(sk_c1),sk_c7) | equal(inverse(sk_c3),sk_c7).
% 21878 [] equal(multiply(sk_c1,sk_c7),sk_c6) | equal(multiply(sk_c4,sk_c5),sk_c6).
% 21879 [] equal(multiply(sk_c1,sk_c7),sk_c6) | equal(inverse(sk_c4),sk_c6).
% 21880 [] equal(multiply(sk_c1,sk_c7),sk_c6) | equal(multiply(sk_c3,sk_c6),sk_c7).
% 21881 [] equal(multiply(sk_c1,sk_c7),sk_c6) | equal(inverse(sk_c3),sk_c7).
% 21882 [] equal(multiply(sk_c6,sk_c7),sk_c5).
% 21883 [?] ?
% 21884 [] $spltprd0($spltcnst14) | -equal(multiply(X,sk_c6),sk_c7) | -equal(inverse(X),sk_c7).
% 21885 [] $spltprd0($spltcnst15) | -equal(multiply(X,sk_c6),sk_c5) | -equal(inverse(X),sk_c6).
% 21886 [] $spltprd0($spltcnst16) | -equal(multiply(X,sk_c7),sk_c6) | -equal(inverse(X),sk_c7).
% 21887 [] -$spltprd0($spltcnst14) | -$spltprd0($spltcnst13) | -$spltprd0($spltcnst16) | -$spltprd0($spltcnst15).
% 21954 [input:21883,cut:21861] $spltprd0($spltcnst13) | -equal(multiply(X,sk_c5),sk_c6) | -equal(inverse(X),sk_c6).
% 21957 [para:21866.1.1,21954.2.1,cut:21861] -equal(inverse(sk_c4),sk_c6) | equal(inverse(sk_c2),sk_c6) | $spltprd0($spltcnst13).
% 21958 [para:21874.1.1,21954.2.1,cut:21861] -equal(inverse(sk_c4),sk_c6) | equal(inverse(sk_c1),sk_c7) | $spltprd0($spltcnst13).
% 21959 [para:21870.2.1,21954.2.1,cut:21861] equal(multiply(sk_c2,sk_c6),sk_c5) | -equal(inverse(sk_c4),sk_c6) | $spltprd0($spltcnst13).
% 21960 [para:21878.2.1,21954.2.1,cut:21861] equal(multiply(sk_c1,sk_c7),sk_c6) | -equal(inverse(sk_c4),sk_c6) | $spltprd0($spltcnst13).
% 21966 [para:21867.2.1,21957.1.1,cut:21861] equal(inverse(sk_c2),sk_c6) | $spltprd0($spltcnst13).
% 21968 [para:21862.1.1,21884.2.1] -equal(inverse(identity),sk_c7) | -equal(sk_c6,sk_c7) | $spltprd0($spltcnst14).
% 21970 [para:21868.1.1,21884.2.1,cut:21861] -equal(inverse(sk_c3),sk_c7) | equal(inverse(sk_c2),sk_c6) | $spltprd0($spltcnst14).
% 21973 [para:21876.1.1,21884.2.1,cut:21861] -equal(inverse(sk_c3),sk_c7) | equal(inverse(sk_c1),sk_c7) | $spltprd0($spltcnst14).
% 21976 [para:21872.2.1,21884.2.1,cut:21861] equal(multiply(sk_c2,sk_c6),sk_c5) | -equal(inverse(sk_c3),sk_c7) | $spltprd0($spltcnst14).
% 21977 [para:21880.2.1,21884.2.1,cut:21861] equal(multiply(sk_c1,sk_c7),sk_c6) | -equal(inverse(sk_c3),sk_c7) | $spltprd0($spltcnst14).
% 21982 [para:21966.1.1,21863.1.1.1] equal(multiply(sk_c6,sk_c2),identity) | $spltprd0($spltcnst13).
% 21988 [para:21871.1.1,21885.2.1,cut:21861,binarycut:21867] equal(inverse(sk_c4),sk_c6) | $spltprd0($spltcnst15).
% 21990 [para:21873.1.1,21885.2.1,cut:21861,binarycut:21869] equal(inverse(sk_c3),sk_c7) | $spltprd0($spltcnst15).
% 21992 [para:21870.1.1,21885.2.1,cut:21861] equal(multiply(sk_c4,sk_c5),sk_c6) | -equal(inverse(sk_c2),sk_c6) | $spltprd0($spltcnst15).
% 21993 [para:21872.1.1,21885.2.1,cut:21861] equal(multiply(sk_c3,sk_c6),sk_c7) | -equal(inverse(sk_c2),sk_c6) | $spltprd0($spltcnst15).
% 22000 [para:21988.1.1,21863.1.1.1] equal(multiply(sk_c6,sk_c4),identity) | $spltprd0($spltcnst15).
% 22002 [para:21990.1.1,21863.1.1.1] equal(multiply(sk_c7,sk_c3),identity) | $spltprd0($spltcnst15).
% 22007 [para:21862.1.1,21886.2.1] -equal(inverse(identity),sk_c7) | -equal(sk_c7,sk_c6) | $spltprd0($spltcnst16).
% 22011 [para:21879.1.1,21886.2.1,cut:21861,binarycut:21875] equal(inverse(sk_c4),sk_c6) | $spltprd0($spltcnst16).
% 22013 [para:21881.1.1,21886.2.1,cut:21861,binarycut:21877] equal(inverse(sk_c3),sk_c7) | $spltprd0($spltcnst16).
% 22014 [para:21878.1.1,21886.2.1,cut:21861] equal(multiply(sk_c4,sk_c5),sk_c6) | -equal(inverse(sk_c1),sk_c7) | $spltprd0($spltcnst16).
% 22015 [para:21880.1.1,21886.2.1,cut:21861] equal(multiply(sk_c3,sk_c6),sk_c7) | -equal(inverse(sk_c1),sk_c7) | $spltprd0($spltcnst16).
% 22017 [para:22011.1.1,21863.1.1.1] equal(multiply(sk_c6,sk_c4),identity) | $spltprd0($spltcnst16).
% 22024 [para:21863.1.1,21864.1.1.1,demod:21862] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 22064 [para:22000.1.1,21864.1.1.1,demod:21862] $spltprd0($spltcnst15) | equal(X,multiply(sk_c6,multiply(sk_c4,X))).
% 22067 [para:22017.1.1,21864.1.1.1,demod:21862] $spltprd0($spltcnst16) | equal(X,multiply(sk_c6,multiply(sk_c4,X))).
% 22077 [para:21862.1.1,22024.1.2.2] equal(X,multiply(inverse(identity),X)).
% 22078 [para:21882.1.1,22024.1.2.2] equal(sk_c7,multiply(inverse(sk_c6),sk_c5)).
% 22124 [para:21982.1.1,22024.1.2.2] equal(sk_c2,multiply(inverse(sk_c6),identity)) | $spltprd0($spltcnst13).
% 22126 [para:22002.1.1,22024.1.2.2] equal(sk_c3,multiply(inverse(sk_c7),identity)) | $spltprd0($spltcnst15).
% 22137 [para:22124.1.2,21864.1.1.1,demod:21862] $spltprd0($spltcnst13) | equal(multiply(sk_c2,X),multiply(inverse(sk_c6),X)).
% 22229 [para:22137.2.2,21863.1.1] equal(multiply(sk_c2,sk_c6),identity) | $spltprd0($spltcnst13).
% 22237 [para:22137.2.2,22078.1.2] equal(sk_c7,multiply(sk_c2,sk_c5)) | $spltprd0($spltcnst13).
% 22239 [para:22137.2.2,22124.1.2] equal(sk_c2,multiply(sk_c2,identity)) | $spltprd0($spltcnst13).
% 22271 [para:22237.1.2,21954.2.1,binarycut:21966] -equal(sk_c7,sk_c6) | $spltprd0($spltcnst13).
% 22534 [para:21875.2.1,21958.1.1,cut:21861] equal(inverse(sk_c1),sk_c7) | $spltprd0($spltcnst13).
% 22537 [para:22534.1.1,22024.1.2.1] $spltprd0($spltcnst13) | equal(X,multiply(sk_c7,multiply(sk_c1,X))).
% 22552 [para:21871.2.1,21959.2.1,cut:21861] equal(multiply(sk_c2,sk_c6),sk_c5) | $spltprd0($spltcnst13).
% 22560 [para:22552.1.1,22229.1.1] equal(sk_c5,identity) | $spltprd0($spltcnst13).
% 22568 [para:22560.1.1,22237.1.2.2] equal(sk_c7,multiply(sk_c2,identity)) | $spltprd0($spltcnst13).
% 22577 [para:21879.2.1,21960.2.1,cut:21861] equal(multiply(sk_c1,sk_c7),sk_c6) | $spltprd0($spltcnst13).
% 22581 [para:22568.1.2,22239.1.2] equal(sk_c2,sk_c7) | $spltprd0($spltcnst13).
% 22596 [para:22581.1.2,22271.1.1] -equal(sk_c2,sk_c6) | $spltprd0($spltcnst13).
% 22611 [para:22577.1.1,22537.2.2.2] equal(sk_c7,multiply(sk_c7,sk_c6)) | $spltprd0($spltcnst13).
% 22622 [para:22611.1.2,22024.1.2.2,demod:21863] equal(sk_c6,identity) | $spltprd0($spltcnst13).
% 22640 [?] ?
% 22652 [para:22622.1.1,22596.1.2,binarycut:22640] $spltprd0($spltcnst13).
% 22655 [para:21869.2.1,21970.1.1,cut:21861] equal(inverse(sk_c2),sk_c6) | $spltprd0($spltcnst14).
% 22665 [para:21877.2.1,21973.1.1,cut:21861] equal(inverse(sk_c1),sk_c7) | $spltprd0($spltcnst14).
% 22699 [para:21873.2.1,21976.2.1,cut:21861] equal(multiply(sk_c2,sk_c6),sk_c5) | $spltprd0($spltcnst14).
% 22712 [para:22699.1.1,22024.1.2.2] equal(sk_c6,multiply(inverse(sk_c2),sk_c5)) | $spltprd0($spltcnst14).
% 22721 [para:21881.2.1,21977.2.1,cut:21861] equal(multiply(sk_c1,sk_c7),sk_c6) | $spltprd0($spltcnst14).
% 22730 [para:22721.1.1,22024.1.2.2] equal(sk_c7,multiply(inverse(sk_c1),sk_c6)) | $spltprd0($spltcnst14).
% 22741 [para:22655.1.1,22712.1.2.1] equal(sk_c6,multiply(sk_c6,sk_c5)) | $spltprd0($spltcnst14).
% 22777 [para:22665.1.1,22730.1.2.1] equal(sk_c7,multiply(sk_c7,sk_c6)) | $spltprd0($spltcnst14).
% 22791 [para:22777.1.2,22024.1.2.2,demod:21863] equal(sk_c6,identity) | $spltprd0($spltcnst14).
% 22793 [para:22791.1.1,21882.1.1.1,demod:21862] equal(sk_c7,sk_c5) | $spltprd0($spltcnst14).
% 22813 [para:22791.1.1,22741.1.2.1,demod:21862] equal(sk_c6,sk_c5) | $spltprd0($spltcnst14).
% 22881 [para:22813.1.1,22078.1.2.1.1,demod:21863] equal(sk_c7,identity) | $spltprd0($spltcnst14).
% 22905 [para:22881.1.1,21968.1.2,cut:21705] -equal(sk_c6,sk_c7) | $spltprd0($spltcnst14).
% 22928 [para:22793.1.1,22905.1.2,binarycut:22813] $spltprd0($spltcnst14).
% 22930 [binary:21887,22928,cut:22652] -$spltprd0($spltcnst16) | -$spltprd0($spltcnst15).
% 22932 [binary:22011.2,22930] equal(inverse(sk_c4),sk_c6) | -$spltprd0($spltcnst15).
% 22933 [binary:22013.2,22930] equal(inverse(sk_c3),sk_c7) | -$spltprd0($spltcnst15).
% 22939 [binary:22067,22930,binarycut:22064] equal(X,multiply(sk_c6,multiply(sk_c4,X))).
% 22949 [binary:21988.2,22932.2] equal(inverse(sk_c4),sk_c6).
% 22951 [para:21866.2.1,21992.2.1,cut:21861] equal(multiply(sk_c4,sk_c5),sk_c6) | $spltprd0($spltcnst15).
% 22952 [para:22949.1.1,21863.1.1.1] equal(multiply(sk_c6,sk_c4),identity).
% 22953 [para:22952.1.1,22024.1.2.2] equal(sk_c4,multiply(inverse(sk_c6),identity)).
% 22955 [binary:21990.2,22933.2] equal(inverse(sk_c3),sk_c7).
% 22957 [para:21868.2.1,21993.2.1,cut:21861] equal(multiply(sk_c3,sk_c6),sk_c7) | $spltprd0($spltcnst15).
% 22958 [para:22955.1.1,21863.1.1.1] equal(multiply(sk_c7,sk_c3),identity).
% 22960 [para:22958.1.1,22024.1.2.2] equal(sk_c3,multiply(inverse(sk_c7),identity)).
% 22984 [para:21874.2.1,22014.2.1,cut:21861] equal(multiply(sk_c4,sk_c5),sk_c6) | $spltprd0($spltcnst16).
% 22987 [para:21876.2.1,22015.2.1,cut:21861] equal(multiply(sk_c3,sk_c6),sk_c7) | $spltprd0($spltcnst16).
% 22990 [para:22951.1.1,22024.1.2.2,demod:22949] equal(sk_c5,multiply(sk_c6,sk_c6)) | $spltprd0($spltcnst15).
% 22995 [para:22957.1.1,22024.1.2.2,demod:22955] equal(sk_c6,multiply(sk_c7,sk_c7)) | $spltprd0($spltcnst15).
% 22998 [para:22984.1.1,22024.1.2.2,demod:22949] equal(sk_c5,multiply(sk_c6,sk_c6)) | $spltprd0($spltcnst16).
% 23017 [para:22990.1.2,22024.1.2.2,demod:22078] equal(sk_c6,sk_c7) | $spltprd0($spltcnst15).
% 23093 [para:22998.1.2,22024.1.2.2,demod:22078] equal(sk_c6,sk_c7) | $spltprd0($spltcnst16).
% 23124 [binary:22930,23093.2] equal(sk_c6,sk_c7) | -$spltprd0($spltcnst15).
% 23147 [binary:23017.2,23124.2] equal(sk_c6,sk_c7).
% 23148 [para:23147.1.1,21882.1.1.1] equal(multiply(sk_c7,sk_c7),sk_c5).
% 23177 [para:23147.1.1,22953.1.2.1.1,demod:22960] equal(sk_c4,sk_c3).
% 23188 [para:23177.1.1,22949.1.1.1,demod:22955] equal(sk_c7,sk_c6).
% 23190 [para:23177.1.1,22939.1.2.2.1] equal(X,multiply(sk_c6,multiply(sk_c3,X))).
% 23193 [para:23148.1.1,22995.1.2] equal(sk_c6,sk_c5) | $spltprd0($spltcnst15).
% 23202 [para:23193.1.1,22078.1.2.1.1,demod:21863] equal(sk_c7,identity) | $spltprd0($spltcnst15).
% 23231 [para:23202.1.1,22126.1.2.1.1,demod:22077] equal(sk_c3,identity) | $spltprd0($spltcnst15).
% 23237 [?] ?
% 23260 [para:23231.1.1,22955.1.1.1,binarycut:23237] $spltprd0($spltcnst15).
% 23300 [para:22987.1.1,23190.1.2.2,demod:21882] equal(sk_c6,sk_c5) | $spltprd0($spltcnst16).
% 23322 [binary:22930,23300.2,cut:23260] equal(sk_c6,sk_c5).
% 23334 [para:23322.1.1,22078.1.2.1.1,demod:21863] equal(sk_c7,identity).
% 23353 [para:23334.1.1,22007.1.2,cut:21705,cut:23188] $spltprd0($spltcnst16).
% 23358 [binary:22930,23353,cut:23260] 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 17
% clause depth limited to 3
% seconds given: 30
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 4661
% derived clauses: 285543
% kept clauses: 12122
% kept size sum: 190491
% kept mid-nuclei: 6330
% kept new demods: 1135
% forw unit-subs: 201458
% forw double-subs: 39786
% forw overdouble-subs: 6815
% backward subs: 410
% fast unit cutoff: 1490
% full unit cutoff: 0
% dbl unit cutoff: 783
% real runtime : 23.66
% process. runtime: 23.62
% specific non-discr-tree subsumption statistics:
% tried: 135549
% length fails: 20429
% strength fails: 51611
% predlist fails: 1103
% aux str. fails: 16619
% by-lit fails: 8355
% full subs tried: 33614
% full subs fail: 27292
%
% ; 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/GRP315-1+eq_r.in")
%
%------------------------------------------------------------------------------