TSTP Solution File: GRP130-1.003 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP130-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/GRP130-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(X,Z,U) | -product(X,Y,Z) | product(U,Y,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).
% 39 [hyper:24,17,16] product(e_3,e_2,e_1) | product(e_3,e_2,e_2) | product(e_3,e_2,e_3).
% 43 [hyper:24,17,16] product(e_2,e_3,e_2) | product(e_2,e_3,e_3) | product(e_2,e_3,e_1).
% 142 [hyper:28,33,33] product(e_2,e_1,e_2) | product(e_2,e_1,e_3) | product(e_1,e_1,e_2).
% 233 [hyper:28,34,33] 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_2).
% 369 [hyper:28,36,36] product(e_1,e_2,e_3) | product(e_1,e_2,e_1) | product(e_2,e_2,e_1).
% 451 [hyper:28,38,38] product(e_3,e_1,e_2) | product(e_3,e_1,e_3) | product(e_1,e_1,e_3).
% 558 [hyper:28,39,39] product(e_3,e_2,e_1) | product(e_3,e_2,e_3) | product(e_2,e_2,e_3).
% 850 [hyper:28,43,43] product(e_2,e_3,e_2) | product(e_2,e_3,e_1) | product(e_3,e_3,e_2).
% 1008 [hyper:27,142,30,cut:18] product(e_1,e_1,e_2) | product(e_1,e_1,e_1) | product(e_2,e_1,e_2).
% 1143 [hyper:26,233,34,cut:20] product(e_2,e_2,e_2) | product(e_2,e_2,e_3) | product(e_2,e_1,e_3).
% 1151 [hyper:26,233,33,cut:18] product(e_2,e_1,e_1) | product(e_2,e_1,e_3) | product(e_2,e_2,e_3).
% 1221 [hyper:27,369,34,cut:20] product(e_2,e_2,e_2) | product(e_2,e_2,e_1) | product(e_1,e_2,e_1).
% 1294 [hyper:27,451,30,cut:19] product(e_1,e_1,e_1) | product(e_1,e_1,e_3) | product(e_3,e_1,e_3).
% 1677 [hyper:28,1143,34] product(e_2,e_2,e_2) | product(e_2,e_2,e_3) | product(e_3,e_2,e_2).
% 1748 [hyper:28,1151,33] product(e_2,e_1,e_1) | product(e_2,e_1,e_3) | product(e_3,e_1,e_2).
% 2290 [hyper:28,1677,1677] product(e_2,e_2,e_3) | product(e_2,e_2,e_2).
% 2340 [hyper:25,2290,1221,cut:19] product(e_2,e_2,e_2) | product(e_1,e_2,e_1).
% 2389 [hyper:25,2340,369,cut:18] product(e_1,e_2,e_1) | product(e_1,e_2,e_3).
% 2608 [hyper:27,1748,33,cut:21] product(e_2,e_1,e_1) | product(e_2,e_1,e_3).
% 2629 [hyper:28,2608,2608] product(e_1,e_1,e_2) | product(e_2,e_1,e_3).
% 2693 [hyper:25,2629,1008,cut:21] product(e_1,e_1,e_1) | product(e_1,e_1,e_2).
% 2702 [hyper:26,2629,2290,cut:20] product(e_1,e_1,e_2) | product(e_2,e_2,e_2).
% 2776 [hyper:28,2693,2340] product(e_1,e_1,e_1) | product(e_2,e_2,e_2).
% 2777 [hyper:28,2693,2389] product(e_1,e_1,e_1) | product(e_1,e_2,e_3).
% 2783 [hyper:25,2693,1294,cut:23] product(e_1,e_1,e_1) | product(e_3,e_1,e_3).
% 2855 [hyper:25,2776,2702,cut:20] product(e_2,e_2,e_2).
% 2875 [hyper:25,2855,558,cut:23] product(e_3,e_2,e_3) | product(e_3,e_2,e_1).
% 2879 [hyper:26,2855,850,cut:23] product(e_2,e_3,e_1) | product(e_3,e_3,e_2).
% 2895 [hyper:28,2777,2693] product(e_3,e_1,e_1) | product(e_1,e_1,e_1).
% 2905 [hyper:26,2777,2389,cut:20] product(e_1,e_2,e_3).
% 2991 [hyper:27,2875,2905,cut:19] product(e_3,e_2,e_1).
% 3140 [hyper:25,2895,2783,cut:22] product(e_1,e_1,e_1).
% 3156 [hyper:25,3140,2629,cut:20] product(e_2,e_1,e_3).
% 3171 [hyper:28,3156,2879] product(e_3,e_3,e_2).
% 3191 [hyper:28,3171,2991] product(e_1,e_3,e_3).
% 3229 [hyper:26,3191,2905,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: 82
% derived clauses: 12604
% kept clauses: 946
% kept size sum: 14668
% kept mid-nuclei: 2192
% kept new demods: 0
% forw unit-subs: 3151
% forw double-subs: 547
% forw overdouble-subs: 5652
% backward subs: 128
% fast unit cutoff: 4561
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.25
% process. runtime: 0.24
% specific non-discr-tree subsumption statistics:
% tried: 77270
% length fails: 3280
% strength fails: 21630
% predlist fails: 13098
% aux str. fails: 0
% by-lit fails: 15311
% 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/GRP130-1.003+noeq.in")
%
%------------------------------------------------------------------------------