TSTP Solution File: RNG004-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : RNG004-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/RNG004-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,63312,50,257,63333,0,257)
%
%
% START OF PROOF
% 63314 [] sum(additive_identity,X,X).
% 63315 [] sum(X,additive_identity,X).
% 63316 [] product(X,Y,multiply(X,Y)).
% 63317 [] sum(X,Y,add(X,Y)).
% 63318 [] sum(additive_inverse(X),X,additive_identity).
% 63319 [] sum(X,additive_inverse(X),additive_identity).
% 63320 [] -sum(U,Y,V) | -sum(W,X,U) | -sum(X,Y,Z) | sum(W,Z,V).
% 63322 [] -sum(X,Y,Z) | sum(Y,X,Z).
% 63325 [] -product(X,U,V) | -product(X,W,X1) | -product(X,Y,Z) | -sum(W,Y,U) | sum(X1,Z,V).
% 63327 [] -product(U,Y,V) | -product(W,Y,X1) | -product(X,Y,Z) | -sum(W,X,U) | sum(X1,Z,V).
% 63329 [] -sum(X,Y,U) | -sum(X,Y,Z) | equal(Z,U).
% 63331 [] product(a,b,c).
% 63332 [] product(additive_inverse(a),additive_inverse(b),d).
% 63333 [] -equal(c,d).
% 63711 [hyper:63325,63316,63332,63316,63318] sum(d,multiply(additive_inverse(a),b),multiply(additive_inverse(a),additive_identity)).
% 63740 [hyper:63325,63316,63332,63332,63314] sum(multiply(additive_inverse(a),additive_identity),d,d).
% 63856 [hyper:63327,63316,63331,63331,63314] sum(multiply(additive_identity,b),c,c).
% 64032 [hyper:63322,63317] sum(X,Y,add(Y,X)).
% 64165 [hyper:63329,63317,63315] equal(X,add(X,additive_identity)).
% 64166 [hyper:63329,63317,63318] equal(additive_identity,add(additive_inverse(X),X)).
% 64183 [hyper:63320,64032,64032,63319,demod:64165] sum(X,add(Y,additive_inverse(X)),Y).
% 66314 [hyper:63320,63856,64032,63319,demod:64166] sum(multiply(additive_identity,b),additive_identity,additive_identity).
% 68190 [hyper:63329,66314,63315] equal(multiply(additive_identity,b),additive_identity).
% 68320 [hyper:63327,63316,63316,63331,63318,demod:68190] sum(multiply(additive_inverse(a),b),c,additive_identity).
% 107239 [hyper:63320,63740,64183,64183] sum(multiply(additive_inverse(a),additive_identity),X,X).
% 107907 [hyper:63329,107239,63315] equal(multiply(additive_inverse(a),additive_identity),additive_identity).
% 209283 [hyper:63320,68320,63711,63314,demod:107907] sum(d,additive_identity,c).
% 211314 [hyper:63329,209283,63315,cut:63333] 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 3
% seconds given: 58
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 285
% derived clauses: 1230312
% kept clauses: 1446
% kept size sum: 14292
% kept mid-nuclei: 209639
% kept new demods: 40
% forw unit-subs: 820714
% forw double-subs: 1570
% forw overdouble-subs: 0
% backward subs: 34
% fast unit cutoff: 10
% full unit cutoff: 143
% dbl unit cutoff: 0
% real runtime : 9.88
% process. runtime: 9.85
% specific non-discr-tree subsumption statistics:
% tried: 67267
% length fails: 0
% strength fails: 20255
% predlist fails: 43349
% aux str. fails: 2469
% by-lit fails: 0
% full subs tried: 1194
% full subs fail: 1194
%
% ; 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/RNG004-1+eq_r.in")
%
%------------------------------------------------------------------------------