TSTP Solution File: GRP095-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP095-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 : art10.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/GRP095-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(6,40,1,12,0,1,446,4,754)
%
%
% START OF PROOF
% 7 [] equal(X,X).
% 8 [] equal(divide(divide(identity,X),divide(divide(divide(Y,X),Z),Y)),Z).
% 9 [] equal(multiply(X,Y),divide(X,divide(identity,Y))).
% 10 [] equal(inverse(X),divide(identity,X)).
% 11 [] equal(identity,divide(X,X)).
% 12 [] -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)).
% 13 [para:10.1.2,11.1.2] equal(identity,inverse(identity)).
% 15 [para:11.1.2,9.1.2.2] equal(multiply(X,identity),divide(X,identity)).
% 16 [para:9.1.2,10.1.2,demod:10] equal(inverse(inverse(X)),multiply(identity,X)).
% 17 [para:10.1.2,9.1.2.2] equal(multiply(X,Y),divide(X,inverse(Y))).
% 24 [para:11.1.2,8.1.1.2.1,demod:17,10] equal(multiply(inverse(X),Y),divide(Y,X)).
% 25 [para:11.1.2,8.1.1.2.1.1,demod:10] equal(divide(inverse(X),divide(inverse(Y),X)),Y).
% 28 [para:9.1.2,8.1.1.1,demod:17,10] equal(divide(multiply(identity,X),divide(divide(multiply(Y,X),Z),Y)),Z).
% 29 [para:9.1.2,8.1.1.2.1,demod:10] equal(divide(inverse(X),divide(multiply(divide(Y,X),Z),Y)),inverse(Z)).
% 30 [para:8.1.1,8.1.1.2.1,demod:10] equal(divide(inverse(X),divide(Y,identity)),divide(divide(divide(Z,X),Y),Z)).
% 31 [para:13.1.2,24.1.1.1] equal(multiply(identity,X),divide(X,identity)).
% 33 [para:24.1.1,15.1.1,demod:10] equal(inverse(X),divide(inverse(X),identity)).
% 34 [para:16.1.1,33.1.2.1,demod:31,16] equal(divide(X,identity),divide(divide(X,identity),identity)).
% 35 [para:33.1.2,8.1.1.2.1.1,demod:17,13,10] equal(inverse(multiply(divide(inverse(X),Y),X)),Y).
% 36 [para:11.1.2,25.1.1.2,demod:34,31,16] equal(divide(X,identity),X).
% 37 [para:9.1.2,25.1.1.2,demod:24,36,31,16,10] equal(divide(X,divide(X,Y)),Y).
% 38 [para:16.1.1,25.1.1.2.1,demod:36,31] equal(divide(inverse(X),divide(Y,X)),inverse(Y)).
% 41 [para:36.1.1,8.1.1.1,demod:10,36] equal(inverse(divide(divide(X,Y),X)),Y).
% 46 [para:9.1.2,37.1.1.2,demod:10] equal(divide(X,multiply(X,Y)),inverse(Y)).
% 48 [para:37.1.1,8.1.1.2.1,demod:10] equal(divide(inverse(X),divide(Y,Z)),divide(divide(Z,X),Y)).
% 49 [para:8.1.1,37.1.1.2,demod:10] equal(divide(inverse(X),Y),divide(divide(divide(Z,X),Y),Z)).
% 54 [para:41.1.1,16.1.1.1,demod:36,31] equal(inverse(X),divide(divide(Y,X),Y)).
% 55 [para:8.1.1,41.1.1.1.1,demod:49,17,10] equal(inverse(multiply(X,Y)),divide(inverse(Y),X)).
% 56 [para:41.1.1,24.1.1.1,demod:17,54] equal(multiply(X,Y),multiply(Y,X)).
% 57 [para:37.1.1,41.1.1.1.1] equal(inverse(divide(X,Y)),divide(Y,X)).
% 71 [para:57.1.1,24.1.1.1] equal(multiply(divide(X,Y),Z),divide(Z,divide(Y,X))).
% 72 [para:57.1.1,25.1.1.1,demod:48] equal(divide(divide(X,Y),divide(divide(X,Z),Y)),Z).
% 74 [para:57.1.1,35.1.1.1.1.1,demod:57,71] equal(divide(divide(X,divide(Y,Z)),divide(Z,Y)),X).
% 75 [para:38.1.1,8.1.1.2.1.1,demod:71,17,57,10] equal(divide(divide(X,Y),divide(X,multiply(Z,Y))),Z).
% 80 [para:55.1.1,17.1.2.2] equal(multiply(X,multiply(Y,Z)),divide(X,divide(inverse(Z),Y))).
% 88 [para:37.1.1,28.1.1.2.1,demod:36,31] equal(divide(X,divide(Y,Z)),divide(multiply(Z,X),Y)).
% 90 [para:46.1.1,28.1.1.2.1,demod:80,36,31] equal(multiply(X,multiply(Y,Z)),multiply(multiply(Y,X),Z)).
% 107 [para:72.1.1,29.1.1.2.1.1,demod:88,57] equal(divide(divide(X,divide(Y,Z)),divide(U,divide(divide(Y,X),Z))),inverse(U)).
% 109 [para:75.1.1,8.1.1.2.1,demod:48,10] equal(divide(divide(X,Y),Z),divide(X,multiply(Z,Y))).
% 112 [para:74.1.1,30.1.2.1.1,demod:71,109,36,57] equal(divide(X,multiply(Y,Z)),divide(U,divide(Y,divide(X,multiply(U,Z))))).
% 126 [para:56.1.1,90.1.2.1,demod:90] equal(multiply(X,multiply(Y,Z)),multiply(Y,multiply(X,Z))).
% 447 [input:12,cut:56] -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)).
% 448 [para:107.1.2,447.1.1.1.1,demod:90,36,31,11,24,46,37,112,88,71,109,cut:7,cut:126,cut:7] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos 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 5
% seconds given: 10
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 335
% derived clauses: 425979
% kept clauses: 431
% kept size sum: 7293
% kept mid-nuclei: 2
% kept new demods: 95
% forw unit-subs: 182616
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 2
% fast unit cutoff: 4
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 7.56
% process. runtime: 7.54
% 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/GRP095-1+eq_r.in")
%
%------------------------------------------------------------------------------