TSTP Solution File: GRP126-4.004 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP126-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 : 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/GRP126-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).
% 39 [] -equalish(e_3,e_1).
% 42 [] -equalish(e_4,e_1).
% 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(U,Z,X) | -product(X,Y,Z) | product(Y,X,U).
% 51 [] -product(Z,U,Y) | -product(X,Y,Z) | product(Y,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).
% 199 [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).
% 262 [hyper:47,199,49,cut:36] product(e_3,e_1,e_2) | product(e_4,e_1,e_2).
% 394 [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).
% 457 [hyper:47,394,49,cut:33] product(e_4,e_2,e_1) | product(e_3,e_2,e_1).
% 531 [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).
% 674 [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).
% 844 [hyper:48,531,49,cut:36] product(e_1,e_3,e_2) | product(e_1,e_4,e_2).
% 877 [hyper:50,844,457] product(e_3,e_1,e_3) | product(e_4,e_2,e_1) | product(e_1,e_4,e_2).
% 984 [hyper:48,674,49,cut:33] product(e_2,e_4,e_1) | product(e_2,e_3,e_1).
% 1511 [hyper:47,877,49,cut:39] product(e_1,e_4,e_2) | product(e_4,e_2,e_1).
% 1547 [hyper:50,1511,457] product(e_4,e_1,e_3) | product(e_4,e_2,e_1).
% 1549 [hyper:50,1511,844] product(e_3,e_1,e_4) | product(e_1,e_4,e_2).
% 1552 [hyper:51,1511,457] product(e_2,e_3,e_4) | product(e_4,e_2,e_1).
% 1556 [hyper:51,1511,844] product(e_2,e_4,e_3) | product(e_1,e_4,e_2).
% 1619 [hyper:46,1547,262,cut:37] product(e_4,e_2,e_1) | product(e_3,e_1,e_2).
% 1764 [hyper:46,1549,262,cut:38] product(e_1,e_4,e_2) | product(e_4,e_1,e_2).
% 1820 [hyper:46,1552,984,cut:35] product(e_4,e_2,e_1) | product(e_2,e_4,e_1).
% 1878 [hyper:46,1556,984,cut:34] product(e_1,e_4,e_2) | product(e_2,e_3,e_1).
% 2146 [hyper:50,1820,1619] product(e_4,e_2,e_3) | product(e_4,e_2,e_1).
% 2209 [hyper:50,1878,1764] product(e_3,e_2,e_4) | product(e_1,e_4,e_2).
% 2295 [hyper:47,2146,1547,cut:33] product(e_4,e_2,e_1).
% 2456 [hyper:47,2209,1549,cut:33] product(e_1,e_4,e_2).
% 2475 [hyper:50,2456,2295] product(e_4,e_1,e_4).
% 2513 [hyper:47,2475,49,cut:42] 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: 63
% derived clauses: 5091
% kept clauses: 479
% kept size sum: 7067
% kept mid-nuclei: 1939
% kept new demods: 0
% forw unit-subs: 1144
% forw double-subs: 703
% forw overdouble-subs: 794
% backward subs: 43
% fast unit cutoff: 404
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.10
% process. runtime: 0.11
% specific non-discr-tree subsumption statistics:
% tried: 4816
% length fails: 139
% strength fails: 1096
% predlist fails: 318
% aux str. fails: 0
% by-lit fails: 1870
% full subs tried: 2
% full subs fail: 2
%
% ; 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/GRP126-4.004+noeq.in")
%
%------------------------------------------------------------------------------