↑ Up

Gandalf---c-2.6.UNS-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : GRP424-1 : TPTP v3.4.2. Released v2.6.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/GRP424-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: ueq
% 
% strategies selected: 
% (binary-posweight-kb-big-order 60 #f 9 1)
% (binary-posweight-lex-big-order 30 #f 9 1)
% (binary 30 #t)
% (binary-posweight-kb-big-order 180 #f)
% (binary-posweight-lex-big-order 120 #f)
% (binary-posweight-firstpref-order 60 #f)
% (binary-posweight-kb-small-order 60 #f)
% (binary-posweight-lex-small-order 60 #f)
% 
% 
% **** EMPTY CLAUSE DERIVED ****
% 
% 
% timer checkpoints: c(3,40,0,6,0,0,11,50,0,14,0,0,32,50,5,35,0,5)
% 
% 
% START OF PROOF
% 34 [] equal(multiply(inverse(multiply(inverse(multiply(X,inverse(multiply(inverse(Y),Z)))),multiply(X,inverse(Z)))),inverse(multiply(inverse(Z),Z))),Y).
% 35 [] -equal(multiply(inverse(a1),a1),multiply(inverse(b1),b1)).
% 36 [para:34.1.1,34.1.1.1.1.1.1.2.1] equal(multiply(inverse(multiply(inverse(multiply(X,inverse(Y))),multiply(X,inverse(inverse(multiply(inverse(Z),Z)))))),inverse(multiply(inverse(inverse(multiply(inverse(Z),Z))),inverse(multiply(inverse(Z),Z))))),multiply(inverse(multiply(U,inverse(multiply(inverse(Y),Z)))),multiply(U,inverse(Z)))).
% 37 [para:36.1.1,34.1.1] equal(multiply(inverse(multiply(X,inverse(multiply(inverse(multiply(inverse(Y),inverse(multiply(inverse(Z),Z)))),Z)))),multiply(X,inverse(Z))),Y).
% 38 [para:36.1.2,34.1.1.1.1] equal(multiply(inverse(multiply(inverse(multiply(inverse(multiply(X,inverse(Y))),multiply(X,inverse(inverse(multiply(inverse(Z),Z)))))),inverse(multiply(inverse(inverse(multiply(inverse(Z),Z))),inverse(multiply(inverse(Z),Z)))))),inverse(multiply(inverse(Z),Z))),Y).
% 39 [para:34.1.1,36.1.2.1.1] equal(multiply(inverse(multiply(inverse(multiply(X,inverse(Y))),multiply(X,inverse(inverse(multiply(inverse(Y),Y)))))),inverse(multiply(inverse(inverse(multiply(inverse(Y),Y))),inverse(multiply(inverse(Y),Y))))),multiply(inverse(Z),multiply(inverse(multiply(inverse(multiply(U,inverse(multiply(inverse(Z),Y)))),multiply(U,inverse(Y)))),inverse(Y)))).
% 40 [para:34.1.1,36.1.2.2] equal(multiply(inverse(multiply(inverse(multiply(X,inverse(Y))),multiply(X,inverse(inverse(multiply(inverse(multiply(inverse(Z),Z)),multiply(inverse(Z),Z))))))),inverse(multiply(inverse(inverse(multiply(inverse(multiply(inverse(Z),Z)),multiply(inverse(Z),Z)))),inverse(multiply(inverse(multiply(inverse(Z),Z)),multiply(inverse(Z),Z)))))),multiply(inverse(multiply(inverse(multiply(inverse(multiply(U,inverse(multiply(inverse(V),Z)))),multiply(U,inverse(Z)))),inverse(multiply(inverse(Y),multiply(inverse(Z),Z))))),V)).
% 41 [para:36.1.1,36.1.1] equal(multiply(inverse(multiply(X,inverse(multiply(inverse(Y),Z)))),multiply(X,inverse(Z))),multiply(inverse(multiply(U,inverse(multiply(inverse(Y),Z)))),multiply(U,inverse(Z)))).
% 43 [para:37.1.1,34.1.1.1.1.1.1.2.1] equal(multiply(inverse(multiply(inverse(multiply(X,inverse(Y))),multiply(X,inverse(multiply(Z,inverse(U)))))),inverse(multiply(inverse(multiply(Z,inverse(U))),multiply(Z,inverse(U))))),multiply(Z,inverse(multiply(inverse(multiply(inverse(Y),inverse(multiply(inverse(U),U)))),U)))).
% 55 [para:37.1.1,41.1.1.1.1.2.1,demod:37] equal(multiply(inverse(multiply(X,inverse(Y))),multiply(X,inverse(multiply(Z,inverse(U))))),multiply(inverse(multiply(V,inverse(Y))),multiply(V,inverse(multiply(Z,inverse(U)))))).
% 60 [para:34.1.1,55.1.1.2.2.1,demod:34] equal(multiply(inverse(multiply(X,inverse(Y))),multiply(X,inverse(Z))),multiply(inverse(multiply(U,inverse(Y))),multiply(U,inverse(Z)))).
% 69 [para:60.1.1,34.1.1.1.1.1.1.2.1,demod:43] equal(multiply(X,inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(Y,inverse(Z))),multiply(Y,inverse(U)))),inverse(multiply(inverse(U),U)))),U))),multiply(X,inverse(Z))).
% 70 [para:60.1.1,34.1.1.2.1] equal(multiply(inverse(multiply(inverse(multiply(X,inverse(multiply(inverse(Y),multiply(Z,inverse(U)))))),multiply(X,inverse(multiply(Z,inverse(U)))))),inverse(multiply(inverse(multiply(V,inverse(U))),multiply(V,inverse(U))))),Y).
% 84 [para:69.1.1,38.1.1.1.1.1.1.1.1,demod:38] equal(X,multiply(inverse(multiply(inverse(multiply(inverse(multiply(Y,inverse(X))),multiply(Y,inverse(Z)))),inverse(multiply(inverse(Z),Z)))),Z)).
% 118 [para:69.1.1,70.1.1.1.1.2,demod:84] equal(multiply(inverse(multiply(inverse(multiply(X,inverse(multiply(inverse(Y),Z)))),multiply(X,inverse(Z)))),inverse(multiply(inverse(multiply(U,inverse(V))),multiply(U,inverse(V))))),Y).
% 122 [para:34.1.1,118.1.1.2.1.1.1,demod:34] equal(multiply(inverse(multiply(inverse(multiply(X,inverse(multiply(inverse(Y),Z)))),multiply(X,inverse(Z)))),inverse(multiply(inverse(U),U))),Y).
% 146 [para:40.1.1,39.1.1,demod:122,slowcut:35] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% using first neg lit preferred strategy
% not using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% clause length limited to 1
% clause depth limited to 11
% seconds given: 60
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    42
%  derived clauses:   3034
%  kept clauses:      132
%  kept size sum:     6502
%  kept mid-nuclei:   0
%  kept new demods:   18
%  forw unit-subs:    742
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     5
%  fast unit cutoff:  0
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.8
%  process. runtime:  0.8
% specific non-discr-tree subsumption statistics: 
%  tried:           0
%  length fails:    0
%  strength fails:  0
%  predlist fails:  0
%  aux str. fails:  0
%  by-lit fails:    0
%  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/GRP424-1+eq_r.in")
% 
%------------------------------------------------------------------------------