TSTP Solution File: GRP522-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP522-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 : 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/GRP522-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 5 1)
% (binary-posweight-lex-big-order 30 #f 5 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(X,divide(Y,divide(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).
% 13 [para:7.1.1,9.1.2,demod:9] equal(inverse(divide(X,divide(Y,inverse(X)))),Y).
% 18 [para:9.1.2,13.1.1.1.2] equal(inverse(divide(X,inverse(inverse(X)))),divide(Y,Y)).
% 25 [para:18.1.1,18.1.1] equal(divide(X,X),divide(Y,Y)).
% 33 [para:25.1.1,7.1.1.2.2] equal(divide(X,divide(Y,divide(Z,Z))),divide(X,Y)).
% 34 [para:25.1.1,7.1.1.2.2.2,demod:33] equal(divide(X,divide(X,Y)),Y).
% 38 [para:34.1.1,7.1.1] equal(divide(X,divide(Y,Y)),X).
% 40 [para:7.1.1,34.1.1.2] equal(divide(X,Y),divide(Z,divide(Y,divide(X,Z)))).
% 49 [para:8.1.2,7.1.1,demod:38] equal(multiply(X,divide(Y,X)),Y).
% 60 [para:34.1.1,8.1.2.2,demod:9] equal(multiply(X,inverse(Y)),divide(X,Y)).
% 64 [para:7.1.1,49.1.1.2,demod:40] equal(multiply(divide(X,Y),Y),X).
% 67 [para:8.1.2,64.1.1.1,demod:60,9] equal(divide(multiply(X,Y),Y),X).
% 69 [para:67.1.1,7.1.1.2.2] equal(divide(X,divide(Y,Z)),multiply(Z,divide(X,Y))).
% 71 [para:67.1.1,13.1.1.1.2,demod:60] equal(inverse(divide(X,Y)),divide(Y,X)).
% 72 [para:67.1.1,34.1.1.2] equal(divide(multiply(X,Y),X),Y).
% 73 [para:67.1.1,49.1.1.2] equal(multiply(X,Y),multiply(Y,X)).
% 77 [para:72.1.1,13.1.1.1.2,demod:71] equal(divide(X,Y),multiply(inverse(Y),X)).
% 78 [para:73.1.1,10.1.1,demod:34,69,77,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 5
% seconds given: 60
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 21
% derived clauses: 380
% kept clauses: 67
% kept size sum: 628
% kept mid-nuclei: 0
% kept new demods: 42
% forw unit-subs: 281
% 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.0
% 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/GRP522-1+eq_r.in")
%
%------------------------------------------------------------------------------