TSTP Solution File: GRP412-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP412-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/GRP412-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 10 1)
% (binary-posweight-lex-big-order 30 #f 10 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,6,50,1,9,0,1)
%
%
% START OF PROOF
% 8 [] equal(multiply(X,inverse(multiply(multiply(multiply(inverse(Y),Y),inverse(multiply(inverse(multiply(X,inverse(Y))),Z))),Y))),Z).
% 9 [] -equal(multiply(inverse(a1),a1),multiply(inverse(b1),b1)).
% 10 [para:8.1.1,8.1.1.2.1.1.2.1] equal(multiply(X,inverse(multiply(multiply(multiply(inverse(Y),Y),inverse(Z)),Y))),inverse(multiply(multiply(multiply(inverse(U),U),inverse(multiply(inverse(multiply(inverse(multiply(X,inverse(Y))),inverse(U))),Z))),U))).
% 11 [para:10.1.1,8.1.1] equal(inverse(multiply(multiply(multiply(inverse(X),X),inverse(multiply(inverse(multiply(inverse(multiply(Y,inverse(Z))),inverse(X))),multiply(inverse(multiply(Y,inverse(Z))),U)))),X)),U).
% 12 [para:10.1.2,8.1.1.2] equal(multiply(inverse(multiply(X,inverse(Y))),multiply(X,inverse(multiply(multiply(multiply(inverse(Y),Y),inverse(Z)),Y)))),Z).
% 14 [para:8.1.1,12.1.1.2.2.1.1] equal(multiply(inverse(multiply(X,inverse(Y))),multiply(X,inverse(multiply(Z,Y)))),multiply(multiply(multiply(inverse(U),U),inverse(multiply(inverse(multiply(multiply(inverse(Y),Y),inverse(U))),Z))),U)).
% 24 [para:11.1.1,11.1.1.1.1.2.1.1.1.1,demod:11] equal(inverse(multiply(multiply(multiply(inverse(X),X),inverse(multiply(inverse(multiply(Y,inverse(X))),multiply(Y,Z)))),X)),Z).
% 30 [para:24.1.1,12.1.1.2.2] equal(multiply(inverse(multiply(X,inverse(Y))),multiply(X,Z)),multiply(inverse(multiply(U,inverse(Y))),multiply(U,Z))).
% 39 [para:11.1.1,30.1.1.1.1.2,demod:11] equal(multiply(inverse(multiply(X,Y)),multiply(X,Z)),multiply(inverse(multiply(U,Y)),multiply(U,Z))).
% 46 [para:39.1.1,8.1.1.2.1.1.1] equal(multiply(X,inverse(multiply(multiply(multiply(inverse(multiply(Y,Z)),multiply(Y,Z)),inverse(multiply(inverse(multiply(X,inverse(multiply(U,Z)))),V))),multiply(U,Z)))),V).
% 311 [para:14.1.2,8.1.1.2.1] equal(multiply(multiply(inverse(X),X),inverse(multiply(inverse(multiply(Y,inverse(X))),multiply(Y,inverse(multiply(Z,X)))))),Z).
% 315 [para:10.1.1,14.1.1.2,demod:8] equal(X,multiply(multiply(multiply(inverse(Y),Y),inverse(multiply(inverse(multiply(multiply(inverse(Z),Z),inverse(Y))),multiply(multiply(inverse(Z),Z),inverse(X))))),Y)).
% 319 [para:14.1.2,24.1.1.1] equal(inverse(multiply(inverse(multiply(X,inverse(Y))),multiply(X,inverse(multiply(multiply(multiply(inverse(Y),Y),Z),Y))))),Z).
% 1165 [para:315.1.2,46.1.1.2.1.1.1.1.1,demod:315] equal(multiply(X,inverse(multiply(multiply(multiply(inverse(Y),Y),inverse(multiply(inverse(multiply(X,inverse(multiply(Z,U)))),V))),multiply(Z,U)))),V).
% 1171 [para:8.1.1,1165.1.1.2.1.1.2.1.1.1.2.1,demod:8] equal(multiply(X,inverse(multiply(multiply(multiply(inverse(Y),Y),inverse(multiply(inverse(multiply(X,inverse(Z))),U))),Z))),U).
% 1210 [para:319.1.1,1171.1.1.2.1.1.2] equal(multiply(X,inverse(multiply(multiply(multiply(inverse(Y),Y),Z),U))),multiply(X,inverse(multiply(multiply(multiply(inverse(U),U),Z),U)))).
% 1279 [para:1210.1.1,311.1.1.2.1.2,demod:319] equal(multiply(multiply(inverse(X),X),Y),multiply(multiply(inverse(Z),Z),Y)).
% 1365 [para:1279.1.1,311.1.1] equal(multiply(multiply(inverse(X),X),inverse(multiply(inverse(multiply(Y,inverse(Z))),multiply(Y,inverse(multiply(U,Z)))))),U).
% 1368 [para:1279.1.1,311.1.1.2.1.2.2.1,demod:1365,slowcut:9] 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: 39
% derived clauses: 8579
% kept clauses: 1357
% kept size sum: 55667
% kept mid-nuclei: 0
% kept new demods: 188
% forw unit-subs: 4827
% 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.26
% process. runtime: 0.26
% 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/GRP412-1+eq_r.in")
%
%------------------------------------------------------------------------------