TSTP Solution File: GRP344-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP344-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 : art07.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/GRP344-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(multiply(sk_c6,sk_c7),sk_c5) | -equal(inverse(X),sk_c7) | -equal(multiply(X,sk_c6),sk_c7) | -equal(inverse(Y),sk_c6) | -equal(multiply(Y,sk_c5),sk_c6) | -equal(multiply(Z,sk_c6),sk_c7) | -equal(inverse(Z),sk_c6) | -equal(inverse(U),sk_c5) | -equal(multiply(U,sk_c6),sk_c5).
% was split for some strategies as:
% -equal(inverse(U),sk_c5) | -equal(multiply(U,sk_c6),sk_c5).
% -equal(multiply(Z,sk_c6),sk_c7) | -equal(inverse(Z),sk_c6).
% -equal(inverse(Y),sk_c6) | -equal(multiply(Y,sk_c5),sk_c6).
% -equal(inverse(X),sk_c7) | -equal(multiply(X,sk_c6),sk_c7).
% -equal(multiply(sk_c6,sk_c7),sk_c5).
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(22,40,0,49,0,0,4234,50,38,4261,0,38,8480,50,80,8507,0,80,12739,50,118,12766,0,118,17010,50,155,17037,0,155,21291,50,200,21318,0,200,25584,50,266,25611,0,266,29889,50,378,29916,0,378,34208,50,547,34235,0,547,38541,50,818,38541,40,818,38568,0,818,49987,3,1119,50658,4,1269,51327,5,1419,51328,1,1419,51328,50,1419,51328,40,1419,51355,0,1419,51530,3,1733,51538,4,1882,51547,5,2020,51547,1,2020,51547,50,2020,51547,40,2020,51574,0,2020)
%
%
% START OF PROOF
% 51548 [] equal(X,X).
% 51549 [] equal(multiply(identity,X),X).
% 51550 [] equal(multiply(inverse(X),X),identity).
% 51551 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 51553 [] equal(multiply(sk_c2,sk_c5),sk_c6) | equal(multiply(sk_c4,sk_c6),sk_c5).
% 51554 [] equal(multiply(sk_c2,sk_c5),sk_c6) | equal(inverse(sk_c4),sk_c5).
% 51555 [] equal(multiply(sk_c2,sk_c5),sk_c6) | equal(inverse(sk_c3),sk_c6).
% 51556 [] equal(multiply(sk_c2,sk_c5),sk_c6) | equal(multiply(sk_c3,sk_c6),sk_c7).
% 51557 [] equal(multiply(sk_c4,sk_c6),sk_c5) | equal(inverse(sk_c2),sk_c6).
% 51558 [] equal(inverse(sk_c2),sk_c6) | equal(inverse(sk_c4),sk_c5).
% 51559 [] equal(inverse(sk_c2),sk_c6) | equal(inverse(sk_c3),sk_c6).
% 51560 [] equal(multiply(sk_c3,sk_c6),sk_c7) | equal(inverse(sk_c2),sk_c6).
% 51561 [] equal(multiply(sk_c1,sk_c6),sk_c7) | equal(multiply(sk_c4,sk_c6),sk_c5).
% 51562 [] equal(multiply(sk_c1,sk_c6),sk_c7) | equal(inverse(sk_c4),sk_c5).
% 51563 [] equal(multiply(sk_c1,sk_c6),sk_c7) | equal(inverse(sk_c3),sk_c6).
% 51564 [] equal(multiply(sk_c1,sk_c6),sk_c7) | equal(multiply(sk_c3,sk_c6),sk_c7).
% 51565 [] equal(multiply(sk_c4,sk_c6),sk_c5) | equal(inverse(sk_c1),sk_c7).
% 51566 [] equal(inverse(sk_c1),sk_c7) | equal(inverse(sk_c4),sk_c5).
% 51567 [] equal(inverse(sk_c1),sk_c7) | equal(inverse(sk_c3),sk_c6).
% 51568 [] equal(multiply(sk_c3,sk_c6),sk_c7) | equal(inverse(sk_c1),sk_c7).
% 51569 [] equal(multiply(sk_c6,sk_c7),sk_c5).
% 51570 [?] ?
% 51571 [] $spltprd0($spltcnst14) | -equal(multiply(X,sk_c6),sk_c7) | -equal(inverse(X),sk_c6).
% 51572 [] $spltprd0($spltcnst15) | -equal(multiply(X,sk_c5),sk_c6) | -equal(inverse(X),sk_c6).
% 51573 [] $spltprd0($spltcnst16) | -equal(multiply(X,sk_c6),sk_c7) | -equal(inverse(X),sk_c7).
% 51574 [] -$spltprd0($spltcnst14) | -$spltprd0($spltcnst13) | -$spltprd0($spltcnst16) | -$spltprd0($spltcnst15).
% 51643 [input:51570,cut:51548] $spltprd0($spltcnst13) | -equal(multiply(X,sk_c6),sk_c5) | -equal(inverse(X),sk_c5).
% 51646 [para:51553.2.1,51643.2.1,cut:51548] equal(multiply(sk_c2,sk_c5),sk_c6) | -equal(inverse(sk_c4),sk_c5) | $spltprd0($spltcnst13).
% 51647 [para:51557.1.1,51643.2.1,cut:51548] -equal(inverse(sk_c4),sk_c5) | equal(inverse(sk_c2),sk_c6) | $spltprd0($spltcnst13).
% 51652 [para:51565.1.1,51643.2.1,cut:51548] -equal(inverse(sk_c4),sk_c5) | equal(inverse(sk_c1),sk_c7) | $spltprd0($spltcnst13).
% 51655 [para:51561.2.1,51643.2.1,cut:51548] equal(multiply(sk_c1,sk_c6),sk_c7) | -equal(inverse(sk_c4),sk_c5) | $spltprd0($spltcnst13).
% 51664 [para:51558.2.1,51647.1.1,cut:51548] equal(inverse(sk_c2),sk_c6) | $spltprd0($spltcnst13).
% 51670 [para:51560.1.1,51571.2.1,cut:51548] -equal(inverse(sk_c3),sk_c6) | equal(inverse(sk_c2),sk_c6) | $spltprd0($spltcnst14).
% 51673 [para:51556.2.1,51571.2.1,cut:51548] equal(multiply(sk_c2,sk_c5),sk_c6) | -equal(inverse(sk_c3),sk_c6) | $spltprd0($spltcnst14).
% 51675 [para:51568.1.1,51571.2.1,cut:51548] -equal(inverse(sk_c3),sk_c6) | equal(inverse(sk_c1),sk_c7) | $spltprd0($spltcnst14).
% 51679 [para:51564.2.1,51571.2.1,cut:51548] equal(multiply(sk_c1,sk_c6),sk_c7) | -equal(inverse(sk_c3),sk_c6) | $spltprd0($spltcnst14).
% 51684 [para:51664.1.1,51550.1.1.1] equal(multiply(sk_c6,sk_c2),identity) | $spltprd0($spltcnst13).
% 51689 [para:51554.1.1,51572.2.1,cut:51548,binarycut:51558] equal(inverse(sk_c4),sk_c5) | $spltprd0($spltcnst15).
% 51690 [para:51553.1.1,51572.2.1,cut:51548] equal(multiply(sk_c4,sk_c6),sk_c5) | -equal(inverse(sk_c2),sk_c6) | $spltprd0($spltcnst15).
% 51692 [para:51555.1.1,51572.2.1,cut:51548,binarycut:51559] equal(inverse(sk_c3),sk_c6) | $spltprd0($spltcnst15).
% 51693 [para:51556.1.1,51572.2.1,cut:51548] equal(multiply(sk_c3,sk_c6),sk_c7) | -equal(inverse(sk_c2),sk_c6) | $spltprd0($spltcnst15).
% 51697 [para:51689.1.1,51550.1.1.1] equal(multiply(sk_c5,sk_c4),identity) | $spltprd0($spltcnst15).
% 51699 [para:51692.1.1,51550.1.1.1] equal(multiply(sk_c6,sk_c3),identity) | $spltprd0($spltcnst15).
% 51710 [para:51562.1.1,51573.2.1,cut:51548,binarycut:51566] equal(inverse(sk_c4),sk_c5) | $spltprd0($spltcnst16).
% 51712 [para:51563.1.1,51573.2.1,cut:51548,binarycut:51567] equal(inverse(sk_c3),sk_c6) | $spltprd0($spltcnst16).
% 51724 [para:51710.1.1,51550.1.1.1] equal(multiply(sk_c5,sk_c4),identity) | $spltprd0($spltcnst16).
% 51730 [para:51569.1.1,51551.1.1.1] equal(multiply(sk_c5,X),multiply(sk_c6,multiply(sk_c7,X))).
% 51731 [para:51550.1.1,51551.1.1.1,demod:51549] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 51770 [para:51684.1.1,51551.1.1.1,demod:51549] $spltprd0($spltcnst13) | equal(X,multiply(sk_c6,multiply(sk_c2,X))).
% 51771 [para:51697.1.1,51551.1.1.1,demod:51549] $spltprd0($spltcnst15) | equal(X,multiply(sk_c5,multiply(sk_c4,X))).
% 51778 [para:51549.1.1,51731.1.2.2] equal(X,multiply(inverse(identity),X)).
% 51779 [para:51569.1.1,51731.1.2.2] equal(sk_c7,multiply(inverse(sk_c6),sk_c5)).
% 51825 [para:51684.1.1,51731.1.2.2] equal(sk_c2,multiply(inverse(sk_c6),identity)) | $spltprd0($spltcnst13).
% 51826 [para:51697.1.1,51731.1.2.2] equal(sk_c4,multiply(inverse(sk_c5),identity)) | $spltprd0($spltcnst15).
% 51827 [para:51699.1.1,51731.1.2.2] equal(sk_c3,multiply(inverse(sk_c6),identity)) | $spltprd0($spltcnst15).
% 51828 [para:51724.1.1,51731.1.2.2] equal(sk_c4,multiply(inverse(sk_c5),identity)) | $spltprd0($spltcnst16).
% 51830 [para:51730.1.2,51731.1.2.2] equal(multiply(sk_c7,X),multiply(inverse(sk_c6),multiply(sk_c5,X))).
% 51838 [para:51825.1.2,51551.1.1.1,demod:51549] $spltprd0($spltcnst13) | equal(multiply(sk_c2,X),multiply(inverse(sk_c6),X)).
% 51841 [para:51826.1.2,51551.1.1.1,demod:51549] $spltprd0($spltcnst15) | equal(multiply(sk_c4,X),multiply(inverse(sk_c5),X)).
% 51843 [para:51827.1.2,51551.1.1.1,demod:51549] $spltprd0($spltcnst15) | equal(multiply(sk_c3,X),multiply(inverse(sk_c6),X)).
% 52052 [para:51838.2.2,51550.1.1] equal(multiply(sk_c2,sk_c6),identity) | $spltprd0($spltcnst13).
% 52061 [para:51838.2.2,51779.1.2] equal(sk_c7,multiply(sk_c2,sk_c5)) | $spltprd0($spltcnst13).
% 52076 [para:52052.1.1,51643.2.1] -equal(inverse(sk_c2),sk_c5) | -equal(identity,sk_c5) | $spltprd0($spltcnst13).
% 52206 [para:51664.1.1,52076.1.1] -equal(identity,sk_c5) | -equal(sk_c6,sk_c5) | $spltprd0($spltcnst13).
% 52322 [para:51841.2.2,51550.1.1] equal(multiply(sk_c4,sk_c5),identity) | $spltprd0($spltcnst15).
% 52334 [para:52322.1.1,51771.2.2.2] equal(sk_c5,multiply(sk_c5,identity)) | $spltprd0($spltcnst15).
% 52344 [para:52334.1.2,51830.1.2.2,demod:51779] equal(multiply(sk_c7,identity),sk_c7) | $spltprd0($spltcnst15).
% 52353 [para:52344.1.1,51730.1.2.2,demod:51569] equal(multiply(sk_c5,identity),sk_c5) | $spltprd0($spltcnst15).
% 52397 [para:51843.2.2,51550.1.1] equal(multiply(sk_c3,sk_c6),identity) | $spltprd0($spltcnst15).
% 52459 [para:51554.2.1,51646.2.1,cut:51548] equal(multiply(sk_c2,sk_c5),sk_c6) | $spltprd0($spltcnst13).
% 52466 [para:52459.1.1,51770.2.2.2] equal(sk_c5,multiply(sk_c6,sk_c6)) | $spltprd0($spltcnst13).
% 52467 [para:52459.1.1,52061.1.2] equal(sk_c7,sk_c6) | $spltprd0($spltcnst13).
% 52471 [para:52467.1.2,51569.1.1.1] equal(multiply(sk_c7,sk_c7),sk_c5) | $spltprd0($spltcnst13).
% 52493 [para:52467.1.2,51825.1.2.1.1] equal(sk_c2,multiply(inverse(sk_c7),identity)) | $spltprd0($spltcnst13).
% 52535 [para:52467.1.2,52466.1.2.1] equal(sk_c5,multiply(sk_c7,sk_c6)) | $spltprd0($spltcnst13).
% 52564 [para:52535.1.2,51731.1.2.2] equal(sk_c6,multiply(inverse(sk_c7),sk_c5)) | $spltprd0($spltcnst13).
% 52576 [para:51566.2.1,51652.1.1,cut:51548] equal(inverse(sk_c1),sk_c7) | $spltprd0($spltcnst13).
% 52578 [para:52576.1.1,51550.1.1.1] equal(multiply(sk_c7,sk_c1),identity) | $spltprd0($spltcnst13).
% 52583 [para:52578.1.1,51731.1.2.2] equal(sk_c1,multiply(inverse(sk_c7),identity)) | $spltprd0($spltcnst13).
% 52613 [para:52583.1.2,52493.1.2] equal(sk_c2,sk_c1) | $spltprd0($spltcnst13).
% 52616 [para:51562.2.1,51655.2.1,cut:51548] equal(multiply(sk_c1,sk_c6),sk_c7) | $spltprd0($spltcnst13).
% 52639 [para:52613.1.1,52052.1.1.1] equal(multiply(sk_c1,sk_c6),identity) | $spltprd0($spltcnst13).
% 52700 [para:52639.1.1,52616.1.1] equal(identity,sk_c7) | $spltprd0($spltcnst13).
% 52713 [para:52700.1.2,52471.1.1.1,demod:51549] equal(sk_c7,sk_c5) | $spltprd0($spltcnst13).
% 52725 [para:52700.1.2,52564.1.2.1.1,demod:51778] equal(sk_c6,sk_c5) | $spltprd0($spltcnst13).
% 52755 [para:52713.1.1,52700.1.2] equal(identity,sk_c5) | $spltprd0($spltcnst13).
% 52834 [para:52755.1.2,52206.1.2,cut:51548,binarycut:52725] $spltprd0($spltcnst13).
% 52847 [para:51559.2.1,51670.1.1,cut:51548] equal(inverse(sk_c2),sk_c6) | $spltprd0($spltcnst14).
% 52858 [para:51555.2.1,51673.2.1,cut:51548] equal(multiply(sk_c2,sk_c5),sk_c6) | $spltprd0($spltcnst14).
% 52862 [para:51567.2.1,51675.1.1,cut:51548] equal(inverse(sk_c1),sk_c7) | $spltprd0($spltcnst14).
% 52874 [para:51563.2.1,51679.2.1,cut:51548] equal(multiply(sk_c1,sk_c6),sk_c7) | $spltprd0($spltcnst14).
% 52883 [para:52858.1.1,51731.1.2.2] equal(sk_c5,multiply(inverse(sk_c2),sk_c6)) | $spltprd0($spltcnst14).
% 52892 [para:52874.1.1,51571.2.1,cut:51548] -equal(inverse(sk_c1),sk_c6) | $spltprd0($spltcnst14).
% 52908 [para:51557.2.1,51690.2.1,cut:51548] equal(multiply(sk_c4,sk_c6),sk_c5) | $spltprd0($spltcnst15).
% 52913 [para:52908.1.1,51771.2.2.2] equal(sk_c6,multiply(sk_c5,sk_c5)) | $spltprd0($spltcnst15).
% 52918 [para:52913.1.2,51830.1.2.2,demod:51550] equal(multiply(sk_c7,sk_c5),identity) | $spltprd0($spltcnst15).
% 52934 [para:51560.2.1,51693.2.1,cut:51548] equal(multiply(sk_c3,sk_c6),sk_c7) | $spltprd0($spltcnst15).
% 52940 [para:52934.1.1,52397.1.1] equal(sk_c7,identity) | $spltprd0($spltcnst15).
% 52973 [para:52940.1.1,52918.1.1.1,demod:51549] equal(sk_c5,identity) | $spltprd0($spltcnst15).
% 52976 [?] ?
% 52995 [para:52973.1.1,52353.1.1.1,demod:51549,binarycut:52976] $spltprd0($spltcnst15).
% 53046 [para:52847.1.1,52883.1.2.1] equal(sk_c5,multiply(sk_c6,sk_c6)) | $spltprd0($spltcnst14).
% 53052 [para:53046.1.2,51731.1.2.2,demod:51779] equal(sk_c6,sk_c7) | $spltprd0($spltcnst14).
% 53098 [para:53052.1.1,52892.1.2,binarycut:52862] $spltprd0($spltcnst14).
% 53099 [binary:51574,53098,cut:52834,cut:52995] -$spltprd0($spltcnst16).
% 53100 [binary:51710.2,53099] equal(inverse(sk_c4),sk_c5).
% 53101 [binary:51712.2,53099] equal(inverse(sk_c3),sk_c6).
% 53104 [binary:51828.2,53099] equal(sk_c4,multiply(inverse(sk_c5),identity)).
% 53120 [para:51561.1.1,51573.2.1,cut:51548,cut:53099] equal(multiply(sk_c4,sk_c6),sk_c5) | -equal(inverse(sk_c1),sk_c7).
% 53121 [para:51565.2.1,53120.2.1,cut:51548] equal(multiply(sk_c4,sk_c6),sk_c5).
% 53123 [para:53121.1.1,51573.2.1,demod:53100,cut:53099] -equal(sk_c5,sk_c7).
% 53135 [para:53104.1.2,51551.1.1.1,demod:51549] equal(multiply(sk_c4,X),multiply(inverse(sk_c5),X)).
% 53138 [para:51564.1.1,51573.2.1,cut:51548,cut:53099] equal(multiply(sk_c3,sk_c6),sk_c7) | -equal(inverse(sk_c1),sk_c7).
% 53139 [para:51568.2.1,53138.2.1,cut:51548] equal(multiply(sk_c3,sk_c6),sk_c7).
% 53143 [para:53139.1.1,51731.1.2.2,demod:51569,53101] equal(sk_c6,sk_c5).
% 53147 [para:53143.1.1,51779.1.2.1.1,demod:53135] equal(sk_c7,multiply(sk_c4,sk_c5)).
% 53154 [para:53143.1.1,53121.1.1.2,demod:53147] equal(sk_c7,sk_c5).
% 53168 [para:53154.1.1,53123.1.2,cut:51548] 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: 4488
% derived clauses: 359105
% kept clauses: 12140
% kept size sum: 188571
% kept mid-nuclei: 35424
% kept new demods: 959
% forw unit-subs: 149947
% forw double-subs: 69201
% forw overdouble-subs: 16684
% backward subs: 554
% fast unit cutoff: 1426
% full unit cutoff: 0
% dbl unit cutoff: 1571
% real runtime : 20.38
% process. runtime: 20.34
% specific non-discr-tree subsumption statistics:
% tried: 240614
% length fails: 53845
% strength fails: 84120
% predlist fails: 1934
% aux str. fails: 19018
% by-lit fails: 15150
% full subs tried: 61547
% full subs fail: 45722
%
% ; 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/GRP344-1+eq_r.in")
%
%------------------------------------------------------------------------------