TSTP Solution File: GRP222-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP222-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 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/GRP222-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(inverse(X),sk_c7) | -equal(multiply(X,sk_c6),sk_c7) | -equal(multiply(Y,Z),sk_c6) | -equal(inverse(Y),Z) | -equal(multiply(Z,sk_c7),sk_c6) | -equal(multiply(U,sk_c7),sk_c6) | -equal(inverse(U),sk_c7) | -equal(inverse(V),sk_c7) | -equal(multiply(V,sk_c6),sk_c7).
% was split for some strategies as:
% -equal(inverse(V),sk_c7) | -equal(multiply(V,sk_c6),sk_c7).
% -equal(multiply(U,sk_c7),sk_c6) | -equal(inverse(U),sk_c7).
% -equal(multiply(Y,Z),sk_c6) | -equal(inverse(Y),Z) | -equal(multiply(Z,sk_c7),sk_c6).
% -equal(inverse(X),sk_c7) | -equal(multiply(X,sk_c6),sk_c7).
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(25,40,1,55,0,1,170738,4,1364,176623,5,1503,176626,1,1503,176626,50,1503,176626,40,1503,176656,0,1503,188047,3,1804,188793,4,1954,189461,5,2104,189462,1,2104,189462,50,2104,189462,40,2104,189492,0,2104,189722,3,2411,189732,4,2564,189741,5,2705,189741,1,2705,189741,50,2705,189741,40,2705,189771,0,2705)
%
%
% START OF PROOF
% 189742 [] equal(X,X).
% 189743 [] equal(multiply(identity,X),X).
% 189744 [] equal(multiply(inverse(X),X),identity).
% 189745 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 189748 [] equal(multiply(sk_c3,sk_c7),sk_c6) | equal(inverse(sk_c5),sk_c7).
% 189749 [] equal(multiply(sk_c3,sk_c7),sk_c6) | equal(inverse(sk_c4),sk_c7).
% 189750 [] equal(multiply(sk_c3,sk_c7),sk_c6) | equal(multiply(sk_c4,sk_c7),sk_c6).
% 189752 [] equal(inverse(sk_c2),sk_c3) | equal(inverse(sk_c5),sk_c7).
% 189753 [] equal(inverse(sk_c2),sk_c3) | equal(inverse(sk_c4),sk_c7).
% 189754 [] equal(multiply(sk_c4,sk_c7),sk_c6) | equal(inverse(sk_c2),sk_c3).
% 189756 [] equal(multiply(sk_c2,sk_c3),sk_c6) | equal(inverse(sk_c5),sk_c7).
% 189757 [] equal(multiply(sk_c2,sk_c3),sk_c6) | equal(inverse(sk_c4),sk_c7).
% 189758 [] equal(multiply(sk_c2,sk_c3),sk_c6) | equal(multiply(sk_c4,sk_c7),sk_c6).
% 189759 [] equal(multiply(sk_c1,sk_c6),sk_c7) | equal(multiply(sk_c5,sk_c6),sk_c7).
% 189760 [] equal(multiply(sk_c1,sk_c6),sk_c7) | equal(inverse(sk_c5),sk_c7).
% 189763 [] equal(multiply(sk_c5,sk_c6),sk_c7) | equal(inverse(sk_c1),sk_c7).
% 189764 [] equal(inverse(sk_c1),sk_c7) | equal(inverse(sk_c5),sk_c7).
% 189765 [] equal(inverse(sk_c1),sk_c7) | equal(inverse(sk_c4),sk_c7).
% 189766 [] equal(multiply(sk_c4,sk_c7),sk_c6) | equal(inverse(sk_c1),sk_c7).
% 189767 [] $spltprd0($spltcnst13) | -equal(multiply(X,sk_c6),sk_c7) | -equal(inverse(X),sk_c7).
% 189768 [] $spltprd0($spltcnst14) | -equal(multiply(X,sk_c7),sk_c6) | -equal(inverse(X),sk_c7).
% 189769 [] $spltprd0($spltcnst15) | -equal(multiply(X,sk_c7),sk_c6) | -equal(multiply(Y,X),sk_c6) | -equal(inverse(Y),X).
% 189770 [] $spltprd0($spltcnst16) | -equal(multiply(X,sk_c6),sk_c7) | -equal(inverse(X),sk_c7).
% 189771 [] -$spltprd0($spltcnst14) | -$spltprd0($spltcnst13) | -$spltprd0($spltcnst16) | -$spltprd0($spltcnst15).
% 189773 [input:189769,factor] -equal(multiply(sk_c7,sk_c7),sk_c6) | -equal(inverse(sk_c7),sk_c7) | $spltprd0($spltcnst15).
% 189835 [para:189760.1.1,189767.2.1,cut:189742,binarycut:189764] equal(inverse(sk_c5),sk_c7) | $spltprd0($spltcnst13).
% 189839 [para:189763.1.1,189767.2.1,cut:189742,binarycut:189835] equal(inverse(sk_c1),sk_c7) | $spltprd0($spltcnst13).
% 189843 [para:189759.1.1,189767.2.1,cut:189742,binarycut:189839] equal(multiply(sk_c5,sk_c6),sk_c7) | $spltprd0($spltcnst13).
% 189860 [para:189754.1.1,189768.2.1,cut:189742] -equal(inverse(sk_c4),sk_c7) | equal(inverse(sk_c2),sk_c3) | $spltprd0($spltcnst14).
% 189863 [para:189766.1.1,189768.2.1,cut:189742] -equal(inverse(sk_c4),sk_c7) | equal(inverse(sk_c1),sk_c7) | $spltprd0($spltcnst14).
% 189885 [para:189843.1.1,189767.2.1,cut:189742,binarycut:189835] $spltprd0($spltcnst13).
% 189892 [para:189760.1.1,189770.2.1,cut:189742,binarycut:189764] equal(inverse(sk_c5),sk_c7) | $spltprd0($spltcnst16).
% 189896 [para:189763.1.1,189770.2.1,cut:189742,binarycut:189892] equal(inverse(sk_c1),sk_c7) | $spltprd0($spltcnst16).
% 189900 [para:189759.1.1,189770.2.1,cut:189742,binarycut:189896] equal(multiply(sk_c5,sk_c6),sk_c7) | $spltprd0($spltcnst16).
% 189911 [para:189744.1.1,189745.1.1.1,demod:189743] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 189954 [para:189900.1.1,189770.2.1,cut:189742,binarycut:189892] $spltprd0($spltcnst16).
% 190047 [para:189753.2.1,189860.1.1,cut:189742] equal(inverse(sk_c2),sk_c3) | $spltprd0($spltcnst14).
% 190049 [para:190047.1.1,189744.1.1.1] equal(multiply(sk_c3,sk_c2),identity) | $spltprd0($spltcnst14).
% 190061 [para:190049.1.1,189911.1.2.2] equal(sk_c2,multiply(inverse(sk_c3),identity)) | $spltprd0($spltcnst14).
% 190065 [para:190061.1.2,189745.1.1.1,demod:189743] $spltprd0($spltcnst14) | equal(multiply(sk_c2,X),multiply(inverse(sk_c3),X)).
% 190081 [para:190065.2.2,189744.1.1] equal(multiply(sk_c2,sk_c3),identity) | $spltprd0($spltcnst14).
% 190093 [para:190081.1.1,189757.1.1] equal(inverse(sk_c4),sk_c7) | equal(identity,sk_c6) | $spltprd0($spltcnst14).
% 190223 [para:189765.2.1,189863.1.1,cut:189742] equal(inverse(sk_c1),sk_c7) | $spltprd0($spltcnst14).
% 190225 [para:190223.1.1,189744.1.1.1] equal(multiply(sk_c7,sk_c1),identity) | $spltprd0($spltcnst14).
% 190234 [para:190225.1.1,189911.1.2.2] equal(sk_c1,multiply(inverse(sk_c7),identity)) | $spltprd0($spltcnst14).
% 190238 [para:190234.1.2,189745.1.1.1,demod:189743] $spltprd0($spltcnst14) | equal(multiply(sk_c1,X),multiply(inverse(sk_c7),X)).
% 190253 [para:190238.2.2,189744.1.1] equal(multiply(sk_c1,sk_c7),identity) | $spltprd0($spltcnst14).
% 190264 [para:190253.1.1,189768.2.1,binarycut:190223] -equal(identity,sk_c6) | $spltprd0($spltcnst14).
% 190269 [para:190093.2.2,190264.1.2,cut:189742] equal(inverse(sk_c4),sk_c7) | $spltprd0($spltcnst14).
% 190325 [para:189758.2.1,189768.2.1,cut:189742,binarycut:190269] equal(multiply(sk_c2,sk_c3),sk_c6) | $spltprd0($spltcnst14).
% 190332 [para:190081.1.1,190325.1.1,binarycut:190264] $spltprd0($spltcnst14).
% 190333 [binary:189771,190332,cut:189885,cut:189954] -$spltprd0($spltcnst15).
% 190375 [para:189748.1.1,189769.2.1,cut:189742,cut:190333] equal(inverse(sk_c5),sk_c7) | -equal(multiply(X,sk_c3),sk_c6) | -equal(inverse(X),sk_c3).
% 190379 [para:189756.1.1,190375.2.1,cut:189742,binarycut:189752] equal(inverse(sk_c5),sk_c7).
% 190380 [para:190379.1.1,189744.1.1.1] equal(multiply(sk_c7,sk_c5),identity).
% 190382 [para:190380.1.1,189911.1.2.2] equal(sk_c5,multiply(inverse(sk_c7),identity)).
% 190383 [para:190382.1.2,189745.1.1.1,demod:189743] equal(multiply(sk_c5,X),multiply(inverse(sk_c7),X)).
% 190390 [para:190383.1.2,189744.1.1] equal(multiply(sk_c5,sk_c7),identity).
% 190395 [para:190383.1.2,190382.1.2] equal(sk_c5,multiply(sk_c5,identity)).
% 190396 [para:189749.1.1,189769.2.1,cut:189742,cut:190333] equal(inverse(sk_c4),sk_c7) | -equal(multiply(X,sk_c3),sk_c6) | -equal(inverse(X),sk_c3).
% 190400 [para:189757.1.1,190396.2.1,cut:189742,binarycut:189753] equal(inverse(sk_c4),sk_c7).
% 190401 [para:190400.1.1,189744.1.1.1] equal(multiply(sk_c7,sk_c4),identity).
% 190405 [para:190401.1.1,189911.1.2.2,demod:190382] equal(sk_c4,sk_c5).
% 190413 [para:190405.1.2,190390.1.1.1] equal(multiply(sk_c4,sk_c7),identity).
% 190414 [para:190405.1.2,190395.1.2.1] equal(sk_c5,multiply(sk_c4,identity)).
% 190421 [?] ?
% 190437 [para:190414.1.2,189745.1.1.1,demod:189743] equal(multiply(sk_c5,X),multiply(sk_c4,X)).
% 190456 [para:189750.1.1,189769.2.1,cut:189742,cut:190333] equal(multiply(sk_c4,sk_c7),sk_c6) | -equal(multiply(X,sk_c3),sk_c6) | -equal(inverse(X),sk_c3).
% 190459 [para:189758.1.1,190456.2.1,demod:190413,cut:189742,binarycut:190421] equal(identity,sk_c6).
% 190462 [para:190459.1.2,189763.1.1.2,demod:190395] equal(inverse(sk_c1),sk_c7) | equal(sk_c5,sk_c7).
% 190527 [para:190462.2.2,189766.1.1.2] equal(multiply(sk_c4,sk_c5),sk_c6) | equal(inverse(sk_c1),sk_c7).
% 190530 [para:190462.2.2,189769.2.1.2,cut:190333,factor:binarycut:190527] equal(inverse(sk_c1),sk_c7) | -equal(sk_c7,sk_c5).
% 190550 [para:190462.2.2,190530.2.1,cut:189742] equal(inverse(sk_c1),sk_c7).
% 190551 [para:190550.1.1,189744.1.1.1] equal(multiply(sk_c7,sk_c1),identity).
% 190553 [para:190551.1.1,189911.1.2.2,demod:190382] equal(sk_c1,sk_c5).
% 190554 [para:190553.1.1,189759.1.1.1,demod:190437] equal(multiply(sk_c4,sk_c6),sk_c7).
% 190558 [para:190459.1.2,190554.1.1.2,demod:190414] equal(sk_c5,sk_c7).
% 190572 [para:190558.1.2,189773.1.1.1,demod:190390,cut:190459,cut:190333] -equal(inverse(sk_c7),sk_c7).
% 190580 [para:190558.1.2,190572.1.1.1,demod:190379,cut:189742] 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: 3767
% derived clauses: 496956
% kept clauses: 15780
% kept size sum: 369709
% kept mid-nuclei: 161984
% kept new demods: 210
% forw unit-subs: 53726
% forw double-subs: 215959
% forw overdouble-subs: 17522
% backward subs: 352
% fast unit cutoff: 2194
% full unit cutoff: 0
% dbl unit cutoff: 8669
% real runtime : 27.10
% process. runtime: 27.9
% specific non-discr-tree subsumption statistics:
% tried: 729194
% length fails: 61246
% strength fails: 291164
% predlist fails: 116412
% aux str. fails: 58349
% by-lit fails: 59342
% full subs tried: 117246
% full subs fail: 101025
%
% ; 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/GRP222-1+eq_r.in")
%
%------------------------------------------------------------------------------