TSTP Solution File: GRP126-1.004 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP126-1.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 : art10.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-1.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(22,40,1,44,0,1)
%
%
% START OF PROOF
% 23 [] group_element(e_1).
% 24 [] group_element(e_2).
% 25 [] group_element(e_3).
% 27 [] -equalish(e_1,e_2).
% 28 [] -equalish(e_1,e_3).
% 29 [] -equalish(e_1,e_4).
% 30 [] -equalish(e_2,e_1).
% 31 [] -equalish(e_2,e_3).
% 33 [] -equalish(e_3,e_1).
% 34 [] -equalish(e_3,e_2).
% 37 [] -equalish(e_4,e_2).
% 39 [] 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).
% 40 [] -product(X,Y,U) | -product(X,Y,Z) | equalish(Z,U).
% 41 [] -product(X,U,Z) | -product(X,Y,Z) | equalish(Y,U).
% 42 [] -product(U,Y,Z) | -product(X,Y,Z) | equalish(X,U).
% 43 [] product(X,X,X).
% 44 [] -product(Y,X,U) | -product(X,Y,Z) | product(Z,U,Y).
% 48 [hyper:39,24,23] 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).
% 50 [hyper:39,24,23] product(e_2,e_1,e_3) | product(e_2,e_1,e_4) | product(e_2,e_1,e_1) | product(e_2,e_1,e_2).
% 52 [hyper:39,25,23] product(e_1,e_3,e_4) | product(e_1,e_3,e_3) | product(e_1,e_3,e_2) | product(e_1,e_3,e_1).
% 53 [hyper:39,25,24] product(e_2,e_3,e_4) | product(e_2,e_3,e_3) | product(e_2,e_3,e_2) | product(e_2,e_3,e_1).
% 119 [hyper:41,48,43,cut:27] product(e_1,e_2,e_2) | product(e_1,e_2,e_4) | product(e_1,e_2,e_3).
% 162 [hyper:42,119,43,cut:30] product(e_1,e_2,e_3) | product(e_1,e_2,e_4).
% 256 [hyper:41,50,43,cut:30] product(e_2,e_1,e_1) | product(e_2,e_1,e_3) | product(e_2,e_1,e_4).
% 311 [hyper:42,256,43,cut:27] product(e_2,e_1,e_4) | product(e_2,e_1,e_3).
% 358 [hyper:41,52,43,cut:28] product(e_1,e_3,e_2) | product(e_1,e_3,e_4) | product(e_1,e_3,e_3).
% 384 [hyper:44,311,162] product(e_4,e_4,e_2) | product(e_1,e_2,e_3) | product(e_2,e_1,e_3).
% 448 [hyper:42,358,43,cut:33] product(e_1,e_3,e_2) | product(e_1,e_3,e_4).
% 477 [hyper:41,448,162,cut:31] product(e_1,e_3,e_2) | product(e_1,e_2,e_3).
% 560 [hyper:41,53,43,cut:31] product(e_2,e_3,e_3) | product(e_2,e_3,e_1) | product(e_2,e_3,e_4).
% 653 [hyper:40,384,43,cut:37] product(e_2,e_1,e_3) | product(e_1,e_2,e_3).
% 756 [hyper:44,653,162] product(e_4,e_3,e_2) | product(e_1,e_2,e_3).
% 856 [hyper:42,756,477,cut:29] product(e_1,e_2,e_3).
% 868 [hyper:44,856,311] product(e_3,e_3,e_1) | product(e_2,e_1,e_4).
% 1004 [hyper:40,868,43,cut:33] product(e_2,e_1,e_4).
% 1022 [hyper:44,1004,856] product(e_4,e_3,e_1).
% 1206 [hyper:41,560,1004,cut:28] product(e_2,e_3,e_3) | product(e_2,e_3,e_1).
% 1225 [hyper:42,1206,43,cut:34] product(e_2,e_3,e_1).
% 1235 [hyper:42,1225,1022,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: 54
% derived clauses: 2748
% kept clauses: 152
% kept size sum: 2135
% kept mid-nuclei: 1007
% kept new demods: 0
% forw unit-subs: 682
% forw double-subs: 218
% forw overdouble-subs: 661
% backward subs: 53
% fast unit cutoff: 462
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.7
% process. runtime: 0.6
% specific non-discr-tree subsumption statistics:
% tried: 2235
% length fails: 69
% strength fails: 647
% predlist fails: 103
% aux str. fails: 0
% by-lit fails: 693
% 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/GRP126-1.004+noeq.in")
%
%------------------------------------------------------------------------------