TSTP Solution File: GRP261-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP261-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 : art08.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 50.0s
% Output : Assurance 50.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/GRP261-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 21)
% (binary-unit 12 #f)
% (binary-unit-uniteq 12 #f)
% (binary-posweight-kb-big-order 60 #f 3 21)
% (binary-posweight-lex-big-order 30 #f 3 21)
% (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(X,sk_c8),sk_c7) | -equal(inverse(X),sk_c8) | -equal(multiply(Y,sk_c7),sk_c6) | -equal(inverse(Y),sk_c7) | -equal(multiply(sk_c6,sk_c8),sk_c7) | -equal(multiply(Z,sk_c8),sk_c7) | -equal(inverse(Z),sk_c8) | -equal(multiply(U,sk_c7),sk_c6) | -equal(inverse(U),sk_c7) | -equal(inverse(V),sk_c6) | -equal(multiply(V,sk_c8),sk_c6).
% was split for some strategies as:
% -equal(inverse(V),sk_c6) | -equal(multiply(V,sk_c8),sk_c6).
% -equal(multiply(U,sk_c7),sk_c6) | -equal(inverse(U),sk_c7).
% -equal(multiply(Z,sk_c8),sk_c7) | -equal(inverse(Z),sk_c8).
% -equal(multiply(Y,sk_c7),sk_c6) | -equal(inverse(Y),sk_c7).
% -equal(multiply(X,sk_c8),sk_c7) | -equal(inverse(X),sk_c8).
% -equal(multiply(sk_c6,sk_c8),sk_c7).
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(35,40,0,76,0,1,142355,4,1158,155015,5,1502,155016,5,1502,155016,1,1502,155016,50,1502,155016,40,1502,155057,0,1502,167944,3,1803,168555,4,1953,169188,5,2103,169189,1,2103,169189,50,2104,169189,40,2104,169230,0,2104,169388,3,2411,169397,4,2564,169404,5,2705,169404,1,2705,169404,50,2705,169404,40,2705,169445,0,2707,188003,3,4208,188887,4,4958,189329,1,5708,189329,50,5708,189329,40,5708,189370,0,5708)
%
%
% START OF PROOF
% 174187 [?] ?
% 175478 [?] ?
% 175519 [?] ?
% 187800 [?] ?
% 189330 [] equal(X,X).
% 189331 [] equal(multiply(identity,X),X).
% 189332 [] equal(multiply(inverse(X),X),identity).
% 189333 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 189335 [] equal(multiply(sk_c6,sk_c8),sk_c7) | equal(multiply(sk_c5,sk_c8),sk_c6).
% 189336 [] equal(multiply(sk_c6,sk_c8),sk_c7) | equal(inverse(sk_c5),sk_c6).
% 189339 [] equal(multiply(sk_c6,sk_c8),sk_c7) | equal(inverse(sk_c3),sk_c8).
% 189340 [] equal(multiply(sk_c6,sk_c8),sk_c7) | equal(multiply(sk_c3,sk_c8),sk_c7).
% 189341 [] equal(multiply(sk_c5,sk_c8),sk_c6) | equal(inverse(sk_c2),sk_c7).
% 189342 [] equal(inverse(sk_c2),sk_c7) | equal(inverse(sk_c5),sk_c6).
% 189343 [] equal(inverse(sk_c2),sk_c7) | equal(inverse(sk_c4),sk_c7).
% 189344 [] equal(multiply(sk_c4,sk_c7),sk_c6) | equal(inverse(sk_c2),sk_c7).
% 189345 [] equal(inverse(sk_c2),sk_c7) | equal(inverse(sk_c3),sk_c8).
% 189346 [] equal(multiply(sk_c3,sk_c8),sk_c7) | equal(inverse(sk_c2),sk_c7).
% 189347 [] equal(multiply(sk_c2,sk_c7),sk_c6) | equal(multiply(sk_c5,sk_c8),sk_c6).
% 189348 [] equal(multiply(sk_c2,sk_c7),sk_c6) | equal(inverse(sk_c5),sk_c6).
% 189349 [] equal(multiply(sk_c2,sk_c7),sk_c6) | equal(inverse(sk_c4),sk_c7).
% 189350 [] equal(multiply(sk_c2,sk_c7),sk_c6) | equal(multiply(sk_c4,sk_c7),sk_c6).
% 189353 [] equal(multiply(sk_c5,sk_c8),sk_c6) | equal(inverse(sk_c1),sk_c8).
% 189354 [] equal(inverse(sk_c1),sk_c8) | equal(inverse(sk_c5),sk_c6).
% 189357 [] equal(inverse(sk_c1),sk_c8) | equal(inverse(sk_c3),sk_c8).
% 189359 [] equal(multiply(sk_c1,sk_c8),sk_c7) | equal(multiply(sk_c5,sk_c8),sk_c6).
% 189360 [] equal(multiply(sk_c1,sk_c8),sk_c7) | equal(inverse(sk_c5),sk_c6).
% 189363 [] equal(multiply(sk_c1,sk_c8),sk_c7) | equal(inverse(sk_c3),sk_c8).
% 189364 [] equal(multiply(sk_c1,sk_c8),sk_c7) | equal(multiply(sk_c3,sk_c8),sk_c7).
% 189365 [] -equal(multiply(sk_c6,sk_c8),sk_c7) | $spltprd0($spltcnst21) | -equal(multiply(X,sk_c8),sk_c6) | -equal(inverse(X),sk_c6).
% 189366 [] $spltprd0($spltcnst22) | -equal(multiply(X,sk_c7),sk_c6) | -equal(inverse(X),sk_c7).
% 189367 [] $spltprd0($spltcnst23) | -equal(multiply(X,sk_c8),sk_c7) | -equal(inverse(X),sk_c8).
% 189368 [] $spltprd0($spltcnst24) | -equal(multiply(X,sk_c7),sk_c6) | -equal(inverse(X),sk_c7).
% 189369 [] $spltprd0($spltcnst25) | -equal(multiply(X,sk_c8),sk_c7) | -equal(inverse(X),sk_c8).
% 189370 [] -$spltprd0($spltcnst22) | -$spltprd0($spltcnst21) | -$spltprd0($spltcnst23) | -$spltprd0($spltcnst25) | -$spltprd0($spltcnst24).
% 189379 [para:189343.2.1,189332.1.1.1] equal(multiply(sk_c7,sk_c4),identity) | equal(inverse(sk_c2),sk_c7).
% 189383 [para:189345.2.1,189332.1.1.1] equal(multiply(sk_c8,sk_c3),identity) | equal(inverse(sk_c2),sk_c7).
% 189386 [para:189354.2.1,189332.1.1.1] equal(multiply(sk_c6,sk_c5),identity) | equal(inverse(sk_c1),sk_c8).
% 189402 [para:189339.2.1,189332.1.1.1] equal(multiply(sk_c8,sk_c3),identity) | equal(multiply(sk_c6,sk_c8),sk_c7).
% 189413 [para:189348.2.1,189332.1.1.1] equal(multiply(sk_c6,sk_c5),identity) | equal(multiply(sk_c2,sk_c7),sk_c6).
% 189427 [para:189360.2.1,189332.1.1.1] equal(multiply(sk_c6,sk_c5),identity) | equal(multiply(sk_c1,sk_c8),sk_c7).
% 189476 [para:189331.1.1,189366.2.1,cut:174187,cut:175478] $spltprd0($spltcnst22).
% 189477 [binary:189370,189476] -$spltprd0($spltcnst25) | -$spltprd0($spltcnst24) | -$spltprd0($spltcnst21) | -$spltprd0($spltcnst23).
% 189502 [para:189363.1.1,189367.2.1,cut:189330,binarycut:189357] equal(inverse(sk_c3),sk_c8) | $spltprd0($spltcnst23).
% 189511 [para:189364.2.1,189367.2.1,cut:189330,binarycut:189502] equal(multiply(sk_c1,sk_c8),sk_c7) | $spltprd0($spltcnst23).
% 189527 [para:189331.1.1,189368.2.1,cut:174187,cut:175478] $spltprd0($spltcnst24).
% 189530 [para:189511.1.1,189367.2.1,cut:189330] -equal(inverse(sk_c1),sk_c8) | $spltprd0($spltcnst23).
% 189532 [para:189353.2.1,189530.1.1,cut:189330] equal(multiply(sk_c5,sk_c8),sk_c6) | $spltprd0($spltcnst23).
% 189556 [para:189363.1.1,189369.2.1,cut:189330,binarycut:189357] equal(inverse(sk_c3),sk_c8) | $spltprd0($spltcnst25).
% 189565 [para:189364.2.1,189369.2.1,cut:189330,binarycut:189556] equal(multiply(sk_c1,sk_c8),sk_c7) | $spltprd0($spltcnst25).
% 189583 [para:189332.1.1,189333.1.1.1,demod:189331] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 189657 [para:189532.1.1,189367.2.1,cut:175519] -equal(inverse(sk_c5),sk_c8) | $spltprd0($spltcnst23).
% 189672 [para:189354.2.1,189657.1.1,cut:187800,binarycut:189530] $spltprd0($spltcnst23).
% 189683 [para:189565.1.1,189369.2.1,cut:189330] -equal(inverse(sk_c1),sk_c8) | $spltprd0($spltcnst25).
% 189686 [para:189353.2.1,189683.1.1,cut:189330] equal(multiply(sk_c5,sk_c8),sk_c6) | $spltprd0($spltcnst25).
% 189714 [para:189686.1.1,189369.2.1,cut:175519] -equal(inverse(sk_c5),sk_c8) | $spltprd0($spltcnst25).
% 189724 [para:189354.2.1,189714.1.1,cut:187800,binarycut:189683] $spltprd0($spltcnst25).
% 189725 [binary:189477,189724,cut:189527,cut:189672] -$spltprd0($spltcnst21).
% 189742 [para:189341.1.1,189583.1.2.2] equal(sk_c8,multiply(inverse(sk_c5),sk_c6)) | equal(inverse(sk_c2),sk_c7).
% 189743 [para:189344.1.1,189583.1.2.2] equal(sk_c7,multiply(inverse(sk_c4),sk_c6)) | equal(inverse(sk_c2),sk_c7).
% 189747 [para:189348.1.1,189583.1.2.2] equal(sk_c7,multiply(inverse(sk_c2),sk_c6)) | equal(inverse(sk_c5),sk_c6).
% 189748 [para:189349.1.1,189583.1.2.2] equal(sk_c7,multiply(inverse(sk_c2),sk_c6)) | equal(inverse(sk_c4),sk_c7).
% 189855 [para:189342.2.1,189742.1.2.1] equal(sk_c8,multiply(sk_c6,sk_c6)) | equal(inverse(sk_c2),sk_c7).
% 189864 [para:189343.2.1,189743.1.2.1] equal(sk_c7,multiply(sk_c7,sk_c6)) | equal(inverse(sk_c2),sk_c7).
% 189870 [para:189864.1.2,189583.1.2.2,demod:189332] equal(inverse(sk_c2),sk_c7) | equal(sk_c6,identity).
% 189877 [para:189870.1.1,189332.1.1.1] equal(multiply(sk_c7,sk_c2),identity) | equal(sk_c6,identity).
% 189883 [para:189870.2.1,189855.1.2.1,demod:189331] equal(inverse(sk_c2),sk_c7) | equal(sk_c8,sk_c6).
% 189884 [para:189870.2.1,189855.1.2.2] equal(sk_c8,multiply(sk_c6,identity)) | equal(inverse(sk_c2),sk_c7).
% 189902 [para:189883.1.1,189583.1.2.1] equal(sk_c8,sk_c6) | equal(X,multiply(sk_c7,multiply(sk_c2,X))).
% 189913 [para:189877.1.1,189583.1.2.2] equal(sk_c2,multiply(inverse(sk_c7),identity)) | equal(sk_c6,identity).
% 189955 [para:189870.2.1,189884.1.2.1,demod:189331] equal(inverse(sk_c2),sk_c7) | equal(sk_c8,identity).
% 189962 [para:189955.2.1,189383.1.1.1,demod:189331] equal(inverse(sk_c2),sk_c7) | equal(sk_c3,identity).
% 189971 [para:189962.2.1,189346.1.1.1,demod:189331] equal(inverse(sk_c2),sk_c7) | equal(sk_c8,sk_c7).
% 189990 [para:189955.2.1,189971.2.1] equal(inverse(sk_c2),sk_c7) | equal(sk_c7,identity).
% 190009 [para:189990.2.1,189379.1.1.1,demod:189331] equal(inverse(sk_c2),sk_c7) | equal(sk_c4,identity).
% 190019 [para:189343.2.1,190009.2.1.1] equal(inverse(identity),sk_c7) | equal(inverse(sk_c2),sk_c7).
% 190027 [para:190019.2.1,189332.1.1.1] equal(multiply(sk_c7,sk_c2),identity) | equal(inverse(identity),sk_c7).
% 190637 [para:189342.1.1,189747.1.2.1] equal(sk_c7,multiply(sk_c7,sk_c6)) | equal(inverse(sk_c5),sk_c6).
% 190643 [para:190637.1.2,189583.1.2.2,demod:189332] equal(inverse(sk_c5),sk_c6) | equal(sk_c6,identity).
% 190647 [para:190643.2.1,189336.1.1.1,demod:189331] equal(inverse(sk_c5),sk_c6) | equal(sk_c8,sk_c7).
% 190654 [para:190647.1.1,189332.1.1.1] equal(multiply(sk_c6,sk_c5),identity) | equal(sk_c8,sk_c7).
% 190803 [para:189343.1.1,189748.1.2.1] equal(sk_c7,multiply(sk_c7,sk_c6)) | equal(inverse(sk_c4),sk_c7).
% 190812 [para:190803.1.2,189583.1.2.2,demod:189332] equal(inverse(sk_c4),sk_c7) | equal(sk_c6,identity).
% 190816 [para:190812.1.1,189332.1.1.1] equal(multiply(sk_c7,sk_c4),identity) | equal(sk_c6,identity).
% 190842 [para:190816.1.1,189583.1.2.2] equal(sk_c4,multiply(inverse(sk_c7),identity)) | equal(sk_c6,identity).
% 190896 [para:190842.1.2,189913.1.2] equal(sk_c2,sk_c4) | equal(sk_c6,identity).
% 190909 [para:190896.1.1,189350.1.1.1] equal(multiply(sk_c4,sk_c7),sk_c6) | equal(sk_c6,identity).
% 190950 [para:190909.1.1,189583.1.2.2] equal(sk_c7,multiply(inverse(sk_c4),sk_c6)) | equal(sk_c6,identity).
% 191098 [para:190803.2.1,190950.1.2.1] equal(sk_c7,multiply(sk_c7,sk_c6)) | equal(sk_c6,identity).
% 191106 [para:191098.1.2,189583.1.2.2,demod:189332] equal(sk_c6,identity).
% 191116 [para:191106.1.1,189335.1.1.1,demod:189331] equal(multiply(sk_c5,sk_c8),sk_c6) | equal(sk_c8,sk_c7).
% 191118 [para:191106.1.1,189340.1.1.1,demod:189331] equal(multiply(sk_c3,sk_c8),sk_c7) | equal(sk_c8,sk_c7).
% 191119 [para:191106.1.1,189386.1.1.1,demod:189331] equal(inverse(sk_c1),sk_c8) | equal(sk_c5,identity).
% 191122 [para:189402.1.1,191106.2.1.1,demod:189331] equal(multiply(sk_c8,sk_c3),identity) | equal(sk_c8,sk_c7).
% 191123 [para:191106.1.1,189413.1.1.1,demod:189331] equal(multiply(sk_c2,sk_c7),sk_c6) | equal(sk_c5,identity).
% 191124 [para:191106.1.1,189427.1.1.1,demod:189331] equal(multiply(sk_c1,sk_c8),sk_c7) | equal(sk_c5,identity).
% 191130 [para:191106.1.1,190654.1.1.1,demod:189331] equal(sk_c5,identity) | equal(sk_c8,sk_c7).
% 191189 [para:191119.2.1,189353.1.1.1,demod:189331] equal(inverse(sk_c1),sk_c8) | equal(sk_c8,sk_c6).
% 191364 [para:191130.1.1,191116.1.1.1,demod:189331] equal(sk_c8,sk_c6) | equal(sk_c8,sk_c7).
% 191459 [para:191364.1.1,191122.1.1.1] equal(multiply(sk_c6,sk_c3),identity) | equal(sk_c8,sk_c7).
% 191462 [para:189347.2.1,191123.2.1.1,demod:189331] equal(multiply(sk_c2,sk_c7),sk_c6) | equal(sk_c8,sk_c6).
% 191469 [para:189359.2.1,191124.2.1.1,demod:189331] equal(multiply(sk_c1,sk_c8),sk_c7) | equal(sk_c8,sk_c6).
% 191618 [para:191106.1.1,191459.1.1.1,demod:189331] equal(sk_c3,identity) | equal(sk_c8,sk_c7).
% 191651 [para:191618.1.1,191118.1.1.1,demod:189331] equal(sk_c8,sk_c7).
% 191743 [para:189902.1.1,191462.2.2.2] equal(sk_c7,multiply(sk_c7,sk_c6)) | equal(sk_c8,sk_c6).
% 191758 [para:191469.1.1,189583.1.2.2] equal(sk_c8,multiply(inverse(sk_c1),sk_c7)) | equal(sk_c8,sk_c6).
% 191896 [para:191743.2.1,191651.1.1] equal(sk_c7,multiply(sk_c7,sk_c6)) | equal(sk_c6,sk_c7).
% 191897 [para:191651.1.1,191743.2.1] equal(sk_c7,multiply(sk_c7,sk_c6)) | equal(sk_c7,sk_c6).
% 193700 [para:191189.1.1,191758.1.2.1] equal(sk_c8,multiply(sk_c8,sk_c7)) | equal(sk_c8,sk_c6).
% 193731 [para:193700.1.2,189583.1.2.2,demod:189332] equal(sk_c7,identity) | equal(sk_c8,sk_c6).
% 193849 [para:193731.2.1,191651.1.1] equal(sk_c6,sk_c7) | equal(sk_c7,identity).
% 194021 [para:193849.1.1,191106.1.1] equal(sk_c7,identity).
% 194076 [para:194021.1.1,190027.1.1.1,demod:189331] equal(inverse(identity),sk_c7) | equal(sk_c2,identity).
% 194113 [para:194021.1.1,191897.1.2.1,demod:189331] equal(sk_c7,sk_c6).
% 195438 [para:190019.2.1,194076.2.1.1] equal(inverse(identity),sk_c7).
% 195440 [para:195438.1.1,189583.1.2.1,demod:189331] equal(X,multiply(sk_c7,X)).
% 195462 [para:191896.1.2,195440.1.2] equal(sk_c6,sk_c7).
% 195467 [para:195462.1.1,189365.1.1.1,demod:195440,cut:191651,cut:189725] -equal(multiply(X,sk_c8),sk_c6) | -equal(inverse(X),sk_c6).
% 198499 [para:189331.1.1,195467.1.1,demod:195438,cut:194113] -equal(sk_c8,sk_c6).
% 198592 [para:191651.1.1,198499.1.1,cut:194113] 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 21
% clause depth limited to 3
% seconds given: 15
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 8195
% derived clauses: 1731865
% kept clauses: 48049
% kept size sum: 746266
% kept mid-nuclei: 124034
% kept new demods: 220
% forw unit-subs: 730742
% forw double-subs: 698497
% forw overdouble-subs: 25898
% backward subs: 7036
% fast unit cutoff: 3282
% full unit cutoff: 0
% dbl unit cutoff: 18243
% real runtime : 59.96
% process. runtime: 59.95
% specific non-discr-tree subsumption statistics:
% tried: 1014983
% length fails: 61023
% strength fails: 201578
% predlist fails: 21605
% aux str. fails: 138625
% by-lit fails: 289778
% full subs tried: 146954
% full subs fail: 134274
%
% ; 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/GRP261-1+eq_r.in")
%
%------------------------------------------------------------------------------