%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP130-2.003 : 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 : art10.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/GRP130-2.003+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 9)
% (binary-unit 10 #f 1 9)
% (binary-double 16 #f 1 9)
% (binary 54 #t 1 9)
% (binary-order 27 #f 1 9)
% (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(20,40,0,40,0,0)
%
%
% START OF PROOF
% 21 [] next(e_1,e_2).
% 25 [] greater(e_3,e_2).
% 26 [] -product(X,e_1,Y) | -greater(Y,Z) | -next(X,Z).
% 27 [] group_element(e_1).
% 28 [] group_element(e_2).
% 29 [] group_element(e_3).
% 30 [] -equalish(e_1,e_2).
% 32 [] -equalish(e_2,e_1).
% 33 [] -equalish(e_2,e_3).
% 34 [] -equalish(e_3,e_1).
% 35 [] -equalish(e_3,e_2).
% 36 [] product(X,Y,e_2) | product(X,Y,e_3) | product(X,Y,e_1) | -group_element(X) | -group_element(Y).
% 37 [] -product(X,Y,U) | -product(X,Y,Z) | equalish(Z,U).
% 38 [] -product(X,U,Z) | -product(X,Y,Z) | equalish(Y,U).
% 39 [] -product(U,Y,Z) | -product(X,Y,Z) | equalish(X,U).
% 40 [] -product(X,Z,U) | -product(X,Y,Z) | product(U,Y,X).
% 42 [hyper:36,27,27] product(e_1,e_1,e_1) | product(e_1,e_1,e_2) | product(e_1,e_1,e_3).
% 45 [hyper:36,28,27] product(e_2,e_1,e_1) | product(e_2,e_1,e_2) | product(e_2,e_1,e_3).
% 46 [hyper:36,28,28] product(e_2,e_2,e_1) | product(e_2,e_2,e_2) | product(e_2,e_2,e_3).
% 48 [hyper:36,28,27] product(e_1,e_2,e_2) | product(e_1,e_2,e_3) | product(e_1,e_2,e_1).
% 50 [hyper:36,29,27] product(e_3,e_1,e_1) | product(e_3,e_1,e_2) | product(e_3,e_1,e_3).
% 54 [hyper:36,29,27] product(e_1,e_3,e_2) | product(e_1,e_3,e_3) | product(e_1,e_3,e_1).
% 85 [hyper:26,42,25,cut:21] product(e_1,e_1,e_1) | product(e_1,e_1,e_2).
% 172 [hyper:40,45,45] product(e_2,e_1,e_2) | product(e_2,e_1,e_3) | product(e_1,e_1,e_2).
% 423 [hyper:40,48,85] product(e_1,e_2,e_3) | product(e_1,e_1,e_1) | product(e_1,e_2,e_2).
% 1362 [hyper:38,423,48,cut:32] product(e_1,e_2,e_3) | product(e_1,e_2,e_2).
% 1364 [hyper:38,423,85,cut:30] product(e_1,e_2,e_3) | product(e_1,e_1,e_1).
% 1386 [hyper:40,1362,1362] product(e_2,e_2,e_1) | product(e_1,e_2,e_3).
% 1424 [hyper:40,1364,85] product(e_3,e_1,e_1) | product(e_1,e_1,e_1).
% 1492 [hyper:39,1386,46,cut:32] product(e_2,e_2,e_2) | product(e_2,e_2,e_1).
% 1514 [hyper:40,1424,1424] product(e_1,e_1,e_3) | product(e_1,e_1,e_1).
% 1607 [hyper:26,1514,25,cut:21] product(e_1,e_1,e_1).
% 1628 [hyper:37,1607,172,cut:32] product(e_2,e_1,e_3) | product(e_2,e_1,e_2).
% 1631 [hyper:38,1607,54,cut:34] product(e_1,e_3,e_3) | product(e_1,e_3,e_2).
% 1634 [hyper:39,1607,50,cut:34] product(e_3,e_1,e_2) | product(e_3,e_1,e_3).
% 1655 [hyper:40,1628,1492] product(e_2,e_1,e_3) | product(e_2,e_2,e_2).
% 1710 [hyper:40,1631,1386] product(e_1,e_3,e_3) | product(e_2,e_2,e_1).
% 1825 [hyper:38,1655,1628,cut:30] product(e_2,e_1,e_3).
% 1857 [hyper:39,1825,1634,cut:35] product(e_3,e_1,e_2).
% 1949 [hyper:38,1710,1386,cut:33] product(e_2,e_2,e_1).
% 1964 [hyper:40,1949,1825] product(e_3,e_2,e_2).
% 1985 [hyper:38,1964,1857,cut:30] 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 9
% clause depth limited to 1
% seconds given: 27
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 66
% derived clauses: 5599
% kept clauses: 401
% kept size sum: 5531
% kept mid-nuclei: 1499
% kept new demods: 0
% forw unit-subs: 1326
% forw double-subs: 488
% forw overdouble-subs: 1815
% backward subs: 92
% fast unit cutoff: 1547
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.12
% process. runtime: 0.11
% specific non-discr-tree subsumption statistics:
% tried: 13111
% length fails: 884
% strength fails: 3089
% predlist fails: 3011
% aux str. fails: 35
% by-lit fails: 2587
% 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/GRP130-2.003+noeq.in")
%
%------------------------------------------------------------------------------