TSTP Solution File: GRP539-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP539-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 : art09.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/GRP539-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(6,40,0,12,0,0)
%
%
% START OF PROOF
% 8 [] equal(divide(divide(X,Y),divide(divide(X,Z),Y)),Z).
% 9 [] equal(multiply(X,Y),divide(X,divide(divide(Z,Z),Y))).
% 10 [] equal(inverse(X),divide(divide(Y,Y),X)).
% 11 [] equal(identity,divide(X,X)).
% 12 [] -equal(multiply(multiply(a3,b3),c3),multiply(a3,multiply(b3,c3))).
% 14 [para:11.1.2,10.1.2.1] equal(inverse(X),divide(identity,X)).
% 15 [para:11.1.2,8.1.1.1,demod:14] equal(inverse(divide(divide(X,Y),X)),Y).
% 16 [para:11.1.2,8.1.1.2] equal(divide(divide(X,divide(X,Y)),identity),Y).
% 18 [para:10.1.2,8.1.1.1,demod:14,11] equal(divide(inverse(X),divide(inverse(Y),X)),Y).
% 20 [para:11.1.2,15.1.1.1.1,demod:14] equal(inverse(inverse(X)),X).
% 21 [para:10.1.2,15.1.1.1.1,demod:11] equal(inverse(divide(inverse(X),identity)),X).
% 23 [para:15.1.1,20.1.1.1] equal(inverse(X),divide(divide(Y,X),Y)).
% 24 [para:15.1.1,21.1.1.1.1,demod:23] equal(inverse(divide(X,identity)),inverse(X)).
% 26 [para:24.1.1,20.1.1.1,demod:20] equal(X,divide(X,identity)).
% 29 [para:11.1.2,9.1.2.2.1,demod:14] equal(multiply(X,Y),divide(X,inverse(Y))).
% 31 [para:9.1.2,8.1.1] equal(multiply(divide(X,Y),Y),X).
% 34 [para:8.1.1,9.1.2.2,demod:23] equal(multiply(X,inverse(Y)),divide(X,Y)).
% 36 [para:26.1.2,8.1.1.1,demod:26] equal(divide(X,divide(X,Y)),Y).
% 38 [para:9.1.2,31.1.1.1,demod:34,14,11] equal(divide(multiply(X,Y),Y),X).
% 40 [para:9.1.2,16.1.1.1.2,demod:14,11,26] equal(divide(X,multiply(X,Y)),inverse(Y)).
% 42 [para:36.1.1,8.1.1.2.1] equal(divide(divide(X,Y),divide(Z,Y)),divide(X,Z)).
% 43 [para:36.1.1,15.1.1.1.1] equal(inverse(divide(X,Y)),divide(Y,X)).
% 44 [para:36.1.1,31.1.1.1] equal(multiply(X,divide(Y,X)),Y).
% 48 [para:38.1.1,44.1.1.2] equal(multiply(X,Y),multiply(Y,X)).
% 50 [para:48.1.1,12.1.1] -equal(multiply(c3,multiply(a3,b3)),multiply(a3,multiply(b3,c3))).
% 56 [para:8.1.1,23.1.2.1,demod:43] equal(divide(X,divide(Y,Z)),divide(Z,divide(Y,X))).
% 61 [para:40.1.1,23.1.2.1] equal(inverse(multiply(X,Y)),divide(inverse(Y),X)).
% 62 [para:18.1.1,8.1.1.2.1,demod:42] equal(divide(inverse(X),Y),divide(inverse(Y),X)).
% 91 [para:61.1.1,29.1.2.2] equal(multiply(X,multiply(Y,Z)),divide(X,divide(inverse(Z),Y))).
% 108 [para:62.1.1,56.1.2.2,demod:91,slowcut:50] 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: 56
% derived clauses: 2012
% kept clauses: 94
% kept size sum: 1000
% kept mid-nuclei: 0
% kept new demods: 67
% forw unit-subs: 1860
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 1
% fast unit cutoff: 0
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.4
% process. runtime: 0.3
% 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/GRP539-1+eq_r.in")
%
%------------------------------------------------------------------------------