TSTP Solution File: BOO023-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : BOO023-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 : art03.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 10.0s
% Output : Assurance 10.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/BOO023-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,1,18,0,1)
%
%
% START OF PROOF
% 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(add(a,multiply(b,c)),multiply(add(a,b),add(a,c))).
% 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)).
% 26 [para:11.1.1,20.1.1.1,demod:22] equal(multiply(add(X,Y),add(multiply(Z,Y),Y)),add(multiply(Z,Y),Y)).
% 28 [para:20.1.1,12.1.2.1] equal(multiply(multiply(X,Y),add(multiply(Y,add(Z,X)),U)),add(multiply(X,Y),multiply(U,multiply(X,Y)))).
% 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))).
% 40 [para:33.1.2,20.1.1.1.2] equal(multiply(multiply(X,Y),multiply(multiply(Y,n1),X)),multiply(multiply(Y,n1),X)).
% 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)))).
% 44 [para:37.1.1,12.1.2.2] equal(multiply(multiply(X,n1),add(Y,X)),add(multiply(Y,multiply(X,n1)),multiply(X,n1))).
% 46 [para:13.1.1,21.1.1.2] equal(multiply(X,n1),add(X,multiply(inverse(add(Y,X)),X))).
% 47 [para:21.1.1,12.1.2.1] equal(multiply(add(add(X,Y),Z),add(Y,U)),add(add(Y,multiply(Z,Y)),multiply(U,add(add(X,Y),Z)))).
% 48 [para:21.1.1,12.1.2.2] equal(multiply(add(add(X,Y),Z),add(U,Y)),add(multiply(U,add(add(X,Y),Z)),add(Y,multiply(Z,Y)))).
% 50 [para:21.1.1,14.1.2.2] equal(pixley(add(X,Y),Z,Y),add(multiply(add(X,Y),inverse(Z)),add(Y,multiply(inverse(Z),Y)))).
% 51 [para:42.1.1,21.1.1.2] equal(multiply(X,add(Y,n1)),add(X,multiply(n1,X))).
% 54 [para:51.1.1,12.1.2.1] equal(multiply(add(X,n1),add(Y,Z)),add(add(Y,multiply(n1,Y)),multiply(Z,add(X,n1)))).
% 55 [para:51.1.1,12.1.2.2] equal(multiply(add(X,n1),add(Y,Z)),add(multiply(Y,add(X,n1)),add(Z,multiply(n1,Z)))).
% 60 [para:51.1.2,51.1.2] equal(multiply(X,add(Y,n1)),multiply(X,add(Z,n1))).
% 63 [para:60.1.1,12.1.2.1] equal(multiply(add(X,n1),add(Y,Z)),add(multiply(Y,add(U,n1)),multiply(Z,add(X,n1)))).
% 64 [para:60.1.1,12.1.2.2,demod:63] equal(multiply(add(X,n1),add(Y,Z)),multiply(add(U,n1),add(Y,Z))).
% 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))).
% 90 [para:24.1.2,14.1.2.2.2] equal(pixley(multiply(X,inverse(Y)),Y,Z),add(multiply(multiply(X,inverse(Y)),inverse(Y)),multiply(Z,multiply(inverse(Y),add(X,n1))))).
% 101 [para:85.1.2,21.1.1,demod:19] equal(multiply(n1,add(inverse(X),inverse(X))),add(inverse(X),inverse(X))).
% 111 [para:11.1.1,26.1.1.2.1,demod:11] equal(multiply(add(X,Y),add(Y,Y)),add(Y,Y)).
% 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)))).
% 336 [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))).
% 342 [para:336.1.1,39.1.2.2] equal(multiply(inverse(X),n1),add(inverse(n1),add(inverse(X),inverse(X)))).
% 379 [para:342.1.2,22.1.1.2,demod:24,37] equal(multiply(inverse(X),n1),multiply(inverse(X),add(inverse(n1),n1))).
% 390 [para:379.1.2,51.1.1,demod:19] equal(multiply(inverse(X),n1),add(inverse(X),inverse(X))).
% 402 [para:390.1.2,342.1.2.2,demod:39] equal(multiply(inverse(X),n1),inverse(X)).
% 404 [para:402.1.1,12.1.2.2] equal(multiply(n1,add(X,inverse(Y))),add(multiply(X,n1),inverse(Y))).
% 406 [para:402.1.1,33.1.2.2] equal(inverse(X),add(multiply(Y,inverse(Y)),inverse(X))).
% 407 [para:402.1.1,39.1.2.2] equal(inverse(X),add(inverse(n1),inverse(X))).
% 416 [para:407.1.2,13.1.1] equal(inverse(inverse(n1)),n1).
% 446 [para:416.1.1,19.1.1.2,demod:416] equal(multiply(n1,n1),n1).
% 453 [para:416.1.1,336.1.1.1.1,demod:416,446] equal(n1,add(n1,n1)).
% 455 [?] ?
% 458 [para:453.1.2,42.1.1] equal(n1,add(X,n1)).
% 459 [para:453.1.2,51.1.1.2] equal(multiply(X,n1),add(X,multiply(n1,X))).
% 485 [para:406.1.2,13.1.1] equal(inverse(multiply(X,inverse(X))),n1).
% 490 [para:485.1.1,33.1.2.1.2,demod:12] equal(X,multiply(n1,add(multiply(Y,inverse(Y)),X))).
% 500 [para:42.1.1,50.1.2.1.1,demod:402,19,17,458] equal(n1,add(inverse(X),add(n1,inverse(X)))).
% 514 [para:19.1.1,490.1.2.2.1] equal(X,multiply(n1,add(inverse(n1),X))).
% 516 [para:490.1.2,14.1.2.2,demod:402,455,24] equal(pixley(multiply(X,inverse(X)),Y,n1),inverse(Y)).
% 517 [para:14.1.2,490.1.2.2,demod:15,13] equal(multiply(X,n1),multiply(n1,X)).
% 534 [para:517.1.1,39.1.2.2] equal(X,add(inverse(n1),multiply(n1,X))).
% 536 [para:517.1.2,51.1.2.2,demod:458] equal(multiply(X,n1),add(X,multiply(X,n1))).
% 580 [para:514.1.2,517.1.2] equal(multiply(add(inverse(n1),X),n1),X).
% 595 [para:580.1.1,40.1.1.1,demod:514,446] equal(multiply(X,X),X).
% 596 [para:595.1.1,12.1.2.1] equal(multiply(X,add(X,Y)),add(X,multiply(Y,X))).
% 597 [para:595.1.1,12.1.2.2] equal(multiply(X,add(Y,X)),add(multiply(Y,X),X)).
% 635 [?] ?
% 640 [para:536.1.2,46.1.2.2.1.1,demod:43,635] equal(multiply(n1,multiply(X,n1)),multiply(multiply(X,n1),add(X,inverse(multiply(X,n1))))).
% 651 [para:580.1.1,536.1.2.2,demod:580] equal(X,add(add(inverse(n1),X),X)).
% 653 [para:651.1.2,21.1.1.2,demod:595] equal(X,add(X,X)).
% 670 [para:653.1.2,12.1.2,demod:653] equal(multiply(X,Y),multiply(Y,X)).
% 671 [para:653.1.2,21.1.1.2,demod:653,11] equal(multiply(X,add(Y,X)),X).
% 675 [para:653.1.2,47.1.2.2.2,demod:11,653] equal(multiply(add(X,Y),add(Y,Z)),add(Y,multiply(Z,add(X,Y)))).
% 678 [para:670.1.1,18.1.1.2] -equal(add(a,multiply(c,b)),multiply(add(a,b),add(a,c))).
% 680 [para:670.1.1,12.1.2.1] equal(multiply(X,add(Y,Z)),add(multiply(X,Y),multiply(Z,X))).
% 689 [para:670.1.1,22.1.1,demod:671,597] equal(multiply(add(X,add(Y,Z)),Z),Z).
% 693 [para:670.1.1,24.1.2.1,demod:402,458] equal(inverse(X),add(multiply(inverse(X),Y),inverse(X))).
% 717 [?] ?
% 731 [para:670.1.1,490.1.2.2.1] equal(X,multiply(n1,add(multiply(inverse(Y),Y),X))).
% 740 [para:671.1.1,48.1.2.1,demod:675,596] equal(multiply(add(add(X,Y),Z),add(Z,Y)),multiply(add(Y,Z),add(Z,Y))).
% 757 [para:534.1.2,689.1.1.1.2] equal(multiply(add(X,Y),multiply(n1,Y)),multiply(n1,Y)).
% 758 [para:670.1.1,678.1.2] -equal(add(a,multiply(c,b)),multiply(add(a,c),add(a,b))).
% 798 [para:516.1.1,16.1.1] equal(inverse(n1),multiply(X,inverse(X))).
% 811 [para:798.1.2,670.1.1] equal(inverse(n1),multiply(inverse(X),X)).
% 823 [para:811.1.2,43.1.2.2,demod:404,640] equal(multiply(n1,multiply(X,n1)),multiply(n1,add(X,inverse(n1)))).
% 824 [para:811.1.2,44.1.2.1,demod:39,717] equal(multiply(X,n1),X).
% 829 [para:811.1.2,54.1.2.2,demod:459,824,823,458] equal(multiply(n1,X),add(X,inverse(n1))).
% 830 [para:811.1.2,55.1.2.1,demod:824,459,514,458] equal(X,add(inverse(n1),X)).
% 832 [?] ?
% 835 [para:63.1.2,111.1.1.2,demod:757,653,824,458] equal(multiply(n1,X),X).
% 852 [para:830.1.2,111.1.1.2,demod:407,835,829] equal(multiply(X,inverse(n1)),inverse(n1)).
% 855 [para:852.1.1,14.1.2.1,demod:830,835,829] equal(pixley(X,n1,Y),multiply(Y,X)).
% 871 [para:12.1.2,731.1.2.2,demod:835] equal(multiply(X,Y),multiply(Y,add(inverse(Y),X))).
% 874 [para:13.1.1,871.1.2.2,demod:824] equal(multiply(inverse(inverse(X)),X),X).
% 885 [para:500.1.2,871.1.2.2,demod:824] equal(multiply(add(n1,inverse(X)),X),X).
% 888 [para:874.1.1,12.1.2.2,demod:671,597] equal(multiply(X,add(Y,inverse(inverse(X)))),X).
% 903 [para:885.1.1,670.1.1] equal(X,multiply(X,add(n1,inverse(X)))).
% 907 [para:903.1.2,14.1.2.2,demod:19,16] equal(n1,add(inverse(X),X)).
% 909 [para:907.1.2,20.1.1.1.2,demod:824] equal(multiply(X,multiply(Y,X)),multiply(Y,X)).
% 910 [para:907.1.2,14.1.2.2.2,demod:830,824,811] equal(pixley(inverse(inverse(X)),X,Y),Y).
% 919 [para:910.1.1,16.1.1] equal(X,inverse(inverse(X))).
% 928 [para:919.1.2,500.1.2.1,demod:919] equal(n1,add(X,add(n1,X))).
% 930 [para:919.1.2,693.1.2.1.1,demod:919] equal(X,add(multiply(X,Y),X)).
% 931 [para:919.1.2,871.1.2.2.1] equal(multiply(X,inverse(Y)),multiply(inverse(Y),add(Y,X))).
% 934 [para:11.1.1,930.1.2.1] equal(add(X,Y),add(Y,add(X,Y))).
% 935 [para:930.1.2,28.1.1.2,demod:653,12,909] equal(multiply(multiply(X,Y),Y),multiply(Y,X)).
% 958 [para:928.1.2,64.1.1.2,demod:832,934,446,458] equal(n1,add(n1,X)).
% 960 [para:958.1.2,21.1.1.2.1,demod:596,824,958] equal(X,multiply(X,add(X,Y))).
% 963 [para:960.1.2,12.1.2.1] equal(multiply(add(X,Y),add(X,Z)),add(X,multiply(Z,add(X,Y)))).
% 978 [para:960.1.2,670.1.1] equal(X,multiply(add(X,Y),X)).
% 1051 [para:888.1.1,48.1.2.1,demod:960,596,740,919] equal(multiply(add(X,Y),add(Y,X)),add(Y,X)).
% 1081 [para:935.1.1,14.1.2.1,demod:680,402,458,24] equal(pixley(multiply(X,inverse(Y)),Y,Z),multiply(inverse(Y),add(X,Z))).
% 1088 [para:935.1.1,43.1.2.2,demod:595,960,596,824] equal(X,add(X,multiply(X,Y))).
% 1109 [para:1088.1.2,871.1.2.2,demod:798] equal(multiply(multiply(inverse(X),Y),X),inverse(n1)).
% 1111 [para:978.1.2,1088.1.2.2] equal(add(X,Y),add(add(X,Y),X)).
% 1238 [para:1109.1.1,12.1.2.1,demod:830] equal(multiply(X,add(multiply(inverse(X),Y),Z)),multiply(Z,X)).
% 1506 [para:811.1.2,90.1.2.2,demod:835,829,935,1081,919,402,458] equal(multiply(inverse(X),add(Y,X)),multiply(inverse(X),Y)).
% 1708 [para:934.1.2,931.1.2.2,demod:1506] equal(multiply(add(X,Y),inverse(Y)),multiply(inverse(Y),X)).
% 1772 [para:1051.1.1,670.1.1,demod:1051] equal(add(X,Y),add(Y,X)).
% 1789 [para:1772.1.1,36.1.2,demod:824,958] equal(pixley(n1,X,Y),add(Y,inverse(X))).
% 1809 [para:1772.1.1,758.1.1] -equal(add(multiply(c,b),a),multiply(add(a,c),add(a,b))).
% 2621 [para:1708.1.1,50.1.2.1,demod:824,855,1789,811,16] equal(add(X,Y),add(multiply(inverse(Y),X),Y)).
% 2634 [para:670.1.1,2621.1.2.1] equal(add(X,Y),add(multiply(X,inverse(Y)),Y)).
% 11498 [para:1238.1.1,2621.1.2.1,demod:2634,919] equal(add(add(multiply(X,Y),Z),X),add(Z,X)).
% 11541 [para:11.1.1,11498.1.1.1.1] equal(add(add(X,Y),add(Z,X)),add(Y,add(Z,X))).
% 11560 [para:11498.1.1,1111.1.2.1,demod:11541,11498] equal(add(X,Y),add(Y,add(multiply(Y,Z),X))).
% 11772 [para:12.1.2,11560.1.2.2,demod:963,slowcut:1809] 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: 1020
% derived clauses: 443611
% kept clauses: 11752
% kept size sum: 193726
% kept mid-nuclei: 0
% kept new demods: 11286
% forw unit-subs: 417207
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 95
% fast unit cutoff: 0
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 10.27
% process. runtime: 10.26
% 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/BOO023-1+eq_r.in")
%
%------------------------------------------------------------------------------