TSTP Solution File: GRP544-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP544-1 : TPTP v3.4.2. Bugfixed v2.7.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/GRP544-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 6 1)
% (binary-posweight-lex-big-order 30 #f 6 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(6,40,0,12,0,0)
%
%
% START OF PROOF
% 8 [] equal(divide(divide(identity,divide(divide(divide(X,Y),Z),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(a,b),multiply(b,a)).
% 13 [para:10.1.2,11.1.2] equal(identity,inverse(identity)).
% 14 [para:11.1.2,8.1.1.1.2.1,demod:10] equal(divide(inverse(inverse(X)),divide(X,Y)),Y).
% 15 [para:11.1.2,8.1.1.1.2.1.1,demod:10] equal(divide(inverse(divide(inverse(X),Y)),X),Y).
% 20 [para:10.1.2,14.1.1.2,demod:10,13] equal(inverse(inverse(X)),X).
% 23 [para:20.1.1,14.1.1.1] equal(divide(X,divide(X,Y)),Y).
% 24 [para:11.1.2,23.1.1.2] equal(divide(X,identity),X).
% 26 [para:24.1.1,8.1.1,demod:10,24] equal(inverse(divide(divide(X,Y),X)),Y).
% 31 [para:10.1.2,9.1.2.2] equal(multiply(X,Y),divide(X,inverse(Y))).
% 37 [para:14.1.1,26.1.1.1.1,demod:20] equal(inverse(divide(X,Y)),divide(Y,X)).
% 42 [para:15.1.1,14.1.1.2,demod:20,31,37] equal(divide(multiply(X,Y),X),Y).
% 44 [para:20.1.1,15.1.1.1.1.1,demod:31,37] equal(multiply(divide(X,Y),Y),X).
% 52 [para:42.1.1,44.1.1.1,slowcut:12] 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 6
% seconds given: 60
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 20
% derived clauses: 194
% kept clauses: 38
% kept size sum: 335
% kept mid-nuclei: 0
% kept new demods: 40
% forw unit-subs: 151
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 0
% 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/GRP544-1+eq_r.in")
%
%------------------------------------------------------------------------------