TSTP Solution File: GRP453-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP453-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 : art03.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/GRP453-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(5,40,0,10,0,0)
%
%
% START OF PROOF
% 6 [] equal(X,X).
% 7 [] equal(divide(divide(divide(X,X),divide(X,divide(Y,divide(divide(divide(X,X),X),Z)))),Z),Y).
% 8 [] equal(multiply(X,Y),divide(X,divide(divide(Z,Z),Y))).
% 9 [] equal(inverse(X),divide(divide(Y,Y),X)).
% 10 [] -equal(multiply(multiply(a3,b3),c3),multiply(a3,multiply(b3,c3))).
% 11 [para:9.1.2,9.1.2.1] equal(inverse(X),divide(inverse(divide(Y,Y)),X)).
% 12 [para:11.1.2,9.1.2.1] equal(inverse(X),divide(inverse(inverse(divide(Y,Y))),X)).
% 16 [para:8.1.2,9.1.2,demod:9] equal(inverse(inverse(X)),multiply(divide(Y,Y),X)).
% 19 [para:9.1.2,8.1.2.2] equal(multiply(X,Y),divide(X,inverse(Y))).
% 20 [para:8.1.2,11.1.2,demod:9] equal(inverse(inverse(X)),multiply(inverse(divide(Y,Y)),X)).
% 24 [para:8.1.2,8.1.2.2,demod:9] equal(multiply(X,inverse(Y)),divide(X,multiply(divide(Z,Z),Y))).
% 28 [para:16.1.1,16.1.1] equal(multiply(divide(X,X),Y),multiply(divide(Z,Z),Y)).
% 29 [para:16.1.1,16.1.1.1] equal(inverse(multiply(divide(X,X),Y)),multiply(divide(Z,Z),inverse(Y))).
% 36 [para:9.1.2,7.1.1.1,demod:9] equal(divide(inverse(divide(X,divide(Y,divide(inverse(X),Z)))),Z),Y).
% 37 [para:9.1.2,7.1.1.1.1,demod:19,11,9] equal(divide(inverse(inverse(multiply(X,Y))),Y),X).
% 38 [para:9.1.2,7.1.1.1.2.2,demod:19,9] equal(divide(inverse(multiply(X,divide(inverse(X),Y))),Y),divide(Z,Z)).
% 41 [para:7.1.1,8.1.2,demod:19,9] equal(multiply(inverse(divide(X,divide(Y,multiply(inverse(X),Z)))),Z),Y).
% 43 [para:7.1.1,7.1.1.1.2.2,demod:9] equal(divide(inverse(divide(X,Y)),Z),inverse(divide(U,divide(Y,divide(inverse(U),divide(inverse(X),Z)))))).
% 44 [para:37.1.1,8.1.2,demod:9] equal(multiply(inverse(inverse(multiply(X,inverse(Y)))),Y),X).
% 59 [para:44.1.1,37.1.1.1.1.1] equal(divide(inverse(inverse(X)),Y),inverse(inverse(multiply(X,inverse(Y))))).
% 75 [para:28.1.1,37.1.1.1.1.1,demod:37] equal(divide(X,X),divide(Y,Y)).
% 81 [para:75.1.1,12.1.2] equal(inverse(inverse(inverse(divide(X,X)))),divide(Y,Y)).
% 181 [para:24.1.2,11.1.2,demod:20] equal(inverse(multiply(divide(X,X),Y)),inverse(inverse(inverse(Y)))).
% 923 [para:29.1.1,181.1.2.1.1,demod:12,59] equal(inverse(multiply(divide(X,X),multiply(divide(Y,Y),Z))),inverse(Z)).
% 991 [para:181.1.1,181.1.2.1.1,demod:923] equal(inverse(X),inverse(inverse(inverse(inverse(inverse(X)))))).
% 993 [para:991.1.2,19.1.2.2,demod:19] equal(multiply(X,inverse(inverse(inverse(inverse(Y))))),multiply(X,Y)).
% 996 [para:991.1.2,44.1.1.1.1.1.2,demod:993,59] equal(multiply(divide(inverse(inverse(X)),Y),Y),X).
% 1000 [para:996.1.1,16.1.2] equal(inverse(inverse(inverse(inverse(X)))),X).
% 1004 [para:996.1.1,24.1.2.2] equal(multiply(X,inverse(inverse(inverse(Y)))),divide(X,Y)).
% 1005 [para:996.1.1,29.1.2] equal(inverse(multiply(divide(X,X),inverse(Y))),Y).
% 1027 [para:16.1.1,1000.1.1.1.1] equal(inverse(inverse(multiply(divide(X,X),Y))),Y).
% 1030 [para:1000.1.1,996.1.1.1.1] equal(multiply(divide(X,Y),Y),inverse(inverse(X))).
% 1103 [para:1030.1.2,181.1.2.1.1,demod:1005] equal(X,inverse(inverse(multiply(divide(X,Y),Y)))).
% 1107 [para:1030.1.2,1000.1.1.1] equal(inverse(multiply(divide(inverse(X),Y),Y)),X).
% 1139 [para:38.1.1,1103.1.2.1.1.1,demod:1027] equal(inverse(multiply(X,divide(inverse(X),Y))),Y).
% 1147 [para:36.1.1,1107.1.1.1.1] equal(inverse(multiply(X,Y)),divide(Z,divide(X,divide(inverse(Z),Y)))).
% 1159 [para:1139.1.1,37.1.1.1.1] equal(divide(inverse(X),divide(inverse(Y),X)),Y).
% 1166 [para:81.1.2,1139.1.1.1.2,demod:1004] equal(inverse(divide(X,divide(Y,Y))),inverse(X)).
% 1189 [para:1159.1.1,11.1.2,demod:1166] equal(inverse(inverse(X)),X).
% 1190 [para:8.1.2,1159.1.1.2,demod:1189,9] equal(divide(X,multiply(inverse(Y),X)),Y).
% 1193 [para:37.1.1,1159.1.1.2] equal(divide(inverse(X),Y),inverse(multiply(Y,X))).
% 1205 [para:9.1.2,41.1.1.1.1,demod:1189,20] equal(multiply(divide(X,Y),Y),X).
% 1215 [para:1189.1.1,19.1.2.2] equal(multiply(X,inverse(Y)),divide(X,Y)).
% 1218 [para:7.1.1,1205.1.1.1,demod:1193,1147,9] equal(multiply(X,Y),inverse(divide(inverse(Y),X))).
% 1221 [para:44.1.1,1190.1.1.2,demod:1215] equal(divide(X,Y),inverse(divide(Y,X))).
% 1227 [para:9.1.2,43.1.2.1,demod:1218,9,1221] equal(divide(divide(X,Y),Z),divide(X,multiply(Z,Y))).
% 1274 [para:1193.1.2,1218.1.2.1.1,demod:1218,1227] equal(multiply(X,multiply(Y,Z)),multiply(multiply(X,Y),Z)).
% 1283 [para:1274.1.2,10.1.1,cut: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 8
% seconds given: 60
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 178
% derived clauses: 34847
% kept clauses: 1272
% kept size sum: 18590
% kept mid-nuclei: 0
% kept new demods: 345
% forw unit-subs: 33111
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 1
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.42
% process. runtime: 0.41
% 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/GRP453-1+eq_r.in")
%
%------------------------------------------------------------------------------