TSTP Solution File: GRP039-3 by Gandalf---c-2.6

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : GRP039-3 : TPTP v3.4.2. Released v1.0.0.
% Transfm  : add_equality:r
% Format   : otter:hypothesis:set(auto),clear(print_given)
% Command  : gandalf-wrapper -time %d %s

% Computer : art09.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/GRP039-3+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: neq
% detected subclass: medium
% 
% strategies selected: 
% (hyper 25 #f 3 7)
% (binary-unit 9 #f 3 7)
% (binary-double 9 #f 3 7)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 3 7)
% (binary-order 25 #f 3 7)
% (binary-posweight-order 101 #f)
% (binary-posweight-lex-big-order 25 #f)
% (binary-posweight-lex-small-order 9 #f)
% (binary-order-sos 50 #t)
% (binary-unit-uniteq 25 #f)
% (binary-weightorder 50 #f)
% (binary-order 50 #f)
% (hyper-order 30 #f)
% (binary 112 #t)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(21,40,0,42,0,0)
% 
% 
% START OF PROOF
% 23 [] product(identity,X,X).
% 24 [] product(X,identity,X).
% 25 [] product(inverse(X),X,identity).
% 26 [] product(X,inverse(X),identity).
% 27 [] product(X,Y,multiply(X,Y)).
% 28 [] -product(X,Y,U) | -product(X,Y,Z) | equal(Z,U).
% 29 [] -product(U,Y,V) | -product(W,X,U) | -product(X,Y,Z) | product(W,Z,V).
% 30 [] -product(U,Z,V) | -product(U,X,W) | -product(X,Y,Z) | product(W,Y,V).
% 31 [] -product(X,inverse(Y),Z) | -subgroup_member(X) | -subgroup_member(Y) | subgroup_member(Z).
% 32 [] -product(X,U,Z) | -product(X,Y,Z) | equal(U,Y).
% 34 [] equal(inverse(inverse(X)),X).
% 35 [] subgroup_member(identity).
% 36 [] subgroup_member(inverse(X)) | -subgroup_member(X).
% 37 [] subgroup_member(element_in_^o2(X,Y)) | subgroup_member(Y) | subgroup_member(X).
% 38 [] product(X,element_in_^o2(X,Y),Y) | subgroup_member(Y) | subgroup_member(X).
% 39 [] subgroup_member(b).
% 40 [] product(b,inverse(a),c).
% 41 [] product(a,c,d).
% 42 [] -subgroup_member(d).
% 47 [hyper:36,39] subgroup_member(inverse(b)).
% 150 [hyper:29,25,23,40] product(inverse(b),c,inverse(a)).
% 176 [hyper:30,25,40,24] product(c,a,b).
% 202 [hyper:29,176,23,25] product(inverse(c),b,a).
% 323 [hyper:28,27,40] equal(c,multiply(b,inverse(a))).
% 324 [hyper:28,27,23] equal(X,multiply(identity,X)).
% 326 [hyper:28,27,41] equal(d,multiply(a,c)).
% 351 [hyper:29,27,27,25,demod:324] product(inverse(X),multiply(X,Y),Y).
% 352 [hyper:29,27,27,176] product(c,multiply(a,X),multiply(b,X)).
% 353 [hyper:29,27,27,26,demod:324] product(X,multiply(inverse(X),Y),Y).
% 355 [hyper:29,27,27,27] product(X,multiply(Y,Z),multiply(multiply(X,Y),Z)).
% 362 [hyper:29,27,41,176] product(c,d,multiply(b,c)).
% 364 [hyper:29,27,40,27] product(X,c,multiply(multiply(X,b),inverse(a))).
% 528 [hyper:30,202,27,27] product(a,X,multiply(inverse(c),multiply(b,X))).
% 529 [hyper:30,202,26,24] product(a,inverse(b),inverse(c)).
% 803 [hyper:28,150,27] equal(multiply(inverse(b),c),inverse(a)).
% 1814 [hyper:42,37] subgroup_member(element_in_^o2(X,d)) | subgroup_member(X).
% 2007 [hyper:31,1814,529,cut:39] subgroup_member(element_in_^o2(a,d)) | subgroup_member(inverse(c)).
% 2773 [hyper:32,38,41,cut:42] equal(element_in_^o2(a,d),c) | subgroup_member(a).
% 3757 [hyper:30,351,26,24] product(X,inverse(multiply(Y,X)),inverse(Y)).
% 4011 [hyper:32,353,362] equal(multiply(inverse(c),multiply(b,c)),d).
% 6573 [hyper:32,352,353] equal(multiply(a,X),multiply(inverse(c),multiply(b,X))).
% 7715 [hyper:28,355,27] equal(multiply(X,multiply(Y,Z)),multiply(multiply(X,Y),Z)).
% 10851 [hyper:31,2007,364,37,demod:34,demod:323,7715,factor:cut:42] subgroup_member(element_in_^o2(a,d)).
% 10895 [hyper:31,10851,23,cut:35] subgroup_member(inverse(element_in_^o2(a,d))).
% 19967 [hyper:31,2773,529,cut:39] equal(element_in_^o2(a,d),c) | subgroup_member(inverse(c)).
% 23077 [hyper:32,3757,353] equal(inverse(multiply(X,Y)),multiply(inverse(Y),inverse(X))).
% 63387 [hyper:31,19967,528,2773,demod:34,demod:4011,cut:42] equal(element_in_^o2(a,d),c).
% 63389 [para:63387.1.1,10895.1.1.1] subgroup_member(inverse(c)).
% 63673 [hyper:31,63389,27,47,demod:23077,demod:34,803] subgroup_member(a).
% 63938 [hyper:31,63673,528,10895,demod:6573,demod:326,34,63387,cut:42] 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 7
% clause depth limited to 3
% seconds given: 25
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    380
%  derived clauses:   410201
%  kept clauses:      24823
%  kept size sum:     384107
%  kept mid-nuclei:   38248
%  kept new demods:   38
%  forw unit-subs:    126379
%  forw double-subs: 53454
%  forw overdouble-subs: 41285
%  backward subs:     111
%  fast unit cutoff:  4004
%  full unit cutoff:  4
%  dbl  unit cutoff:  5
%  real runtime  :  8.53
%  process. runtime:  8.52
% specific non-discr-tree subsumption statistics: 
%  tried:           981849
%  length fails:    100608
%  strength fails:  241062
%  predlist fails:  175459
%  aux str. fails:  22095
%  by-lit fails:    2544
%  full subs tried: 436030
%  full subs fail:  395270
% 
% ; 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/GRP039-3+eq_r.in")
% 
%------------------------------------------------------------------------------