TSTP Solution File: GRP069-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP069-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/GRP069-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),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,0,12,0,0)
%
%
% START OF PROOF
% 7 [] equal(X,X).
% 8 [] equal(divide(X,divide(divide(divide(divide(X,X),Y),Z),divide(divide(identity,X),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))).
% 18 [para:9.1.2,9.1.2.2,demod:10] equal(multiply(X,inverse(Y)),divide(X,multiply(identity,Y))).
% 23 [para:11.1.2,8.1.1.2.1,demod:17,11,10] equal(multiply(X,multiply(inverse(X),Y)),Y).
% 35 [para:14.1.2,23.1.1.2,demod:15] equal(divide(X,identity),X).
% 37 [para:15.1.1,23.1.1.2,demod:35] equal(multiply(X,inverse(X)),identity).
% 40 [para:35.1.1,8.1.1.2.1,demod:17,35,10,11] equal(divide(X,multiply(inverse(Y),X)),Y).
% 42 [para:37.1.1,23.1.1.2,demod:16,35,15] equal(X,multiply(identity,X)).
% 45 [para:23.1.1,18.1.2.2,demod:42,13] equal(multiply(X,inverse(Y)),divide(X,Y)).
% 46 [para:16.1.1,40.1.1.2.1,demod:42] equal(divide(X,multiply(Y,X)),inverse(Y)).
% 51 [para:23.1.1,40.1.1.2,demod:42,16] equal(divide(multiply(X,Y),Y),X).
% 52 [para:51.1.1,9.1.2,demod:45,10] equal(multiply(divide(X,Y),Y),X).
% 54 [para:45.1.1,23.1.1.2] equal(multiply(X,divide(inverse(X),Y)),inverse(Y)).
% 59 [para:52.1.1,46.1.1.2] equal(divide(X,Y),inverse(divide(Y,X))).
% 62 [para:9.1.2,59.1.2.1,demod:10] equal(divide(inverse(X),Y),inverse(multiply(Y,X))).
% 67 [para:8.1.1,54.1.1.2,demod:59,42,16,10,14,17] equal(multiply(X,Y),divide(divide(X,Z),divide(inverse(Y),Z))).
% 70 [para:62.1.2,17.1.2.2] equal(multiply(X,multiply(Y,Z)),divide(X,divide(inverse(Z),Y))).
% 113 [para:51.1.1,67.1.2.1,demod:70] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 133 [hyper:12,113,demod:42,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 6
% seconds given: 10
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 53
% derived clauses: 1407
% kept clauses: 119
% kept size sum: 1393
% kept mid-nuclei: 0
% kept new demods: 122
% forw unit-subs: 1266
% 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.2
% 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/GRP069-1+eq_r.in")
%
%------------------------------------------------------------------------------