TSTP Solution File: RNG005-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : RNG005-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 : art02.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/RNG/RNG005-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(21,40,0,42,0,0)
%
%
% START OF PROOF
% 23 [] sum(additive_identity,X,X).
% 24 [] sum(X,additive_identity,X).
% 25 [] product(X,Y,multiply(X,Y)).
% 27 [] sum(additive_inverse(X),X,additive_identity).
% 28 [] sum(X,additive_inverse(X),additive_identity).
% 29 [] -sum(U,Y,V) | -sum(W,X,U) | -sum(X,Y,Z) | sum(W,Z,V).
% 36 [] -product(X,Y,Z) | -product(U,Y,V) | -product(W,Y,X1) | -sum(U,W,X) | sum(V,X1,Z).
% 38 [] -sum(X,Y,Z) | -sum(X,Y,U) | equal(U,Z).
% 40 [] product(a,b,d).
% 41 [] product(additive_inverse(a),b,c).
% 42 [] -sum(c,d,additive_identity).
% 208 [hyper:29,27,23,23] sum(additive_inverse(additive_identity),X,X).
% 240 [hyper:38,27,24] equal(additive_inverse(additive_identity),additive_identity).
% 446 [hyper:36,25,41,27,40] sum(c,d,multiply(additive_identity,b)).
% 475 [hyper:36,25,41,208,41,demod:240] sum(multiply(additive_identity,b),c,c).
% 2243 [hyper:29,475,28,28] sum(multiply(additive_identity,b),additive_identity,additive_identity).
% 4748 [hyper:29,2243,446,24,cut:42] 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: 47
% derived clauses: 15672
% kept clauses: 145
% kept size sum: 1116
% kept mid-nuclei: 4553
% kept new demods: 7
% forw unit-subs: 7803
% forw double-subs: 56
% forw overdouble-subs: 0
% backward subs: 4
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.18
% process. runtime: 0.17
% specific non-discr-tree subsumption statistics:
% tried: 2056
% length fails: 0
% strength fails: 673
% predlist fails: 1177
% aux str. fails: 205
% by-lit fails: 0
% full subs tried: 1
% full subs fail: 1
%
% ; 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/RNG/RNG005-1+eq_r.in")
%
%------------------------------------------------------------------------------