TSTP Solution File: GRP402-1 by Gandalf---c-2.6

View Problem - Process Solution

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

% Computer : art06.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 19.5s
% Output   : Assurance 19.5s
% 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/GRP402-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: peq
% 
% strategies selected: 
% (hyper 30 #f 4 3)
% (binary-unit 12 #f)
% (binary-unit-uniteq 12 #f)
% (binary-posweight-kb-big-order 60 #f 4 3)
% (binary-posweight-lex-big-order 30 #f 4 3)
% (binary 30 #t)
% (binary-posweight-kb-big-order 156 #f)
% (binary-posweight-lex-big-order 102 #f)
% (binary-posweight-firstpref-order 60 #f)
% (binary-order 30 #f)
% (binary-posweight-kb-small-order 48 #f)
% (binary-posweight-lex-small-order 30 #f)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(7,40,0,14,0,0,5172,4,2251)
% 
% 
% START OF PROOF
% 8 [] equal(X,X).
% 9 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 10 [] -equal(multiply(X,Y),multiply(Z,Y)) | equal(X,Z).
% 12 [] equal(multiply(X,Y),multiply(Y,multiply(X,commutator(X,Y)))).
% 13 [] equal(multiply(commutator(X,Y),Z),multiply(Z,commutator(X,Y))).
% 14 [] -equal(commutator(commutator(a,b),c),commutator(a,commutator(b,c))).
% 19 [para:13.1.2,9.1.1] equal(multiply(commutator(X,Y),multiply(Z,U)),multiply(Z,multiply(U,commutator(X,Y)))).
% 20 [para:13.1.1,9.1.1.1,demod:9] equal(multiply(X,multiply(commutator(Y,Z),U)),multiply(commutator(Y,Z),multiply(X,U))).
% 34 [para:19.1.2,12.1.2] equal(multiply(X,Y),multiply(commutator(X,Y),multiply(Y,X))).
% 57 [para:34.1.2,9.1.1.1,demod:9] equal(multiply(X,multiply(Y,Z)),multiply(commutator(X,Y),multiply(Y,multiply(X,Z)))).
% 60 [para:34.1.2,20.1.1.2] equal(multiply(X,multiply(Y,Z)),multiply(commutator(Y,Z),multiply(X,multiply(Z,Y)))).
% 71 [para:34.1.2,57.1.2.2.2,demod:60] equal(multiply(X,multiply(Y,Z)),multiply(commutator(commutator(Y,Z),X),multiply(X,multiply(Y,Z)))).
% 84 [para:60.1.2,57.1.2.2,demod:34] equal(multiply(X,multiply(Y,Z)),multiply(commutator(X,commutator(Y,Z)),multiply(X,multiply(Y,Z)))).
% 134 [para:84.1.2,60.1.2.2,demod:34,9] equal(multiply(commutator(X,commutator(Y,Z)),multiply(Y,multiply(Z,X))),multiply(Y,multiply(Z,X))).
% 149 [para:134.1.1,60.1.2.2,demod:34,9] equal(multiply(commutator(X,commutator(Y,Z)),multiply(Z,multiply(X,Y))),multiply(Z,multiply(X,Y))).
% 5174 [binary:10.2,14] -equal(multiply(commutator(commutator(a,b),c),X),multiply(commutator(a,commutator(b,c)),X)).
% 5184 [para:149.1.1,5174.1.2,demod:71,cut:8] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% not using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 3
% clause depth limited to 4
% seconds given: 30
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    654
%  derived clauses:   1257804
%  kept clauses:      5167
%  kept size sum:     115547
%  kept mid-nuclei:   0
%  kept new demods:   339
%  forw unit-subs:    403086
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     121
%  fast unit cutoff:  1
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  23.5
%  process. runtime:  22.60
% 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/GRP402-1+eq_r.in")
% 
%------------------------------------------------------------------------------