TSTP Solution File: FLD068-3 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : FLD068-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 59.5s
% Output : Assurance 59.5s
% 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/FLD068-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 3 9)
% (binary-unit 10 #f 3 9)
% (binary-double 16 #f 3 9)
% (binary 54 #t 3 9)
% (binary-order 27 #f 3 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,1,60,0,1,562824,4,2040,562848,50,2067,562848,40,2067,562878,0,2067,588838,3,2568,592713,4,2819,658385,5,3068,658386,5,3068,658387,1,3068,658387,50,3070,658387,40,3070,658417,0,3070,702723,3,3871,712708,4,4279,760137,5,4671,760139,5,4671,760139,1,4671,760139,50,4674,760139,40,4674,760169,0,4674)
%
%
% START OF PROOF
% 760140 [] -sum(X,Y,Z) | -sum(U,Y,V) | -sum(W,X,U) | sum(W,Z,V).
% 760141 [] -sum(X,Y,Z) | -sum(U,Z,V) | -sum(U,X,W) | sum(W,Y,V).
% 760142 [] sum(additive_identity,X,X) | -defined(X).
% 760143 [] sum(additive_inverse(X),X,additive_identity) | -defined(X).
% 760144 [] -sum(X,Y,Z) | sum(Y,X,Z).
% 760154 [] defined(additive_inverse(X)) | -defined(X).
% 760158 [] sum(X,Y,add(X,Y)) | -defined(X) | -defined(Y).
% 760163 [] -sum(X,Y,Z) | -sum(U,Y,V) | -less_or_equal(X,U) | less_or_equal(Z,V).
% 760166 [] defined(a).
% 760167 [] defined(b).
% 760168 [] less_or_equal(additive_identity,add(b,additive_inverse(a))).
% 760169 [] -less_or_equal(a,b).
% 760170 [binary:760142.2,760166] sum(additive_identity,a,a).
% 760171 [binary:760143.2,760166] sum(additive_inverse(a),a,additive_identity).
% 760176 [binary:760154.2,760166] defined(additive_inverse(a)).
% 760185 [binary:760142.2,760167] sum(additive_identity,b,b).
% 760195 [binary:760158.2,760167] sum(b,X,add(b,X)) | -defined(X).
% 760196 [binary:760158.3,760167] sum(X,b,add(X,b)) | -defined(X).
% 760232 [binary:760163.4,760169] -sum(Z,Y,b) | -sum(X,Y,a) | -less_or_equal(X,Z).
% 760252 [binary:760141,760170] -sum(X,additive_identity,Z) | -sum(X,a,Y) | sum(Z,a,Y).
% 760279 [binary:760144,760171] sum(a,additive_inverse(a),additive_identity).
% 760391 [binary:760140,760279] -sum(X,additive_inverse(a),Y) | -sum(Z,a,X) | sum(Z,additive_identity,Y).
% 760393 [binary:760140.3,760279] -sum(additive_inverse(a),X,Y) | -sum(additive_identity,X,Z) | sum(a,Y,Z).
% 761907 [binary:760176,760196.2] sum(additive_inverse(a),b,add(additive_inverse(a),b)).
% 764209 [binary:760142,760232.2,cut:760166] -sum(X,a,b) | -less_or_equal(additive_identity,X).
% 778262 [binary:760168,764209.2] -sum(add(b,additive_inverse(a)),a,b).
% 800023 [binary:760252.3,778262] -sum(X,additive_identity,add(b,additive_inverse(a))) | -sum(X,a,b).
% 829424 [binary:760195,760391,cut:760176,binarycut:800023] -sum(X,a,b).
% 829773 [binary:760144.2,829424] -sum(a,X,b).
% 830534 [binary:760185,760393.2,cut:829773,slowcut:761907] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% clause length limited to 9
% clause depth limited to 3
% seconds given: 54
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 6326
% derived clauses: 1662315
% kept clauses: 222333
% kept size sum: 0
% kept mid-nuclei: 172246
% kept new demods: 0
% forw unit-subs: 45466
% forw double-subs: 204299
% forw overdouble-subs: 49958
% backward subs: 30
% fast unit cutoff: 10543
% full unit cutoff: 471
% dbl unit cutoff: 351
% real runtime : 64.97
% process. runtime: 64.43
% specific non-discr-tree subsumption statistics:
% tried: 14177612
% length fails: 265507
% strength fails: 3870727
% predlist fails: 5831197
% aux str. fails: 823942
% by-lit fails: 196378
% full subs tried: 2954451
% full subs fail: 2908005
%
% ; 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/FLD068-3+noeq.in")
%
%------------------------------------------------------------------------------