TSTP Solution File: GRP133-1.003 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP133-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 : 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/GRP133-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,0,28,0,0)
%
%
% 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,X).
% 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).
% 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).
% 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).
% 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).
% 379 [hyper:26,36,30,cut:18] product(e_1,e_1,e_1) | product(e_1,e_1,e_3) | product(e_1,e_2,e_1) | product(e_1,e_2,e_3).
% 383 [hyper:26,36,30,cut:18] product(e_1,e_1,e_2) | product(e_1,e_1,e_1) | product(e_1,e_2,e_1) | product(e_1,e_2,e_2).
% 593 [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).
% 1267 [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).
% 1382 [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).
% 1544 [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).
% 1746 [hyper:28,593,593] product(e_3,e_3,e_3) | product(e_1,e_1,e_3) | product(e_2,e_2,e_3).
% 1971 [hyper:25,1267,169,cut:20] product(e_2,e_1,e_3) | product(e_2,e_1,e_2) | product(e_1,e_1,e_3).
% 2042 [hyper:25,1382,62,cut:18] product(e_1,e_1,e_1) | product(e_1,e_1,e_2) | product(e_2,e_2,e_2).
% 2096 [hyper:28,1544,1544] product(e_2,e_2,e_2) | product(e_2,e_1,e_3) | product(e_3,e_3,e_2).
% 2183 [hyper:25,1746,59,cut:19] product(e_1,e_1,e_3) | product(e_1,e_1,e_1) | product(e_3,e_3,e_3).
% 2776 [hyper:26,2042,176,cut:18] product(e_1,e_1,e_1) | product(e_1,e_1,e_2) | product(e_2,e_1,e_1).
% 2830 [hyper:26,2096,1971,cut:18] product(e_2,e_1,e_3) | product(e_1,e_1,e_3) | product(e_3,e_3,e_2).
% 4616 [hyper:27,379,59,cut:20] product(e_1,e_1,e_3) | product(e_1,e_1,e_1) | product(e_1,e_2,e_3).
% 4650 [hyper:28,383,2776] product(e_1,e_1,e_2) | product(e_1,e_1,e_1) | product(e_1,e_2,e_2).
% 4842 [hyper:27,4650,2042,cut:20] product(e_1,e_1,e_2) | product(e_1,e_1,e_1).
% 4890 [hyper:25,4842,1267,cut:23] product(e_1,e_1,e_1) | product(e_2,e_1,e_3).
% 4892 [hyper:25,4842,2183,cut:23] product(e_1,e_1,e_1) | product(e_3,e_3,e_3).
% 4893 [hyper:25,4842,4616,cut:23] product(e_1,e_1,e_1) | product(e_1,e_2,e_3).
% 5008 [hyper:25,4890,2830,cut:22] product(e_2,e_1,e_3) | product(e_3,e_3,e_2).
% 5095 [hyper:28,4893,4890] product(e_3,e_3,e_2) | product(e_1,e_1,e_1).
% 5106 [hyper:26,4893,36,cut:20] product(e_1,e_2,e_3) | product(e_1,e_2,e_2).
% 5437 [hyper:25,5095,4892,cut:23] product(e_1,e_1,e_1).
% 5440 [hyper:25,5095,1382,cut:20] product(e_2,e_2,e_2) | product(e_3,e_3,e_2).
% 5529 [hyper:26,5437,42,cut:22] product(e_1,e_3,e_3) | product(e_1,e_3,e_2).
% 5532 [hyper:27,5437,38,cut:22] product(e_3,e_1,e_2) | product(e_3,e_1,e_3).
% 5547 [hyper:28,5106,5008] product(e_1,e_2,e_2) | product(e_3,e_3,e_2).
% 5833 [hyper:27,5547,5440,cut:20] product(e_3,e_3,e_2).
% 5857 [hyper:26,5833,5532,cut:19] product(e_3,e_1,e_3).
% 5861 [hyper:27,5833,5529,cut:19] product(e_1,e_3,e_3).
% 5921 [hyper:28,5861,5857] product(e_3,e_3,e_3).
% 5961 [hyper:25,5921,5833,cut:21] 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: 125
% derived clauses: 53600
% kept clauses: 1397
% kept size sum: 22740
% kept mid-nuclei: 4430
% kept new demods: 0
% forw unit-subs: 16507
% forw double-subs: 1799
% forw overdouble-subs: 29373
% backward subs: 214
% fast unit cutoff: 18979
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 1.3
% process. runtime: 1.1
% specific non-discr-tree subsumption statistics:
% tried: 475760
% length fails: 13400
% strength fails: 90018
% predlist fails: 65417
% aux str. fails: 0
% by-lit fails: 175758
% 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/GRP133-1.003+noeq.in")
%
%------------------------------------------------------------------------------