TSTP Solution File: GRP436-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP436-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 : 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 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/GRP436-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,1)
%
%
% START OF PROOF
% 5 [] equal(multiply(X,inverse(multiply(Y,multiply(Z,multiply(multiply(inverse(Z),inverse(multiply(U,Y))),X))))),U).
% 6 [] -equal(multiply(inverse(a1),a1),multiply(inverse(b1),b1)).
% 8 [para:5.1.1,5.1.1.2.1.2.2.1] equal(multiply(X,inverse(multiply(multiply(Y,multiply(multiply(inverse(Y),inverse(multiply(Z,U))),inverse(V))),multiply(V,multiply(Z,X))))),U).
% 10 [para:8.1.1,5.1.1.2.1.2.2.1] equal(multiply(X,inverse(multiply(multiply(Y,multiply(Z,inverse(U))),multiply(U,multiply(V,X))))),multiply(W,multiply(multiply(inverse(W),inverse(multiply(Z,V))),inverse(Y)))).
% 13 [para:8.1.1,8.1.1.2.1.1.2.1.2.1] equal(multiply(X,inverse(multiply(multiply(Y,multiply(multiply(inverse(Y),inverse(Z)),inverse(U))),multiply(U,multiply(V,X))))),inverse(multiply(multiply(W,multiply(multiply(inverse(W),inverse(multiply(X1,Z))),inverse(X2))),multiply(X2,multiply(X1,V))))).
% 14 [para:8.1.1,8.1.1.2.1.2.2] equal(multiply(inverse(multiply(multiply(X,multiply(multiply(inverse(X),inverse(multiply(Y,Z))),inverse(U))),multiply(U,multiply(Y,V)))),inverse(multiply(multiply(W,multiply(multiply(inverse(W),inverse(multiply(V,X1))),inverse(X2))),multiply(X2,Z)))),X1).
% 16 [para:10.1.1,8.1.1] equal(multiply(X,multiply(multiply(inverse(X),inverse(multiply(multiply(inverse(Y),inverse(multiply(Z,U))),Z))),inverse(Y))),U).
% 25 [para:5.1.1,16.1.1.2.1.2.1.1.2.1] equal(multiply(X,multiply(multiply(inverse(X),inverse(multiply(multiply(inverse(Y),inverse(Z)),U))),inverse(Y))),inverse(multiply(V,multiply(W,multiply(multiply(inverse(W),inverse(multiply(Z,V))),U))))).
% 93 [para:25.1.2,5.1.1.2] equal(multiply(X,multiply(Y,multiply(multiply(inverse(Y),inverse(multiply(multiply(inverse(Z),inverse(U)),X))),inverse(Z)))),U).
% 95 [para:25.1.1,16.1.1] equal(inverse(multiply(X,multiply(Y,multiply(multiply(inverse(Y),inverse(multiply(multiply(Z,U),X))),Z)))),U).
% 100 [para:5.1.1,95.1.1.1.2.2.1] equal(inverse(multiply(multiply(X,multiply(multiply(inverse(X),inverse(multiply(Y,multiply(Z,U)))),inverse(V))),multiply(V,multiply(Y,Z)))),U).
% 102 [para:8.1.1,95.1.1.1.2.2.1] equal(inverse(multiply(multiply(X,multiply(Y,inverse(Z))),multiply(Z,multiply(U,V)))),multiply(multiply(inverse(V),inverse(multiply(Y,U))),inverse(X))).
% 105 [para:95.1.1,10.1.2.2.1.2,demod:95,102] equal(multiply(X,multiply(multiply(inverse(X),Y),inverse(Z))),multiply(U,multiply(multiply(inverse(U),Y),inverse(Z)))).
% 108 [para:95.1.1,16.1.1.2.1.2.1.1.1,demod:95] equal(multiply(X,multiply(multiply(inverse(X),inverse(multiply(multiply(Y,inverse(multiply(Z,U))),Z))),Y)),U).
% 208 [para:95.1.1,93.1.1.2.2.1.2.1.1.1,demod:95] equal(multiply(X,multiply(Y,multiply(multiply(inverse(Y),inverse(multiply(multiply(Z,inverse(U)),X))),Z))),U).
% 245 [para:95.1.1,100.1.1.1.1.2.1.1,demod:95,102] equal(multiply(multiply(inverse(X),inverse(multiply(multiply(Y,inverse(multiply(Z,multiply(X,U)))),Z))),Y),U).
% 266 [para:95.1.1,245.1.1.1.2.1.1.2] equal(multiply(multiply(inverse(X),inverse(multiply(multiply(Y,Z),U))),Y),multiply(multiply(inverse(X),inverse(multiply(multiply(V,Z),U))),V)).
% 268 [para:245.1.1,93.1.1.2.2.1.2.1] equal(multiply(X,multiply(Y,multiply(multiply(inverse(Y),inverse(Z)),inverse(U)))),multiply(multiply(X,inverse(multiply(V,multiply(U,Z)))),V)).
% 400 [para:268.1.1,93.1.1] equal(multiply(multiply(X,inverse(multiply(Y,multiply(Z,multiply(multiply(inverse(Z),inverse(U)),X))))),Y),U).
% 472 [para:108.1.1,400.1.1.1.2.1.2] equal(multiply(multiply(X,inverse(multiply(Y,Z))),Y),multiply(multiply(X,inverse(multiply(U,Z))),U)).
% 491 [para:472.1.1,5.1.1.2.1.2.2] equal(multiply(X,inverse(multiply(Y,multiply(Z,multiply(multiply(inverse(Z),inverse(multiply(U,Y))),U))))),X).
% 572 [para:491.1.1,105.1.1.2,demod:491] equal(multiply(X,multiply(inverse(X),Y)),multiply(Z,multiply(inverse(Z),Y))).
% 588 [para:491.1.1,472.1.1.1.2.1,demod:491] equal(multiply(multiply(X,inverse(Y)),Y),multiply(multiply(X,inverse(Z)),Z)).
% 662 [para:491.1.1,572.1.1.2,demod:491] equal(multiply(X,inverse(X)),multiply(Y,inverse(Y))).
% 816 [para:662.1.1,588.1.1.1] equal(multiply(multiply(X,inverse(X)),Y),multiply(multiply(Y,inverse(Z)),Z)).
% 913 [para:816.1.1,208.1.1.2.2.1.2.1] equal(multiply(X,multiply(Y,multiply(multiply(inverse(Y),inverse(multiply(multiply(X,inverse(Z)),Z))),U))),U).
% 994 [para:816.1.1,491.1.1.2.1.2.2.1.2.1,demod:913] equal(multiply(X,inverse(multiply(Y,inverse(Y)))),X).
% 1085 [para:994.1.1,8.1.1.2.1.1.2.1,demod:102] equal(multiply(X,multiply(multiply(inverse(X),inverse(multiply(inverse(Y),Z))),inverse(Y))),inverse(Z)).
% 1095 [para:994.1.1,16.1.1.2.1.2.1,demod:1085] equal(inverse(inverse(multiply(inverse(multiply(X,inverse(X))),Y))),Y).
% 1116 [para:994.1.1,93.1.1.2.2.1.2.1,demod:1085] equal(multiply(inverse(multiply(X,inverse(X))),inverse(inverse(Y))),Y).
% 1148 [para:994.1.1,472.1.1.1] equal(multiply(X,Y),multiply(multiply(X,inverse(multiply(Z,inverse(Y)))),Z)).
% 1197 [para:93.1.1,1095.1.1.1.1,demod:1148,994] equal(inverse(inverse(X)),multiply(Y,multiply(inverse(Y),X))).
% 1225 [para:1197.1.2,8.1.1.2.1.2,demod:1085] equal(multiply(X,inverse(multiply(inverse(Y),inverse(inverse(X))))),Y).
% 1274 [para:1197.1.2,13.1.2.1.2,demod:1085,102] equal(multiply(X,multiply(multiply(inverse(X),inverse(multiply(multiply(inverse(Y),inverse(Z)),U))),inverse(Y))),inverse(multiply(inverse(Z),inverse(inverse(U))))).
% 1275 [para:1197.1.2,13.1.2.1.2.2,demod:1274,102] equal(inverse(multiply(inverse(X),inverse(inverse(multiply(inverse(Y),Z))))),inverse(multiply(multiply(U,multiply(multiply(inverse(U),inverse(multiply(Y,X))),inverse(V))),multiply(V,inverse(inverse(Z)))))).
% 1287 [para:1197.1.2,572.1.1.2,demod:1197] equal(multiply(X,inverse(inverse(Y))),inverse(inverse(multiply(inverse(inverse(X)),Y)))).
% 1322 [para:1116.1.1,266.1.1.1.2.1.1,demod:994] equal(multiply(inverse(X),inverse(multiply(Y,Z))),multiply(multiply(inverse(X),inverse(multiply(multiply(U,inverse(inverse(Y))),Z))),U)).
% 1470 [para:1225.1.1,13.1.2.1.1.2.1,demod:994,1287,1197,1322,102] equal(inverse(multiply(X,inverse(inverse(Y)))),multiply(inverse(Y),inverse(X))).
% 1481 [para:1225.1.1,14.1.1.1.1.1.2.1,demod:1197,1470,1275,994,102] equal(inverse(inverse(inverse(inverse(X)))),X).
% 1494 [para:1225.1.1,816.1.2.1,demod:1481,1197] equal(multiply(multiply(X,inverse(X)),Y),Y).
% 1736 [para:1494.1.1,588.1.1.1,demod:1494,slowcut:6] 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: 51
% derived clauses: 11226
% kept clauses: 1728
% kept size sum: 52089
% kept mid-nuclei: 0
% kept new demods: 540
% forw unit-subs: 3458
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 2
% fast unit cutoff: 0
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.40
% process. runtime: 0.39
% 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/GRP436-1+eq_r.in")
%
%------------------------------------------------------------------------------