↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : GRP418-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 : 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/GRP418-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 12 1)
% (binary-posweight-lex-big-order 30 #f 12 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,1,6,0,1,12,50,2,15,0,2)
% 
% 
% START OF PROOF
% 14 [] equal(inverse(multiply(inverse(multiply(X,inverse(multiply(inverse(Y),inverse(multiply(Z,inverse(multiply(inverse(Z),Z)))))))),multiply(X,Z))),Y).
% 15 [] -equal(multiply(inverse(a1),a1),multiply(inverse(b1),b1)).
% 16 [para:14.1.1,14.1.1.1.1.1.2.1.1] equal(inverse(multiply(inverse(multiply(X,inverse(multiply(Y,inverse(multiply(Z,inverse(multiply(inverse(Z),Z)))))))),multiply(X,Z))),multiply(inverse(multiply(U,inverse(multiply(inverse(Y),inverse(multiply(V,inverse(multiply(inverse(V),V)))))))),multiply(U,V))).
% 17 [para:16.1.1,14.1.1] equal(multiply(inverse(multiply(X,inverse(multiply(inverse(inverse(Y)),inverse(multiply(Z,inverse(multiply(inverse(Z),Z)))))))),multiply(X,Z)),Y).
% 25 [para:17.1.1,17.1.1.2] equal(multiply(inverse(multiply(inverse(multiply(X,inverse(multiply(inverse(inverse(Y)),inverse(multiply(Z,inverse(multiply(inverse(Z),Z)))))))),inverse(multiply(inverse(inverse(U)),inverse(multiply(multiply(X,Z),inverse(multiply(inverse(multiply(X,Z)),multiply(X,Z))))))))),Y),U).
% 38 [para:25.1.1,14.1.1.1.1.1.2.1] equal(inverse(multiply(inverse(multiply(X,inverse(Y))),multiply(X,Z))),multiply(inverse(multiply(U,inverse(multiply(inverse(inverse(inverse(multiply(Z,inverse(multiply(inverse(Z),Z)))))),inverse(multiply(V,inverse(multiply(inverse(V),V)))))))),inverse(multiply(inverse(inverse(Y)),inverse(multiply(multiply(U,V),inverse(multiply(inverse(multiply(U,V)),multiply(U,V))))))))).
% 45 [para:38.1.2,16.1.2.1.1,demod:17,14] equal(X,multiply(inverse(inverse(multiply(inverse(multiply(Y,inverse(X))),multiply(Y,Z)))),inverse(multiply(Z,inverse(multiply(inverse(Z),Z)))))).
% 53 [para:38.1.2,38.1.2] equal(inverse(multiply(inverse(multiply(X,inverse(Y))),multiply(X,Z))),inverse(multiply(inverse(multiply(U,inverse(Y))),multiply(U,Z)))).
% 54 [para:53.1.1,14.1.1.1.1.1.2.1.1,demod:14] equal(multiply(inverse(multiply(X,inverse(Y))),multiply(X,Z)),multiply(inverse(multiply(U,inverse(Y))),multiply(U,Z))).
% 71 [para:14.1.1,54.1.1.1.1.2,demod:14] equal(multiply(inverse(multiply(X,Y)),multiply(X,Z)),multiply(inverse(multiply(U,Y)),multiply(U,Z))).
% 95 [para:71.1.1,14.1.1.1.1.1.2.1.2.1.2.1] equal(inverse(multiply(inverse(multiply(X,inverse(multiply(inverse(Y),inverse(multiply(multiply(Z,U),inverse(multiply(inverse(multiply(V,U)),multiply(V,U))))))))),multiply(X,multiply(Z,U)))),Y).
% 127 [para:71.1.1,25.1.1.1.1.2.1.2.1.2.1] equal(multiply(inverse(multiply(inverse(multiply(X,inverse(multiply(inverse(inverse(Y)),inverse(multiply(Z,inverse(multiply(inverse(Z),Z)))))))),inverse(multiply(inverse(inverse(U)),inverse(multiply(multiply(X,Z),inverse(multiply(inverse(multiply(V,Z)),multiply(V,Z))))))))),Y),U).
% 1104 [para:25.1.1,95.1.1.1.1.1.2.1.2.1.1,demod:127] equal(inverse(multiply(inverse(multiply(X,inverse(multiply(inverse(Y),inverse(multiply(Z,inverse(multiply(inverse(multiply(U,V)),multiply(U,V))))))))),multiply(X,Z))),Y).
% 1127 [para:17.1.1,1104.1.1.1.1.1.2.1.2.1.2.1.1.1,demod:17] equal(inverse(multiply(inverse(multiply(X,inverse(multiply(inverse(Y),inverse(multiply(Z,inverse(multiply(inverse(U),U)))))))),multiply(X,Z))),Y).
% 1193 [para:1127.1.1,45.1.2.1.1] equal(multiply(inverse(X),inverse(multiply(Y,inverse(multiply(inverse(Z),Z))))),multiply(inverse(X),inverse(multiply(Y,inverse(multiply(inverse(Y),Y)))))).
% 1277 [para:1193.1.2,45.1.2] equal(X,multiply(inverse(inverse(multiply(inverse(multiply(Y,inverse(X))),multiply(Y,Z)))),inverse(multiply(Z,inverse(multiply(inverse(U),U)))))).
% 1278 [para:1193.1.1,45.1.2.1.1.1.1.1,demod:1277] equal(multiply(X,inverse(multiply(inverse(Y),Y))),multiply(X,inverse(multiply(inverse(X),X)))).
% 1520 [para:1278.1.1,45.1.2.1.1.1.1.1,demod:1277,slowcut:15] 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 13
% seconds given: 60
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    52
%  derived clauses:   15144
%  kept clauses:      1509
%  kept size sum:     73453
%  kept mid-nuclei:   0
%  kept new demods:   150
%  forw unit-subs:    5820
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     8
%  fast unit cutoff:  0
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.47
%  process. runtime:  0.46
% 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/GRP418-1+eq_r.in")
% 
%------------------------------------------------------------------------------