TSTP Solution File: GRP087-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP087-1 : TPTP v3.4.2. Bugfixed v2.7.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/GRP087-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 7)
% (binary-unit 12 #f)
% (binary-unit-uniteq 12 #f)
% (binary-posweight-kb-big-order 60 #f 6 7)
% (binary-posweight-lex-big-order 30 #f 6 7)
% (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))) | -equal(multiply(a4,b4),multiply(b4,a4)).
% 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))).
% -equal(multiply(a4,b4),multiply(b4,a4)).
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(3,40,0,6,0,0,7,50,0,10,0,0)
%
%
% START OF PROOF
% 8 [] equal(X,X).
% 9 [] equal(multiply(X,multiply(multiply(inverse(multiply(X,Y)),Z),Y)),Z).
% 10 [] -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)) | -equal(multiply(a4,b4),multiply(b4,a4)).
% 11 [para:9.1.1,9.1.1.2.1] equal(multiply(X,multiply(Y,Z)),multiply(multiply(inverse(multiply(inverse(multiply(X,Z)),U)),Y),U)).
% 13 [para:11.1.2,9.1.1.2] equal(multiply(inverse(multiply(X,Y)),multiply(X,multiply(Z,Y))),Z).
% 21 [para:13.1.1,13.1.1.2] equal(multiply(inverse(multiply(inverse(multiply(X,Y)),multiply(Z,Y))),Z),X).
% 24 [para:9.1.1,21.1.1.1.1] equal(multiply(inverse(X),multiply(inverse(multiply(inverse(multiply(Y,Z)),Z)),X)),Y).
% 36 [para:24.1.1,13.1.1] equal(X,inverse(multiply(inverse(multiply(X,Y)),Y))).
% 38 [para:24.1.1,13.1.1.2,demod:36] equal(multiply(inverse(multiply(inverse(X),X)),Y),Y).
% 48 [para:36.1.2,11.1.2.1.1] equal(multiply(X,multiply(Y,Z)),multiply(multiply(X,Y),Z)).
% 54 [para:21.1.1,36.1.2.1.1.1] equal(inverse(multiply(inverse(multiply(X,Y)),multiply(Z,Y))),inverse(multiply(inverse(X),Z))).
% 56 [para:36.1.2,24.1.1.2.1] equal(multiply(inverse(X),multiply(Y,X)),Y).
% 67 [para:21.1.1,56.1.1.2,demod:54] equal(multiply(inverse(X),Y),inverse(multiply(inverse(Y),X))).
% 68 [para:38.1.1,9.1.1.2.1.1.1,demod:56,48,67] equal(multiply(inverse(X),multiply(X,Y)),Y).
% 69 [para:38.1.1,11.1.2.1.1.1.1.1,demod:68,48,67] equal(multiply(X,Y),multiply(inverse(Z),multiply(Y,multiply(X,Z)))).
% 71 [para:38.1.1,21.1.1.1.1.1.1,demod:67,56] equal(multiply(inverse(X),X),multiply(inverse(Y),Y)).
% 82 [para:68.1.1,21.1.1.1.1.1.1,demod:69] equal(multiply(inverse(multiply(X,Y)),Y),inverse(X)).
% 84 [para:68.1.1,24.1.1,demod:82] equal(inverse(inverse(X)),X).
% 85 [para:24.1.1,68.1.1.2,demod:82,84] equal(multiply(X,Y),multiply(Y,X)).
% 96 [hyper:10,85,demod:68,48,cut:71,cut:8,cut:8] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 7
% clause depth limited to 7
% seconds given: 10
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 17
% derived clauses: 263
% kept clauses: 84
% kept size sum: 1196
% kept mid-nuclei: 0
% kept new demods: 72
% forw unit-subs: 159
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.2
% process. runtime: 0.1
% 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/GRP087-1+eq_r.in")
%
%------------------------------------------------------------------------------