TSTP Solution File: RNG004-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : RNG004-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 : art08.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-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,1,46,0,1,73856,50,246,73879,0,246)
%
%
% START OF PROOF
% 44294 [?] ?
% 73858 [] sum(additive_identity,X,X).
% 73859 [] sum(X,additive_identity,X).
% 73860 [] product(X,Y,multiply(X,Y)).
% 73861 [] sum(X,Y,add(X,Y)).
% 73862 [] sum(additive_inverse(X),X,additive_identity).
% 73863 [] sum(X,additive_inverse(X),additive_identity).
% 73864 [] -sum(U,Y,V) | -sum(W,X,U) | -sum(X,Y,Z) | sum(W,Z,V).
% 73865 [] -sum(U,Z,V) | -sum(U,X,W) | -sum(X,Y,Z) | sum(W,Y,V).
% 73866 [] -sum(X,Y,Z) | sum(Y,X,Z).
% 73869 [] -product(X,U,V) | -product(X,W,X1) | -product(X,Y,Z) | -sum(W,Y,U) | sum(X1,Z,V).
% 73870 [] -product(X,Y,Z) | -product(X,U,V) | -sum(Z,V,X1) | -sum(Y,U,W) | product(X,W,X1).
% 73871 [] -product(U,Y,V) | -product(W,Y,X1) | -product(X,Y,Z) | -sum(W,X,U) | sum(X1,Z,V).
% 73873 [] -sum(X,Y,U) | -sum(X,Y,Z) | equal(Z,U).
% 73874 [] -product(X,Y,U) | -product(X,Y,Z) | equal(Z,U).
% 73875 [] -sum(X,U,Z) | -sum(X,Y,Z) | equal(Y,U).
% 73876 [] -sum(U,Y,Z) | -sum(X,Y,Z) | equal(X,U).
% 73877 [] product(a,b,c).
% 73878 [] product(additive_inverse(a),additive_inverse(b),d).
% 73879 [] -equal(c,d).
% 74290 [hyper:73869,73860,73877,73877,73858] sum(multiply(a,additive_identity),c,c).
% 74399 [hyper:73871,73860,73877,73877,73858] sum(multiply(additive_identity,b),c,c).
% 74621 [hyper:73866,73861] sum(X,Y,add(Y,X)).
% 74753 [hyper:73873,73861,73858] equal(X,add(additive_identity,X)).
% 74754 [hyper:73873,73861,73859] equal(X,add(X,additive_identity)).
% 74846 [hyper:73864,74621,74621,73863,demod:74754] sum(X,add(Y,additive_inverse(X)),Y).
% 74894 [hyper:73865,74621,74621,73862,demod:74753] sum(add(additive_inverse(X),Y),X,Y).
% 76604 [hyper:73876,74290,73858] equal(additive_identity,multiply(a,additive_identity)).
% 76665 [para:76604.1.2,73860.1.3] product(a,additive_identity,additive_identity).
% 76734 [hyper:73869,76665,73860,73877,73862] sum(multiply(a,additive_inverse(b)),c,additive_identity).
% 84073 [hyper:73876,74399,73858] equal(additive_identity,multiply(additive_identity,b)).
% 84215 [para:84073.1.2,73860.1.3] product(additive_identity,b,additive_identity).
% 84388 [hyper:73870,84215,73859,cut:44294,slowcut:74846] product(additive_identity,X,additive_identity).
% 85005 [hyper:73870,84388,73860,73858,slowcut:74894] product(additive_identity,X,multiply(additive_identity,Y)).
% 86239 [hyper:73874,84388,73860] equal(multiply(additive_identity,X),additive_identity).
% 154874 [hyper:73876,76734,73862] equal(additive_inverse(c),multiply(a,additive_inverse(b))).
% 155347 [para:154874.1.2,73860.1.3] product(a,additive_inverse(b),additive_inverse(c)).
% 158971 [hyper:73871,155347,85005,73878,demod:86239,cut:73863] sum(additive_inverse(c),d,additive_identity).
% 161828 [hyper:73875,158971,73862,cut:73879] 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: 232
% derived clauses: 823885
% kept clauses: 744
% kept size sum: 6909
% kept mid-nuclei: 159935
% kept new demods: 34
% forw unit-subs: 558808
% forw double-subs: 953
% forw overdouble-subs: 0
% backward subs: 43
% fast unit cutoff: 39
% full unit cutoff: 1053
% dbl unit cutoff: 0
% real runtime : 6.59
% process. runtime: 6.57
% specific non-discr-tree subsumption statistics:
% tried: 51821
% length fails: 0
% strength fails: 20755
% predlist fails: 28577
% aux str. fails: 1490
% by-lit fails: 0
% full subs tried: 999
% full subs fail: 999
%
% ; 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-2+eq_r.in")
%
%------------------------------------------------------------------------------