TSTP Solution File: GRP406-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP406-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 : 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/GRP406-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 8 1)
% (binary-posweight-lex-big-order 30 #f 8 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,6,50,0,9,0,0)
%
%
% START OF PROOF
% 8 [] equal(multiply(X,inverse(multiply(inverse(multiply(inverse(multiply(X,Y)),Z)),multiply(inverse(Y),multiply(inverse(Y),Y))))),Z).
% 9 [] -equal(multiply(inverse(a1),a1),multiply(inverse(b1),b1)).
% 10 [para:8.1.1,8.1.1.2.1.1.1] equal(multiply(X,inverse(multiply(inverse(Y),multiply(inverse(Z),multiply(inverse(Z),Z))))),inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(X,Z)),U)),Y)),multiply(inverse(U),multiply(inverse(U),U))))).
% 11 [para:10.1.1,8.1.1] equal(inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(X,Y)),Z)),multiply(inverse(multiply(X,Y)),U))),multiply(inverse(Z),multiply(inverse(Z),Z)))),U).
% 12 [para:10.1.2,8.1.1.2] equal(multiply(inverse(multiply(X,Y)),multiply(X,inverse(multiply(inverse(Z),multiply(inverse(Y),multiply(inverse(Y),Y)))))),Z).
% 21 [para:11.1.1,11.1.1.1.1.1.1.1.1,demod:11] equal(inverse(multiply(inverse(multiply(inverse(multiply(X,Y)),multiply(X,Z))),multiply(inverse(Y),multiply(inverse(Y),Y)))),Z).
% 27 [para:21.1.1,12.1.1.2.2] equal(multiply(inverse(multiply(X,Y)),multiply(X,Z)),multiply(inverse(multiply(U,Y)),multiply(U,Z))).
% 37 [para:27.1.1,12.1.1.2.2.1] equal(multiply(inverse(multiply(X,Y)),multiply(X,inverse(multiply(inverse(multiply(Z,U)),multiply(Z,multiply(inverse(Y),Y)))))),multiply(inverse(Y),U)).
% 44 [para:21.1.1,27.1.1.1] equal(multiply(X,multiply(inverse(multiply(inverse(multiply(Y,Z)),multiply(Y,X))),U)),multiply(inverse(multiply(V,multiply(inverse(Z),multiply(inverse(Z),Z)))),multiply(V,U))).
% 59 [para:27.1.1,37.1.1.2.2.1.2.2] equal(multiply(inverse(multiply(X,multiply(Y,Z))),multiply(X,inverse(multiply(inverse(multiply(U,V)),multiply(U,multiply(inverse(multiply(W,Z)),multiply(W,Z))))))),multiply(inverse(multiply(Y,Z)),V)).
% 630 [para:44.1.1,12.1.1.2.2.1,demod:59] equal(multiply(inverse(multiply(inverse(multiply(X,Y)),multiply(X,inverse(Z)))),multiply(inverse(Y),multiply(inverse(Y),Y))),Z).
% 741 [para:630.1.1,44.1.1.2] equal(multiply(inverse(X),X),multiply(inverse(multiply(Y,multiply(inverse(Z),multiply(inverse(Z),Z)))),multiply(Y,multiply(inverse(Z),multiply(inverse(Z),Z))))).
% 744 [para:741.1.1,9.1.2,cut:741] 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 9
% seconds given: 60
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 30
% derived clauses: 5794
% kept clauses: 734
% kept size sum: 30634
% kept mid-nuclei: 0
% kept new demods: 79
% forw unit-subs: 2629
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 5
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.15
% process. runtime: 0.15
% 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/GRP406-1+eq_r.in")
%
%------------------------------------------------------------------------------