TSTP Solution File: GRP067-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP067-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 : 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/GRP067-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 7 5)
% (binary-unit 12 #f)
% (binary-unit-uniteq 12 #f)
% (binary-posweight-kb-big-order 60 #f 7 5)
% (binary-posweight-lex-big-order 30 #f 7 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),identity) | -equal(multiply(identity,a2),a2) | -equal(multiply(multiply(a3,b3),c3),multiply(a3,multiply(b3,c3))).
% was split for some strategies as:
% -equal(multiply(inverse(a1),a1),identity).
% -equal(multiply(identity,a2),a2).
% -equal(multiply(multiply(a3,b3),c3),multiply(a3,multiply(b3,c3))).
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(6,40,1,12,0,1)
%
%
% START OF PROOF
% 7 [] equal(X,X).
% 8 [] equal(divide(divide(divide(X,X),divide(X,divide(Y,divide(divide(identity,X),Z)))),Z),Y).
% 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(a3,b3),c3),multiply(a3,multiply(b3,c3))) | -equal(multiply(inverse(a1),a1),identity) | -equal(multiply(identity,a2),a2).
% 13 [para:10.1.2,11.1.2] equal(identity,inverse(identity)).
% 14 [para:9.1.2,11.1.2,demod:10] equal(identity,multiply(inverse(X),X)).
% 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))).
% 25 [para:11.1.2,8.1.1.1.2.2.2,demod:17,10,11] equal(multiply(inverse(divide(X,divide(Y,identity))),X),Y).
% 26 [para:11.1.2,8.1.1.1.2.2.2.1,demod:16,17,13,10] equal(divide(multiply(identity,multiply(X,Y)),Y),X).
% 29 [para:9.1.2,8.1.1.1.1,demod:16,14,10] equal(divide(inverse(divide(inverse(X),divide(Y,divide(multiply(identity,X),Z)))),Z),Y).
% 32 [para:15.1.1,26.1.1.1.2] equal(divide(multiply(identity,divide(X,identity)),identity),X).
% 36 [para:26.1.1,32.1.1.1.2,demod:15] equal(divide(multiply(identity,X),identity),multiply(identity,divide(X,identity))).
% 38 [para:11.1.2,25.1.1.1.1,demod:36,13] equal(divide(multiply(identity,X),identity),X).
% 40 [para:10.1.2,25.1.1.1.1,demod:15,38,36,16] equal(divide(X,identity),X).
% 48 [para:40.1.1,26.1.1,demod:40,15] equal(multiply(identity,X),X).
% 52 [para:48.1.1,26.1.1.1] equal(divide(multiply(X,Y),Y),X).
% 57 [para:25.1.1,52.1.1.1,demod:40] equal(divide(X,Y),inverse(divide(Y,X))).
% 66 [para:9.1.2,57.1.2.1,demod:10] equal(divide(inverse(X),Y),inverse(multiply(Y,X))).
% 68 [para:57.1.2,17.1.2.2] equal(multiply(X,divide(Y,Z)),divide(X,divide(Z,Y))).
% 75 [para:66.1.2,17.1.2.2] equal(multiply(X,multiply(Y,Z)),divide(X,divide(inverse(Z),Y))).
% 88 [para:26.1.1,29.1.1.1.1.2,demod:68,48,17,57] equal(divide(multiply(X,Y),Z),divide(X,divide(Z,Y))).
% 106 [para:88.1.1,9.1.2,demod:75,10] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 109 [hyper:12,106,demod:48,14,cut:7,cut:7] 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 5
% clause depth limited to 7
% seconds given: 10
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 58
% derived clauses: 1738
% kept clauses: 93
% kept size sum: 1055
% kept mid-nuclei: 2
% kept new demods: 96
% forw unit-subs: 1638
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 3
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.5
% process. runtime: 0.3
% 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/GRP067-1+eq_r.in")
%
%------------------------------------------------------------------------------