TSTP Solution File: BOO008-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : BOO008-1 : TPTP v3.4.2. Released v1.0.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 70.0s
% Output : Assurance 70.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/BOO008-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: heq
% detected subclass: medium
% detected subclass: long
%
% strategies selected:
% (hyper 58 #f 2 9)
% (binary-posweight-order 29 #f 2 9)
% (binary-unit 29 #f 2 9)
% (binary-double 29 #f 2 9)
% (binary 29 #t 2 9)
% (hyper 29 #t)
% (hyper 105 #f)
% (binary-unit-uniteq 17 #f)
% (binary-weightorder 23 #f)
% (binary-posweight-order 70 #f)
% (binary-posweight-lex-big-order 29 #f)
% (binary-posweight-lex-small-order 11 #f)
% (binary-order 29 #f)
% (binary-unit 46 #f)
% (binary 67 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(28,40,2,56,0,2,846008,4,4358,1016777,5,5803,1016782,1,5803,1016782,50,5803,1016782,40,5803,1016810,0,5803,1043207,3,7255)
%
%
% START OF PROOF
% 490651 [?] ?
% 857716 [?] ?
% 1016784 [] sum(X,Y,add(X,Y)).
% 1016785 [] product(X,Y,multiply(X,Y)).
% 1016786 [] -sum(X,Y,Z) | sum(Y,X,Z).
% 1016788 [] sum(additive_identity,X,X).
% 1016790 [] product(multiplicative_identity,X,X).
% 1016791 [] product(X,multiplicative_identity,X).
% 1016792 [] -product(X,U,V) | -product(X,W,X1) | -product(X,Y,Z) | -sum(W,Y,U) | sum(X1,Z,V).
% 1016793 [] -product(X,Y,Z) | -product(X,U,V) | -sum(Z,V,X1) | -sum(Y,U,W) | product(X,W,X1).
% 1016794 [] -product(U,Y,V) | -product(W,Y,X1) | -product(X,Y,Z) | -sum(W,X,U) | sum(X1,Z,V).
% 1016796 [] -product(X,Y,Z) | -sum(U,Z,X1) | -sum(U,X,W) | -sum(U,Y,V) | product(W,V,X1).
% 1016800 [] sum(inverse(X),X,multiplicative_identity).
% 1016803 [] product(X,inverse(X),additive_identity).
% 1016804 [] -sum(X,Y,U) | -sum(X,Y,Z) | equal(Z,U).
% 1016806 [] sum(y,z,y_plus_z).
% 1016807 [] sum(x,y_plus_z,x__plus_y_plus_z).
% 1016808 [] sum(x,y,x_plus_y).
% 1016809 [] sum(x_plus_y,z,x_plus_y__plus_z).
% 1016812 [input:1016792,factor:factor] -product(X,Y,Z) | -product(X,U,V) | -sum(U,Y,Y) | sum(V,Z,Z).
% 1016817 [input:1016794,factor:factor] -product(X,Y,Z) | -product(U,Y,V) | -sum(U,X,X) | sum(V,Z,Z).
% 1016822 [binary:1016806,1016786] sum(z,y,y_plus_z).
% 1016824 [binary:1016808,1016786] sum(y,x,x_plus_y).
% 1016825 [binary:1016809,1016786] sum(z,x_plus_y,x_plus_y__plus_z).
% 1016826 [binary:1016784,1016786] sum(X,Y,add(Y,X)).
% 1016831 [binary:1016788,1016804] -sum(additive_identity,X,Y) | equal(Y,X).
% 1016833 [binary:1016806,1016804] -sum(y,z,X) | equal(X,y_plus_z).
% 1016840 [binary:1016822,1016804] -sum(z,y,X) | equal(X,y_plus_z).
% 1016853 [binary:1016791,1016792] -sum(X,Y,multiplicative_identity) | -product(Z,X,V) | -product(Z,Y,U) | sum(V,U,Z).
% 1016860 [binary:1016826,1016833] equal(add(z,y),y_plus_z).
% 1016866 [binary:1016785,1016793] -sum(multiply(X,Y),Z,U) | -product(X,V,Z) | -sum(Y,V,W) | product(X,W,U).
% 1016877 [binary:1016785,1016794] sum(X,Y,multiply(Z,U)) | -product(W,U,X) | -product(V,U,Y) | -sum(W,V,Z).
% 1016897 [binary:1016785,1016796] -sum(X,multiply(Y,Z),U) | -sum(X,Z,W) | -sum(X,Y,V) | product(V,W,U).
% 1016947 [binary:1016791,1016812,cut:490651] -product(X,Y,Z) | sum(Z,X,X).
% 1016953 [binary:1016790,1016947] sum(X,multiplicative_identity,multiplicative_identity).
% 1016954 [binary:1016785,1016947] sum(multiply(X,Y),X,X).
% 1016996 [binary:1016790,1016817,cut:1016953] -product(X,Y,Z) | sum(Z,Y,Y).
% 1017075 [binary:1016800,1016853] -product(X,inverse(Y),Z) | -product(X,Y,U) | sum(Z,U,X).
% 1017118 [binary:1016803,1017075] sum(additive_identity,X,Y) | -product(Y,Y,X).
% 1017120 [binary:1016785,1017118.2] sum(additive_identity,multiply(X,X),X).
% 1017125 [binary:1016831,1017120] equal(X,multiply(X,X)).
% 1017126 [para:1017125.1.2,1016785.1.3] product(X,X,X).
% 1017189 [binary:1016954,1016866] -product(X,Y,X) | -sum(Z,Y,U) | product(X,U,X).
% 1017348 [binary:1017126,1017189] -sum(X,Y,Z) | product(Y,Z,Y).
% 1017353 [binary:1016808,1017348] product(y,x_plus_y,y).
% 1017354 [binary:1016809,1017348] product(z,x_plus_y__plus_z,z).
% 1017358 [binary:1016824,1017348] product(x,x_plus_y,x).
% 1017435 [binary:1017189,1017353] product(y,X,y) | -sum(Y,x_plus_y,X).
% 1017456 [binary:1016877.2,1017354] sum(z,X,multiply(Y,x_plus_y__plus_z)) | -product(Z,x_plus_y__plus_z,X) | -sum(z,Z,Y).
% 1017531 [binary:1017189,1017358] product(x,X,x) | -sum(Y,x_plus_y,X).
% 1018362 [binary:1016825,1017435.2] product(y,x_plus_y__plus_z,y).
% 1018935 [binary:1016825,1017531.2] product(x,x_plus_y__plus_z,x).
% 1018952 [binary:1016996,1018935] sum(x,x_plus_y__plus_z,x_plus_y__plus_z).
% 1031481 [binary:1018362,1017456.2] sum(z,y,multiply(X,x_plus_y__plus_z)) | -sum(z,y,X).
% 1040747 [binary:1016784,1031481.2,demod:1016860] sum(z,y,multiply(y_plus_z,x_plus_y__plus_z)).
% 1040751 [binary:1016840,1040747] equal(multiply(y_plus_z,x_plus_y__plus_z),y_plus_z).
% 1040769 [para:1040751.1.1,1016897.1.2,factor] -sum(X,x_plus_y__plus_z,Z) | -sum(X,y_plus_z,Y) | product(Y,Z,Y).
% 1045973 [binary:1018952,1040769] -sum(x,y_plus_z,X) | product(X,x_plus_y__plus_z,X).
% 1045992 [binary:1016807,1045973,cut:857716] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using first neg lit preferred strategy
% not using sos strategy
% using unit paramodulation strategy
% using unit 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 9
% clause depth limited to 2
% seconds given: 29
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 3739
% derived clauses: 5849394
% kept clauses: 30613
% kept size sum: 505949
% kept mid-nuclei: 1009297
% kept new demods: 130
% forw unit-subs: 4347400
% forw double-subs: 31161
% forw overdouble-subs: 18463
% backward subs: 121
% fast unit cutoff: 8285
% full unit cutoff: 3269
% dbl unit cutoff: 0
% real runtime : 78.92
% process. runtime: 78.21
% specific non-discr-tree subsumption statistics:
% tried: 4005492
% length fails: 70338
% strength fails: 1084758
% predlist fails: 238989
% aux str. fails: 391786
% by-lit fails: 19360
% full subs tried: 2189675
% full subs fail: 2170544
%
% ; 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/BOO008-1+eq_r.in")
%
%------------------------------------------------------------------------------