TSTP Solution File: GRP229-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP229-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 : art09.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/GRP229-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(inverse(X),sk_c8) | -equal(multiply(X,sk_c7),sk_c8) | -equal(multiply(sk_c8,Y),sk_c7) | -equal(multiply(Z,sk_c8),Y) | -equal(inverse(Z),sk_c8) | -equal(inverse(sk_c8),sk_c7) | -equal(inverse(U),sk_c8) | -equal(multiply(U,sk_c7),sk_c8) | -equal(multiply(sk_c8,V),sk_c7) | -equal(multiply(W,sk_c8),V) | -equal(inverse(W),sk_c8).
% was split for some strategies as:
% -equal(multiply(sk_c8,V),sk_c7) | -equal(multiply(W,sk_c8),V) | -equal(inverse(W),sk_c8).
% -equal(inverse(U),sk_c8) | -equal(multiply(U,sk_c7),sk_c8).
% -equal(multiply(sk_c8,Y),sk_c7) | -equal(multiply(Z,sk_c8),Y) | -equal(inverse(Z),sk_c8).
% -equal(inverse(X),sk_c8) | -equal(multiply(X,sk_c7),sk_c8).
% -equal(inverse(sk_c8),sk_c7).
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(35,40,1,75,0,1,4628,50,50,4668,0,50)
%
%
% START OF PROOF
% 4629 [] equal(X,X).
% 4630 [] equal(multiply(identity,X),X).
% 4631 [] equal(multiply(inverse(X),X),identity).
% 4632 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 4633 [] -equal(inverse(sk_c8),sk_c7) | -equal(multiply(sk_c8,U),sk_c7) | -equal(multiply(Z,sk_c7),sk_c8) | -equal(multiply(sk_c8,X),sk_c7) | -equal(multiply(Y,sk_c7),sk_c8) | -equal(multiply(W,sk_c8),U) | -equal(multiply(V,sk_c8),X) | -equal(inverse(W),sk_c8) | -equal(inverse(Z),sk_c8) | -equal(inverse(V),sk_c8) | -equal(inverse(Y),sk_c8).
% 4634 [] equal(inverse(sk_c2),sk_c8) | equal(inverse(sk_c5),sk_c8).
% 4635 [] equal(multiply(sk_c5,sk_c8),sk_c6) | equal(inverse(sk_c2),sk_c8).
% 4636 [?] ?
% 4637 [?] ?
% 4638 [] equal(inverse(sk_c2),sk_c8) | equal(inverse(sk_c4),sk_c8).
% 4639 [] equal(inverse(sk_c2),sk_c8) | equal(inverse(sk_c8),sk_c7).
% 4640 [] equal(multiply(sk_c2,sk_c8),sk_c3) | equal(inverse(sk_c5),sk_c8).
% 4641 [] equal(multiply(sk_c2,sk_c8),sk_c3) | equal(multiply(sk_c5,sk_c8),sk_c6).
% 4642 [] equal(multiply(sk_c2,sk_c8),sk_c3) | equal(multiply(sk_c8,sk_c6),sk_c7).
% 4643 [] equal(multiply(sk_c2,sk_c8),sk_c3) | equal(multiply(sk_c4,sk_c7),sk_c8).
% 4644 [] equal(multiply(sk_c2,sk_c8),sk_c3) | equal(inverse(sk_c4),sk_c8).
% 4645 [] equal(multiply(sk_c2,sk_c8),sk_c3) | equal(inverse(sk_c8),sk_c7).
% 4646 [] equal(multiply(sk_c8,sk_c3),sk_c7) | equal(inverse(sk_c5),sk_c8).
% 4647 [] equal(multiply(sk_c8,sk_c3),sk_c7) | equal(multiply(sk_c5,sk_c8),sk_c6).
% 4648 [] equal(multiply(sk_c8,sk_c3),sk_c7) | equal(multiply(sk_c8,sk_c6),sk_c7).
% 4649 [] equal(multiply(sk_c8,sk_c3),sk_c7) | equal(multiply(sk_c4,sk_c7),sk_c8).
% 4650 [] equal(multiply(sk_c8,sk_c3),sk_c7) | equal(inverse(sk_c4),sk_c8).
% 4651 [] equal(multiply(sk_c8,sk_c3),sk_c7) | equal(inverse(sk_c8),sk_c7).
% 4652 [] equal(multiply(sk_c1,sk_c7),sk_c8) | equal(inverse(sk_c5),sk_c8).
% 4653 [] equal(multiply(sk_c1,sk_c7),sk_c8) | equal(multiply(sk_c5,sk_c8),sk_c6).
% 4654 [] equal(multiply(sk_c1,sk_c7),sk_c8) | equal(multiply(sk_c8,sk_c6),sk_c7).
% 4655 [] equal(multiply(sk_c1,sk_c7),sk_c8) | equal(multiply(sk_c4,sk_c7),sk_c8).
% 4656 [] equal(multiply(sk_c1,sk_c7),sk_c8) | equal(inverse(sk_c4),sk_c8).
% 4657 [] equal(multiply(sk_c1,sk_c7),sk_c8) | equal(inverse(sk_c8),sk_c7).
% 4658 [] equal(inverse(sk_c1),sk_c8) | equal(inverse(sk_c5),sk_c8).
% 4659 [] equal(multiply(sk_c5,sk_c8),sk_c6) | equal(inverse(sk_c1),sk_c8).
% 4660 [?] ?
% 4661 [?] ?
% 4662 [] equal(inverse(sk_c1),sk_c8) | equal(inverse(sk_c4),sk_c8).
% 4663 [] equal(inverse(sk_c1),sk_c8) | equal(inverse(sk_c8),sk_c7).
% 4664 [] -equal(inverse(sk_c8),sk_c7) | $spltprd0($spltcnst1) | -equal(multiply(sk_c8,X),sk_c7) | -equal(multiply(Y,sk_c8),X) | -equal(inverse(Y),sk_c8).
% 4665 [] $spltprd0($spltcnst2) | -equal(multiply(X,sk_c7),sk_c8) | -equal(inverse(X),sk_c8).
% 4666 [] $spltprd0($spltcnst3) | -equal(multiply(sk_c8,X),sk_c7) | -equal(multiply(Y,sk_c8),X) | -equal(inverse(Y),sk_c8).
% 4667 [] $spltprd0($spltcnst4) | -equal(multiply(X,sk_c7),sk_c8) | -equal(inverse(X),sk_c8).
% 4668 [] -$spltprd0($spltcnst2) | -$spltprd0($spltcnst1) | -$spltprd0($spltcnst4) | -$spltprd0($spltcnst3).
% 4713 [hyper:4665,4638,binarycut:4637] equal(inverse(sk_c2),sk_c8) | $spltprd0($spltcnst2).
% 4718 [hyper:4667,4638,binarycut:4637] equal(inverse(sk_c2),sk_c8) | $spltprd0($spltcnst4).
% 4814 [hyper:4664,4635,4639,4634,binarycut:4636] equal(inverse(sk_c2),sk_c8) | $spltprd0($spltcnst1).
% 4819 [hyper:4666,4635,4634,binarycut:4636] equal(inverse(sk_c2),sk_c8) | $spltprd0($spltcnst3).
% 4870 [hyper:4668,4819,4814,4718,4713] equal(inverse(sk_c2),sk_c8).
% 4885 [hyper:4666,4640,demod:4870,cut:4629,binarycut:4646] equal(inverse(sk_c5),sk_c8) | $spltprd0($spltcnst3).
% 4904 [para:4870.1.1,4631.1.1.1] equal(multiply(sk_c8,sk_c2),identity).
% 4933 [hyper:4665,4662,binarycut:4661] equal(inverse(sk_c1),sk_c8) | $spltprd0($spltcnst2).
% 4939 [hyper:4667,4662,binarycut:4661] equal(inverse(sk_c1),sk_c8) | $spltprd0($spltcnst4).
% 4971 [hyper:4666,4641,demod:4870,cut:4629,binarycut:4647] equal(multiply(sk_c5,sk_c8),sk_c6) | $spltprd0($spltcnst3).
% 5130 [hyper:4666,4642,demod:4870,cut:4629,binarycut:4648] equal(multiply(sk_c8,sk_c6),sk_c7) | $spltprd0($spltcnst3).
% 5241 [hyper:4666,5130,4971,binarycut:4885] $spltprd0($spltcnst3).
% 5417 [hyper:4633,4645,4642,4641,4640,4643,4644,4643,4644,4642,4641,4640] equal(multiply(sk_c2,sk_c8),sk_c3).
% 5685 [hyper:4664,4659,4663,4658,binarycut:4660] equal(inverse(sk_c1),sk_c8) | $spltprd0($spltcnst1).
% 8416 [hyper:4668,5685,4933,4939,cut:5241] equal(inverse(sk_c1),sk_c8).
% 8489 [para:8416.1.1,4631.1.1.1] equal(multiply(sk_c8,sk_c1),identity).
% 8661 [hyper:4633,4649,4648,4648,4647,4647,4649,4650,4650,4646,4646,4651] equal(multiply(sk_c8,sk_c3),sk_c7).
% 8973 [hyper:4633,4655,4656,4657,4655,4656,4654,4653,4652,4654,4653,4652] equal(multiply(sk_c1,sk_c7),sk_c8).
% 8992 [para:4631.1.1,4632.1.1.1,demod:4630] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 8995 [para:4904.1.1,4632.1.1.1,demod:4630] equal(X,multiply(sk_c8,multiply(sk_c2,X))).
% 8996 [para:5417.1.1,4632.1.1.1] equal(multiply(sk_c3,X),multiply(sk_c2,multiply(sk_c8,X))).
% 8997 [para:8489.1.1,4632.1.1.1,demod:4630] equal(X,multiply(sk_c8,multiply(sk_c1,X))).
% 9006 [para:5417.1.1,8995.1.2.2,demod:8661] equal(sk_c8,sk_c7).
% 9009 [para:9006.1.1,5417.1.1.2] equal(multiply(sk_c2,sk_c7),sk_c3).
% 9011 [para:9006.1.1,8661.1.1.1] equal(multiply(sk_c7,sk_c3),sk_c7).
% 9021 [para:8973.1.1,8997.1.2.2] equal(sk_c7,multiply(sk_c8,sk_c8)).
% 9024 [para:9006.1.1,9021.1.2.1] equal(sk_c7,multiply(sk_c7,sk_c8)).
% 9027 [para:9006.1.1,9024.1.2.2] equal(sk_c7,multiply(sk_c7,sk_c7)).
% 9046 [para:4631.1.1,8992.1.2.2] equal(X,multiply(inverse(inverse(X)),identity)).
% 9049 [para:4904.1.1,8992.1.2.2] equal(sk_c2,multiply(inverse(sk_c8),identity)).
% 9051 [para:8661.1.1,8992.1.2.2] equal(sk_c3,multiply(inverse(sk_c8),sk_c7)).
% 9056 [para:9011.1.1,8992.1.2.2,demod:4631] equal(sk_c3,identity).
% 9059 [para:9024.1.2,8992.1.2.2,demod:4631] equal(sk_c8,identity).
% 9061 [para:9027.1.2,8992.1.2.2,demod:4631] equal(sk_c7,identity).
% 9063 [para:8992.1.2,8992.1.2.2] equal(multiply(X,Y),multiply(inverse(inverse(X)),Y)).
% 9065 [para:9056.1.1,8661.1.1.2] equal(multiply(sk_c8,identity),sk_c7).
% 9075 [para:9059.1.1,4904.1.1.1,demod:4630] equal(sk_c2,identity).
% 9083 [para:9075.1.1,4870.1.1.1] equal(inverse(identity),sk_c8).
% 9084 [para:9075.1.1,8995.1.2.2.1,demod:4630] equal(X,multiply(sk_c8,X)).
% 9140 [para:9059.1.1,9049.1.2.1.1,demod:9065,9083] equal(sk_c2,sk_c7).
% 9152 [para:9061.1.1,9051.1.2.2,demod:9049] equal(sk_c3,sk_c2).
% 9153 [para:9152.1.2,4870.1.1.1] equal(inverse(sk_c3),sk_c8).
% 9204 [para:9063.1.2,9046.1.2] equal(X,multiply(X,identity)).
% 9212 [para:9204.1.2,9049.1.2] equal(sk_c2,inverse(sk_c8)).
% 9271 [hyper:4633,8996,8973,8973,4630,demod:9153,9212,8661,9009,9021,9084,cut:4629,cut:9140,cut:4629,demod:8416,cut:4629,demod:8416,cut:4629,demod:9083,cut:4629,cut:9006] 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 21
% clause depth limited to 4
% seconds given: 15
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 266
% derived clauses: 35235
% kept clauses: 271
% kept size sum: 1673
% kept mid-nuclei: 8462
% kept new demods: 163
% forw unit-subs: 1767
% forw double-subs: 7728
% forw overdouble-subs: 1346
% backward subs: 220
% fast unit cutoff: 1154
% full unit cutoff: 0
% dbl unit cutoff: 314
% real runtime : 0.83
% process. runtime: 0.81
% specific non-discr-tree subsumption statistics:
% tried: 17679
% length fails: 140
% strength fails: 779
% predlist fails: 640
% aux str. fails: 176
% by-lit fails: 14556
% full subs tried: 1308
% full subs fail: 32
%
% ; 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/GRP229-1+eq_r.in")
%
%------------------------------------------------------------------------------