TSTP Solution File: GRP130-3.003 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP130-3.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 : art08.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-3.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(30,40,1,60,0,1)
%
%
% START OF PROOF
% 31 [] next(e_0,e_1).
% 32 [] next(e_1,e_2).
% 33 [] next(e_2,e_3).
% 34 [] greater(e_1,e_0).
% 35 [] greater(e_2,e_0).
% 37 [] greater(e_2,e_1).
% 38 [] greater(e_3,e_1).
% 39 [] greater(e_3,e_2).
% 41 [] cycle(X,e_1) | cycle(X,e_2) | cycle(X,e_0) | -group_element(X).
% 42 [] cycle(e_3,e_0).
% 43 [] -greater(X,e_0) | -cycle(Y,Z) | -cycle(U,X) | -next(Z,V) | -next(U,Y) | equalish(X,V).
% 44 [] -cycle(X,e_0) | -cycle(Y,Z) | -cycle(U,V) | -greater(X,U) | -greater(V,Z) | -next(X,Y).
% 45 [] -product(X,e_1,Y) | -cycle(X,e_0) | -greater(Y,X).
% 46 [] -product(X,e_1,Y) | -greater(Z,e_0) | -cycle(X,Z) | -next(X,U) | equalish(Y,U).
% 47 [] group_element(e_1).
% 48 [] group_element(e_2).
% 49 [] group_element(e_3).
% 50 [] -equalish(e_1,e_2).
% 51 [] -equalish(e_1,e_3).
% 52 [] -equalish(e_2,e_1).
% 53 [] -equalish(e_2,e_3).
% 54 [] -equalish(e_3,e_1).
% 55 [] -equalish(e_3,e_2).
% 56 [] product(X,Y,e_2) | product(X,Y,e_3) | product(X,Y,e_1) | -group_element(X) | -group_element(Y).
% 58 [] -product(X,U,Z) | -product(X,Y,Z) | equalish(Y,U).
% 59 [] -product(U,Y,Z) | -product(X,Y,Z) | equalish(X,U).
% 60 [] -product(X,Z,U) | -product(X,Y,Z) | product(U,Y,X).
% 61 [hyper:41,47] cycle(e_1,e_2) | cycle(e_1,e_1) | cycle(e_1,e_0).
% 63 [hyper:56,47,47] product(e_1,e_1,e_1) | product(e_1,e_1,e_2) | product(e_1,e_1,e_3).
% 65 [hyper:41,48] cycle(e_2,e_2) | cycle(e_2,e_1) | cycle(e_2,e_0).
% 67 [hyper:56,48,47] product(e_2,e_1,e_1) | product(e_2,e_1,e_2) | product(e_2,e_1,e_3).
% 70 [hyper:56,48,47] product(e_1,e_2,e_2) | product(e_1,e_2,e_3) | product(e_1,e_2,e_1).
% 72 [hyper:56,49,47] product(e_3,e_1,e_1) | product(e_3,e_1,e_2) | product(e_3,e_1,e_3).
% 76 [hyper:56,49,47] product(e_1,e_3,e_2) | product(e_1,e_3,e_3) | product(e_1,e_3,e_1).
% 288 [hyper:43,65,33,42,31,cut:35,cut:52] cycle(e_2,e_1) | cycle(e_2,e_0).
% 480 [hyper:43,288,32,34,61,32,cut:50] cycle(e_1,e_0) | cycle(e_1,e_2) | cycle(e_2,e_0).
% 1095 [hyper:44,480,33,42,61,cut:37,cut:34] cycle(e_1,e_2) | cycle(e_1,e_0).
% 1958 [hyper:43,1095,32,288,31,cut:35,cut:52] cycle(e_1,e_0) | cycle(e_2,e_1).
% 2391 [hyper:45,63,1095,cut:37] product(e_1,e_1,e_3) | product(e_1,e_1,e_1) | cycle(e_1,e_2).
% 2632 [hyper:45,2391,1095,cut:38] product(e_1,e_1,e_1) | cycle(e_1,e_2).
% 2766 [hyper:43,2632,32,31,288,cut:35,cut:52] product(e_1,e_1,e_1) | cycle(e_2,e_1).
% 2804 [hyper:46,2632,32,63,cut:35,cut:55] product(e_1,e_1,e_2) | product(e_1,e_1,e_1).
% 2896 [hyper:45,67,288,cut:39] product(e_2,e_1,e_1) | product(e_2,e_1,e_2) | cycle(e_2,e_1).
% 3246 [hyper:46,2804,35,1095,32,cut:50] product(e_1,e_1,e_2) | cycle(e_1,e_0).
% 3526 [hyper:58,70,2632,cut:50] product(e_1,e_2,e_3) | product(e_1,e_2,e_2) | cycle(e_1,e_2).
% 3598 [hyper:59,72,2632,cut:51] product(e_3,e_1,e_2) | product(e_3,e_1,e_3) | cycle(e_1,e_2).
% 3608 [hyper:59,72,3246,cut:51] product(e_3,e_1,e_1) | product(e_3,e_1,e_3) | cycle(e_1,e_0).
% 3886 [hyper:59,2896,2766,cut:50] product(e_2,e_1,e_2) | cycle(e_2,e_1).
% 4275 [hyper:46,3886,33,67,cut:34,cut:51] product(e_2,e_1,e_2) | product(e_2,e_1,e_3).
% 4759 [hyper:46,4275,34,33,288,cut:53] product(e_2,e_1,e_3) | cycle(e_2,e_0).
% 4760 [hyper:46,4275,34,33,1958,cut:53] product(e_2,e_1,e_3) | cycle(e_1,e_0).
% 6997 [hyper:59,3598,4759,cut:53] product(e_3,e_1,e_2) | cycle(e_2,e_0) | cycle(e_1,e_2).
% 8748 [hyper:59,3608,4760,cut:53] product(e_3,e_1,e_1) | cycle(e_1,e_0).
% 8847 [hyper:60,8748,8748] product(e_1,e_1,e_3) | cycle(e_1,e_0).
% 9263 [hyper:46,8847,35,32,binarycut:1095,cut:55] cycle(e_1,e_0).
% 9467 [hyper:45,9263,2804,cut:37] product(e_1,e_1,e_1).
% 9586 [hyper:46,9467,35,32,3526,cut:50] product(e_1,e_2,e_2) | product(e_1,e_2,e_3).
% 9588 [hyper:46,9467,35,32,6997,cut:50] product(e_3,e_1,e_2) | cycle(e_2,e_0).
% 9592 [hyper:58,9467,76,cut:54] product(e_1,e_3,e_3) | product(e_1,e_3,e_2).
% 9694 [hyper:45,9588,4275,cut:39] product(e_3,e_1,e_2) | product(e_2,e_1,e_2).
% 9788 [hyper:60,9586,9586] product(e_2,e_2,e_1) | product(e_1,e_2,e_3).
% 10029 [hyper:60,9788,9592] product(e_2,e_2,e_1) | product(e_1,e_3,e_3).
% 10210 [hyper:58,10029,9788,cut:53] product(e_2,e_2,e_1).
% 10223 [hyper:60,10210,3886] product(e_1,e_1,e_2) | cycle(e_2,e_1).
% 10327 [hyper:45,10223,cut:9263,cut:37] cycle(e_2,e_1).
% 10502 [hyper:46,10327,33,4275,cut:34,cut:53] product(e_2,e_1,e_3).
% 10503 [hyper:46,10327,33,9694,cut:34,cut:53] product(e_3,e_1,e_2).
% 10569 [hyper:60,10502,10210] product(e_3,e_2,e_2).
% 10624 [hyper:58,10569,10503,cut:50] 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: 108
% derived clauses: 20207
% kept clauses: 575
% kept size sum: 7052
% kept mid-nuclei: 9901
% kept new demods: 0
% forw unit-subs: 2339
% forw double-subs: 4154
% forw overdouble-subs: 3067
% backward subs: 160
% fast unit cutoff: 4038
% full unit cutoff: 0
% dbl unit cutoff: 9
% real runtime : 0.46
% process. runtime: 0.45
% specific non-discr-tree subsumption statistics:
% tried: 40078
% length fails: 2942
% strength fails: 5705
% predlist fails: 13150
% aux str. fails: 2095
% by-lit fails: 12000
% full subs tried: 177
% full subs fail: 177
%
% ; 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-3.003+noeq.in")
%
%------------------------------------------------------------------------------