TSTP Solution File: BOO025-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : BOO025-1 : TPTP v3.4.2. Released v2.2.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/BOO/BOO025-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(9,40,0,18,0,0)
%
%
% START OF PROOF
% 10 [] equal(X,X).
% 11 [] equal(multiply(add(X,Y),Y),Y).
% 12 [] equal(multiply(X,add(Y,Z)),add(multiply(Y,X),multiply(Z,X))).
% 13 [] equal(add(X,inverse(X)),n1).
% 14 [] equal(pixley(X,Y,Z),add(multiply(X,inverse(Y)),multiply(Z,add(X,inverse(Y))))).
% 15 [] equal(pixley(X,X,Y),Y).
% 16 [] equal(pixley(X,Y,Y),X).
% 17 [] equal(pixley(X,Y,X),X).
% 18 [] -equal(multiply(b,inverse(b)),multiply(a,inverse(a))).
% 19 [para:13.1.1,11.1.1.1] equal(multiply(n1,inverse(X)),inverse(X)).
% 20 [para:12.1.2,11.1.1.1] equal(multiply(multiply(X,add(Y,Z)),multiply(Z,X)),multiply(Z,X)).
% 21 [para:11.1.1,12.1.2.1] equal(multiply(X,add(add(Y,X),Z)),add(X,multiply(Z,X))).
% 22 [para:11.1.1,12.1.2.2] equal(multiply(X,add(Y,add(Z,X))),add(multiply(Y,X),X)).
% 24 [para:19.1.1,12.1.2.2] equal(multiply(inverse(X),add(Y,n1)),add(multiply(Y,inverse(X)),inverse(X))).
% 25 [para:13.1.1,20.1.1.1.2] equal(multiply(multiply(X,n1),multiply(inverse(Y),X)),multiply(inverse(Y),X)).
% 29 [para:20.1.1,12.1.2.2] equal(multiply(multiply(X,Y),add(Z,multiply(Y,add(U,X)))),add(multiply(Z,multiply(X,Y)),multiply(X,Y))).
% 33 [para:13.1.1,14.1.2.2.2,demod:15] equal(X,add(multiply(Y,inverse(Y)),multiply(X,n1))).
% 36 [para:19.1.1,14.1.2.1] equal(pixley(n1,X,Y),add(inverse(X),multiply(Y,add(n1,inverse(X))))).
% 37 [para:33.1.2,11.1.1.1] equal(multiply(X,multiply(X,n1)),multiply(X,n1)).
% 39 [para:19.1.1,33.1.2.1] equal(X,add(inverse(n1),multiply(X,n1))).
% 41 [para:11.1.1,39.1.2.2] equal(add(X,n1),add(inverse(n1),n1)).
% 42 [para:41.1.2,41.1.2] equal(add(X,n1),add(Y,n1)).
% 43 [para:37.1.1,12.1.2.1] equal(multiply(multiply(X,n1),add(X,Y)),add(multiply(X,n1),multiply(Y,multiply(X,n1)))).
% 51 [para:42.1.1,21.1.1.2] equal(multiply(X,add(Y,n1)),add(X,multiply(n1,X))).
% 82 [para:25.1.1,12.1.2.2] equal(multiply(multiply(inverse(X),Y),add(Z,multiply(Y,n1))),add(multiply(Z,multiply(inverse(X),Y)),multiply(inverse(X),Y))).
% 85 [para:51.1.1,25.1.1.2,demod:19,11] equal(multiply(n1,add(inverse(X),inverse(X))),multiply(inverse(X),add(Y,n1))).
% 101 [para:85.1.2,21.1.1,demod:19] equal(multiply(n1,add(inverse(X),inverse(X))),add(inverse(X),inverse(X))).
% 182 [para:36.1.2,29.1.1.2,demod:82] equal(multiply(multiply(inverse(X),Y),pixley(n1,X,Y)),multiply(multiply(inverse(X),Y),add(inverse(X),multiply(Y,n1)))).
% 337 [para:25.1.1,43.1.2.2,demod:101,12,17,182] equal(multiply(multiply(inverse(X),n1),n1),add(inverse(X),inverse(X))).
% 343 [para:337.1.1,39.1.2.2] equal(multiply(inverse(X),n1),add(inverse(n1),add(inverse(X),inverse(X)))).
% 380 [para:343.1.2,22.1.1.2,demod:24,37] equal(multiply(inverse(X),n1),multiply(inverse(X),add(inverse(n1),n1))).
% 391 [para:380.1.2,51.1.1,demod:19] equal(multiply(inverse(X),n1),add(inverse(X),inverse(X))).
% 403 [para:391.1.2,343.1.2.2,demod:39] equal(multiply(inverse(X),n1),inverse(X)).
% 407 [para:403.1.1,33.1.2.2] equal(inverse(X),add(multiply(Y,inverse(Y)),inverse(X))).
% 456 [?] ?
% 486 [para:407.1.2,13.1.1] equal(inverse(multiply(X,inverse(X))),n1).
% 491 [para:486.1.1,33.1.2.1.2,demod:12] equal(X,multiply(n1,add(multiply(Y,inverse(Y)),X))).
% 517 [para:491.1.2,14.1.2.2,demod:403,456,24] equal(pixley(multiply(X,inverse(X)),Y,n1),inverse(Y)).
% 799 [para:517.1.1,16.1.1] equal(inverse(n1),multiply(X,inverse(X))).
% 801 [para:799.1.2,18.1.1,demod:799,cut:10] 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: 144
% derived clauses: 7087
% kept clauses: 782
% kept size sum: 13700
% kept mid-nuclei: 0
% kept new demods: 698
% forw unit-subs: 5550
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 17
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.12
% process. runtime: 0.12
% 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/BOO/BOO025-1+eq_r.in")
%
%------------------------------------------------------------------------------