TSTP Solution File: GRP124-2.004 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP124-2.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 : art04.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-2.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(33,40,1,66,0,1)
%
%
% START OF PROOF
% 35 [] next(e_2,e_3).
% 42 [] greater(e_4,e_3).
% 43 [] -product(X,e_1,Y) | -greater(Y,Z) | -next(X,Z).
% 44 [] group_element(e_1).
% 45 [] group_element(e_2).
% 46 [] group_element(e_3).
% 48 [] -equalish(e_1,e_2).
% 49 [] -equalish(e_1,e_3).
% 51 [] -equalish(e_2,e_1).
% 52 [] -equalish(e_2,e_3).
% 54 [] -equalish(e_3,e_1).
% 60 [] 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).
% 62 [] -product(X,U,Z) | -product(X,Y,Z) | equalish(Y,U).
% 63 [] -product(U,Y,Z) | -product(X,Y,Z) | equalish(X,U).
% 64 [] product(X,X,X).
% 65 [] -product(W,X,Y) | -product(W,U,V) | -product(U,V,Z) | -product(X,Y,Z) | equalish(U,X).
% 70 [hyper:60,45,44] 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).
% 72 [hyper:60,45,44] 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).
% 74 [hyper:60,46,44] 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).
% 75 [hyper:60,46,45] 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).
% 214 [hyper:62,70,64,cut:48] product(e_1,e_2,e_2) | product(e_1,e_2,e_4) | product(e_1,e_2,e_3).
% 305 [hyper:43,72,42,cut:35] product(e_2,e_1,e_3) | product(e_2,e_1,e_2) | product(e_2,e_1,e_1).
% 398 [hyper:63,214,64,cut:51] product(e_1,e_2,e_3) | product(e_1,e_2,e_4).
% 564 [hyper:62,74,64,cut:49] product(e_1,e_3,e_2) | product(e_1,e_3,e_4) | product(e_1,e_3,e_3).
% 677 [hyper:62,305,64,cut:51] product(e_2,e_1,e_1) | product(e_2,e_1,e_3).
% 836 [hyper:62,75,64,cut:52] product(e_2,e_3,e_3) | product(e_2,e_3,e_1) | product(e_2,e_3,e_4).
% 952 [hyper:63,677,64,cut:48] product(e_2,e_1,e_3).
% 1308 [hyper:63,564,64,cut:54] product(e_1,e_3,e_2) | product(e_1,e_3,e_4).
% 1479 [hyper:65,1308,952,64,cut:64,cut:48] product(e_1,e_3,e_4).
% 1512 [hyper:62,1479,398,cut:52] product(e_1,e_2,e_3).
% 2018 [hyper:62,836,952,cut:49] product(e_2,e_3,e_4) | product(e_2,e_3,e_1).
% 2222 [hyper:63,2018,1479,cut:48] product(e_2,e_3,e_1).
% 2257 [hyper:65,2222,1512,64,cut:64] equalish(e_2,e_1).
% 2335 [hyper:51,2257] 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: 56
% derived clauses: 3765
% kept clauses: 93
% kept size sum: 974
% kept mid-nuclei: 2151
% kept new demods: 0
% forw unit-subs: 660
% forw double-subs: 157
% forw overdouble-subs: 678
% backward subs: 29
% fast unit cutoff: 391
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.12
% process. runtime: 0.11
% specific non-discr-tree subsumption statistics:
% tried: 5085
% length fails: 41
% strength fails: 870
% predlist fails: 795
% aux str. fails: 4
% by-lit fails: 1864
% full subs tried: 770
% full subs fail: 741
%
% ; 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-2.004+noeq.in")
%
%------------------------------------------------------------------------------