TSTP Solution File: GRP126-2.004 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP126-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 : art01.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-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(32,40,0,64,0,0)
%
%
% START OF PROOF
% 34 [] next(e_2,e_3).
% 41 [] greater(e_4,e_3).
% 42 [] -product(X,e_1,Y) | -greater(Y,Z) | -next(X,Z).
% 43 [] group_element(e_1).
% 44 [] group_element(e_2).
% 45 [] group_element(e_3).
% 47 [] -equalish(e_1,e_2).
% 48 [] -equalish(e_1,e_3).
% 50 [] -equalish(e_2,e_1).
% 51 [] -equalish(e_2,e_3).
% 53 [] -equalish(e_3,e_1).
% 54 [] -equalish(e_3,e_2).
% 56 [] -equalish(e_4,e_1).
% 59 [] 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).
% 60 [] -product(X,Y,U) | -product(X,Y,Z) | equalish(Z,U).
% 61 [] -product(X,U,Z) | -product(X,Y,Z) | equalish(Y,U).
% 62 [] -product(U,Y,Z) | -product(X,Y,Z) | equalish(X,U).
% 63 [] product(X,X,X).
% 64 [] -product(Y,X,U) | -product(X,Y,Z) | product(Z,U,Y).
% 68 [hyper:59,44,43] 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).
% 70 [hyper:59,44,43] 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).
% 72 [hyper:59,45,43] 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).
% 151 [hyper:61,68,63,cut:47] product(e_1,e_2,e_2) | product(e_1,e_2,e_4) | product(e_1,e_2,e_3).
% 194 [hyper:62,151,63,cut:50] product(e_1,e_2,e_3) | product(e_1,e_2,e_4).
% 231 [hyper:42,70,41,cut:34] product(e_2,e_1,e_3) | product(e_2,e_1,e_2) | product(e_2,e_1,e_1).
% 333 [hyper:61,231,63,cut:50] product(e_2,e_1,e_1) | product(e_2,e_1,e_3).
% 378 [hyper:61,72,63,cut:48] product(e_1,e_3,e_2) | product(e_1,e_3,e_4) | product(e_1,e_3,e_3).
% 428 [hyper:62,333,63,cut:47] product(e_2,e_1,e_3).
% 491 [hyper:64,428,194] product(e_3,e_3,e_2) | product(e_1,e_2,e_4).
% 529 [hyper:60,491,63,cut:54] product(e_1,e_2,e_4).
% 547 [hyper:64,529,428] product(e_4,e_3,e_2).
% 750 [hyper:61,378,529,cut:51] product(e_1,e_3,e_3) | product(e_1,e_3,e_2).
% 771 [hyper:62,750,63,cut:53] product(e_1,e_3,e_2).
% 781 [hyper:62,771,547,cut:56] 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: 52
% derived clauses: 1443
% kept clauses: 73
% kept size sum: 863
% kept mid-nuclei: 623
% kept new demods: 0
% forw unit-subs: 255
% forw double-subs: 84
% forw overdouble-subs: 388
% backward subs: 26
% fast unit cutoff: 231
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.4
% process. runtime: 0.3
% specific non-discr-tree subsumption statistics:
% tried: 1238
% length fails: 18
% strength fails: 362
% predlist fails: 56
% aux str. fails: 4
% by-lit fails: 396
% 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-2.004+noeq.in")
%
%------------------------------------------------------------------------------