TSTP Solution File: RNG008-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : RNG008-2 : 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 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/RNG/RNG008-2+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(23,40,0,46,0,0)
%
%
% START OF PROOF
% 25 [] sum(additive_identity,X,X).
% 26 [] sum(X,additive_identity,X).
% 27 [] product(X,Y,multiply(X,Y)).
% 28 [] sum(X,Y,add(X,Y)).
% 29 [] sum(additive_inverse(X),X,additive_identity).
% 30 [] sum(X,additive_inverse(X),additive_identity).
% 32 [] -sum(U,Z,V) | -sum(U,X,W) | -sum(X,Y,Z) | sum(W,Y,V).
% 33 [] -sum(X,Y,Z) | sum(Y,X,Z).
% 34 [] -product(U,Y,V) | -product(W,X,U) | -product(X,Y,Z) | product(W,Z,V).
% 35 [] -product(U,Z,V) | -product(U,X,W) | -product(X,Y,Z) | product(W,Y,V).
% 37 [] -product(X,Y,Z) | -product(X,U,V) | -sum(Z,V,X1) | -sum(Y,U,W) | product(X,W,X1).
% 38 [] -product(U,Y,V) | -product(W,Y,X1) | -product(X,Y,Z) | -sum(W,X,U) | sum(X1,Z,V).
% 39 [] -product(X,Y,Z) | -product(U,Y,V) | -sum(Z,V,X1) | -sum(X,U,W) | product(W,Y,X1).
% 40 [] -sum(X,Y,U) | -sum(X,Y,Z) | equal(Z,U).
% 41 [] -product(X,Y,U) | -product(X,Y,Z) | equal(Z,U).
% 42 [] -sum(X,U,Z) | -sum(X,Y,Z) | equal(Y,U).
% 44 [] product(X,X,X).
% 45 [] product(a,b,c).
% 46 [] -product(b,a,c).
% 182 [hyper:34,45,44,45] product(a,c,c).
% 193 [hyper:35,45,44,45] product(c,b,c).
% 610 [hyper:34,27,45,27] product(a,multiply(b,X),multiply(c,X)).
% 634 [hyper:34,27,44,44] product(X,multiply(X,X),X).
% 654 [hyper:35,27,44,182] product(c,c,multiply(a,c)).
% 673 [hyper:35,27,44,44] product(multiply(X,X),X,X).
% 1289 [hyper:41,27,44] equal(X,multiply(X,X)).
% 1291 [hyper:41,27,182] equal(c,multiply(a,c)).
% 1532 [hyper:32,28,30,28] sum(add(X,Y),additive_inverse(Y),add(X,additive_identity)).
% 1546 [hyper:32,28,28,25] sum(add(additive_identity,X),Y,add(X,Y)).
% 1559 [hyper:33,28] sum(X,Y,add(Y,X)).
% 1610 [hyper:37,28,44,182,28] product(a,add(c,a),add(c,a)).
% 1613 [hyper:37,28,44,44,28] product(X,add(X,X),add(X,X)).
% 1714 [hyper:39,28,44,193,28] product(add(c,b),b,add(c,b)).
% 1770 [hyper:40,28,25] equal(X,add(additive_identity,X)).
% 1771 [hyper:40,28,26] equal(X,add(X,additive_identity)).
% 94655 [hyper:34,610,27,44] product(b,multiply(c,a),multiply(b,a)).
% 107820 [hyper:38,1613,673,1613,demod:1289,cut:1559] sum(add(X,X),add(X,X),add(X,X)).
% 327743 [hyper:42,107820,26] equal(additive_identity,add(X,X)).
% 328425 [para:327743.1.2,28.1.3] sum(X,X,additive_identity).
% 328957 [hyper:32,328425,1546,1559,demod:1771,1770] sum(add(X,Y),X,Y).
% 342128 [hyper:42,328425,29] equal(X,additive_inverse(X)).
% 343741 [hyper:37,328425,1532,673,1714,demod:1771,342128,demod:1289] product(add(c,b),c,additive_identity).
% 350507 [hyper:39,328425,1532,634,1610,demod:1771,342128,demod:1289] product(c,add(c,a),additive_identity).
% 438269 [hyper:39,343741,328957,654,25,demod:1291] product(b,c,c).
% 439886 [hyper:35,438269,94655,27] product(c,a,multiply(b,a)).
% 453733 [hyper:37,350507,328957,654,25,demod:1291] product(c,a,c).
% 457650 [hyper:41,453733,27] equal(multiply(c,a),c).
% 563054 [hyper:41,439886,27,demod:457650] equal(c,multiply(b,a)).
% 565517 [para:563054.1.2,27.1.3,cut:46] 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: 243
% derived clauses: 2177927
% kept clauses: 394
% kept size sum: 2941
% kept mid-nuclei: 564011
% kept new demods: 14
% forw unit-subs: 1311644
% forw double-subs: 2276
% forw overdouble-subs: 0
% backward subs: 17
% fast unit cutoff: 170
% full unit cutoff: 1052
% dbl unit cutoff: 0
% real runtime : 20.98
% process. runtime: 20.97
% specific non-discr-tree subsumption statistics:
% tried: 118791
% length fails: 0
% strength fails: 52785
% predlist fails: 61518
% aux str. fails: 2549
% by-lit fails: 0
% full subs tried: 1939
% full subs fail: 1939
%
% ; 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/RNG008-2+eq_r.in")
%
%------------------------------------------------------------------------------