TSTP Solution File: BOO013-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : BOO013-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 : art07.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 40.0s
% Output : Assurance 40.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/BOO013-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,0,56,0,0,792066,4,4443)
%
%
% START OF PROOF
% 30 [] sum(X,Y,add(X,Y)).
% 32 [] -sum(X,Y,Z) | sum(Y,X,Z).
% 34 [] sum(additive_identity,X,X).
% 42 [] -product(X,Y,Z) | -sum(U,Z,X1) | -sum(U,X,W) | -sum(U,Y,V) | product(W,V,X1).
% 44 [] -product(X,Y,Z) | -sum(Z,U,X1) | -sum(X,U,W) | -sum(Y,U,V) | product(W,V,X1).
% 50 [] -sum(X,Y,U) | -sum(X,Y,Z) | equal(Z,U).
% 51 [] -product(X,Y,U) | -product(X,Y,Z) | equal(Z,U).
% 52 [] sum(x,y,multiplicative_identity).
% 53 [] sum(x,z,multiplicative_identity).
% 54 [] product(x,y,additive_identity).
% 55 [] product(x,z,additive_identity).
% 56 [] -equal(y,z).
% 972 [hyper:32,30] sum(X,Y,add(Y,X)).
% 1518 [hyper:44,30,54,34,53] product(multiplicative_identity,add(y,z),z).
% 1575 [hyper:50,30,34] equal(X,add(additive_identity,X)).
% 1577 [hyper:50,30,52] equal(multiplicative_identity,add(x,y)).
% 15346 [hyper:42,972,55,30,972,demod:1575] product(add(x,X),add(X,z),X).
% 792067 [binary:51.3,56] -product(X,Y,y) | -product(X,Y,z).
% 792079 [binary:15346,792067,demod:1577,cut:1518] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos 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: 135
% derived clauses: 6067572
% kept clauses: 881
% kept size sum: 6361
% kept mid-nuclei: 788695
% kept new demods: 22
% forw unit-subs: 4888347
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 5
% fast unit cutoff: 320
% full unit cutoff: 2434
% dbl unit cutoff: 0
% real runtime : 44.47
% process. runtime: 44.44
% specific non-discr-tree subsumption statistics:
% tried: 128728
% length fails: 0
% strength fails: 79514
% predlist fails: 47954
% aux str. fails: 851
% by-lit fails: 0
% full subs tried: 409
% full subs fail: 409
%
% ; 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/BOO013-1+eq_r.in")
%
%------------------------------------------------------------------------------