TSTP Solution File: GRP134-2.003 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP134-2.003 : 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/GRP134-2.003+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 9)
% (binary-unit 10 #f 1 9)
% (binary-double 16 #f 1 9)
% (binary 54 #t 1 9)
% (binary-order 27 #f 1 9)
% (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(20,40,0,40,0,0)
%
%
% START OF PROOF
% 21 [] next(e_1,e_2).
% 25 [] greater(e_3,e_2).
% 26 [] -product(X,e_1,Y) | -greater(Y,Z) | -next(X,Z).
% 27 [] group_element(e_1).
% 28 [] group_element(e_2).
% 30 [] -equalish(e_1,e_2).
% 32 [] -equalish(e_2,e_1).
% 35 [] -equalish(e_3,e_2).
% 36 [] product(X,Y,e_2) | product(X,Y,e_3) | product(X,Y,e_1) | -group_element(X) | -group_element(Y).
% 37 [] -product(X,Y,U) | -product(X,Y,Z) | equalish(Z,U).
% 38 [] -product(X,U,Z) | -product(X,Y,Z) | equalish(Y,U).
% 39 [] -product(U,Y,Z) | -product(X,Y,Z) | equalish(X,U).
% 40 [] -product(Y,X,U) | -product(X,Y,Z) | product(Z,U,Y).
% 42 [hyper:36,27,27] product(e_1,e_1,e_1) | product(e_1,e_1,e_2) | product(e_1,e_1,e_3).
% 45 [hyper:36,28,27] product(e_2,e_1,e_1) | product(e_2,e_1,e_2) | product(e_2,e_1,e_3).
% 46 [hyper:36,28,28] product(e_2,e_2,e_1) | product(e_2,e_2,e_2) | product(e_2,e_2,e_3).
% 48 [hyper:36,28,27] product(e_1,e_2,e_2) | product(e_1,e_2,e_3) | product(e_1,e_2,e_1).
% 88 [hyper:26,42,25,cut:21] product(e_1,e_1,e_1) | product(e_1,e_1,e_2).
% 125 [hyper:40,88,88] product(e_2,e_2,e_1) | product(e_1,e_1,e_1).
% 208 [hyper:39,45,88,cut:30] product(e_2,e_1,e_2) | product(e_1,e_1,e_2) | product(e_2,e_1,e_3).
% 212 [hyper:39,45,88,cut:30] product(e_2,e_1,e_1) | product(e_1,e_1,e_1) | product(e_2,e_1,e_3).
% 270 [hyper:40,46,46] product(e_2,e_2,e_2) | product(e_2,e_2,e_3) | product(e_1,e_1,e_2).
% 442 [hyper:38,48,88,cut:30] product(e_1,e_2,e_3) | product(e_1,e_1,e_1) | product(e_1,e_2,e_1).
% 1194 [hyper:38,212,125,cut:32] product(e_2,e_1,e_3) | product(e_1,e_1,e_1).
% 1244 [hyper:37,1194,208,cut:32] product(e_2,e_1,e_2) | product(e_2,e_1,e_3).
% 1507 [hyper:39,442,125,cut:32] product(e_1,e_2,e_3) | product(e_1,e_1,e_1).
% 1527 [hyper:40,1507,1194] product(e_3,e_3,e_1) | product(e_1,e_1,e_1).
% 1529 [hyper:40,1507,1194] product(e_3,e_3,e_2) | product(e_1,e_1,e_1).
% 1543 [hyper:38,1507,48,cut:32] product(e_1,e_2,e_3) | product(e_1,e_2,e_2).
% 1622 [hyper:37,1529,1527,cut:30] product(e_1,e_1,e_1).
% 1647 [hyper:37,1622,270,cut:32] product(e_2,e_2,e_3) | product(e_2,e_2,e_2).
% 1721 [hyper:38,1647,1244,cut:30] product(e_2,e_2,e_2) | product(e_2,e_1,e_2).
% 1725 [hyper:38,1647,1244,cut:30] product(e_2,e_2,e_3) | product(e_2,e_1,e_3).
% 1729 [hyper:39,1647,1543,cut:30] product(e_2,e_2,e_2) | product(e_1,e_2,e_2).
% 1987 [hyper:40,1729,1721] product(e_2,e_2,e_2).
% 2009 [hyper:37,1987,1725,cut:35] product(e_2,e_1,e_3).
% 2016 [hyper:39,1987,1543,cut:30] product(e_1,e_2,e_3).
% 2052 [hyper:40,2016,2009] product(e_3,e_3,e_1).
% 2054 [hyper:40,2016,2009] product(e_3,e_3,e_2).
% 2111 [hyper:37,2054,2052,cut:30] 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 9
% clause depth limited to 1
% seconds given: 27
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 72
% derived clauses: 6229
% kept clauses: 394
% kept size sum: 5274
% kept mid-nuclei: 1628
% kept new demods: 0
% forw unit-subs: 1554
% forw double-subs: 943
% forw overdouble-subs: 1671
% backward subs: 97
% fast unit cutoff: 1656
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.12
% process. runtime: 0.12
% specific non-discr-tree subsumption statistics:
% tried: 11279
% length fails: 865
% strength fails: 2904
% predlist fails: 2298
% aux str. fails: 17
% by-lit fails: 1794
% 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/GRP134-2.003+noeq.in")
%
%------------------------------------------------------------------------------