TSTP Solution File: GRP124-7.004 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP124-7.004 : 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 : art06.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-7.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(37,40,0,74,0,0)
%
%
% START OF PROOF
% 48 [] group_element(e_1).
% 49 [] group_element(e_2).
% 50 [] group_element(e_3).
% 52 [] -equalish(e_1,e_2).
% 53 [] -equalish(e_1,e_3).
% 55 [] -equalish(e_2,e_1).
% 56 [] -equalish(e_2,e_3).
% 57 [] -equalish(e_2,e_4).
% 58 [] -equalish(e_3,e_1).
% 59 [] -equalish(e_3,e_2).
% 60 [] -equalish(e_3,e_4).
% 64 [] 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).
% 65 [] -product1(X,Y,U) | -product1(X,Y,Z) | equalish(Z,U).
% 66 [] -product1(X,U,Z) | -product1(X,Y,Z) | equalish(Y,U).
% 67 [] -product1(U,Y,Z) | -product1(X,Y,Z) | equalish(X,U).
% 68 [] product1(X,X,X).
% 70 [] -product2(X,Y,U) | -product2(X,Y,Z) | equalish(Z,U).
% 73 [] product2(X,X,X).
% 74 [] -product1(Z,X,U) | -product1(X,Y,Z) | product2(U,Y,X).
% 80 [hyper:64,49,48] 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:64,49,48] 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).
% 88 [hyper:64,50,48] 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).
% 89 [hyper:64,50,49] 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).
% 204 [hyper:66,80,68,cut:52] product1(e_1,e_2,e_2) | product1(e_1,e_2,e_4) | product1(e_1,e_2,e_3).
% 252 [hyper:66,82,68,cut:55] product1(e_2,e_1,e_1) | product1(e_2,e_1,e_3) | product1(e_2,e_1,e_4).
% 295 [hyper:67,204,68,cut:55] product1(e_1,e_2,e_3) | product1(e_1,e_2,e_4).
% 406 [hyper:67,252,68,cut:52] product1(e_2,e_1,e_4) | product1(e_2,e_1,e_3).
% 636 [hyper:66,88,68,cut:53] product1(e_1,e_3,e_2) | product1(e_1,e_3,e_4) | product1(e_1,e_3,e_3).
% 687 [hyper:67,636,68,cut:58] product1(e_1,e_3,e_2) | product1(e_1,e_3,e_4).
% 708 [hyper:74,687,406] product2(e_3,e_3,e_1) | product1(e_2,e_1,e_4) | product1(e_1,e_3,e_4).
% 718 [hyper:66,687,295,cut:56] product1(e_1,e_3,e_2) | product1(e_1,e_2,e_3).
% 803 [hyper:66,89,68,cut:56] product1(e_2,e_3,e_3) | product1(e_2,e_3,e_1) | product1(e_2,e_3,e_4).
% 893 [hyper:70,708,73,cut:58] product1(e_1,e_3,e_4) | product1(e_2,e_1,e_4).
% 914 [hyper:74,893,687] product2(e_4,e_3,e_1) | product1(e_1,e_3,e_4).
% 1011 [hyper:65,914,718,cut:57] product2(e_4,e_3,e_1) | product1(e_1,e_2,e_3).
% 1186 [hyper:67,803,68,cut:59] product1(e_2,e_3,e_4) | product1(e_2,e_3,e_1).
% 1226 [hyper:66,1186,893,cut:53] product1(e_2,e_3,e_1) | product1(e_1,e_3,e_4).
% 1309 [hyper:67,1226,1186,cut:55] product1(e_2,e_3,e_1).
% 1320 [hyper:74,1309,295] product2(e_3,e_3,e_2) | product1(e_1,e_2,e_4).
% 1462 [hyper:70,1320,73,cut:59] product1(e_1,e_2,e_4).
% 1472 [hyper:74,1462,1309] product2(e_4,e_3,e_2).
% 1477 [hyper:65,1462,1011,cut:60] product2(e_4,e_3,e_1).
% 1572 [hyper:70,1477,1472,cut:55] 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: 78
% derived clauses: 3474
% kept clauses: 160
% kept size sum: 2199
% kept mid-nuclei: 1293
% kept new demods: 0
% forw unit-subs: 981
% forw double-subs: 264
% forw overdouble-subs: 740
% backward subs: 45
% fast unit cutoff: 695
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.9
% process. runtime: 0.8
% specific non-discr-tree subsumption statistics:
% tried: 2527
% length fails: 88
% strength fails: 798
% predlist fails: 179
% aux str. fails: 0
% by-lit fails: 652
% 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-7.004+noeq.in")
%
%------------------------------------------------------------------------------