TSTP Solution File: GRP127-4.004 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP127-4.004 : TPTP v3.4.2. Bugfixed v1.2.1.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art01.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/GRP127-4.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(26,40,0,52,0,0)
%
%
% START OF PROOF
% 27 [] product(e_3,X,Y) | product(e_4,X,Y) | product(e_2,X,Y) | product(e_1,X,Y) | -group_element(Y) | -group_element(X).
% 28 [] product(X,e_3,Y) | product(X,e_4,Y) | product(X,e_2,Y) | product(X,e_1,Y) | -group_element(Y) | -group_element(X).
% 29 [] group_element(e_1).
% 30 [] group_element(e_2).
% 33 [] -equalish(e_1,e_2).
% 34 [] -equalish(e_1,e_3).
% 35 [] -equalish(e_1,e_4).
% 36 [] -equalish(e_2,e_1).
% 37 [] -equalish(e_2,e_3).
% 38 [] -equalish(e_2,e_4).
% 41 [] -equalish(e_3,e_4).
% 42 [] -equalish(e_4,e_1).
% 44 [] -equalish(e_4,e_3).
% 45 [] 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).
% 46 [] -product(X,Y,U) | -product(X,Y,Z) | equalish(Z,U).
% 47 [] -product(X,U,Z) | -product(X,Y,Z) | equalish(Y,U).
% 48 [] -product(U,Y,Z) | -product(X,Y,Z) | equalish(X,U).
% 49 [] product(X,X,X).
% 50 [] -product(Z,Y,U) | -product(X,Y,Z) | product(Y,U,X).
% 51 [] -product(U,X,Y) | -product(X,Y,Z) | product(Z,X,U).
% 60 [hyper:27,30,29] product(e_4,e_1,e_2) | product(e_3,e_1,e_2) | product(e_2,e_1,e_2) | product(e_1,e_1,e_2).
% 62 [hyper:27,30,29] product(e_3,e_2,e_1) | product(e_4,e_2,e_1) | product(e_1,e_2,e_1) | product(e_2,e_2,e_1).
% 64 [hyper:28,30,29] product(e_1,e_4,e_2) | product(e_1,e_3,e_2) | product(e_1,e_2,e_2) | product(e_1,e_1,e_2).
% 66 [hyper:28,30,29] product(e_2,e_3,e_1) | product(e_2,e_4,e_1) | product(e_2,e_1,e_1) | product(e_2,e_2,e_1).
% 68 [hyper:45,30,29] 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).
% 198 [hyper:46,60,49,cut:33] product(e_2,e_1,e_2) | product(e_4,e_1,e_2) | product(e_3,e_1,e_2).
% 261 [hyper:47,198,49,cut:36] product(e_3,e_1,e_2) | product(e_4,e_1,e_2).
% 390 [hyper:46,62,49,cut:36] product(e_1,e_2,e_1) | product(e_3,e_2,e_1) | product(e_4,e_2,e_1).
% 455 [hyper:47,390,49,cut:33] product(e_4,e_2,e_1) | product(e_3,e_2,e_1).
% 525 [hyper:46,64,49,cut:33] product(e_1,e_2,e_2) | product(e_1,e_4,e_2) | product(e_1,e_3,e_2).
% 654 [hyper:46,66,49,cut:36] product(e_2,e_1,e_1) | product(e_2,e_3,e_1) | product(e_2,e_4,e_1).
% 754 [hyper:47,68,49,cut:33] product(e_1,e_2,e_2) | product(e_1,e_2,e_4) | product(e_1,e_2,e_3).
% 826 [hyper:48,525,49,cut:36] product(e_1,e_3,e_2) | product(e_1,e_4,e_2).
% 861 [hyper:51,826,455] product(e_1,e_3,e_1) | product(e_4,e_2,e_1) | product(e_1,e_4,e_2).
% 864 [hyper:51,826,455] product(e_1,e_4,e_1) | product(e_3,e_2,e_1) | product(e_1,e_3,e_2).
% 955 [hyper:48,654,49,cut:33] product(e_2,e_4,e_1) | product(e_2,e_3,e_1).
% 986 [hyper:50,955,826] product(e_4,e_1,e_1) | product(e_1,e_3,e_2) | product(e_2,e_3,e_1).
% 990 [hyper:50,955,826] product(e_3,e_1,e_1) | product(e_1,e_4,e_2) | product(e_2,e_4,e_1).
% 994 [hyper:51,955,261] product(e_2,e_4,e_2) | product(e_3,e_1,e_2) | product(e_2,e_3,e_1).
% 997 [hyper:51,955,261] product(e_2,e_3,e_2) | product(e_4,e_1,e_2) | product(e_2,e_4,e_1).
% 1204 [hyper:48,754,49,cut:36] product(e_1,e_2,e_3) | product(e_1,e_2,e_4).
% 1236 [hyper:50,1204,455] product(e_2,e_3,e_3) | product(e_4,e_2,e_1) | product(e_1,e_2,e_4).
% 1420 [hyper:46,861,826,cut:36] product(e_4,e_2,e_1) | product(e_1,e_4,e_2).
% 1540 [hyper:46,864,826,cut:36] product(e_3,e_2,e_1) | product(e_1,e_3,e_2).
% 1771 [hyper:48,986,49,cut:35] product(e_2,e_3,e_1) | product(e_1,e_3,e_2).
% 1827 [hyper:47,1771,1420,cut:44] product(e_2,e_3,e_1) | product(e_4,e_2,e_1).
% 2035 [hyper:48,990,49,cut:34] product(e_2,e_4,e_1) | product(e_1,e_4,e_2).
% 2091 [hyper:47,2035,1540,cut:41] product(e_2,e_4,e_1) | product(e_3,e_2,e_1).
% 2293 [hyper:46,994,955,cut:33] product(e_3,e_1,e_2) | product(e_2,e_3,e_1).
% 2361 [hyper:47,2293,2091,cut:44] product(e_3,e_1,e_2) | product(e_3,e_2,e_1).
% 2529 [hyper:46,997,955,cut:33] product(e_4,e_1,e_2) | product(e_2,e_4,e_1).
% 2727 [hyper:47,2529,1827,cut:41] product(e_4,e_1,e_2) | product(e_4,e_2,e_1).
% 3581 [hyper:46,1236,1827,cut:34] product(e_1,e_2,e_4) | product(e_4,e_2,e_1).
% 3630 [hyper:51,3581,2727] product(e_4,e_1,e_4) | product(e_4,e_2,e_1).
% 3971 [hyper:46,3630,2727,cut:38] product(e_4,e_2,e_1).
% 3994 [hyper:50,3971,1204] product(e_2,e_1,e_1) | product(e_1,e_2,e_3).
% 4018 [hyper:48,3971,2091,cut:41] product(e_2,e_4,e_1).
% 4019 [hyper:48,3971,2361,cut:41] product(e_3,e_1,e_2).
% 4480 [hyper:47,3994,4018,cut:42] product(e_1,e_2,e_3).
% 4502 [hyper:51,4480,4019] product(e_3,e_1,e_3).
% 4561 [hyper:46,4502,4019,cut:37] 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: 91
% derived clauses: 10639
% kept clauses: 1146
% kept size sum: 17239
% kept mid-nuclei: 3296
% kept new demods: 0
% forw unit-subs: 2319
% forw double-subs: 1689
% forw overdouble-subs: 2144
% backward subs: 100
% fast unit cutoff: 1097
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.22
% process. runtime: 0.22
% specific non-discr-tree subsumption statistics:
% tried: 18189
% length fails: 1199
% strength fails: 4839
% predlist fails: 857
% aux str. fails: 0
% by-lit fails: 5851
% 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/GRP127-4.004+noeq.in")
%
%------------------------------------------------------------------------------