%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP127-3.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 : art01.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/GRP127-3.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(43,40,1,86,0,1)
%
%
% START OF PROOF
% 44 [] next(e_0,e_1).
% 45 [] next(e_1,e_2).
% 46 [] next(e_2,e_3).
% 47 [] next(e_3,e_4).
% 48 [] greater(e_1,e_0).
% 49 [] greater(e_2,e_0).
% 50 [] greater(e_3,e_0).
% 55 [] greater(e_3,e_2).
% 56 [] greater(e_4,e_2).
% 59 [] cycle(X,e_2) | cycle(X,e_3) | cycle(X,e_1) | cycle(X,e_0) | -group_element(X).
% 60 [] cycle(e_4,e_0).
% 61 [] -greater(X,e_0) | -cycle(Y,Z) | -cycle(U,X) | -next(Z,V) | -next(U,Y) | equalish(X,V).
% 62 [] -cycle(X,e_0) | -cycle(Y,Z) | -cycle(U,V) | -greater(X,U) | -greater(V,Z) | -next(X,Y).
% 63 [] -product(X,e_1,Y) | -cycle(X,e_0) | -greater(Y,X).
% 64 [] -product(X,e_1,Y) | -greater(Z,e_0) | -cycle(X,Z) | -next(X,U) | equalish(Y,U).
% 65 [] group_element(e_1).
% 66 [] group_element(e_2).
% 67 [] group_element(e_3).
% 69 [] -equalish(e_1,e_2).
% 70 [] -equalish(e_1,e_3).
% 72 [] -equalish(e_2,e_1).
% 73 [] -equalish(e_2,e_3).
% 75 [] -equalish(e_3,e_1).
% 76 [] -equalish(e_3,e_2).
% 77 [] -equalish(e_3,e_4).
% 80 [] -equalish(e_4,e_3).
% 81 [] 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).
% 83 [] -product(X,U,Z) | -product(X,Y,Z) | equalish(Y,U).
% 84 [] -product(U,Y,Z) | -product(X,Y,Z) | equalish(X,U).
% 85 [] product(X,X,X).
% 86 [] -product(Z,X,U) | -product(X,Y,Z) | product(U,X,Y).
% 90 [hyper:59,66] cycle(e_2,e_3) | cycle(e_2,e_2) | cycle(e_2,e_0) | cycle(e_2,e_1).
% 92 [hyper:81,66,65] 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).
% 94 [hyper:81,66,65] 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).
% 95 [hyper:59,67] cycle(e_3,e_3) | cycle(e_3,e_2) | cycle(e_3,e_0) | cycle(e_3,e_1).
% 97 [hyper:81,67,65] 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).
% 98 [hyper:81,67,66] product(e_2,e_3,e_4) | product(e_2,e_3,e_3) | product(e_2,e_3,e_2) | product(e_2,e_3,e_1).
% 1169 [hyper:83,92,85,cut:69] product(e_1,e_2,e_2) | product(e_1,e_2,e_4) | product(e_1,e_2,e_3).
% 1242 [hyper:61,95,47,60,44,cut:50,cut:75] cycle(e_3,e_2) | cycle(e_3,e_1) | cycle(e_3,e_0).
% 1741 [hyper:61,1242,47,60,44,cut:49,cut:72] cycle(e_3,e_1) | cycle(e_3,e_0).
% 2171 [hyper:61,1741,46,50,90,45,cut:76] cycle(e_2,e_1) | cycle(e_2,e_0) | cycle(e_3,e_0) | cycle(e_2,e_2).
% 2674 [hyper:83,94,85,cut:72] product(e_2,e_1,e_1) | product(e_2,e_1,e_3) | product(e_2,e_1,e_4).
% 2742 [hyper:61,2171,46,1741,45,cut:48,cut:69] cycle(e_2,e_0) | cycle(e_3,e_0) | cycle(e_2,e_2).
% 2768 [hyper:61,2171,46,90,44,cut:50,cut:75] cycle(e_2,e_1) | cycle(e_2,e_0) | cycle(e_2,e_2).
% 3598 [hyper:62,2768,48,55,47,2742,cut:60] cycle(e_2,e_0) | cycle(e_2,e_2).
% 3871 [hyper:83,97,85,cut:70] product(e_1,e_3,e_2) | product(e_1,e_3,e_4) | product(e_1,e_3,e_3).
% 4488 [hyper:83,98,85,cut:73] product(e_2,e_3,e_3) | product(e_2,e_3,e_1) | product(e_2,e_3,e_4).
% 4535 [hyper:84,1169,85,cut:72] product(e_1,e_2,e_3) | product(e_1,e_2,e_4).
% 4826 [hyper:84,2674,85,cut:69] product(e_2,e_1,e_4) | product(e_2,e_1,e_3).
% 4859 [hyper:63,4826,3598,cut:56] product(e_2,e_1,e_3) | cycle(e_2,e_2).
% 5017 [hyper:63,4859,cut:55,binarycut:3598] cycle(e_2,e_2).
% 5021 [hyper:64,4859,4826,46,cut:49,cut:80] product(e_2,e_1,e_3).
% 5054 [hyper:61,5017,46,1741,44,cut:49,cut:72] cycle(e_3,e_1).
% 5478 [hyper:84,3871,85,cut:75] product(e_1,e_3,e_2) | product(e_1,e_3,e_4).
% 5498 [hyper:86,5478,5021] product(e_1,e_3,e_4) | product(e_3,e_1,e_3).
% 5542 [hyper:64,5498,5054,47,cut:48,cut:77] product(e_1,e_3,e_4).
% 5612 [hyper:83,5542,4535,cut:73] product(e_1,e_2,e_3).
% 5703 [hyper:83,4488,5021,cut:70] product(e_2,e_3,e_4) | product(e_2,e_3,e_1).
% 5735 [hyper:84,5703,5542,cut:69] product(e_2,e_3,e_1).
% 5748 [hyper:86,5735,5612] product(e_3,e_2,e_3).
% 5770 [hyper:83,5748,85,cut:76] 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: 87
% derived clauses: 8526
% kept clauses: 231
% kept size sum: 3502
% kept mid-nuclei: 5399
% kept new demods: 0
% forw unit-subs: 808
% forw double-subs: 424
% forw overdouble-subs: 1537
% backward subs: 68
% fast unit cutoff: 1784
% full unit cutoff: 0
% dbl unit cutoff: 8
% real runtime : 0.28
% process. runtime: 0.27
% specific non-discr-tree subsumption statistics:
% tried: 21352
% length fails: 1434
% strength fails: 4887
% predlist fails: 3817
% aux str. fails: 785
% by-lit fails: 8199
% full subs tried: 329
% full subs fail: 329
%
% ; 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/GRP127-3.004+noeq.in")
%
%------------------------------------------------------------------------------