TSTP Solution File: FLD063-3 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : FLD063-3 : TPTP v3.4.2. Bugfixed v2.1.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art07.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/FLD/FLD063-3+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: nne
% detected subclass: medium
%
% strategies selected:
% (hyper 27 #f 2 9)
% (binary-unit 10 #f 2 9)
% (binary-double 16 #f 2 9)
% (binary 54 #t 2 9)
% (binary-order 27 #f 2 9)
% (binary-posweight-order 125 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 27 #f)
% (binary-weightorder 54 #f)
% (binary-order 54 #f)
% (hyper-order 43 #f)
% (binary 109 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(30,40,0,60,0,0,269768,4,2137)
%
%
% START OF PROOF
% 31 [] -sum(Y,U,V) | -sum(Z,U,W) | -sum(X,Y,Z) | sum(X,V,W).
% 33 [] sum(additive_identity,X,X) | -defined(X).
% 34 [] sum(additive_inverse(X),X,additive_identity) | -defined(X).
% 35 [] -sum(X,Y,Z) | sum(Y,X,Z).
% 44 [] defined(additive_identity).
% 45 [] defined(additive_inverse(X)) | -defined(X).
% 49 [] sum(X,Y,add(X,Y)) | -defined(X) | -defined(Y).
% 54 [] -sum(X,Y,Z) | -sum(U,Y,V) | -less_or_equal(X,U) | less_or_equal(Z,V).
% 57 [] defined(a).
% 58 [] defined(b).
% 59 [] less_or_equal(additive_inverse(b),additive_inverse(a)).
% 60 [] -less_or_equal(a,b).
% 61 [hyper:33,57] sum(additive_identity,a,a).
% 62 [hyper:34,57] sum(additive_inverse(a),a,additive_identity).
% 82 [hyper:33,58] sum(additive_identity,b,b).
% 83 [hyper:34,58] sum(additive_inverse(b),b,additive_identity).
% 102 [hyper:49,58,57] sum(a,b,add(a,b)).
% 113 [hyper:34,44] sum(additive_inverse(additive_identity),additive_identity,additive_identity).
% 122 [hyper:45,44] defined(additive_inverse(additive_identity)).
% 220 [hyper:33,122] sum(additive_identity,additive_inverse(additive_identity),additive_inverse(additive_identity)).
% 2060 [hyper:31,113,82,82] sum(additive_inverse(additive_identity),b,b).
% 2061 [hyper:31,113,61,61] sum(additive_inverse(additive_identity),a,a).
% 2241 [hyper:35,2060] sum(b,additive_inverse(additive_identity),b).
% 2274 [hyper:35,2061] sum(a,additive_inverse(additive_identity),a).
% 2743 [hyper:31,220,2274,62] sum(additive_inverse(a),a,additive_inverse(additive_identity)).
% 2744 [hyper:31,220,2241,83] sum(additive_inverse(b),b,additive_inverse(additive_identity)).
% 9385 [hyper:31,102,2743,2060] sum(additive_inverse(a),add(a,b),b).
% 9429 [hyper:35,102] sum(b,a,add(a,b)).
% 35435 [hyper:31,9429,2744,2061] sum(additive_inverse(b),add(a,b),a).
% 269769 [binary:54.4,60] -sum(Z,Y,b) | -sum(X,Y,a) | -less_or_equal(X,Z).
% 281995 [binary:35435,269769.2] -sum(X,add(a,b),b) | -less_or_equal(additive_inverse(b),X).
% 281996 [binary:9385,281995,cut:59] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos 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: 27
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 861
% derived clauses: 518458
% kept clauses: 27273
% kept size sum: 366932
% kept mid-nuclei: 254433
% kept new demods: 0
% forw unit-subs: 167129
% forw double-subs: 42552
% forw overdouble-subs: 11406
% backward subs: 67
% fast unit cutoff: 1306
% full unit cutoff: 0
% dbl unit cutoff: 52
% real runtime : 22.33
% process. runtime: 22.31
% specific non-discr-tree subsumption statistics:
% tried: 138663
% length fails: 5806
% strength fails: 3873
% predlist fails: 90178
% aux str. fails: 7378
% by-lit fails: 386
% full subs tried: 11964
% full subs fail: 10109
%
% ; 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/FLD/FLD063-3+noeq.in")
%
%------------------------------------------------------------------------------