TSTP Solution File: GRP124-3.004 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP124-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 : art02.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/GRP124-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(44,40,0,88,0,1)
%
%
% START OF PROOF
% 45 [] next(e_0,e_1).
% 46 [] next(e_1,e_2).
% 47 [] next(e_2,e_3).
% 48 [] next(e_3,e_4).
% 49 [] greater(e_1,e_0).
% 50 [] greater(e_2,e_0).
% 51 [] greater(e_3,e_0).
% 56 [] greater(e_3,e_2).
% 57 [] greater(e_4,e_2).
% 60 [] cycle(X,e_2) | cycle(X,e_3) | cycle(X,e_1) | cycle(X,e_0) | -group_element(X).
% 61 [] cycle(e_4,e_0).
% 62 [] -greater(X,e_0) | -cycle(Y,Z) | -cycle(U,X) | -next(Z,V) | -next(U,Y) | equalish(X,V).
% 63 [] -cycle(X,e_0) | -cycle(Y,Z) | -cycle(U,V) | -greater(X,U) | -greater(V,Z) | -next(X,Y).
% 64 [] -product(X,e_1,Y) | -cycle(X,e_0) | -greater(Y,X).
% 65 [] -product(X,e_1,Y) | -greater(Z,e_0) | -cycle(X,Z) | -next(X,U) | equalish(Y,U).
% 66 [] group_element(e_1).
% 67 [] group_element(e_2).
% 68 [] group_element(e_3).
% 70 [] -equalish(e_1,e_2).
% 71 [] -equalish(e_1,e_3).
% 73 [] -equalish(e_2,e_1).
% 74 [] -equalish(e_2,e_3).
% 76 [] -equalish(e_3,e_1).
% 77 [] -equalish(e_3,e_2).
% 81 [] -equalish(e_4,e_3).
% 82 [] 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).
% 84 [] -product(X,U,Z) | -product(X,Y,Z) | equalish(Y,U).
% 85 [] -product(U,Y,Z) | -product(X,Y,Z) | equalish(X,U).
% 86 [] product(X,X,X).
% 87 [] -product(W,X,Y) | -product(W,U,V) | -product(U,V,Z) | -product(X,Y,Z) | equalish(U,X).
% 92 [hyper:60,67] cycle(e_2,e_3) | cycle(e_2,e_2) | cycle(e_2,e_0) | cycle(e_2,e_1).
% 94 [hyper:82,67,66] 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).
% 96 [hyper:82,67,66] 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).
% 97 [hyper:60,68] cycle(e_3,e_3) | cycle(e_3,e_2) | cycle(e_3,e_0) | cycle(e_3,e_1).
% 99 [hyper:82,68,66] 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).
% 100 [hyper:82,68,67] 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).
% 1217 [hyper:62,97,48,61,45,cut:51,cut:76] cycle(e_3,e_2) | cycle(e_3,e_1) | cycle(e_3,e_0).
% 1716 [hyper:62,1217,48,61,45,cut:50,cut:73] cycle(e_3,e_1) | cycle(e_3,e_0).
% 2146 [hyper:62,1716,47,51,92,46,cut:77] cycle(e_2,e_1) | cycle(e_2,e_0) | cycle(e_3,e_0) | cycle(e_2,e_2).
% 2600 [hyper:84,94,86,cut:70] product(e_1,e_2,e_2) | product(e_1,e_2,e_4) | product(e_1,e_2,e_3).
% 2667 [hyper:62,2146,47,1716,46,cut:49,cut:70] cycle(e_2,e_0) | cycle(e_3,e_0) | cycle(e_2,e_2).
% 2693 [hyper:62,2146,47,92,45,cut:51,cut:76] cycle(e_2,e_1) | cycle(e_2,e_0) | cycle(e_2,e_2).
% 3507 [hyper:63,2693,49,56,48,2667,cut:61] cycle(e_2,e_0) | cycle(e_2,e_2).
% 3835 [hyper:84,96,86,cut:73] product(e_2,e_1,e_1) | product(e_2,e_1,e_3) | product(e_2,e_1,e_4).
% 4507 [hyper:84,99,86,cut:71] product(e_1,e_3,e_2) | product(e_1,e_3,e_4) | product(e_1,e_3,e_3).
% 4596 [hyper:85,2600,86,cut:73] product(e_1,e_2,e_3) | product(e_1,e_2,e_4).
% 4691 [hyper:84,100,86,cut:74] product(e_2,e_3,e_3) | product(e_2,e_3,e_1) | product(e_2,e_3,e_4).
% 5096 [hyper:85,3835,86,cut:70] product(e_2,e_1,e_4) | product(e_2,e_1,e_3).
% 5153 [hyper:64,5096,3507,cut:57] product(e_2,e_1,e_3) | cycle(e_2,e_2).
% 5426 [hyper:65,5153,5096,47,cut:50,cut:81] product(e_2,e_1,e_3).
% 6237 [hyper:85,4507,86,cut:76] product(e_1,e_3,e_2) | product(e_1,e_3,e_4).
% 6408 [hyper:87,6237,5426,86,cut:86,cut:70] product(e_1,e_3,e_4).
% 6441 [hyper:84,6408,4596,cut:74] product(e_1,e_2,e_3).
% 7086 [hyper:84,4691,5426,cut:71] product(e_2,e_3,e_4) | product(e_2,e_3,e_1).
% 7203 [hyper:85,7086,6408,cut:70] product(e_2,e_3,e_1).
% 7238 [hyper:87,7203,6441,86,cut:86] equalish(e_2,e_1).
% 7316 [hyper:73,7238] 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: 88
% derived clauses: 10663
% kept clauses: 194
% kept size sum: 2347
% kept mid-nuclei: 6979
% kept new demods: 0
% forw unit-subs: 1170
% forw double-subs: 480
% forw overdouble-subs: 1706
% backward subs: 72
% fast unit cutoff: 1728
% full unit cutoff: 0
% dbl unit cutoff: 8
% real runtime : 0.38
% process. runtime: 0.38
% specific non-discr-tree subsumption statistics:
% tried: 21309
% length fails: 1284
% strength fails: 3584
% predlist fails: 4224
% aux str. fails: 794
% by-lit fails: 8170
% full subs tried: 1349
% full subs fail: 1318
%
% ; 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/GRP124-3.004+noeq.in")
%
%------------------------------------------------------------------------------