TSTP Solution File: GRP244-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP244-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 : art06.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 0.0s
% Output : Assurance 0.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/GRP244-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 29)
% (binary-unit 12 #f)
% (binary-unit-uniteq 12 #f)
% (binary-posweight-kb-big-order 60 #f 3 29)
% (binary-posweight-lex-big-order 30 #f 3 29)
% (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_c11),sk_c10) | -equal(inverse(X),sk_c11) | -equal(multiply(Y,sk_c10),sk_c9) | -equal(inverse(Y),sk_c10) | -equal(inverse(Z),sk_c11) | -equal(multiply(Z,sk_c10),sk_c11) | -equal(multiply(U,sk_c11),sk_c10) | -equal(inverse(U),sk_c11) | -equal(multiply(V,sk_c10),sk_c9) | -equal(inverse(V),sk_c10) | -equal(inverse(W),sk_c11) | -equal(multiply(W,sk_c10),sk_c11) | -equal(multiply(X1,X2),sk_c10) | -equal(inverse(X1),X2) | -equal(multiply(X2,sk_c9),sk_c10).
% was split for some strategies as:
% -equal(multiply(X1,X2),sk_c10) | -equal(inverse(X1),X2) | -equal(multiply(X2,sk_c9),sk_c10).
% -equal(inverse(W),sk_c11) | -equal(multiply(W,sk_c10),sk_c11).
% -equal(multiply(V,sk_c10),sk_c9) | -equal(inverse(V),sk_c10).
% -equal(multiply(U,sk_c11),sk_c10) | -equal(inverse(U),sk_c11).
% -equal(inverse(Z),sk_c11) | -equal(multiply(Z,sk_c10),sk_c11).
% -equal(multiply(Y,sk_c10),sk_c9) | -equal(inverse(Y),sk_c10).
% -equal(multiply(X,sk_c11),sk_c10) | -equal(inverse(X),sk_c11).
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(59,40,0,126,0,0)
%
%
% START OF PROOF
% 60 [] equal(X,X).
% 61 [] equal(multiply(identity,X),X).
% 62 [] equal(multiply(inverse(X),X),identity).
% 63 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 64 [] -equal(multiply(X1,sk_c9),sk_c10) | -equal(multiply(V,sk_c10),sk_c11) | -equal(multiply(W,sk_c10),sk_c9) | -equal(multiply(Z,sk_c10),sk_c11) | -equal(multiply(U,sk_c11),sk_c10) | -equal(multiply(X,sk_c10),sk_c9) | -equal(multiply(Y,sk_c11),sk_c10) | -equal(multiply(X2,X1),sk_c10) | -equal(inverse(W),sk_c10) | -equal(inverse(V),sk_c11) | -equal(inverse(U),sk_c11) | -equal(inverse(X),sk_c10) | -equal(inverse(Z),sk_c11) | -equal(inverse(Y),sk_c11) | -equal(inverse(X2),X1).
% 65 [] equal(multiply(sk_c3,sk_c10),sk_c11) | equal(multiply(sk_c8,sk_c9),sk_c10).
% 66 [] equal(multiply(sk_c3,sk_c10),sk_c11) | equal(inverse(sk_c7),sk_c8).
% 67 [] equal(multiply(sk_c3,sk_c10),sk_c11) | equal(multiply(sk_c7,sk_c8),sk_c10).
% 68 [] equal(multiply(sk_c3,sk_c10),sk_c11) | equal(multiply(sk_c6,sk_c10),sk_c11).
% 69 [] equal(multiply(sk_c3,sk_c10),sk_c11) | equal(inverse(sk_c6),sk_c11).
% 70 [] equal(multiply(sk_c3,sk_c10),sk_c11) | equal(inverse(sk_c5),sk_c10).
% 71 [] equal(multiply(sk_c3,sk_c10),sk_c11) | equal(multiply(sk_c5,sk_c10),sk_c9).
% 72 [] equal(multiply(sk_c3,sk_c10),sk_c11) | equal(inverse(sk_c4),sk_c11).
% 73 [] equal(multiply(sk_c3,sk_c10),sk_c11) | equal(multiply(sk_c4,sk_c11),sk_c10).
% 74 [?] ?
% 75 [] equal(inverse(sk_c3),sk_c11) | equal(inverse(sk_c7),sk_c8).
% 76 [?] ?
% 77 [?] ?
% 78 [] equal(inverse(sk_c3),sk_c11) | equal(inverse(sk_c6),sk_c11).
% 79 [] equal(inverse(sk_c3),sk_c11) | equal(inverse(sk_c5),sk_c10).
% 80 [?] ?
% 81 [] equal(inverse(sk_c3),sk_c11) | equal(inverse(sk_c4),sk_c11).
% 82 [?] ?
% 83 [] equal(multiply(sk_c8,sk_c9),sk_c10) | equal(inverse(sk_c2),sk_c10).
% 84 [] equal(inverse(sk_c2),sk_c10) | equal(inverse(sk_c7),sk_c8).
% 85 [] equal(multiply(sk_c7,sk_c8),sk_c10) | equal(inverse(sk_c2),sk_c10).
% 86 [] equal(multiply(sk_c6,sk_c10),sk_c11) | equal(inverse(sk_c2),sk_c10).
% 87 [] equal(inverse(sk_c2),sk_c10) | equal(inverse(sk_c6),sk_c11).
% 88 [] equal(inverse(sk_c2),sk_c10) | equal(inverse(sk_c5),sk_c10).
% 89 [] equal(multiply(sk_c5,sk_c10),sk_c9) | equal(inverse(sk_c2),sk_c10).
% 90 [] equal(inverse(sk_c2),sk_c10) | equal(inverse(sk_c4),sk_c11).
% 91 [] equal(multiply(sk_c4,sk_c11),sk_c10) | equal(inverse(sk_c2),sk_c10).
% 92 [] equal(multiply(sk_c2,sk_c10),sk_c9) | equal(multiply(sk_c8,sk_c9),sk_c10).
% 93 [] equal(multiply(sk_c2,sk_c10),sk_c9) | equal(inverse(sk_c7),sk_c8).
% 94 [] equal(multiply(sk_c2,sk_c10),sk_c9) | equal(multiply(sk_c7,sk_c8),sk_c10).
% 95 [] equal(multiply(sk_c2,sk_c10),sk_c9) | equal(multiply(sk_c6,sk_c10),sk_c11).
% 96 [] equal(multiply(sk_c2,sk_c10),sk_c9) | equal(inverse(sk_c6),sk_c11).
% 97 [] equal(multiply(sk_c2,sk_c10),sk_c9) | equal(inverse(sk_c5),sk_c10).
% 98 [] equal(multiply(sk_c2,sk_c10),sk_c9) | equal(multiply(sk_c5,sk_c10),sk_c9).
% 99 [] equal(multiply(sk_c2,sk_c10),sk_c9) | equal(inverse(sk_c4),sk_c11).
% 100 [] equal(multiply(sk_c2,sk_c10),sk_c9) | equal(multiply(sk_c4,sk_c11),sk_c10).
% 101 [?] ?
% 102 [] equal(inverse(sk_c1),sk_c11) | equal(inverse(sk_c7),sk_c8).
% 103 [?] ?
% 108 [] equal(inverse(sk_c1),sk_c11) | equal(inverse(sk_c4),sk_c11).
% 109 [?] ?
% 110 [] equal(multiply(sk_c1,sk_c11),sk_c10) | equal(multiply(sk_c8,sk_c9),sk_c10).
% 111 [] equal(multiply(sk_c1,sk_c11),sk_c10) | equal(inverse(sk_c7),sk_c8).
% 112 [] equal(multiply(sk_c1,sk_c11),sk_c10) | equal(multiply(sk_c7,sk_c8),sk_c10).
% 113 [] equal(multiply(sk_c1,sk_c11),sk_c10) | equal(multiply(sk_c6,sk_c10),sk_c11).
% 114 [] equal(multiply(sk_c1,sk_c11),sk_c10) | equal(inverse(sk_c6),sk_c11).
% 115 [] equal(multiply(sk_c1,sk_c11),sk_c10) | equal(inverse(sk_c5),sk_c10).
% 116 [] equal(multiply(sk_c1,sk_c11),sk_c10) | equal(multiply(sk_c5,sk_c10),sk_c9).
% 117 [] equal(multiply(sk_c1,sk_c11),sk_c10) | equal(inverse(sk_c4),sk_c11).
% 118 [] equal(multiply(sk_c1,sk_c11),sk_c10) | equal(multiply(sk_c4,sk_c11),sk_c10).
% 119 [] $spltprd0($spltcnst1) | -equal(multiply(X,sk_c9),sk_c10) | -equal(multiply(Y,X),sk_c10) | -equal(inverse(Y),X).
% 120 [] $spltprd0($spltcnst2) | -equal(multiply(X,sk_c10),sk_c11) | -equal(inverse(X),sk_c11).
% 121 [] $spltprd0($spltcnst3) | -equal(multiply(X,sk_c10),sk_c9) | -equal(inverse(X),sk_c10).
% 122 [] $spltprd0($spltcnst4) | -equal(multiply(X,sk_c11),sk_c10) | -equal(inverse(X),sk_c11).
% 123 [] $spltprd0($spltcnst5) | -equal(multiply(X,sk_c10),sk_c11) | -equal(inverse(X),sk_c11).
% 124 [] $spltprd0($spltcnst6) | -equal(multiply(X,sk_c10),sk_c9) | -equal(inverse(X),sk_c10).
% 125 [] $spltprd0($spltcnst7) | -equal(multiply(X,sk_c11),sk_c10) | -equal(inverse(X),sk_c11).
% 126 [] -$spltprd0($spltcnst2) | -$spltprd0($spltcnst1) | -$spltprd0($spltcnst4) | -$spltprd0($spltcnst3) | -$spltprd0($spltcnst6) | -$spltprd0($spltcnst5) | -$spltprd0($spltcnst7).
% 143 [hyper:119,75,binarycut:74,binarycut:76] equal(inverse(sk_c3),sk_c11) | $spltprd0($spltcnst1).
% 182 [hyper:120,78,binarycut:69] equal(inverse(sk_c6),sk_c11) | $spltprd0($spltcnst2).
% 184 [hyper:120,78,binarycut:77] equal(inverse(sk_c3),sk_c11) | $spltprd0($spltcnst2).
% 188 [hyper:123,78,binarycut:69] equal(inverse(sk_c6),sk_c11) | $spltprd0($spltcnst5).
% 190 [hyper:123,78,binarycut:77] equal(inverse(sk_c3),sk_c11) | $spltprd0($spltcnst5).
% 295 [hyper:121,79,binarycut:80] equal(inverse(sk_c3),sk_c11) | $spltprd0($spltcnst3).
% 300 [hyper:124,79,binarycut:80] equal(inverse(sk_c3),sk_c11) | $spltprd0($spltcnst6).
% 394 [hyper:122,81,binarycut:82] equal(inverse(sk_c3),sk_c11) | $spltprd0($spltcnst4).
% 399 [hyper:125,81,binarycut:82] equal(inverse(sk_c3),sk_c11) | $spltprd0($spltcnst7).
% 527 [hyper:126,399,143,300,184,295,190,394] equal(inverse(sk_c3),sk_c11).
% 550 [para:527.1.1,62.1.1.1] equal(multiply(sk_c11,sk_c3),identity).
% 573 [hyper:120,68,demod:527,cut:60] equal(multiply(sk_c6,sk_c10),sk_c11) | $spltprd0($spltcnst2).
% 576 [hyper:123,68,demod:527,cut:60] equal(multiply(sk_c6,sk_c10),sk_c11) | $spltprd0($spltcnst5).
% 653 [hyper:120,573,binarycut:182] $spltprd0($spltcnst2).
% 4067 [hyper:123,576,binarycut:188] $spltprd0($spltcnst5).
% 4419 [hyper:64,73,72,71,70,65,71,70,67,73,72,68,69,68,69,66] equal(multiply(sk_c3,sk_c10),sk_c11).
% 4607 [hyper:121,88,binarycut:97] equal(inverse(sk_c5),sk_c10) | $spltprd0($spltcnst3).
% 4611 [hyper:124,88,binarycut:97] equal(inverse(sk_c5),sk_c10) | $spltprd0($spltcnst6).
% 5369 [hyper:121,89,binarycut:98] equal(multiply(sk_c5,sk_c10),sk_c9) | $spltprd0($spltcnst3).
% 5371 [?] ?
% 6097 [hyper:124,4611,binarycut:5371] $spltprd0($spltcnst6).
% 11953 [hyper:64,91,90,89,88,83,89,88,85,84,91,90,86,87,4419,demod:527,cut:60] equal(inverse(sk_c2),sk_c10).
% 11974 [para:11953.1.1,62.1.1.1] equal(multiply(sk_c10,sk_c2),identity).
% 12001 [hyper:121,5369,binarycut:4607] $spltprd0($spltcnst3).
% 12043 [hyper:119,102,binarycut:101,binarycut:103] equal(inverse(sk_c1),sk_c11) | $spltprd0($spltcnst1).
% 12308 [hyper:122,108,binarycut:109] equal(inverse(sk_c1),sk_c11) | $spltprd0($spltcnst4).
% 12312 [hyper:125,108,binarycut:109] equal(inverse(sk_c1),sk_c11) | $spltprd0($spltcnst7).
% 12431 [hyper:126,12312,12308,12043,cut:4067,cut:6097,cut:12001,cut:653] equal(inverse(sk_c1),sk_c11).
% 12440 [para:12431.1.1,62.1.1.1] equal(multiply(sk_c11,sk_c1),identity).
% 77557 [hyper:64,100,98,98,100,92,94,95,95,96,97,93,99,99,97,96] equal(multiply(sk_c2,sk_c10),sk_c9).
% 79864 [hyper:64,118,117,110,112,111,118,117,116,115,116,115,113,114,4419,demod:527,cut:60] equal(multiply(sk_c1,sk_c11),sk_c10).
% 80154 [para:62.1.1,63.1.1.1,demod:61] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 80155 [para:550.1.1,63.1.1.1,demod:61] equal(X,multiply(sk_c11,multiply(sk_c3,X))).
% 80157 [para:11974.1.1,63.1.1.1,demod:61] equal(X,multiply(sk_c10,multiply(sk_c2,X))).
% 80158 [para:12440.1.1,63.1.1.1,demod:61] equal(X,multiply(sk_c11,multiply(sk_c1,X))).
% 80170 [para:77557.1.1,80157.1.2.2] equal(sk_c10,multiply(sk_c10,sk_c9)).
% 80176 [para:79864.1.1,80158.1.2.2] equal(sk_c11,multiply(sk_c11,sk_c10)).
% 80187 [para:80155.1.2,80154.1.2.2] equal(multiply(sk_c3,X),multiply(inverse(sk_c11),X)).
% 80190 [para:80176.1.2,80154.1.2.2,demod:80187] equal(sk_c10,multiply(sk_c3,sk_c11)).
% 80196 [para:80187.1.2,62.1.1,demod:80190] equal(sk_c10,identity).
% 80200 [para:80196.1.1,11974.1.1.1,demod:61] equal(sk_c2,identity).
% 80210 [para:80200.1.1,11953.1.1.1] equal(inverse(identity),sk_c10).
% 80278 [hyper:64,80210,4419,4419,79864,77557,77557,79864,demod:80170,61,cut:60,cut:60,demod:527,cut:60,demod:527,cut:60,demod:12431,cut:60,demod:11953,cut:60,demod:11953,cut:60,demod:12431,cut:60] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 29
% clause depth limited to 3
% seconds given: 15
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 154
% derived clauses: 421603
% kept clauses: 142
% kept size sum: 849
% kept mid-nuclei: 79459
% kept new demods: 49
% forw unit-subs: 14706
% forw double-subs: 244074
% forw overdouble-subs: 55655
% backward subs: 139
% fast unit cutoff: 239602
% full unit cutoff: 0
% dbl unit cutoff: 435
% real runtime : 9.30
% process. runtime: 9.29
% specific non-discr-tree subsumption statistics:
% tried: 60403
% length fails: 0
% strength fails: 3534
% predlist fails: 674
% aux str. fails: 73
% by-lit fails: 11
% full subs tried: 56101
% full subs fail: 454
%
% ; 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/GRP244-1+eq_r.in")
%
%------------------------------------------------------------------------------