TSTP Solution File: GRP128-1.003 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP128-1.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 : art08.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/GRP128-1.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(14,40,1,28,0,1)
%
%
% START OF PROOF
% 15 [] group_element(e_1).
% 16 [] group_element(e_2).
% 17 [] group_element(e_3).
% 18 [] -equalish(e_1,e_2).
% 19 [] -equalish(e_1,e_3).
% 20 [] -equalish(e_2,e_1).
% 21 [] -equalish(e_2,e_3).
% 23 [] -equalish(e_3,e_2).
% 24 [] product(X,Y,e_2) | product(X,Y,e_3) | product(X,Y,e_1) | -group_element(X) | -group_element(Y).
% 25 [] -product(X,Y,U) | -product(X,Y,Z) | equalish(Z,U).
% 26 [] -product(X,U,Z) | -product(X,Y,Z) | equalish(Y,U).
% 27 [] -product(U,Y,Z) | -product(X,Y,Z) | equalish(X,U).
% 28 [] -product(Z,Y,U) | -product(X,Y,Z) | product(X,Z,U).
% 33 [hyper:24,16,15] product(e_2,e_1,e_1) | product(e_2,e_1,e_2) | product(e_2,e_1,e_3).
% 34 [hyper:24,16,16] product(e_2,e_2,e_1) | product(e_2,e_2,e_2) | product(e_2,e_2,e_3).
% 36 [hyper:24,16,15] product(e_1,e_2,e_2) | product(e_1,e_2,e_3) | product(e_1,e_2,e_1).
% 38 [hyper:24,17,15] product(e_3,e_1,e_1) | product(e_3,e_1,e_2) | product(e_3,e_1,e_3).
% 39 [hyper:24,17,16] product(e_3,e_2,e_1) | product(e_3,e_2,e_2) | product(e_3,e_2,e_3).
% 146 [hyper:28,33,33] product(e_2,e_1,e_1) | product(e_2,e_1,e_3) | product(e_2,e_2,e_2).
% 372 [hyper:28,36,36] product(e_1,e_2,e_3) | product(e_1,e_2,e_2) | product(e_1,e_1,e_1).
% 461 [hyper:28,38,38] product(e_3,e_1,e_2) | product(e_3,e_1,e_1) | product(e_3,e_3,e_3).
% 579 [hyper:28,39,39] product(e_3,e_2,e_2) | product(e_3,e_2,e_1) | product(e_3,e_3,e_3).
% 1040 [hyper:26,146,33,cut:18] product(e_2,e_1,e_1) | product(e_2,e_1,e_3).
% 1138 [hyper:26,372,36,cut:20] product(e_1,e_2,e_3) | product(e_1,e_2,e_2).
% 1236 [hyper:26,461,38,cut:19] product(e_3,e_1,e_2) | product(e_3,e_1,e_1).
% 1287 [hyper:27,1236,1040,cut:21] product(e_3,e_1,e_2) | product(e_2,e_1,e_3).
% 1308 [hyper:28,1287,1040] product(e_3,e_2,e_1) | product(e_2,e_1,e_3).
% 1311 [hyper:28,1287,1236] product(e_2,e_3,e_1) | product(e_3,e_1,e_2).
% 1455 [hyper:26,579,39,cut:21] product(e_3,e_2,e_2) | product(e_3,e_2,e_1).
% 1496 [hyper:26,1455,1311,cut:18] product(e_3,e_2,e_1) | product(e_2,e_3,e_1).
% 1499 [hyper:26,1455,1236,cut:18] product(e_3,e_2,e_2) | product(e_3,e_1,e_2).
% 1503 [hyper:27,1455,1138,cut:19] product(e_3,e_2,e_1) | product(e_1,e_2,e_3).
% 1653 [hyper:28,1503,1455] product(e_1,e_3,e_2) | product(e_3,e_2,e_1).
% 1726 [hyper:28,1653,1496] product(e_2,e_1,e_2) | product(e_3,e_2,e_1).
% 1821 [hyper:25,1726,1308,cut:23] product(e_3,e_2,e_1).
% 1842 [hyper:28,1821,1138] product(e_3,e_1,e_3) | product(e_1,e_2,e_2).
% 1845 [hyper:25,1821,1499,cut:20] product(e_3,e_1,e_2).
% 1851 [hyper:27,1821,34,cut:21] product(e_2,e_2,e_2) | product(e_2,e_2,e_3).
% 1925 [hyper:25,1842,1845,cut:21] product(e_1,e_2,e_2).
% 2006 [hyper:27,1851,1925,cut:18] product(e_2,e_2,e_3).
% 2018 [hyper:28,2006,1925] product(e_1,e_2,e_3).
% 2041 [hyper:25,2018,1925,cut:21] 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: 68
% derived clauses: 6340
% kept clauses: 480
% kept size sum: 6552
% kept mid-nuclei: 1482
% kept new demods: 0
% forw unit-subs: 1645
% forw double-subs: 703
% forw overdouble-subs: 1929
% backward subs: 125
% fast unit cutoff: 1808
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.13
% process. runtime: 0.11
% specific non-discr-tree subsumption statistics:
% tried: 12507
% length fails: 664
% strength fails: 2984
% predlist fails: 2732
% aux str. fails: 0
% by-lit fails: 2558
% 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/GRP128-1.003+noeq.in")
%
%------------------------------------------------------------------------------