TSTP Solution File: GRP124-9.004 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP124-9.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 : art08.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/GRP124-9.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(29,40,0,58,0,0)
%
%
% START OF PROOF
% 32 [] group_element(e_1).
% 33 [] group_element(e_2).
% 34 [] group_element(e_3).
% 36 [] -equalish(e_1,e_2).
% 37 [] -equalish(e_1,e_3).
% 39 [] -equalish(e_2,e_1).
% 40 [] -equalish(e_2,e_3).
% 42 [] -equalish(e_3,e_1).
% 43 [] -equalish(e_3,e_2).
% 48 [] product1(X,Y,e_3) | product1(X,Y,e_4) | product1(X,Y,e_2) | product1(X,Y,e_1) | -group_element(Y) | -group_element(X).
% 50 [] -product1(X,U,Z) | -product1(X,Y,Z) | equalish(Y,U).
% 51 [] -product1(U,Y,Z) | -product1(X,Y,Z) | equalish(X,U).
% 52 [] product1(X,X,X).
% 54 [] -product2(X,Y,U) | -product2(X,Y,Z) | equalish(Z,U).
% 57 [] product2(X,X,X).
% 58 [] -product1(Z,X,U) | -product1(X,Y,Z) | product2(U,Y,X).
% 80 [hyper:48,33,32] product1(e_1,e_2,e_4) | product1(e_1,e_2,e_3) | product1(e_1,e_2,e_2) | product1(e_1,e_2,e_1).
% 82 [hyper:48,33,32] product1(e_2,e_1,e_3) | product1(e_2,e_1,e_4) | product1(e_2,e_1,e_1) | product1(e_2,e_1,e_2).
% 102 [hyper:48,34,32] product1(e_1,e_3,e_4) | product1(e_1,e_3,e_3) | product1(e_1,e_3,e_2) | product1(e_1,e_3,e_1).
% 103 [hyper:48,34,33] product1(e_2,e_3,e_4) | product1(e_2,e_3,e_3) | product1(e_2,e_3,e_2) | product1(e_2,e_3,e_1).
% 252 [hyper:50,80,52,cut:36] product1(e_1,e_2,e_2) | product1(e_1,e_2,e_4) | product1(e_1,e_2,e_3).
% 300 [hyper:50,82,52,cut:39] product1(e_2,e_1,e_1) | product1(e_2,e_1,e_3) | product1(e_2,e_1,e_4).
% 343 [hyper:51,252,52,cut:39] product1(e_1,e_2,e_3) | product1(e_1,e_2,e_4).
% 454 [hyper:51,300,52,cut:36] product1(e_2,e_1,e_4) | product1(e_2,e_1,e_3).
% 694 [hyper:50,102,52,cut:37] product1(e_1,e_3,e_2) | product1(e_1,e_3,e_4) | product1(e_1,e_3,e_3).
% 744 [hyper:50,103,52,cut:40] product1(e_2,e_3,e_3) | product1(e_2,e_3,e_1) | product1(e_2,e_3,e_4).
% 797 [hyper:51,694,52,cut:42] product1(e_1,e_3,e_2) | product1(e_1,e_3,e_4).
% 828 [hyper:50,797,343,cut:40] product1(e_1,e_3,e_2) | product1(e_1,e_2,e_3).
% 910 [hyper:51,744,52,cut:43] product1(e_2,e_3,e_4) | product1(e_2,e_3,e_1).
% 1005 [hyper:50,910,454,cut:37] product1(e_2,e_3,e_1) | product1(e_2,e_1,e_3).
% 1010 [hyper:51,910,797,cut:36] product1(e_2,e_3,e_1) | product1(e_1,e_3,e_2).
% 1072 [hyper:58,1010,828] product2(e_3,e_3,e_2) | product1(e_1,e_3,e_2).
% 1076 [hyper:58,1010,1005] product2(e_3,e_3,e_1) | product1(e_2,e_3,e_1).
% 1117 [hyper:54,1072,57,cut:43] product1(e_1,e_3,e_2).
% 1129 [hyper:58,1117,454] product2(e_3,e_3,e_1) | product1(e_2,e_1,e_4).
% 1217 [hyper:54,1076,57,cut:42] product1(e_2,e_3,e_1).
% 1265 [hyper:58,1217,343] product2(e_3,e_3,e_2) | product1(e_1,e_2,e_4).
% 1321 [hyper:54,1129,57,cut:42] product1(e_2,e_1,e_4).
% 1369 [hyper:58,1321,1117] product2(e_4,e_3,e_1).
% 1408 [hyper:54,1265,57,cut:43] product1(e_1,e_2,e_4).
% 1418 [hyper:58,1408,1217] product2(e_4,e_3,e_2).
% 1435 [hyper:54,1418,1369,cut:36] 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: 84
% derived clauses: 2939
% kept clauses: 174
% kept size sum: 2495
% kept mid-nuclei: 1143
% kept new demods: 0
% forw unit-subs: 765
% forw double-subs: 172
% forw overdouble-subs: 630
% backward subs: 33
% fast unit cutoff: 495
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.7
% process. runtime: 0.8
% specific non-discr-tree subsumption statistics:
% tried: 2183
% length fails: 56
% strength fails: 783
% predlist fails: 103
% aux str. fails: 0
% by-lit fails: 552
% 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/GRP124-9.004+noeq.in")
%
%------------------------------------------------------------------------------