TSTP Solution File: GRP129-2.004 by Gandalf---c-2.6

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : GRP129-2.004 : TPTP v3.4.2. Released v1.2.0.
% Transfm  : add_equality:r
% Format   : otter:hypothesis:set(auto),clear(print_given)
% Command  : gandalf-wrapper -time %d %s

% Computer : art03.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/GRP129-2.004+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: nne
% detected subclass: medium
% 
% strategies selected: 
% (hyper 27 #f 1 11)
% (binary-unit 10 #f 1 11)
% (binary-double 16 #f 1 11)
% (binary 54 #t 1 11)
% (binary-order 27 #f 1 11)
% (binary-posweight-order 125 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 27 #f)
% (binary-weightorder 54 #f)
% (binary-order 54 #f)
% (hyper-order 43 #f)
% (binary 109 #t)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(31,40,1,62,0,1)
% 
% 
% START OF PROOF
% 32 [] next(e_1,e_2).
% 33 [] next(e_2,e_3).
% 38 [] greater(e_3,e_2).
% 39 [] greater(e_4,e_2).
% 40 [] greater(e_4,e_3).
% 41 [] -product(X,e_1,Y) | -greater(Y,Z) | -next(X,Z).
% 42 [] group_element(e_1).
% 43 [] group_element(e_2).
% 44 [] group_element(e_3).
% 45 [] group_element(e_4).
% 46 [] -equalish(e_1,e_2).
% 47 [] -equalish(e_1,e_3).
% 48 [] -equalish(e_1,e_4).
% 49 [] -equalish(e_2,e_1).
% 50 [] -equalish(e_2,e_3).
% 51 [] -equalish(e_2,e_4).
% 53 [] -equalish(e_3,e_2).
% 54 [] -equalish(e_3,e_4).
% 55 [] -equalish(e_4,e_1).
% 56 [] -equalish(e_4,e_2).
% 57 [] -equalish(e_4,e_3).
% 58 [] product(X,Y,e_3) | product(X,Y,e_4) | product(X,Y,e_2) | product(X,Y,e_1) | -group_element(Y) | -group_element(X).
% 59 [] -product(X,Y,U) | -product(X,Y,Z) | equalish(Z,U).
% 60 [] -product(X,U,Z) | -product(X,Y,Z) | equalish(Y,U).
% 61 [] -product(U,Y,Z) | -product(X,Y,Z) | equalish(X,U).
% 62 [] -product(Y,Z,U) | -product(X,Y,Z) | product(Z,X,U).
% 64 [hyper:58,42,42] product(e_1,e_1,e_4) | product(e_1,e_1,e_3) | product(e_1,e_1,e_2) | product(e_1,e_1,e_1).
% 67 [hyper:58,43,42] product(e_1,e_2,e_4) | product(e_1,e_2,e_3) | product(e_1,e_2,e_2) | product(e_1,e_2,e_1).
% 68 [hyper:58,43,43] product(e_2,e_2,e_4) | product(e_2,e_2,e_3) | product(e_2,e_2,e_2) | product(e_2,e_2,e_1).
% 70 [hyper:58,43,42] product(e_2,e_1,e_3) | product(e_2,e_1,e_4) | product(e_2,e_1,e_1) | product(e_2,e_1,e_2).
% 72 [hyper:58,44,42] product(e_1,e_3,e_4) | product(e_1,e_3,e_3) | product(e_1,e_3,e_2) | product(e_1,e_3,e_1).
% 76 [hyper:58,44,42] product(e_3,e_1,e_3) | product(e_3,e_1,e_4) | product(e_3,e_1,e_1) | product(e_3,e_1,e_2).
% 79 [hyper:58,45,42] product(e_1,e_4,e_4) | product(e_1,e_4,e_3) | product(e_1,e_4,e_2) | product(e_1,e_4,e_1).
% 84 [hyper:58,45,42] product(e_4,e_1,e_3) | product(e_4,e_1,e_4) | product(e_4,e_1,e_1) | product(e_4,e_1,e_2).
% 120 [hyper:41,64,39,cut:32] product(e_1,e_1,e_3) | product(e_1,e_1,e_1) | product(e_1,e_1,e_2).
% 167 [hyper:41,120,38,cut:32] product(e_1,e_1,e_2) | product(e_1,e_1,e_1).
% 298 [hyper:60,67,167,cut:46] product(e_1,e_2,e_4) | product(e_1,e_1,e_2) | product(e_1,e_2,e_3) | product(e_1,e_2,e_2).
% 462 [hyper:41,70,40,cut:33] product(e_2,e_1,e_3) | product(e_2,e_1,e_2) | product(e_2,e_1,e_1).
% 571 [hyper:61,462,167,cut:46] product(e_2,e_1,e_3) | product(e_1,e_1,e_1) | product(e_2,e_1,e_1).
% 574 [hyper:61,462,167,cut:46] product(e_2,e_1,e_2) | product(e_1,e_1,e_2) | product(e_2,e_1,e_3).
% 716 [hyper:60,72,167,cut:47] product(e_1,e_3,e_4) | product(e_1,e_1,e_2) | product(e_1,e_3,e_3) | product(e_1,e_3,e_2).
% 1142 [hyper:61,76,167,cut:47] product(e_3,e_1,e_2) | product(e_1,e_1,e_2) | product(e_3,e_1,e_3) | product(e_3,e_1,e_4).
% 1150 [hyper:61,76,167,cut:47] product(e_3,e_1,e_3) | product(e_1,e_1,e_1) | product(e_3,e_1,e_4) | product(e_3,e_1,e_1).
% 1400 [hyper:62,571,167] product(e_1,e_2,e_2) | product(e_1,e_1,e_1) | product(e_2,e_1,e_3).
% 1580 [hyper:60,1400,167,cut:46] product(e_2,e_1,e_3) | product(e_1,e_1,e_1).
% 1582 [hyper:60,1400,67,cut:49] product(e_1,e_2,e_3) | product(e_1,e_2,e_4) | product(e_2,e_1,e_3) | product(e_1,e_2,e_2).
% 1655 [hyper:60,79,167,cut:48] product(e_1,e_4,e_4) | product(e_1,e_1,e_2) | product(e_1,e_4,e_3) | product(e_1,e_4,e_2).
% 1720 [hyper:59,1580,574,cut:49] product(e_2,e_1,e_2) | product(e_2,e_1,e_3).
% 1886 [hyper:60,1720,68,cut:49] product(e_2,e_2,e_2) | product(e_2,e_2,e_1) | product(e_2,e_1,e_2) | product(e_2,e_2,e_4).
% 2327 [hyper:61,84,1580,cut:51] product(e_4,e_1,e_2) | product(e_1,e_1,e_1) | product(e_4,e_1,e_1) | product(e_4,e_1,e_4).
% 5162 [hyper:61,1150,1580,cut:50] product(e_3,e_1,e_1) | product(e_1,e_1,e_1) | product(e_3,e_1,e_4).
% 5210 [hyper:62,5162,167] product(e_1,e_3,e_2) | product(e_1,e_1,e_1) | product(e_3,e_1,e_4).
% 5326 [hyper:60,5210,167,cut:47] product(e_3,e_1,e_4) | product(e_1,e_1,e_1).
% 5388 [hyper:59,5326,1142,cut:49] product(e_3,e_1,e_3) | product(e_3,e_1,e_4) | product(e_3,e_1,e_2).
% 5498 [hyper:61,5388,1720,cut:50] product(e_3,e_1,e_4) | product(e_2,e_1,e_2) | product(e_3,e_1,e_2).
% 5786 [hyper:62,1582,1720] product(e_2,e_2,e_3) | product(e_2,e_1,e_3) | product(e_1,e_2,e_4) | product(e_1,e_2,e_2).
% 7535 [hyper:61,2327,167,cut:48] product(e_4,e_1,e_4) | product(e_1,e_1,e_1) | product(e_4,e_1,e_1).
% 7614 [hyper:61,7535,5326,cut:54] product(e_4,e_1,e_1) | product(e_1,e_1,e_1).
% 7645 [hyper:62,7614,167] product(e_1,e_4,e_2) | product(e_1,e_1,e_1).
% 7700 [hyper:59,7645,1655,cut:49] product(e_1,e_4,e_3) | product(e_1,e_4,e_2) | product(e_1,e_4,e_4).
% 7703 [hyper:60,7645,167,cut:48] product(e_1,e_1,e_1).
% 7723 [hyper:59,7703,298,cut:49] product(e_1,e_2,e_3) | product(e_1,e_2,e_2) | product(e_1,e_2,e_4).
% 7724 [hyper:59,7703,716,cut:49] product(e_1,e_3,e_3) | product(e_1,e_3,e_2) | product(e_1,e_3,e_4).
% 7731 [hyper:61,7703,84,cut:55] product(e_4,e_1,e_3) | product(e_4,e_1,e_2) | product(e_4,e_1,e_4).
% 8068 [hyper:61,7731,1720,cut:51] product(e_4,e_1,e_2) | product(e_2,e_1,e_2) | product(e_4,e_1,e_4).
% 8837 [hyper:61,5786,7723,cut:46] product(e_1,e_2,e_2) | product(e_1,e_2,e_4) | product(e_2,e_1,e_3).
% 8880 [hyper:62,8837,1720] product(e_2,e_2,e_2) | product(e_2,e_1,e_3) | product(e_1,e_2,e_4).
% 8999 [hyper:60,8880,1720,cut:46] product(e_1,e_2,e_4) | product(e_2,e_1,e_3).
% 9035 [hyper:62,8999,1720] product(e_2,e_2,e_4) | product(e_2,e_1,e_3).
% 9122 [hyper:59,9035,1886,cut:50] product(e_2,e_2,e_2) | product(e_2,e_2,e_4) | product(e_2,e_2,e_1).
% 9138 [hyper:61,9035,8999,cut:46] product(e_2,e_1,e_3).
% 9158 [hyper:62,9138,7724] product(e_1,e_3,e_3) | product(e_1,e_3,e_4) | product(e_3,e_2,e_2).
% 9165 [hyper:59,9138,5498,cut:50] product(e_3,e_1,e_4) | product(e_3,e_1,e_2).
% 9168 [hyper:59,9138,8068,cut:50] product(e_4,e_1,e_2) | product(e_4,e_1,e_4).
% 9386 [hyper:62,9122,9138] product(e_2,e_2,e_4) | product(e_1,e_2,e_3) | product(e_2,e_2,e_2).
% 9515 [hyper:62,9158,7724] product(e_1,e_3,e_3) | product(e_1,e_3,e_4) | product(e_2,e_1,e_2).
% 9871 [hyper:61,9386,7723,cut:46] product(e_1,e_2,e_2) | product(e_1,e_2,e_3) | product(e_2,e_2,e_2).
% 9881 [hyper:61,9386,7723,cut:46] product(e_1,e_2,e_3) | product(e_1,e_2,e_4) | product(e_2,e_2,e_4).
% 10165 [hyper:59,9515,9138,cut:53] product(e_1,e_3,e_3) | product(e_1,e_3,e_4).
% 10209 [hyper:62,10165,9138] product(e_1,e_3,e_3) | product(e_3,e_2,e_4).
% 10218 [hyper:60,10165,7700,cut:57] product(e_1,e_4,e_2) | product(e_1,e_4,e_4) | product(e_1,e_3,e_4).
% 10219 [hyper:60,10165,7723,cut:50] product(e_1,e_2,e_2) | product(e_1,e_2,e_4) | product(e_1,e_3,e_4).
% 10220 [hyper:60,10165,9386,cut:50] product(e_2,e_2,e_4) | product(e_2,e_2,e_2) | product(e_1,e_3,e_4).
% 10224 [hyper:60,10165,7723,cut:50] product(e_1,e_2,e_2) | product(e_1,e_2,e_3) | product(e_1,e_3,e_3).
% 10327 [hyper:60,10209,9165,cut:46] product(e_1,e_3,e_3) | product(e_3,e_1,e_2).
% 10336 [hyper:61,10209,9386,cut:50] product(e_1,e_2,e_3) | product(e_2,e_2,e_2) | product(e_1,e_3,e_3).
% 11744 [hyper:61,10336,10224,cut:46] product(e_1,e_2,e_3) | product(e_1,e_3,e_3).
% 11769 [hyper:62,11744,10327] product(e_2,e_3,e_3) | product(e_1,e_3,e_3).
% 11841 [hyper:60,11769,9138,cut:47] product(e_1,e_3,e_3).
% 11865 [hyper:59,11841,10218,cut:57] product(e_1,e_4,e_4) | product(e_1,e_4,e_2).
% 11866 [hyper:59,11841,10219,cut:57] product(e_1,e_2,e_4) | product(e_1,e_2,e_2).
% 11867 [hyper:59,11841,10220,cut:57] product(e_2,e_2,e_2) | product(e_2,e_2,e_4).
% 11870 [hyper:60,11841,9871,cut:50] product(e_1,e_2,e_2) | product(e_2,e_2,e_2).
% 11871 [hyper:60,11841,9881,cut:50] product(e_1,e_2,e_4) | product(e_2,e_2,e_4).
% 11975 [hyper:60,11866,11865,cut:56] product(e_1,e_2,e_2) | product(e_1,e_4,e_2).
% 12046 [hyper:62,11870,11867] product(e_2,e_1,e_4) | product(e_2,e_2,e_2).
% 12223 [hyper:41,12046,40,cut:33] product(e_2,e_2,e_2).
% 12244 [hyper:59,12223,11871,cut:56] product(e_1,e_2,e_4).
% 12251 [hyper:61,12223,11975,cut:46] product(e_1,e_4,e_2).
% 12262 [hyper:62,12244,9168] product(e_2,e_4,e_4) | product(e_4,e_1,e_4).
% 12421 [hyper:62,12262,12244] product(e_4,e_1,e_4).
% 12449 [hyper:62,12421,12251] product(e_4,e_4,e_2).
% 12482 [hyper:61,12449,12251,cut:48] 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 11
% clause depth limited to 1
% seconds given: 27
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    206
%  derived clauses:   52860
%  kept clauses:      4272
%  kept size sum:     95788
%  kept mid-nuclei:   7979
%  kept new demods:   0
%  forw unit-subs:    13793
%  forw double-subs: 4120
%  forw overdouble-subs: 22534
%  backward subs:     469
%  fast unit cutoff:  21187
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  1.79
%  process. runtime:  1.76
% specific non-discr-tree subsumption statistics: 
%  tried:           1476987
%  length fails:    38899
%  strength fails:  657073
%  predlist fails:  261969
%  aux str. fails:  384
%  by-lit fails:    327188
%  full subs tried: 0
%  full subs fail:  0
% 
% ; 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/GRP129-2.004+noeq.in")
% 
%------------------------------------------------------------------------------