TSTP Solution File: GRP302-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP302-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 : 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 238.5s
% Output : Assurance 238.5s
% 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/GRP302-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(sk_c8,sk_c7),sk_c6) | -equal(inverse(X),sk_c8) | -equal(multiply(X,sk_c7),sk_c8) | -equal(multiply(Y,sk_c8),sk_c6) | -equal(inverse(Y),sk_c8) | -equal(inverse(sk_c8),sk_c7) | -equal(inverse(Z),sk_c8) | -equal(multiply(Z,sk_c7),sk_c8) | -equal(inverse(U),V) | -equal(inverse(V),sk_c8) | -equal(multiply(U,sk_c8),V).
% was split for some strategies as:
% -equal(inverse(U),V) | -equal(inverse(V),sk_c8) | -equal(multiply(U,sk_c8),V).
% -equal(inverse(Z),sk_c8) | -equal(multiply(Z,sk_c7),sk_c8).
% -equal(multiply(Y,sk_c8),sk_c6) | -equal(inverse(Y),sk_c8).
% -equal(inverse(X),sk_c8) | -equal(multiply(X,sk_c7),sk_c8).
% -equal(multiply(sk_c8,sk_c7),sk_c6).
% -equal(inverse(sk_c8),sk_c7).
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(30,40,0,65,0,0,89776,5,1501,89776,1,1501,89776,50,1501,89776,40,1501,89811,0,1501,102080,3,1802,102768,4,1952,103374,1,2102,103374,50,2102,103374,40,2102,103409,0,2102,103932,3,2407,103949,4,2568,103959,5,2703,103959,1,2703,103959,50,2703,103959,40,2703,103994,0,2703,137718,3,4205,137948,4,4954,138305,1,5704,138305,50,5705,138305,40,5705,138340,0,5705,163114,3,6456,163587,4,6831,164091,5,7206,164092,1,7206,164092,50,7207,164092,40,7207,164127,0,7207,178491,3,7999,179396,4,8333,180418,5,8708,180419,1,8708,180419,50,8708,180419,40,8708,180454,0,8708,250184,3,12610,251393,4,14559,252563,1,16509,252563,50,16511,252563,40,16511,252598,0,16511,313593,3,19064,314533,4,20337,315404,5,21612,315405,1,21612,315405,50,21614,315405,40,21614,315440,0,21614,355674,3,23116,356708,4,23865,357781,5,24615,357782,1,24615,357782,50,24617,357782,40,24617,357817,0,24617)
%
%
% START OF PROOF
% 321542 [?] ?
% 321617 [?] ?
% 357783 [] equal(X,X).
% 357784 [] equal(multiply(identity,X),X).
% 357785 [] equal(multiply(inverse(X),X),identity).
% 357786 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 357793 [] equal(inverse(sk_c2),sk_c8) | equal(inverse(sk_c8),sk_c7).
% 357795 [] equal(multiply(sk_c2,sk_c8),sk_c6) | equal(inverse(sk_c4),sk_c8).
% 357796 [] equal(multiply(sk_c2,sk_c8),sk_c6) | equal(inverse(sk_c5),sk_c4).
% 357799 [] equal(multiply(sk_c2,sk_c8),sk_c6) | equal(inverse(sk_c8),sk_c7).
% 357800 [] equal(multiply(sk_c1,sk_c7),sk_c8) | equal(multiply(sk_c5,sk_c8),sk_c4).
% 357801 [] equal(multiply(sk_c1,sk_c7),sk_c8) | equal(inverse(sk_c4),sk_c8).
% 357802 [] equal(multiply(sk_c1,sk_c7),sk_c8) | equal(inverse(sk_c5),sk_c4).
% 357804 [] equal(multiply(sk_c1,sk_c7),sk_c8) | equal(inverse(sk_c3),sk_c8).
% 357806 [] equal(multiply(sk_c5,sk_c8),sk_c4) | equal(inverse(sk_c1),sk_c8).
% 357807 [] equal(inverse(sk_c1),sk_c8) | equal(inverse(sk_c4),sk_c8).
% 357808 [] equal(inverse(sk_c1),sk_c8) | equal(inverse(sk_c5),sk_c4).
% 357810 [] equal(inverse(sk_c1),sk_c8) | equal(inverse(sk_c3),sk_c8).
% 357812 [] equal(multiply(sk_c8,sk_c7),sk_c6).
% 357813 [?] ?
% 357814 [] $spltprd0($spltcnst38) | -equal(multiply(X,sk_c7),sk_c8) | -equal(inverse(X),sk_c8).
% 357815 [] $spltprd0($spltcnst39) | -equal(multiply(X,sk_c8),sk_c6) | -equal(inverse(X),sk_c8).
% 357816 [] $spltprd0($spltcnst40) | -equal(multiply(X,sk_c7),sk_c8) | -equal(inverse(X),sk_c8).
% 357817 [] -$spltprd0($spltcnst38) | -$spltprd0($spltcnst37) | -$spltprd0($spltcnst40) | -$spltprd0($spltcnst39).
% 357944 [input:357813,cut:357783] -equal(inverse(sk_c8),sk_c7) | $spltprd0($spltcnst37) | -equal(multiply(X,sk_c8),Y) | -equal(inverse(Y),sk_c8) | -equal(inverse(X),Y).
% 358034 [para:357810.1.1,357814.3.1,cut:357783,binarycut:357804] equal(inverse(sk_c3),sk_c8) | $spltprd0($spltcnst38).
% 358045 [?] ?
% 358079 [para:358034.1.1,357814.3.1,cut:357783,binarycut:358045] $spltprd0($spltcnst38).
% 358082 [para:357785.1.1,357815.2.1,cut:321617] -equal(inverse(inverse(sk_c8)),sk_c8) | $spltprd0($spltcnst39).
% 358094 [para:357793.1.1,357815.3.1,cut:357783,binarycut:357799] equal(inverse(sk_c8),sk_c7) | $spltprd0($spltcnst39).
% 358107 [binary:357817,358079] -$spltprd0($spltcnst40) | -$spltprd0($spltcnst39) | -$spltprd0($spltcnst37).
% 358145 [para:357810.1.1,357816.3.1,cut:357783,binarycut:357804] equal(inverse(sk_c3),sk_c8) | $spltprd0($spltcnst40).
% 358155 [?] ?
% 358192 [para:357785.1.1,357786.1.1.1,demod:357784] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 358201 [para:357801.1.1,357786.1.1.1] equal(inverse(sk_c4),sk_c8) | equal(multiply(sk_c8,X),multiply(sk_c1,multiply(sk_c7,X))).
% 358202 [para:357802.1.1,357786.1.1.1] equal(inverse(sk_c5),sk_c4) | equal(multiply(sk_c8,X),multiply(sk_c1,multiply(sk_c7,X))).
% 358258 [para:358145.1.1,357816.3.1,cut:357783,binarycut:358155] $spltprd0($spltcnst40).
% 358380 [binary:358107,358258] -$spltprd0($spltcnst39) | -$spltprd0($spltcnst37).
% 358385 [para:358094.1.1,358082.1.1.1,cut:321542] $spltprd0($spltcnst39).
% 358454 [binary:358380,358385] -$spltprd0($spltcnst37).
% 358973 [para:357812.1.1,358192.1.2.2] equal(sk_c7,multiply(inverse(sk_c8),sk_c6)).
% 358974 [para:357785.1.1,358192.1.2.2] equal(X,multiply(inverse(inverse(X)),identity)).
% 359014 [para:358192.1.2,358192.1.2.2] equal(multiply(X,Y),multiply(inverse(inverse(X)),Y)).
% 359088 [para:359014.1.2,357785.1.1] equal(multiply(X,inverse(X)),identity).
% 359124 [para:359014.1.2,358974.1.2] equal(X,multiply(X,identity)).
% 359126 [para:359124.1.2,358974.1.2] equal(X,inverse(inverse(X))).
% 359193 [para:357807.1.1,359126.1.2.1] equal(sk_c1,inverse(sk_c8)) | equal(inverse(sk_c4),sk_c8).
% 359202 [para:359126.1.2,357944.5.1,cut:358454,factor:cut:321542] -equal(multiply(sk_c8,sk_c8),sk_c7) | -equal(inverse(sk_c8),sk_c7).
% 359248 [para:357793.2.1,359088.1.1.2,demod:357812] equal(inverse(sk_c2),sk_c8) | equal(sk_c6,identity).
% 359275 [para:359248.1.1,359088.1.1.2] equal(multiply(sk_c2,sk_c8),identity) | equal(sk_c6,identity).
% 362910 [para:357795.1.1,359275.1.1] equal(inverse(sk_c4),sk_c8) | equal(sk_c6,identity).
% 362912 [?] ?
% 362914 [para:357796.1.1,359275.1.1] equal(inverse(sk_c5),sk_c4) | equal(sk_c6,identity).
% 362918 [?] ?
% 362973 [binary:357944.5,362914,cut:358454,binarycut:362912,binarycut:362918,binarycut:362910] equal(sk_c6,identity).
% 362988 [para:362973.1.1,358973.1.2.2,demod:359124] equal(sk_c7,inverse(sk_c8)).
% 363010 [para:362988.1.2,358973.1.2.1] equal(sk_c7,multiply(sk_c7,sk_c6)).
% 363011 [para:362988.1.2,358974.1.2.1.1,demod:359124] equal(sk_c8,inverse(sk_c7)).
% 363031 [para:362988.1.2,359193.1.2] equal(inverse(sk_c4),sk_c8) | equal(sk_c1,sk_c7).
% 363686 [binary:357808.2,357944.5,binarycut:357806,cut:358454] -equal(inverse(sk_c4),sk_c8) | -equal(inverse(sk_c8),sk_c7) | equal(inverse(sk_c1),sk_c8).
% 363689 [para:357807.2.1,363686.1.1,demod:362988,cut:357783,cut:357783] equal(inverse(sk_c1),sk_c8).
% 363693 [para:363686.3.1,358974.1.2.1.1,demod:359124,362988,cut:357783,binarycut:363031] equal(sk_c1,sk_c7).
% 363720 [para:363693.1.2,363010.1.2.1] equal(sk_c7,multiply(sk_c1,sk_c6)).
% 363744 [para:362973.1.1,363720.1.2.2,demod:359124] equal(sk_c7,sk_c1).
% 364423 [para:357800.2.1,357944.3.1,cut:358454] equal(multiply(sk_c1,sk_c7),sk_c8) | -equal(inverse(sk_c8),sk_c7) | -equal(inverse(X),sk_c8) | -equal(inverse(sk_c5),X) | -equal(sk_c4,X).
% 364531 [para:363693.1.2,359202.1.2,demod:362988,cut:357783] -equal(multiply(sk_c8,sk_c8),sk_c1).
% 364607 [para:359088.1.1,358201.2.2.2,demod:359124,363011,cut:364531] equal(inverse(sk_c4),sk_c8).
% 364653 [para:359088.1.1,358202.2.2.2,demod:359124,363011,cut:364531] equal(inverse(sk_c5),sk_c4).
% 364664 [para:364653.1.1,358974.1.2.1.1,demod:359124,364607] equal(sk_c5,sk_c8).
% 364665 [para:364653.1.1,359014.1.2.1.1,demod:364607] equal(multiply(sk_c5,X),multiply(sk_c8,X)).
% 364674 [binary:364423.4,364653,demod:362988,364607,cut:357783,cut:357783,cut:357783] equal(multiply(sk_c1,sk_c7),sk_c8).
% 364705 [para:364664.1.2,359202.1.1.1,demod:362988,cut:357783] -equal(multiply(sk_c5,sk_c8),sk_c7).
% 364715 [para:364674.1.1,358192.1.2.2,demod:364665,363689] equal(sk_c7,multiply(sk_c5,sk_c8)).
% 364721 [para:363693.1.2,364705.1.2,demod:364715,cut:363744] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using term-depth-order 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
% seconds given: 15
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 20923
% derived clauses: 5843332
% kept clauses: 250214
% kept size sum: 640245
% kept mid-nuclei: 89774
% kept new demods: 727
% forw unit-subs: 1615002
% forw double-subs: 2825009
% forw overdouble-subs: 428296
% backward subs: 7162
% fast unit cutoff: 26838
% full unit cutoff: 0
% dbl unit cutoff: 1574
% real runtime : 250.0
% process. runtime: 248.29
% specific non-discr-tree subsumption statistics:
% tried: 7249271
% length fails: 857222
% strength fails: 1646250
% predlist fails: 184738
% aux str. fails: 534722
% by-lit fails: 701293
% full subs tried: 677122
% full subs fail: 577017
%
% ; 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/GRP302-1+eq_r.in")
%
%------------------------------------------------------------------------------