TSTP Solution File: GRP134-1.003 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP134-1.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 : art04.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/GRP134-1.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(14,40,1,28,0,1)
%
%
% START OF PROOF
% 15 [] group_element(e_1).
% 16 [] group_element(e_2).
% 17 [] group_element(e_3).
% 18 [] -equalish(e_1,e_2).
% 19 [] -equalish(e_1,e_3).
% 20 [] -equalish(e_2,e_1).
% 21 [] -equalish(e_2,e_3).
% 22 [] -equalish(e_3,e_1).
% 23 [] -equalish(e_3,e_2).
% 24 [] product(X,Y,e_2) | product(X,Y,e_3) | product(X,Y,e_1) | -group_element(X) | -group_element(Y).
% 25 [] -product(X,Y,U) | -product(X,Y,Z) | equalish(Z,U).
% 26 [] -product(X,U,Z) | -product(X,Y,Z) | equalish(Y,U).
% 27 [] -product(U,Y,Z) | -product(X,Y,Z) | equalish(X,U).
% 28 [] -product(Y,X,U) | -product(X,Y,Z) | product(Z,U,Y).
% 30 [hyper:24,15,15] product(e_1,e_1,e_1) | product(e_1,e_1,e_2) | product(e_1,e_1,e_3).
% 33 [hyper:24,16,15] product(e_2,e_1,e_1) | product(e_2,e_1,e_2) | product(e_2,e_1,e_3).
% 34 [hyper:24,16,16] product(e_2,e_2,e_1) | product(e_2,e_2,e_2) | product(e_2,e_2,e_3).
% 36 [hyper:24,16,15] product(e_1,e_2,e_2) | product(e_1,e_2,e_3) | product(e_1,e_2,e_1).
% 38 [hyper:24,17,15] product(e_3,e_1,e_1) | product(e_3,e_1,e_2) | product(e_3,e_1,e_3).
% 39 [hyper:24,17,16] product(e_3,e_2,e_1) | product(e_3,e_2,e_2) | product(e_3,e_2,e_3).
% 40 [hyper:24,17,17] product(e_3,e_3,e_1) | product(e_3,e_3,e_2) | product(e_3,e_3,e_3).
% 42 [hyper:24,17,15] product(e_1,e_3,e_2) | product(e_1,e_3,e_3) | product(e_1,e_3,e_1).
% 43 [hyper:24,17,16] product(e_2,e_3,e_2) | product(e_2,e_3,e_3) | product(e_2,e_3,e_1).
% 59 [hyper:28,30,30] product(e_1,e_1,e_1) | product(e_1,e_1,e_3) | product(e_2,e_2,e_1).
% 62 [hyper:28,30,30] product(e_1,e_1,e_2) | product(e_1,e_1,e_1) | product(e_3,e_3,e_1).
% 169 [hyper:27,33,30,cut:18] product(e_1,e_1,e_2) | product(e_1,e_1,e_3) | product(e_2,e_1,e_3) | product(e_2,e_1,e_2).
% 173 [hyper:27,33,30,cut:18] product(e_1,e_1,e_1) | product(e_1,e_1,e_3) | product(e_2,e_1,e_3) | product(e_2,e_1,e_1).
% 176 [hyper:27,33,30,cut:18] product(e_1,e_1,e_2) | product(e_1,e_1,e_1) | product(e_2,e_1,e_1) | product(e_2,e_1,e_2).
% 205 [hyper:28,34,34] product(e_2,e_2,e_2) | product(e_2,e_2,e_3) | product(e_1,e_1,e_2).
% 210 [hyper:28,34,34] product(e_2,e_2,e_2) | product(e_2,e_2,e_1) | product(e_3,e_3,e_2).
% 221 [hyper:26,34,33,cut:18] product(e_2,e_1,e_2) | product(e_2,e_1,e_3) | product(e_2,e_2,e_3) | product(e_2,e_2,e_2).
% 225 [hyper:26,34,33,cut:18] product(e_2,e_1,e_1) | product(e_2,e_1,e_3) | product(e_2,e_2,e_3) | product(e_2,e_2,e_1).
% 228 [hyper:26,34,33,cut:18] product(e_2,e_1,e_2) | product(e_2,e_1,e_1) | product(e_2,e_2,e_1) | product(e_2,e_2,e_2).
% 351 [hyper:28,36,33] product(e_2,e_1,e_2) | product(e_2,e_1,e_3) | product(e_1,e_2,e_3) | product(e_1,e_2,e_1).
% 595 [hyper:28,40,40] product(e_3,e_3,e_2) | product(e_3,e_3,e_3) | product(e_1,e_1,e_3).
% 993 [hyper:28,59,59] product(e_1,e_1,e_1) | product(e_2,e_2,e_1) | product(e_3,e_3,e_1).
% 1277 [hyper:26,173,59,cut:20] product(e_1,e_1,e_3) | product(e_1,e_1,e_1) | product(e_2,e_1,e_3).
% 1394 [hyper:28,205,205] product(e_2,e_2,e_2) | product(e_1,e_1,e_2) | product(e_3,e_3,e_2).
% 1556 [hyper:27,221,205,cut:18] product(e_2,e_2,e_3) | product(e_2,e_2,e_2) | product(e_2,e_1,e_3).
% 1758 [hyper:28,595,595] product(e_3,e_3,e_3) | product(e_1,e_1,e_3) | product(e_2,e_2,e_3).
% 1916 [hyper:25,993,210,cut:20] product(e_2,e_2,e_1) | product(e_2,e_2,e_2) | product(e_1,e_1,e_1).
% 1983 [hyper:25,1277,169,cut:20] product(e_2,e_1,e_3) | product(e_2,e_1,e_2) | product(e_1,e_1,e_3).
% 2054 [hyper:25,1394,62,cut:18] product(e_1,e_1,e_1) | product(e_1,e_1,e_2) | product(e_2,e_2,e_2).
% 2210 [hyper:25,1556,225,cut:18] product(e_2,e_1,e_3) | product(e_2,e_1,e_1) | product(e_2,e_2,e_3).
% 2413 [hyper:25,1916,1556,cut:22] product(e_2,e_2,e_2) | product(e_2,e_1,e_3) | product(e_1,e_1,e_1).
% 2443 [hyper:27,1916,228,cut:20] product(e_2,e_2,e_1) | product(e_2,e_2,e_2) | product(e_2,e_1,e_2).
% 2551 [hyper:26,1983,1758,cut:20] product(e_1,e_1,e_3) | product(e_3,e_3,e_3) | product(e_2,e_1,e_2).
% 2557 [hyper:26,1983,1556,cut:20] product(e_2,e_2,e_3) | product(e_2,e_1,e_3) | product(e_1,e_1,e_3).
% 2562 [hyper:26,1983,351,cut:20] product(e_2,e_1,e_2) | product(e_1,e_2,e_1) | product(e_2,e_1,e_3).
% 2687 [hyper:26,2054,176,cut:18] product(e_1,e_1,e_1) | product(e_1,e_1,e_2) | product(e_2,e_1,e_1).
% 2980 [hyper:25,2413,2210,cut:23] product(e_2,e_1,e_1) | product(e_2,e_1,e_3) | product(e_1,e_1,e_1).
% 3036 [hyper:28,2443,2443] product(e_2,e_2,e_2) | product(e_2,e_1,e_2) | product(e_1,e_1,e_2).
% 3188 [hyper:27,2551,33,cut:20] product(e_2,e_1,e_2) | product(e_2,e_1,e_1) | product(e_3,e_3,e_3).
% 3287 [hyper:28,2562,33] product(e_2,e_1,e_2) | product(e_2,e_1,e_3) | product(e_1,e_1,e_1).
% 4123 [hyper:25,3287,2980,cut:18] product(e_2,e_1,e_3) | product(e_1,e_1,e_1).
% 4132 [hyper:25,3287,1983,cut:22] product(e_2,e_1,e_2) | product(e_2,e_1,e_3).
% 4167 [hyper:25,4123,2687,cut:19] product(e_1,e_1,e_2) | product(e_1,e_1,e_1).
% 4173 [hyper:25,4123,2557,cut:22] product(e_2,e_1,e_3) | product(e_2,e_2,e_3).
% 4180 [hyper:26,4123,36,cut:20] product(e_1,e_2,e_3) | product(e_1,e_2,e_2) | product(e_2,e_1,e_3).
% 4219 [hyper:25,4132,3188,cut:19] product(e_2,e_1,e_2) | product(e_3,e_3,e_3).
% 4704 [hyper:27,4180,4173,cut:20] product(e_1,e_2,e_2) | product(e_2,e_1,e_3).
% 4728 [hyper:28,4704,4132] product(e_2,e_2,e_1) | product(e_2,e_1,e_3).
% 4779 [hyper:25,4728,4173,cut:22] product(e_2,e_1,e_3).
% 4803 [hyper:25,4779,3036,cut:21] product(e_2,e_2,e_2) | product(e_1,e_1,e_2).
% 4804 [hyper:25,4779,4219,cut:21] product(e_3,e_3,e_3).
% 4807 [hyper:26,4779,43,cut:22] product(e_2,e_3,e_2) | product(e_2,e_3,e_1).
% 4810 [hyper:27,4779,38,cut:23] product(e_3,e_1,e_2) | product(e_3,e_1,e_1).
% 4825 [hyper:26,4804,39,cut:21] product(e_3,e_2,e_2) | product(e_3,e_2,e_1).
% 4828 [hyper:27,4804,42,cut:19] product(e_1,e_3,e_2) | product(e_1,e_3,e_1).
% 4922 [hyper:26,4807,4803,cut:21] product(e_2,e_3,e_1) | product(e_1,e_1,e_2).
% 4960 [hyper:27,4810,4167,cut:19] product(e_3,e_1,e_1) | product(e_1,e_1,e_1).
% 5011 [hyper:27,4825,4803,cut:21] product(e_3,e_2,e_1) | product(e_1,e_1,e_2).
% 5496 [hyper:28,5011,4922] product(e_1,e_1,e_2).
% 5524 [hyper:25,5496,4960,cut:18] product(e_3,e_1,e_1).
% 5528 [hyper:26,5496,4828,cut:22] product(e_1,e_3,e_1).
% 5590 [hyper:28,5528,5524] product(e_1,e_1,e_1).
% 5630 [hyper:25,5590,5496,cut:20] 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: 129
% derived clauses: 44410
% kept clauses: 1213
% kept size sum: 18650
% kept mid-nuclei: 4280
% kept new demods: 0
% forw unit-subs: 14404
% forw double-subs: 2782
% forw overdouble-subs: 21663
% backward subs: 221
% fast unit cutoff: 15303
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.77
% process. runtime: 0.74
% specific non-discr-tree subsumption statistics:
% tried: 257063
% length fails: 8130
% strength fails: 60121
% predlist fails: 48290
% aux str. fails: 0
% by-lit fails: 58324
% 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/GRP134-1.003+noeq.in")
%
%------------------------------------------------------------------------------