%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP123-8.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 : 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/GRP123-8.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 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(36,40,1,72,0,1)
%
%
% START OF PROOF
% 53 [] group_element(e_1).
% 54 [] group_element(e_2).
% 55 [] group_element(e_3).
% 56 [] -equalish(e_1,e_2).
% 57 [] -equalish(e_1,e_3).
% 58 [] -equalish(e_2,e_1).
% 60 [] -equalish(e_3,e_1).
% 62 [] product1(X,Y,e_2) | product1(X,Y,e_3) | product1(X,Y,e_1) | -group_element(X) | -group_element(Y).
% 64 [] -product1(X,U,Z) | -product1(X,Y,Z) | equalish(Y,U).
% 65 [] -product1(U,Y,Z) | -product1(X,Y,Z) | equalish(X,U).
% 66 [] product1(X,X,X).
% 68 [] -product2(X,Y,U) | -product2(X,Y,Z) | equalish(Z,U).
% 71 [] product2(X,X,X).
% 72 [] -product1(Z,Y,U) | -product1(X,Y,Z) | product2(U,X,Y).
% 80 [hyper:62,54,53] product1(e_2,e_1,e_1) | product1(e_2,e_1,e_2) | product1(e_2,e_1,e_3).
% 88 [hyper:62,55,53] product1(e_3,e_1,e_1) | product1(e_3,e_1,e_2) | product1(e_3,e_1,e_3).
% 1702 [hyper:64,80,66,cut:58] product1(e_2,e_1,e_3) | product1(e_2,e_1,e_1).
% 1734 [hyper:65,1702,66,cut:56] product1(e_2,e_1,e_3).
% 1966 [hyper:64,88,66,cut:60] product1(e_3,e_1,e_1) | product1(e_3,e_1,e_2).
% 1997 [hyper:65,1966,66,cut:57] product1(e_3,e_1,e_2).
% 2009 [hyper:72,1997,1734] product2(e_2,e_2,e_1).
% 2027 [hyper:68,2009,71,cut:58] 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: 60
% derived clauses: 2985
% kept clauses: 67
% kept size sum: 642
% kept mid-nuclei: 1852
% kept new demods: 0
% forw unit-subs: 364
% forw double-subs: 421
% forw overdouble-subs: 222
% backward subs: 29
% fast unit cutoff: 438
% full unit cutoff: 0
% dbl unit cutoff: 4
% real runtime : 0.8
% process. runtime: 0.7
% specific non-discr-tree subsumption statistics:
% tried: 1716
% length fails: 32
% strength fails: 501
% predlist fails: 370
% aux str. fails: 53
% by-lit fails: 490
% full subs tried: 34
% full subs fail: 34
%
% ; 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/GRP123-8.003+noeq.in")
%
%------------------------------------------------------------------------------