TSTP Solution File: RNG007-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : RNG007-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 : art05.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/RNG007-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(20,40,0,40,0,0)
%
%
% START OF PROOF
% 22 [] sum(additive_identity,X,X).
% 23 [] sum(X,additive_identity,X).
% 24 [] product(X,Y,multiply(X,Y)).
% 25 [] sum(X,Y,add(X,Y)).
% 26 [] sum(additive_inverse(X),X,additive_identity).
% 27 [] sum(X,additive_inverse(X),additive_identity).
% 28 [] -sum(U,Y,V) | -sum(W,X,U) | -sum(X,Y,Z) | sum(W,Z,V).
% 29 [] -sum(U,Z,V) | -sum(U,X,W) | -sum(X,Y,Z) | sum(W,Y,V).
% 30 [] -sum(X,Y,Z) | sum(Y,X,Z).
% 32 [] -product(U,Z,V) | -product(U,X,W) | -product(X,Y,Z) | product(W,Y,V).
% 34 [] -product(X,Y,Z) | -product(X,U,V) | -sum(Z,V,X1) | -sum(Y,U,W) | product(X,W,X1).
% 35 [] -product(U,Y,V) | -product(W,Y,X1) | -product(X,Y,Z) | -sum(W,X,U) | sum(X1,Z,V).
% 37 [] -sum(X,Y,U) | -sum(X,Y,Z) | equal(Z,U).
% 38 [] -product(X,Y,U) | -product(X,Y,Z) | equal(Z,U).
% 39 [] product(X,X,X).
% 40 [] -sum(a,a,additive_identity).
% 187 [hyper:32,24,39,39] product(multiply(X,X),X,X).
% 324 [hyper:38,24,39] equal(X,multiply(X,X)).
% 529 [hyper:28,25,25,26] sum(additive_inverse(X),add(X,Y),add(additive_identity,Y)).
% 566 [hyper:29,25,27,25] sum(add(X,Y),additive_inverse(Y),add(X,additive_identity)).
% 583 [hyper:29,25,27,23] sum(add(X,Y),additive_inverse(Y),X).
% 590 [hyper:30,25] sum(X,Y,add(Y,X)).
% 602 [hyper:34,25,39,39,25] product(X,add(X,X),add(X,X)).
% 647 [hyper:37,25,22] equal(X,add(additive_identity,X)).
% 648 [hyper:37,25,23] equal(X,add(X,additive_identity)).
% 21886 [hyper:35,602,187,602,demod:324,cut:590] sum(add(X,X),add(X,X),add(X,X)).
% 84270 [hyper:28,21886,566,583,demod:648] sum(add(X,X),X,X).
% 85427 [hyper:29,84270,529,26,demod:647,slowcut:40] 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: 94
% derived clauses: 579164
% kept clauses: 112
% kept size sum: 843
% kept mid-nuclei: 83988
% kept new demods: 6
% forw unit-subs: 407285
% forw double-subs: 478
% forw overdouble-subs: 0
% backward subs: 11
% fast unit cutoff: 28
% full unit cutoff: 1274
% dbl unit cutoff: 0
% real runtime : 4.84
% process. runtime: 4.82
% specific non-discr-tree subsumption statistics:
% tried: 25954
% length fails: 0
% strength fails: 13556
% predlist fails: 11334
% aux str. fails: 747
% by-lit fails: 0
% full subs tried: 317
% full subs fail: 317
%
% ; 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/RNG007-1+eq_r.in")
%
%------------------------------------------------------------------------------