TSTP Solution File: GRP127-1.004 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP127-1.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/GRP127-1.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(22,40,1,44,0,2)
%
%
% START OF PROOF
% 23 [] group_element(e_1).
% 24 [] group_element(e_2).
% 25 [] group_element(e_3).
% 27 [] -equalish(e_1,e_2).
% 28 [] -equalish(e_1,e_3).
% 30 [] -equalish(e_2,e_1).
% 31 [] -equalish(e_2,e_3).
% 32 [] -equalish(e_2,e_4).
% 33 [] -equalish(e_3,e_1).
% 34 [] -equalish(e_3,e_2).
% 39 [] 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).
% 40 [] -product(X,Y,U) | -product(X,Y,Z) | equalish(Z,U).
% 41 [] -product(X,U,Z) | -product(X,Y,Z) | equalish(Y,U).
% 42 [] -product(U,Y,Z) | -product(X,Y,Z) | equalish(X,U).
% 43 [] product(X,X,X).
% 44 [] -product(Z,X,U) | -product(X,Y,Z) | product(U,X,Y).
% 48 [hyper:39,24,23] 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).
% 50 [hyper:39,24,23] 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).
% 52 [hyper:39,25,23] 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).
% 53 [hyper:39,25,24] 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).
% 120 [hyper:41,48,43,cut:27] product(e_1,e_2,e_2) | product(e_1,e_2,e_4) | product(e_1,e_2,e_3).
% 163 [hyper:42,120,43,cut:30] product(e_1,e_2,e_3) | product(e_1,e_2,e_4).
% 244 [hyper:41,50,43,cut:30] product(e_2,e_1,e_1) | product(e_2,e_1,e_3) | product(e_2,e_1,e_4).
% 289 [hyper:42,244,43,cut:27] product(e_2,e_1,e_4) | product(e_2,e_1,e_3).
% 337 [hyper:41,52,43,cut:28] product(e_1,e_3,e_2) | product(e_1,e_3,e_4) | product(e_1,e_3,e_3).
% 421 [hyper:42,337,43,cut:33] product(e_1,e_3,e_2) | product(e_1,e_3,e_4).
% 442 [hyper:44,421,289] product(e_3,e_1,e_3) | product(e_2,e_1,e_4) | product(e_1,e_3,e_4).
% 452 [hyper:41,421,163,cut:31] product(e_1,e_3,e_2) | product(e_1,e_2,e_3).
% 537 [hyper:41,53,43,cut:31] product(e_2,e_3,e_3) | product(e_2,e_3,e_1) | product(e_2,e_3,e_4).
% 751 [hyper:41,442,43,cut:33] product(e_1,e_3,e_4) | product(e_2,e_1,e_4).
% 780 [hyper:44,751,421] product(e_4,e_1,e_3) | product(e_1,e_3,e_4).
% 820 [hyper:40,780,452,cut:32] product(e_4,e_1,e_3) | product(e_1,e_2,e_3).
% 881 [hyper:44,820,163] product(e_3,e_1,e_2) | product(e_1,e_2,e_3).
% 1043 [hyper:42,537,43,cut:34] product(e_2,e_3,e_4) | product(e_2,e_3,e_1).
% 1086 [hyper:41,1043,751,cut:28] product(e_2,e_3,e_1) | product(e_1,e_3,e_4).
% 1233 [hyper:42,1086,1043,cut:30] product(e_2,e_3,e_1).
% 1243 [hyper:44,1233,881] product(e_1,e_3,e_1) | product(e_1,e_2,e_3).
% 1337 [hyper:40,1243,452,cut:30] product(e_1,e_2,e_3).
% 1353 [hyper:44,1337,1233] product(e_3,e_2,e_3).
% 1376 [hyper:41,1353,43,cut:34] 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: 54
% derived clauses: 3121
% kept clauses: 198
% kept size sum: 2891
% kept mid-nuclei: 1100
% kept new demods: 0
% forw unit-subs: 876
% forw double-subs: 270
% forw overdouble-subs: 650
% backward subs: 35
% fast unit cutoff: 600
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.6
% process. runtime: 0.7
% specific non-discr-tree subsumption statistics:
% tried: 2321
% length fails: 78
% strength fails: 591
% predlist fails: 137
% aux str. fails: 0
% by-lit fails: 712
% 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/GRP127-1.004+noeq.in")
%
%------------------------------------------------------------------------------