TSTP Solution File: GRP530-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP530-1 : TPTP v3.4.2. Released v2.6.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art05.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/GRP530-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: ueq
%
% strategies selected:
% (binary-posweight-kb-big-order 60 #f 4 1)
% (binary-posweight-lex-big-order 30 #f 4 1)
% (binary 30 #t)
% (binary-posweight-kb-big-order 180 #f)
% (binary-posweight-lex-big-order 120 #f)
% (binary-posweight-firstpref-order 60 #f)
% (binary-posweight-kb-small-order 60 #f)
% (binary-posweight-lex-small-order 60 #f)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(5,40,0,10,0,0)
%
%
% START OF PROOF
% 6 [] equal(X,X).
% 7 [] equal(divide(divide(X,divide(Y,Z)),divide(X,Y)),Z).
% 8 [] equal(multiply(X,Y),divide(X,divide(divide(Z,Z),Y))).
% 9 [] equal(inverse(X),divide(divide(Y,Y),X)).
% 10 [] -equal(multiply(multiply(inverse(b2),b2),a2),a2).
% 11 [para:9.1.2,9.1.2.1] equal(inverse(X),divide(inverse(divide(Y,Y)),X)).
% 12 [para:7.1.1,9.1.2] equal(inverse(divide(divide(X,Y),X)),Y).
% 13 [para:9.1.2,7.1.1.1,demod:9] equal(divide(inverse(divide(X,Y)),inverse(X)),Y).
% 14 [para:9.1.2,7.1.1.1.2] equal(divide(divide(X,inverse(Y)),divide(X,divide(Z,Z))),Y).
% 18 [para:9.1.2,8.1.2.2] equal(multiply(X,Y),divide(X,inverse(Y))).
% 20 [para:8.1.2,7.1.1,demod:9] equal(multiply(inverse(divide(X,Y)),X),Y).
% 25 [para:9.1.2,12.1.1.1] equal(inverse(inverse(X)),X).
% 30 [para:18.1.2,9.1.2,demod:25] equal(X,multiply(divide(Y,Y),X)).
% 31 [para:18.1.2,8.1.2.2,demod:30] equal(multiply(X,inverse(Y)),divide(X,Y)).
% 33 [para:9.1.2,20.1.1.1.1,demod:25] equal(multiply(X,divide(Y,Y)),X).
% 34 [para:11.1.2,20.1.1.1.1,demod:31,25] equal(divide(X,divide(Y,Y)),X).
% 37 [para:12.1.1,20.1.1.1] equal(multiply(X,divide(Y,X)),Y).
% 44 [para:34.1.1,7.1.1] equal(divide(X,divide(X,Y)),Y).
% 51 [para:13.1.1,37.1.1.2] equal(multiply(inverse(X),Y),inverse(divide(X,Y))).
% 55 [para:44.1.1,7.1.1.1.2] equal(divide(divide(X,Y),divide(X,Z)),divide(Z,Y)).
% 58 [para:44.1.1,12.1.1.1.1,demod:51] equal(multiply(inverse(X),Y),divide(Y,X)).
% 59 [para:14.1.1,7.1.1.1.2,demod:34,55,18] equal(divide(multiply(X,Y),Y),X).
% 62 [para:59.1.1,37.1.1.2] equal(multiply(X,Y),multiply(Y,X)).
% 63 [para:62.1.1,10.1.1,demod:33,58,cut:6] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using first neg lit preferred strategy
% not using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% clause length limited to 1
% clause depth limited to 4
% seconds given: 60
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 21
% derived clauses: 336
% kept clauses: 52
% kept size sum: 461
% kept mid-nuclei: 0
% kept new demods: 44
% forw unit-subs: 259
% 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.1
% process. runtime: 0.0
% 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/GRP530-1+eq_r.in")
%
%------------------------------------------------------------------------------