TSTP Solution File: GRP063-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP063-1 : TPTP v3.4.2. Bugfixed v2.3.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/GRP063-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 6 5)
% (binary-unit 12 #f)
% (binary-unit-uniteq 12 #f)
% (binary-posweight-kb-big-order 60 #f 6 5)
% (binary-posweight-lex-big-order 30 #f 6 5)
% (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)
%
%
% SOS clause
% -equal(multiply(inverse(a1),a1),multiply(inverse(b1),b1)) | -equal(multiply(multiply(inverse(b2),b2),a2),a2) | -equal(multiply(multiply(a3,b3),c3),multiply(a3,multiply(b3,c3))).
% was split for some strategies as:
% -equal(multiply(inverse(a1),a1),multiply(inverse(b1),b1)).
% -equal(multiply(multiply(inverse(b2),b2),a2),a2).
% -equal(multiply(multiply(a3,b3),c3),multiply(a3,multiply(b3,c3))).
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(5,40,0,10,0,0,219,50,59,224,0,59,454,50,160,459,0,160,701,50,269,706,0,269,950,50,388,955,0,388,1202,50,534,1202,40,534,1207,0,534)
%
%
% START OF PROOF
% 1203 [] equal(X,X).
% 1204 [] equal(divide(X,divide(divide(divide(divide(X,X),Y),Z),divide(divide(divide(X,X),X),Z))),Y).
% 1205 [] equal(multiply(X,Y),divide(X,divide(divide(Z,Z),Y))).
% 1206 [] equal(inverse(X),divide(divide(Y,Y),X)).
% 1207 [] -equal(multiply(multiply(inverse(b2),b2),a2),a2) | -equal(multiply(multiply(a3,b3),c3),multiply(a3,multiply(b3,c3))) | -equal(multiply(inverse(a1),a1),multiply(inverse(b1),b1)).
% 1208 [para:1206.1.2,1206.1.2.1] equal(inverse(X),divide(inverse(divide(Y,Y)),X)).
% 1213 [para:1205.1.2,1206.1.2,demod:1206] equal(inverse(inverse(X)),multiply(divide(Y,Y),X)).
% 1216 [para:1206.1.2,1205.1.2.2] equal(multiply(X,Y),divide(X,inverse(Y))).
% 1217 [para:1205.1.2,1208.1.2,demod:1206] equal(inverse(inverse(X)),multiply(inverse(divide(Y,Y)),X)).
% 1234 [para:1204.1.1,1206.1.2,demod:1216,1208,1206] equal(inverse(multiply(divide(inverse(X),Y),Y)),X).
% 1235 [para:1206.1.2,1204.1.1.2,demod:1216,1206] equal(multiply(X,multiply(inverse(X),Y)),Y).
% 1240 [para:1205.1.2,1204.1.1.2.1.1,demod:1206] equal(divide(X,divide(divide(multiply(divide(X,X),Y),Z),divide(inverse(X),Z))),inverse(Y)).
% 1244 [para:1235.1.1,1213.1.2,demod:1217] equal(inverse(inverse(inverse(inverse(X)))),X).
% 1246 [para:1217.1.2,1235.1.1.2] equal(multiply(divide(X,X),inverse(inverse(Y))),Y).
% 1247 [para:1235.1.1,1235.1.1.2] equal(multiply(X,Y),multiply(inverse(inverse(X)),Y)).
% 1251 [para:1244.1.1,1235.1.1.2.1,demod:1247] equal(multiply(inverse(X),multiply(X,Y)),Y).
% 1253 [para:1208.1.2,1234.1.1.1.1] equal(inverse(multiply(inverse(X),X)),divide(Y,Y)).
% 1295 [para:1253.1.2,1204.1.1.2,demod:1216] equal(multiply(X,multiply(inverse(Y),Y)),X).
% 1296 [para:1253.1.2,1204.1.1.2.2,demod:1295,1216,1206] equal(divide(X,multiply(inverse(Y),X)),Y).
% 1302 [para:1253.1.1,1253.1.1] equal(divide(X,X),divide(Y,Y)).
% 1307 [para:1302.1.1,1205.1.2,demod:1206] equal(multiply(inverse(X),X),divide(Y,Y)).
% 1310 [para:1302.1.1,1204.1.1.2] equal(divide(X,divide(Y,Y)),X).
% 1311 [para:1206.1.2,1310.1.1.2,demod:1216] equal(multiply(X,divide(Y,Y)),X).
% 1318 [para:1310.1.1,1234.1.1.1.1,demod:1311] equal(inverse(inverse(X)),X).
% 1319 [para:1310.1.1,1246.1.1.1,demod:1318] equal(multiply(divide(X,X),Y),Y).
% 1320 [para:1318.1.1,1216.1.2.2] equal(multiply(X,inverse(Y)),divide(X,Y)).
% 1324 [para:1295.1.1,1251.1.1.2] equal(multiply(inverse(X),X),multiply(inverse(Y),Y)).
% 1325 [para:1213.1.1,1296.1.1.2.1,demod:1319] equal(divide(X,multiply(Y,X)),inverse(Y)).
% 1329 [para:1235.1.1,1296.1.1.2,demod:1318] equal(divide(multiply(X,Y),Y),X).
% 1331 [para:1329.1.1,1205.1.2,demod:1320,1206] equal(multiply(divide(X,Y),Y),X).
% 1333 [para:1331.1.1,1251.1.1.2] equal(multiply(inverse(divide(X,Y)),X),Y).
% 1334 [para:1307.1.1,1207.1.1.1,demod:1319,cut:1203,cut:1324] -equal(multiply(multiply(a3,b3),c3),multiply(a3,multiply(b3,c3))).
% 1340 [para:1331.1.1,1325.1.1.2] equal(divide(X,Y),inverse(divide(Y,X))).
% 1344 [para:1205.1.2,1340.1.2.1,demod:1206] equal(divide(inverse(X),Y),inverse(multiply(Y,X))).
% 1350 [para:1344.1.2,1216.1.2.2] equal(multiply(X,multiply(Y,Z)),divide(X,divide(inverse(Z),Y))).
% 1400 [para:1240.1.1,1333.1.1.1.1,demod:1350,1319,1318] equal(multiply(X,Y),multiply(divide(X,Z),multiply(Z,Y))).
% 1414 [para:1251.1.1,1400.1.2.2,demod:1216] equal(multiply(X,multiply(Y,Z)),multiply(multiply(X,Y),Z)).
% 1428 [para:1414.1.2,1334.1.1,cut:1203] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using unit strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 4
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 1284
% derived clauses: 309259
% kept clauses: 1376
% kept size sum: 16879
% kept mid-nuclei: 10
% kept new demods: 1065
% forw unit-subs: 306943
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 24
% fast unit cutoff: 12
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 5.51
% process. runtime: 5.50
% 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/GRP063-1+eq_r.in")
%
%------------------------------------------------------------------------------