TSTP Solution File: RNG039-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : RNG039-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 : art03.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/RNG039-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(61,40,0,122,0,0)
%
%
% START OF PROOF
% 63 [] sum(additive_identity,X,X).
% 64 [] sum(X,additive_identity,X).
% 65 [] product(X,Y,multiply(X,Y)).
% 66 [] sum(X,Y,add(X,Y)).
% 67 [] sum(additive_inverse(X),X,additive_identity).
% 68 [] sum(X,additive_inverse(X),additive_identity).
% 69 [] -sum(U,Y,V) | -sum(W,X,U) | -sum(X,Y,Z) | sum(W,Z,V).
% 70 [] -sum(U,Z,V) | -sum(U,X,W) | -sum(X,Y,Z) | sum(W,Y,V).
% 72 [] -product(U,Y,V) | -product(W,X,U) | -product(X,Y,Z) | product(W,Z,V).
% 75 [] -product(X,Y,Z) | -product(X,U,V) | -sum(Z,V,X1) | -sum(Y,U,W) | product(X,W,X1).
% 76 [] -product(U,Y,V) | -product(W,Y,X1) | -product(X,Y,Z) | -sum(W,X,U) | sum(X1,Z,V).
% 77 [] -product(X,Y,Z) | -product(U,Y,V) | -sum(Z,V,X1) | -sum(X,U,W) | product(W,Y,X1).
% 78 [] -sum(X,Y,U) | -sum(X,Y,Z) | equal(Z,U).
% 79 [] -product(X,Y,U) | -product(X,Y,Z) | equal(Z,U).
% 80 [] sum(X,add(X,Y),Y).
% 82 [] sum(X,X,additive_identity).
% 85 [] equal(multiply(X,X),X).
% 94 [] product(a,multiply(b,X),multiply(Y,X)).
% 119 [] product(X,X,X).
% 122 [] -equal(c,d).
% 386 [hyper:75,82,119,119,82] product(X,additive_identity,additive_identity).
% 416 [hyper:77,82,119,119,82] product(additive_identity,X,additive_identity).
% 1242 [hyper:72,65,386,65] product(X,multiply(Y,additive_identity),additive_identity).
% 1814 [hyper:76,65,82,65,119,demod:85] sum(X,X,multiply(additive_identity,X)).
% 1841 [hyper:76,65,63,65,119,demod:85] sum(multiply(additive_identity,X),X,X).
% 2232 [hyper:79,65,386] equal(additive_identity,multiply(X,additive_identity)).
% 2233 [hyper:79,65,416] equal(additive_identity,multiply(additive_identity,X)).
% 4297 [hyper:78,66,63] equal(X,add(additive_identity,X)).
% 4314 [hyper:69,67,66,82,demod:4297] sum(additive_inverse(X),additive_identity,X).
% 4996 [hyper:78,4314,64] equal(additive_inverse(X),X).
% 16604 [hyper:70,80,68,64,demod:4996] sum(X,add(Y,X),Y).
% 94884 [para:85.1.1,94.1.3] product(a,multiply(b,X),X).
% 95262 [hyper:75,94,1814,1841,demod:2233,cut:94884] product(a,additive_identity,X).
% 95364 [hyper:76,94,1242,demod:2232,slowcut:16604,slowcut:95262] sum(additive_identity,additive_identity,X).
% 95470 [hyper:77,94,1242,demod:2232,cut:95364,slowcut:16604] product(X,additive_identity,Y).
% 95766 [hyper:79,95470,cut:95470,slowcut:122] 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: 79
% derived clauses: 443387
% kept clauses: 291
% kept size sum: 1944
% kept mid-nuclei: 94706
% kept new demods: 14
% forw unit-subs: 316988
% forw double-subs: 142
% forw overdouble-subs: 0
% backward subs: 52
% fast unit cutoff: 41
% full unit cutoff: 634
% dbl unit cutoff: 0
% real runtime : 2.93
% process. runtime: 2.91
% specific non-discr-tree subsumption statistics:
% tried: 22185
% length fails: 0
% strength fails: 15347
% predlist fails: 6487
% aux str. fails: 303
% by-lit fails: 0
% full subs tried: 48
% full subs fail: 48
%
% ; 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/RNG039-1+eq_r.in")
%
%------------------------------------------------------------------------------