TSTP Solution File: BOO009-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : BOO009-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 : art06.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 20.0s
% Output : Assurance 20.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/BOO009-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(24,40,0,48,0,0)
%
%
% START OF PROOF
% 26 [] sum(X,Y,add(X,Y)).
% 27 [] product(X,Y,multiply(X,Y)).
% 28 [] -sum(X,Y,Z) | sum(Y,X,Z).
% 29 [] -product(X,Y,Z) | product(Y,X,Z).
% 30 [] sum(additive_identity,X,X).
% 31 [] sum(X,additive_identity,X).
% 32 [] product(multiplicative_identity,X,X).
% 33 [] product(X,multiplicative_identity,X).
% 34 [] -product(X,U,V) | -product(X,W,X1) | -product(X,Y,Z) | -sum(W,Y,U) | sum(X1,Z,V).
% 35 [] -product(X,Y,Z) | -product(X,U,V) | -sum(Z,V,X1) | -sum(Y,U,W) | product(X,W,X1).
% 36 [] -product(U,Y,V) | -product(W,Y,X1) | -product(X,Y,Z) | -sum(W,X,U) | sum(X1,Z,V).
% 37 [] -product(X,Y,Z) | -product(U,Y,V) | -sum(Z,V,X1) | -sum(X,U,W) | product(W,Y,X1).
% 38 [] -product(X,Y,Z) | -sum(U,Z,X1) | -sum(U,X,W) | -sum(U,Y,V) | product(W,V,X1).
% 43 [] sum(X,inverse(X),multiplicative_identity).
% 45 [] product(X,inverse(X),additive_identity).
% 46 [] -sum(X,Y,U) | -sum(X,Y,Z) | equal(Z,U).
% 47 [] -product(X,Y,U) | -product(X,Y,Z) | equal(Z,U).
% 48 [] -product(x,add(x,y),x).
% 830 [hyper:28,26] sum(X,Y,add(Y,X)).
% 954 [hyper:37,26,33,33,30] product(add(additive_identity,X),multiplicative_identity,X).
% 1020 [hyper:38,26,32,43,43] product(add(X,multiplicative_identity),multiplicative_identity,multiplicative_identity).
% 1022 [hyper:38,26,32,31,31] product(add(X,multiplicative_identity),X,X).
% 1195 [hyper:46,26,30] equal(X,add(additive_identity,X)).
% 1369 [hyper:38,45,43,26,31] product(add(X,X),multiplicative_identity,X).
% 2304 [hyper:29,27] product(X,Y,multiply(Y,X)).
% 3506 [hyper:47,27,32] equal(X,multiply(multiplicative_identity,X)).
% 7363 [hyper:36,1022,830,2304,32] sum(X,multiply(X,X),X).
% 7364 [hyper:36,1022,830,2304,33,demod:3506] sum(multiplicative_identity,multiplicative_identity,multiplicative_identity).
% 7578 [hyper:34,7364,2304,2304,33,demod:3506,demod:3506] sum(X,X,X).
% 10647 [hyper:46,7578,26] equal(add(X,X),X).
% 10783 [hyper:38,7363,2304,7578,26,demod:10647] product(X,X,X).
% 461211 [hyper:36,1020,32,slowcut:830,slowcut:1369] sum(multiplicative_identity,X,multiplicative_identity).
% 467149 [hyper:34,461211,954,954,27,demod:1195,demod:1195] sum(X,multiply(X,Y),X).
% 495426 [hyper:35,467149,26,10783,slowcut:27,slowcut:48] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 9
% clause depth limited to 2
% seconds given: 58
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 98
% derived clauses: 3985226
% kept clauses: 345
% kept size sum: 2554
% kept mid-nuclei: 494496
% kept new demods: 12
% forw unit-subs: 3213390
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 13
% fast unit cutoff: 30
% full unit cutoff: 523
% dbl unit cutoff: 0
% real runtime : 20.99
% process. runtime: 20.98
% specific non-discr-tree subsumption statistics:
% tried: 85825
% length fails: 0
% strength fails: 53795
% predlist fails: 31261
% aux str. fails: 598
% by-lit fails: 0
% full subs tried: 171
% full subs fail: 171
%
% ; 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/BOO009-1+eq_r.in")
%
%------------------------------------------------------------------------------