TSTP Solution File: GRP070-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP070-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 : art07.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/GRP070-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),multiply(inverse(b1),b1)) | -equal(multiply(multiply(inverse(b2),b2),a2),a2) | -equal(multiply(multiply(a3,b3),c3),multiply(a3,multiply(b3,c3))).
% 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))).
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(4,40,0,8,0,0)
%
%
% START OF PROOF
% 5 [] equal(X,X).
% 6 [] equal(divide(divide(X,X),divide(Y,divide(divide(Z,divide(U,Y)),inverse(U)))),Z).
% 7 [] equal(multiply(X,Y),divide(X,inverse(Y))).
% 8 [] -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)).
% 11 [para:7.1.2,6.1.1.2.2.1.2,demod:7] equal(divide(divide(X,X),divide(inverse(Y),multiply(divide(Z,multiply(U,Y)),U))),Z).
% 12 [para:6.1.1,6.1.1.2.2.1,demod:7] equal(divide(divide(X,X),divide(multiply(divide(Y,divide(Z,U)),Z),multiply(Y,U))),divide(V,V)).
% 23 [para:12.1.1,12.1.1] equal(divide(X,X),divide(Y,Y)).
% 25 [para:23.1.1,7.1.2] equal(multiply(inverse(X),X),divide(Y,Y)).
% 27 [para:23.1.1,6.1.1.2.2.1,demod:7] equal(divide(divide(X,X),divide(Y,multiply(divide(Z,Z),U))),divide(U,Y)).
% 34 [para:25.1.2,7.1.2] equal(multiply(inverse(X),X),multiply(inverse(Y),Y)).
% 63 [para:27.1.1,23.1.1] equal(divide(X,multiply(divide(Y,Y),X)),divide(Z,Z)).
% 80 [para:63.1.1,11.1.1.2.2.1,demod:7,27] equal(multiply(divide(X,X),Y),Y).
% 81 [para:63.1.2,11.1.1.2.2.1,demod:80] equal(divide(divide(X,X),divide(inverse(Y),Z)),multiply(Z,Y)).
% 87 [para:63.1.2,27.1.1.1,demod:80] equal(divide(divide(X,X),divide(Y,Z)),divide(Z,Y)).
% 88 [para:7.1.2,80.1.1.1] equal(multiply(multiply(inverse(X),X),Y),Y).
% 90 [para:80.1.1,11.1.1.2.2.1.2,demod:81] equal(multiply(multiply(divide(X,Y),divide(Z,Z)),Y),X).
% 91 [para:80.1.1,12.1.1.2.1,demod:87] equal(divide(multiply(divide(X,Y),Y),X),divide(Z,Z)).
% 176 [para:91.1.1,90.1.1.1.1,demod:80] equal(X,multiply(divide(X,Y),Y)).
% 188 [para:176.1.2,90.1.1.1] equal(multiply(X,divide(Y,Y)),X).
% 204 [para:188.1.1,90.1.1,demod:188] equal(divide(X,divide(Y,Y)),X).
% 207 [para:204.1.1,6.1.1.2.2.1,demod:87,7] equal(divide(multiply(X,Y),Y),X).
% 213 [para:207.1.1,11.1.1.2.2.1,demod:81] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 384 [hyper:8,213,demod:88,cut:5,cut:34] 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: 84
% derived clauses: 10111
% kept clauses: 370
% kept size sum: 5873
% kept mid-nuclei: 4
% kept new demods: 134
% forw unit-subs: 9545
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 2
% fast unit cutoff: 3
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.16
% process. runtime: 0.14
% 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/GRP070-1+eq_r.in")
%
%------------------------------------------------------------------------------