TSTP Solution File: GRP086-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP086-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 : 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/GRP086-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 5 7)
% (binary-unit 12 #f)
% (binary-unit-uniteq 12 #f)
% (binary-posweight-kb-big-order 60 #f 5 7)
% (binary-posweight-lex-big-order 30 #f 5 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,1,6,0,1,7,50,1,10,0,1,11,50,1,14,0,2)
%
%
% START OF PROOF
% 12 [] equal(X,X).
% 13 [] equal(multiply(X,multiply(multiply(Y,Z),inverse(multiply(X,Z)))),Y).
% 14 [] -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)).
% 15 [para:13.1.1,13.1.1.2.2.1] equal(multiply(X,multiply(multiply(Y,multiply(multiply(Z,U),inverse(multiply(X,U)))),inverse(Z))),Y).
% 16 [para:13.1.1,15.1.1.2.1] equal(multiply(X,multiply(Y,inverse(Y))),X).
% 17 [para:16.1.1,13.1.1.2.1,demod:16] equal(multiply(X,multiply(Y,inverse(X))),Y).
% 18 [para:16.1.1,15.1.1.2.1.2.1,demod:16] equal(multiply(X,multiply(multiply(Y,multiply(Z,inverse(X))),inverse(Z))),Y).
% 20 [para:17.1.1,15.1.1.2.1] equal(multiply(X,multiply(multiply(Y,Z),inverse(Y))),multiply(X,Z)).
% 24 [para:13.1.1,18.1.1.2.1] equal(multiply(multiply(X,Y),multiply(Z,inverse(multiply(Z,Y)))),X).
% 28 [para:24.1.1,15.1.1.2.1] equal(multiply(multiply(X,Y),multiply(Z,inverse(X))),multiply(Z,Y)).
% 30 [para:24.1.1,24.1.1.2.2.1,demod:20] equal(multiply(multiply(X,multiply(Y,inverse(multiply(Y,Z)))),Z),X).
% 35 [para:28.1.1,20.1.1] equal(multiply(multiply(X,Y),Z),multiply(multiply(X,Z),Y)).
% 56 [para:30.1.1,15.1.1.2] equal(multiply(multiply(X,inverse(X)),Y),Y).
% 59 [para:30.1.1,17.1.1.2] equal(multiply(X,Y),multiply(Y,multiply(Z,inverse(multiply(Z,inverse(X)))))).
% 60 [para:30.1.1,20.1.1.2,demod:59] equal(multiply(X,Y),multiply(Y,X)).
% 73 [para:60.1.1,16.1.1.2] equal(multiply(X,multiply(inverse(Y),Y)),X).
% 75 [para:60.1.1,17.1.1.2] equal(multiply(X,multiply(inverse(X),Y)),Y).
% 88 [para:60.1.1,35.1.1] equal(multiply(X,multiply(Y,Z)),multiply(multiply(Y,X),Z)).
% 101 [para:56.1.1,13.1.1.2.2.1,demod:17,88] equal(multiply(inverse(X),multiply(X,Y)),Y).
% 108 [para:56.1.1,30.1.1.1.2,demod:101,88] equal(multiply(inverse(X),multiply(Y,X)),Y).
% 110 [para:73.1.1,17.1.1] equal(X,inverse(inverse(X))).
% 161 [para:73.1.1,101.1.1.2] equal(multiply(inverse(X),X),multiply(inverse(Y),Y)).
% 166 [para:108.1.1,28.1.1.1,demod:110] equal(multiply(X,multiply(Y,Z)),multiply(Y,multiply(X,Z))).
% 217 [hyper:14,161,demod:75,88,cut:166,cut:12,cut:60] 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: 44
% derived clauses: 2247
% kept clauses: 199
% kept size sum: 2723
% kept mid-nuclei: 2
% kept new demods: 159
% forw unit-subs: 1967
% 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.5
% process. runtime: 0.4
% specific non-discr-tree subsumption statistics:
% tried: 2
% length fails: 0
% strength fails: 2
% 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/GRP086-1+eq_r.in")
%
%------------------------------------------------------------------------------