TSTP Solution File: GRP129-1.003 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP129-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 : art03.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/GRP129-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,Z,U) | -product(X,Y,Z) | product(Z,X,U).
% 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).
% 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).
% 144 [hyper:28,33,30] product(e_1,e_1,e_1) | product(e_1,e_1,e_3) | product(e_1,e_2,e_2) | product(e_2,e_1,e_3) | product(e_2,e_1,e_2).
% 165 [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).
% 169 [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).
% 172 [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).
% 253 [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).
% 405 [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).
% 414 [hyper:26,36,30,cut:18] product(e_1,e_1,e_2) | product(e_1,e_1,e_3) | product(e_1,e_2,e_2) | product(e_1,e_2,e_3).
% 500 [hyper:27,38,30,cut:19] product(e_1,e_1,e_1) | product(e_1,e_1,e_3) | product(e_3,e_1,e_3) | product(e_3,e_1,e_1).
% 506 [hyper:27,38,30,cut:19] product(e_1,e_1,e_2) | product(e_1,e_1,e_1) | product(e_3,e_1,e_1) | product(e_3,e_1,e_2).
% 507 [hyper:27,38,33,cut:21] product(e_2,e_1,e_2) | product(e_2,e_1,e_1) | product(e_3,e_1,e_1) | product(e_3,e_1,e_2).
% 787 [hyper:26,42,30,cut:19] product(e_1,e_1,e_1) | product(e_1,e_1,e_3) | product(e_1,e_3,e_1) | product(e_1,e_3,e_3).
% 1037 [hyper:28,144,30] 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_2).
% 8719 [hyper:25,1037,165,cut:20] product(e_2,e_1,e_3) | product(e_2,e_1,e_2) | product(e_1,e_1,e_3).
% 8730 [hyper:25,1037,169,cut:18] product(e_1,e_1,e_3) | product(e_1,e_1,e_1) | product(e_2,e_1,e_3).
% 8838 [hyper:28,8719,33] product(e_2,e_1,e_2) | product(e_2,e_1,e_3) | product(e_1,e_2,e_3).
% 8969 [hyper:28,8730,405] product(e_1,e_1,e_1) | product(e_1,e_2,e_3) | product(e_1,e_1,e_3).
% 9043 [hyper:27,8730,500,cut:23] product(e_1,e_1,e_1) | product(e_3,e_1,e_1) | product(e_1,e_1,e_3).
% 9169 [hyper:26,8838,8719,cut:18] product(e_2,e_1,e_2) | product(e_2,e_1,e_3).
% 9259 [hyper:25,9169,253,cut:18] product(e_2,e_2,e_3) | product(e_2,e_2,e_1) | product(e_2,e_1,e_3).
% 9264 [hyper:25,9169,172,cut:19] product(e_1,e_1,e_2) | product(e_2,e_1,e_2) | product(e_1,e_1,e_1).
% 9266 [hyper:25,9169,507,cut:19] product(e_3,e_1,e_1) | product(e_3,e_1,e_2) | product(e_2,e_1,e_2).
% 9355 [hyper:25,8969,414,cut:20] product(e_1,e_2,e_2) | product(e_1,e_2,e_3) | product(e_1,e_1,e_3).
% 9374 [hyper:26,8969,787,cut:23] product(e_1,e_1,e_3) | product(e_1,e_1,e_1) | product(e_1,e_3,e_1).
% 9456 [hyper:25,9043,506,cut:21] product(e_3,e_1,e_1) | product(e_3,e_1,e_2) | product(e_1,e_1,e_1).
% 9540 [hyper:28,9259,9169] product(e_1,e_2,e_2) | product(e_2,e_1,e_3) | product(e_2,e_2,e_3).
% 10551 [hyper:28,9374,9043] product(e_1,e_1,e_1) | product(e_1,e_1,e_3).
% 10606 [hyper:25,10551,9264,cut:21] product(e_2,e_1,e_2) | product(e_1,e_1,e_1).
% 10714 [hyper:27,10606,9266,cut:22] product(e_3,e_1,e_2) | product(e_2,e_1,e_2).
% 11005 [hyper:27,9456,10606,cut:21] product(e_3,e_1,e_1) | product(e_1,e_1,e_1).
% 11041 [hyper:28,11005,10551] product(e_1,e_3,e_3) | product(e_1,e_1,e_1).
% 11116 [hyper:26,11041,10551,cut:19] product(e_1,e_1,e_1).
% 11118 [hyper:26,11041,42,cut:22] product(e_1,e_3,e_3) | product(e_1,e_3,e_2).
% 11149 [hyper:25,11116,9355,cut:22] product(e_1,e_2,e_3) | product(e_1,e_2,e_2).
% 11346 [hyper:26,11149,11118,cut:23] product(e_1,e_2,e_2) | product(e_1,e_3,e_2).
% 11349 [hyper:26,11149,11118,cut:23] product(e_1,e_2,e_3) | product(e_1,e_3,e_3).
% 11687 [hyper:27,9540,11149,cut:18] product(e_2,e_1,e_3) | product(e_1,e_2,e_2).
% 11710 [hyper:28,11687,11346] product(e_3,e_2,e_2) | product(e_1,e_2,e_2).
% 11712 [hyper:28,11687,9169] product(e_2,e_2,e_2) | product(e_2,e_1,e_3).
% 11820 [hyper:26,11712,9169,cut:18] product(e_2,e_1,e_3).
% 11843 [hyper:25,11820,10714,cut:21] product(e_3,e_1,e_2).
% 11878 [hyper:26,11843,11710,cut:20] product(e_1,e_2,e_2).
% 11891 [hyper:28,11878,11843] product(e_2,e_3,e_2).
% 11894 [hyper:25,11878,11349,cut:23] product(e_1,e_3,e_3).
% 11925 [hyper:28,11894,11820] product(e_3,e_2,e_3).
% 11942 [hyper:28,11925,11891] product(e_2,e_2,e_3).
% 11965 [hyper:26,11942,11820,cut:18] 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: 142
% derived clauses: 86738
% kept clauses: 5843
% kept size sum: 129877
% kept mid-nuclei: 5971
% kept new demods: 0
% forw unit-subs: 20768
% forw double-subs: 1240
% forw overdouble-subs: 52706
% backward subs: 249
% fast unit cutoff: 39797
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 3.75
% process. runtime: 3.73
% specific non-discr-tree subsumption statistics:
% tried: 5162720
% length fails: 86150
% strength fails: 1927886
% predlist fails: 242313
% aux str. fails: 0
% by-lit fails: 1434148
% 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/GRP129-1.003+noeq.in")
%
%------------------------------------------------------------------------------