TSTP Solution File: GRP124-4.004 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP124-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 : 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-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(25,40,1,50,0,1)
%
%
% START OF PROOF
% 26 [] 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).
% 27 [] 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).
% 28 [] group_element(e_1).
% 29 [] group_element(e_2).
% 32 [] -equalish(e_1,e_2).
% 33 [] -equalish(e_1,e_3).
% 35 [] -equalish(e_2,e_1).
% 36 [] -equalish(e_2,e_3).
% 37 [] -equalish(e_2,e_4).
% 40 [] -equalish(e_3,e_4).
% 41 [] -equalish(e_4,e_1).
% 44 [] 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).
% 45 [] -product(X,Y,U) | -product(X,Y,Z) | equalish(Z,U).
% 46 [] -product(X,U,Z) | -product(X,Y,Z) | equalish(Y,U).
% 47 [] -product(U,Y,Z) | -product(X,Y,Z) | equalish(X,U).
% 48 [] product(X,X,X).
% 49 [] -product(W,X,Y) | -product(W,U,V) | -product(U,V,Z) | -product(X,Y,Z) | equalish(U,X).
% 58 [hyper:26,29,28] 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).
% 64 [hyper:27,29,28] 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).
% 66 [hyper:44,29,28] 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).
% 236 [hyper:45,58,48,cut:32] product(e_2,e_1,e_2) | product(e_4,e_1,e_2) | product(e_3,e_1,e_2).
% 307 [hyper:46,236,48,cut:35] product(e_3,e_1,e_2) | product(e_4,e_1,e_2).
% 1031 [hyper:45,64,48,cut:35] product(e_2,e_1,e_1) | product(e_2,e_3,e_1) | product(e_2,e_4,e_1).
% 1713 [hyper:46,66,48,cut:32] product(e_1,e_2,e_2) | product(e_1,e_2,e_4) | product(e_1,e_2,e_3).
% 3564 [hyper:47,1031,48,cut:32] product(e_2,e_4,e_1) | product(e_2,e_3,e_1).
% 3830 [hyper:49,3564,307,48,cut:48,cut:37] product(e_3,e_1,e_2) | product(e_2,e_3,e_1).
% 3843 [hyper:49,3830,3830,3564,307,cut:40] product(e_2,e_3,e_1) | product(e_3,e_1,e_2).
% 4355 [hyper:49,3564,307,48,cut:48,cut:36] product(e_4,e_1,e_2) | product(e_2,e_4,e_1).
% 4425 [hyper:46,4355,3564,cut:40] product(e_4,e_1,e_2) | product(e_2,e_4,e_1).
% 6602 [hyper:47,1713,48,cut:35] product(e_1,e_2,e_3) | product(e_1,e_2,e_4).
% 6876 [hyper:49,6602,48,48,307,cut:33] product(e_1,e_2,e_4) | product(e_4,e_1,e_2).
% 7595 [hyper:49,6876,4425,48,cut:48,cut:32] product(e_4,e_1,e_2).
% 7732 [hyper:47,7595,3843,cut:40] product(e_2,e_3,e_1).
% 8150 [hyper:49,7595,6602,48,cut:48,cut:41] product(e_1,e_2,e_3).
% 8155 [hyper:49,8150,7732,48,cut:48] equalish(e_1,e_2).
% 8364 [hyper:32,8155] 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: 65
% derived clauses: 16769
% kept clauses: 330
% kept size sum: 4565
% kept mid-nuclei: 7933
% kept new demods: 0
% forw unit-subs: 3356
% forw double-subs: 1891
% forw overdouble-subs: 2332
% backward subs: 62
% fast unit cutoff: 1775
% full unit cutoff: 0
% dbl unit cutoff: 6
% real runtime : 0.52
% process. runtime: 0.50
% specific non-discr-tree subsumption statistics:
% tried: 24212
% length fails: 98
% strength fails: 1798
% predlist fails: 3495
% aux str. fails: 235
% by-lit fails: 13249
% full subs tried: 2466
% full subs fail: 2305
%
% ; 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-4.004+noeq.in")
%
%------------------------------------------------------------------------------