TSTP Solution File: GRP343-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP343-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 : art03.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 238.9s
% Output : Assurance 238.9s
% 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/GRP343-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 25)
% (binary-unit 12 #f)
% (binary-unit-uniteq 12 #f)
% (binary-posweight-kb-big-order 60 #f 3 25)
% (binary-posweight-lex-big-order 30 #f 3 25)
% (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_c8,sk_c9),sk_c7) | -equal(inverse(X),sk_c9) | -equal(multiply(X,sk_c8),sk_c9) | -equal(inverse(Y),sk_c8) | -equal(multiply(Y,sk_c7),sk_c8) | -equal(multiply(Z,sk_c9),sk_c8) | -equal(inverse(Z),sk_c9) | -equal(multiply(sk_c9,sk_c7),sk_c8) | -equal(multiply(U,sk_c8),sk_c9) | -equal(inverse(U),sk_c8) | -equal(inverse(V),W) | -equal(inverse(W),sk_c9) | -equal(multiply(V,sk_c9),W).
% was split for some strategies as:
% -equal(inverse(V),W) | -equal(inverse(W),sk_c9) | -equal(multiply(V,sk_c9),W).
% -equal(multiply(U,sk_c8),sk_c9) | -equal(inverse(U),sk_c8).
% -equal(multiply(Z,sk_c9),sk_c8) | -equal(inverse(Z),sk_c9).
% -equal(inverse(Y),sk_c8) | -equal(multiply(Y,sk_c7),sk_c8).
% -equal(inverse(X),sk_c9) | -equal(multiply(X,sk_c8),sk_c9).
% -equal(multiply(sk_c8,sk_c9),sk_c7).
% -equal(multiply(sk_c9,sk_c7),sk_c8).
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(38,40,0,82,0,1,238315,5,1502,238316,1,1502,238316,50,1502,238316,40,1502,238360,0,1502,246994,3,1815,247936,4,1953,248857,5,2103,248858,1,2103,248858,50,2103,248858,40,2103,248902,0,2103,250379,3,2406,250534,4,2577,250593,5,2704,250593,1,2704,250593,50,2704,250593,40,2704,250637,0,2704,284877,3,4205,285747,4,4955,286593,5,5705,286594,1,5705,286594,50,5706,286594,40,5706,286638,0,5706,308868,3,6457,309444,4,6832,310085,5,7207,310086,1,7207,310086,50,7208,310086,40,7208,310130,0,7208,325391,3,7985,325948,4,8334,326694,1,8709,326694,50,8709,326694,40,8709,326738,0,8709,439672,3,12610,440662,4,14561,441659,5,16510,441660,1,16510,441660,50,16513,441660,40,16513,441704,0,16513,489614,3,19077,490090,4,20339,490646,1,21614,490646,50,21616,490646,40,21616,490690,0,21616,518489,3,23117,519154,4,23867)
%
%
% START OF PROOF
% 488277 [?] ?
% 488828 [?] ?
% 489160 [?] ?
% 489211 [?] ?
% 489253 [?] ?
% 489320 [?] ?
% 489595 [?] ?
% 490647 [] equal(X,X).
% 490648 [] equal(multiply(identity,X),X).
% 490649 [] equal(multiply(inverse(X),X),identity).
% 490650 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 490657 [] equal(multiply(sk_c2,sk_c7),sk_c8) | equal(multiply(sk_c9,sk_c7),sk_c8).
% 490661 [] equal(inverse(sk_c2),sk_c8) | equal(inverse(sk_c5),sk_c9).
% 490662 [] equal(inverse(sk_c2),sk_c8) | equal(inverse(sk_c6),sk_c5).
% 490663 [] equal(inverse(sk_c2),sk_c8) | equal(inverse(sk_c4),sk_c8).
% 490664 [] equal(multiply(sk_c4,sk_c8),sk_c9) | equal(inverse(sk_c2),sk_c8).
% 490666 [] equal(inverse(sk_c2),sk_c8) | equal(inverse(sk_c3),sk_c9).
% 490673 [] equal(multiply(sk_c1,sk_c8),sk_c9) | equal(multiply(sk_c9,sk_c7),sk_c8).
% 490679 [] equal(inverse(sk_c1),sk_c9) | equal(inverse(sk_c4),sk_c8).
% 490680 [] equal(multiply(sk_c4,sk_c8),sk_c9) | equal(inverse(sk_c1),sk_c9).
% 490683 [] equal(multiply(sk_c3,sk_c9),sk_c8) | equal(inverse(sk_c1),sk_c9).
% 490684 [] equal(multiply(sk_c8,sk_c9),sk_c7).
% 490685 [?] ?
% 490686 [] $spltprd0($spltcnst42) | -equal(multiply(X,sk_c8),sk_c9) | -equal(inverse(X),sk_c8).
% 490687 [] $spltprd0($spltcnst43) | -equal(multiply(X,sk_c9),sk_c8) | -equal(inverse(X),sk_c9).
% 490688 [] $spltprd0($spltcnst44) | -equal(multiply(X,sk_c7),sk_c8) | -equal(inverse(X),sk_c8).
% 490689 [] $spltprd0($spltcnst45) | -equal(multiply(X,sk_c8),sk_c9) | -equal(inverse(X),sk_c9).
% 490690 [] -$spltprd0($spltcnst42) | -$spltprd0($spltcnst41) | -$spltprd0($spltcnst43) | -$spltprd0($spltcnst45) | -$spltprd0($spltcnst44).
% 490701 [para:490663.2.1,490649.1.1.1] equal(multiply(sk_c8,sk_c4),identity) | equal(inverse(sk_c2),sk_c8).
% 490714 [para:490679.2.1,490649.1.1.1] equal(multiply(sk_c8,sk_c4),identity) | equal(inverse(sk_c1),sk_c9).
% 490785 [input:490685,cut:490647] -equal(multiply(sk_c9,sk_c7),sk_c8) | $spltprd0($spltcnst41) | -equal(multiply(X,sk_c9),Y) | -equal(inverse(Y),sk_c9) | -equal(inverse(X),Y).
% 490891 [para:490684.1.1,490650.1.1.1] equal(multiply(sk_c7,X),multiply(sk_c8,multiply(sk_c9,X))).
% 490892 [para:490649.1.1,490650.1.1.1,demod:490648] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 490926 [para:490701.1.1,490650.1.1.1,demod:490648] equal(inverse(sk_c2),sk_c8) | equal(X,multiply(sk_c8,multiply(sk_c4,X))).
% 490938 [para:490714.1.1,490650.1.1.1,demod:490648] equal(inverse(sk_c1),sk_c9) | equal(X,multiply(sk_c8,multiply(sk_c4,X))).
% 490998 [para:490648.1.1,490892.1.2.2] equal(X,multiply(inverse(identity),X)).
% 490999 [para:490684.1.1,490892.1.2.2] equal(sk_c9,multiply(inverse(sk_c8),sk_c7)).
% 491000 [para:490649.1.1,490892.1.2.2] equal(X,multiply(inverse(inverse(X)),identity)).
% 491083 [para:490892.1.2,490650.1.1.1] equal(multiply(X,Y),multiply(inverse(Z),multiply(multiply(Z,X),Y))).
% 491105 [para:490998.1.2,490892.1.2.2] equal(X,multiply(inverse(inverse(identity)),X)).
% 491141 [para:491000.1.2,490892.1.2.2] equal(identity,multiply(inverse(inverse(inverse(X))),X)).
% 491142 [para:491105.1.2,490649.1.1] equal(inverse(identity),identity).
% 491143 [para:491105.1.2,490686.2.1,demod:491142,cut:488828,cut:489320] $spltprd0($spltcnst42).
% 491144 [para:491105.1.2,490687.2.1,demod:491142,cut:488277,cut:489160] $spltprd0($spltcnst43).
% 491145 [para:491105.1.2,490688.2.1,demod:491142,cut:489211,cut:489320] $spltprd0($spltcnst44).
% 491146 [para:491105.1.2,490689.2.1,demod:491142,cut:488828,cut:489160] $spltprd0($spltcnst45).
% 491148 [binary:490690,491143,cut:491144,cut:491146,cut:491145] -$spltprd0($spltcnst41).
% 491208 [para:491141.1.2,490892.1.2.2,demod:491000] equal(X,inverse(inverse(X))).
% 491209 [para:491208.1.2,490649.1.1.1] equal(multiply(X,inverse(X)),identity).
% 491210 [para:490661.1.1,491208.1.2.1] equal(sk_c2,inverse(sk_c8)) | equal(inverse(sk_c5),sk_c9).
% 491211 [para:490661.2.1,491208.1.2.1] equal(sk_c5,inverse(sk_c9)) | equal(inverse(sk_c2),sk_c8).
% 491212 [para:490662.1.1,491208.1.2.1] equal(sk_c2,inverse(sk_c8)) | equal(inverse(sk_c6),sk_c5).
% 491213 [para:490662.2.1,491208.1.2.1] equal(sk_c6,inverse(sk_c5)) | equal(inverse(sk_c2),sk_c8).
% 491217 [para:490666.2.1,491208.1.2.1] equal(sk_c3,inverse(sk_c9)) | equal(inverse(sk_c2),sk_c8).
% 491259 [para:491208.1.2,491000.1.2.1] equal(X,multiply(X,identity)).
% 491372 [para:491210.2.1,491000.1.2.1.1,demod:491259] equal(sk_c5,inverse(sk_c9)) | equal(sk_c2,inverse(sk_c8)).
% 491389 [para:491212.2.1,491000.1.2.1.1,demod:491259] equal(sk_c6,inverse(sk_c5)) | equal(sk_c2,inverse(sk_c8)).
% 491396 [para:490661.1.2,491213.2.1] equal(inverse(sk_c2),sk_c8) | equal(sk_c6,sk_c9).
% 491420 [para:491396.1.1,491000.1.2.1.1,demod:491259] equal(sk_c2,inverse(sk_c8)) | equal(sk_c6,sk_c9).
% 491537 [para:491217.1.2,491211.1.2] equal(inverse(sk_c2),sk_c8) | equal(sk_c5,sk_c3).
% 491545 [para:491537.1.1,491000.1.2.1.1,demod:491259] equal(sk_c2,inverse(sk_c8)) | equal(sk_c5,sk_c3).
% 491819 [para:491372.1.2,491000.1.2.1.1,demod:491259] equal(sk_c9,inverse(sk_c5)) | equal(sk_c2,inverse(sk_c8)).
% 491823 [para:491420.2.2,491372.1.2.1] equal(sk_c5,inverse(sk_c6)) | equal(sk_c2,inverse(sk_c8)).
% 491863 [para:491545.2.1,491389.1.2.1] equal(sk_c6,inverse(sk_c3)) | equal(sk_c2,inverse(sk_c8)).
% 492046 [para:490657.2.1,490785.1.1,cut:490647,cut:491148] equal(multiply(sk_c2,sk_c7),sk_c8) | -equal(multiply(X,sk_c9),Y) | -equal(inverse(Y),sk_c9) | -equal(inverse(X),Y).
% 492052 [binary:490649,492046.2,demod:491208,491142,cut:489160,cut:489253] equal(multiply(sk_c2,sk_c7),sk_c8).
% 492125 [para:491819.2.2,490999.1.2.1,demod:492052] equal(sk_c9,inverse(sk_c5)) | equal(sk_c9,sk_c8).
% 492216 [para:490673.2.1,490785.1.1,cut:490647,cut:491148] equal(multiply(sk_c1,sk_c8),sk_c9) | -equal(multiply(X,sk_c9),Y) | -equal(inverse(Y),sk_c9) | -equal(inverse(X),Y).
% 492222 [binary:490649,492216.2,demod:491208,491142,cut:489160,cut:489253] equal(multiply(sk_c1,sk_c8),sk_c9).
% 492224 [para:492222.1.1,490892.1.2.2] equal(sk_c8,multiply(inverse(sk_c1),sk_c9)).
% 492409 [para:491823.2.2,490999.1.2.1,demod:492052] equal(sk_c5,inverse(sk_c6)) | equal(sk_c9,sk_c8).
% 492434 [para:492409.1.2,491000.1.2.1.1,demod:491259] equal(sk_c6,inverse(sk_c5)) | equal(sk_c9,sk_c8).
% 492536 [para:492434.1.2,492125.1.2] equal(sk_c9,sk_c6) | equal(sk_c9,sk_c8).
% 498425 [para:491209.1.1,490891.1.2.2,demod:491259] equal(multiply(sk_c7,inverse(sk_c9)),sk_c8).
% 498580 [para:498425.1.1,490892.1.2.2] equal(inverse(sk_c9),multiply(inverse(sk_c7),sk_c8)).
% 498757 [para:491863.2.2,490999.1.2.1,demod:492052] equal(sk_c6,inverse(sk_c3)) | equal(sk_c9,sk_c8).
% 498785 [para:498757.1.2,491000.1.2.1.1,demod:491259] equal(sk_c3,inverse(sk_c6)) | equal(sk_c9,sk_c8).
% 499069 [para:492536.1.2,498785.1.2.1] equal(sk_c3,inverse(sk_c9)) | equal(sk_c9,sk_c8).
% 502899 [para:490664.1.1,490926.2.2.2,demod:490684] equal(inverse(sk_c2),sk_c8) | equal(sk_c8,sk_c7).
% 502920 [para:502899.1.1,491000.1.2.1.1,demod:491259] equal(sk_c2,inverse(sk_c8)) | equal(sk_c8,sk_c7).
% 502975 [para:502920.1.2,490999.1.2.1,demod:492052] equal(sk_c9,sk_c8) | equal(sk_c8,sk_c7).
% 503047 [para:502975.2.1,490999.1.2.1.1,demod:490649] equal(sk_c9,identity) | equal(sk_c9,sk_c8).
% 503286 [para:503047.1.1,492224.1.2.2,demod:491259] equal(sk_c8,inverse(sk_c1)) | equal(sk_c9,sk_c8).
% 503308 [para:503047.1.1,499069.1.2.1,demod:491142] equal(sk_c3,identity) | equal(sk_c9,sk_c8).
% 504635 [para:503308.1.1,490683.1.1.1,demod:490648] equal(inverse(sk_c1),sk_c9) | equal(sk_c9,sk_c8).
% 510228 [para:490680.1.1,490938.2.2.2,demod:490684] equal(inverse(sk_c1),sk_c9) | equal(sk_c8,sk_c7).
% 510491 [para:504635.1.1,503286.1.2] equal(sk_c8,sk_c9) | equal(sk_c9,sk_c8).
% 510600 [para:510491.1.2,492536.1.1] equal(sk_c8,sk_c6) | equal(sk_c9,sk_c8).
% 510861 [para:510600.1.2,492536.1.2] equal(sk_c9,sk_c8).
% 510947 [para:510861.1.2,490684.1.1.1] equal(multiply(sk_c9,sk_c9),sk_c7).
% 510961 [para:510861.1.2,490785.1.2,cut:489595,cut:491148] -equal(multiply(X,sk_c9),Y) | -equal(inverse(Y),sk_c9) | -equal(inverse(X),Y).
% 511100 [para:510861.1.1,498425.1.1.2.1] equal(multiply(sk_c7,inverse(sk_c8)),sk_c8).
% 511822 [para:511100.1.1,490892.1.2.2,demod:498580] equal(inverse(sk_c8),inverse(sk_c9)).
% 511863 [para:511822.1.1,491209.1.1.2] equal(multiply(sk_c8,inverse(sk_c9)),identity).
% 517519 [para:510228.1.1,492224.1.2.1,demod:510947] equal(sk_c8,sk_c7).
% 517592 [para:517519.1.1,490999.1.2.1.1,demod:490649] equal(sk_c9,identity).
% 517619 [para:517519.1.2,498425.1.1.1,demod:511863] equal(identity,sk_c8).
% 517694 [para:517592.1.2,490648.1.1.1] equal(multiply(sk_c9,X),X).
% 517854 [para:510861.1.2,517619.1.2] equal(identity,sk_c9).
% 518165 [para:491209.1.1,491083.1.2.2,demod:491259] equal(multiply(X,inverse(multiply(Y,X))),inverse(Y)).
% 519112 [para:518165.1.2,490649.1.1.1] equal(multiply(multiply(X,inverse(multiply(Y,X))),Y),identity).
% 519207 [binary:519112,510961,demod:491209,517694,491142,cut:517854,cut:490647] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using first neg lit preferred strategy
% not using sos strategy
% using unit paramodulation strategy
% using unit strategy
% using dynamic demodulation
% using ordered paramodulation
% using first arg depth ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 30
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 18344
% derived clauses: 4546507
% kept clauses: 223728
% kept size sum: 0
% kept mid-nuclei: 230901
% kept new demods: 605
% forw unit-subs: 1530409
% forw double-subs: 1856030
% forw overdouble-subs: 228645
% backward subs: 11401
% fast unit cutoff: 14055
% full unit cutoff: 0
% dbl unit cutoff: 9404
% real runtime : 240.39
% process. runtime: 239.4
% specific non-discr-tree subsumption statistics:
% tried: 14588145
% length fails: 2064036
% strength fails: 3270019
% predlist fails: 416210
% aux str. fails: 1992592
% by-lit fails: 1354949
% full subs tried: 1344634
% full subs fail: 1217564
%
% ; 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/GRP343-1+eq_r.in")
%
%------------------------------------------------------------------------------