TSTP Solution File: GRP124-6.004 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP124-6.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 : art10.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-6.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(27,40,0,54,0,0)
%
%
% START OF PROOF
% 28 [] group_element(e_1).
% 29 [] group_element(e_2).
% 30 [] group_element(e_3).
% 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).
% 38 [] -equalish(e_3,e_1).
% 39 [] -equalish(e_3,e_2).
% 40 [] -equalish(e_3,e_4).
% 44 [] product1(X,Y,e_3) | product1(X,Y,e_4) | product1(X,Y,e_2) | product1(X,Y,e_1) | -group_element(Y) | -group_element(X).
% 45 [] -product1(X,Y,U) | -product1(X,Y,Z) | equalish(Z,U).
% 46 [] -product1(X,U,Z) | -product1(X,Y,Z) | equalish(Y,U).
% 47 [] -product1(U,Y,Z) | -product1(X,Y,Z) | equalish(X,U).
% 48 [] product1(X,X,X).
% 50 [] -product2(X,Y,U) | -product2(X,Y,Z) | equalish(Z,U).
% 53 [] product2(X,X,X).
% 54 [] -product1(Z,X,U) | -product1(X,Y,Z) | product2(U,Y,X).
% 60 [hyper:44,29,28] product1(e_1,e_2,e_4) | product1(e_1,e_2,e_3) | product1(e_1,e_2,e_2) | product1(e_1,e_2,e_1).
% 62 [hyper:44,29,28] product1(e_2,e_1,e_3) | product1(e_2,e_1,e_4) | product1(e_2,e_1,e_1) | product1(e_2,e_1,e_2).
% 68 [hyper:44,30,28] product1(e_1,e_3,e_4) | product1(e_1,e_3,e_3) | product1(e_1,e_3,e_2) | product1(e_1,e_3,e_1).
% 69 [hyper:44,30,29] product1(e_2,e_3,e_4) | product1(e_2,e_3,e_3) | product1(e_2,e_3,e_2) | product1(e_2,e_3,e_1).
% 165 [hyper:46,60,48,cut:32] product1(e_1,e_2,e_2) | product1(e_1,e_2,e_4) | product1(e_1,e_2,e_3).
% 208 [hyper:47,165,48,cut:35] product1(e_1,e_2,e_3) | product1(e_1,e_2,e_4).
% 298 [hyper:46,62,48,cut:35] product1(e_2,e_1,e_1) | product1(e_2,e_1,e_3) | product1(e_2,e_1,e_4).
% 343 [hyper:47,298,48,cut:32] product1(e_2,e_1,e_4) | product1(e_2,e_1,e_3).
% 552 [hyper:46,68,48,cut:33] product1(e_1,e_3,e_2) | product1(e_1,e_3,e_4) | product1(e_1,e_3,e_3).
% 659 [hyper:47,552,48,cut:38] product1(e_1,e_3,e_2) | product1(e_1,e_3,e_4).
% 680 [hyper:54,659,343] product2(e_3,e_3,e_1) | product1(e_2,e_1,e_4) | product1(e_1,e_3,e_4).
% 690 [hyper:46,659,208,cut:36] product1(e_1,e_3,e_2) | product1(e_1,e_2,e_3).
% 739 [hyper:46,69,48,cut:36] product1(e_2,e_3,e_3) | product1(e_2,e_3,e_1) | product1(e_2,e_3,e_4).
% 925 [hyper:50,680,53,cut:38] product1(e_1,e_3,e_4) | product1(e_2,e_1,e_4).
% 946 [hyper:54,925,659] product2(e_4,e_3,e_1) | product1(e_1,e_3,e_4).
% 981 [hyper:45,946,690,cut:37] product2(e_4,e_3,e_1) | product1(e_1,e_2,e_3).
% 1156 [hyper:47,739,48,cut:39] product1(e_2,e_3,e_4) | product1(e_2,e_3,e_1).
% 1196 [hyper:46,1156,925,cut:33] product1(e_2,e_3,e_1) | product1(e_1,e_3,e_4).
% 1279 [hyper:47,1196,1156,cut:35] product1(e_2,e_3,e_1).
% 1290 [hyper:54,1279,208] product2(e_3,e_3,e_2) | product1(e_1,e_2,e_4).
% 1357 [hyper:50,1290,53,cut:39] product1(e_1,e_2,e_4).
% 1406 [hyper:54,1357,1279] product2(e_4,e_3,e_2).
% 1411 [hyper:45,1357,981,cut:40] product2(e_4,e_3,e_1).
% 1470 [hyper:50,1411,1406,cut:35] 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: 66
% derived clauses: 3286
% kept clauses: 154
% kept size sum: 2127
% kept mid-nuclei: 1220
% kept new demods: 0
% forw unit-subs: 965
% forw double-subs: 262
% forw overdouble-subs: 650
% backward subs: 41
% fast unit cutoff: 631
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.6
% process. runtime: 0.7
% specific non-discr-tree subsumption statistics:
% tried: 2276
% length fails: 88
% strength fails: 704
% predlist fails: 179
% aux str. fails: 0
% by-lit fails: 586
% 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/GRP124-6.004+noeq.in")
%
%------------------------------------------------------------------------------