TSTP Solution File: ANA004-4 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : ANA004-4 : 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 : 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 358.1s
% Output : Assurance 358.1s
% 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/ANA/ANA004-4+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 6 5)
% (binary-unit 10 #f 6 5)
% (binary-double 16 #f 6 5)
% (binary 54 #t 6 5)
% (binary-order 27 #f 6 5)
% (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(13,40,0,26,0,0,2492,50,40,2505,0,40,25607,4,1991,50490,5,2641,50490,1,2641,50490,50,2642,50490,40,2642,50503,0,2642,110530,3,3143,121870,4,3393,121967,5,4837,121968,1,4837,121968,50,4844,121968,40,4844,121981,0,4844,213334,3,5645,219840,4,6046,219908,5,6927,219909,5,6928,219909,1,6928,219909,50,6935,219909,40,6935,219922,0,6935,466826,3,9636,546434,4,11010,546473,5,12463,546475,5,12464,546475,1,12464,546475,50,12470,546475,40,12470,546488,0,12470,605517,3,13827,606119,4,14496,606664,1,15171,606664,50,15172,606664,40,15172,606677,0,15172,772590,3,21423,776473,4,24548,782928,5,27673,782929,5,27674,782930,1,27674,782930,50,27677,782930,40,27677,782943,0,27677,820668,3,30378,825566,4,31728,838328,62,33078,838329,1,33079,838329,50,33083,838329,40,33083,838342,0,33083,1014869,3,34436,1065659,4,35109,1066679,62,35784,1066679,5,35785,1066680,1,35785,1066680,50,35792,1066680,40,35792,1066693,0,35792)
%
%
% START OF PROOF
% 1066681 [] -less_or_equal(add(absolute(X),absolute(Y)),Z) | less_or_equal(absolute(add(X,Y)),Z).
% 1066682 [] -less_or_equal(X,minimum(Y,Z)) | less_or_equal(X,Y).
% 1066683 [] -less_or_equal(X,minimum(Y,Z)) | less_or_equal(X,Z).
% 1066684 [] -less_or_equal(minimum(X,Y),n0) | less_or_equal(Y,n0) | less_or_equal(X,n0).
% 1066685 [] less_or_equal(add(X,Y),Z) | -less_or_equal(Y,half(Z)) | -less_or_equal(X,half(Z)).
% 1066686 [] -less_or_equal(half(X),n0) | less_or_equal(X,n0).
% 1066687 [] -less_or_equal(delta_1(X),n0) | less_or_equal(X,n0).
% 1066688 [] -less_or_equal(delta_2(X),n0) | less_or_equal(X,n0).
% 1066689 [] less_or_equal(absolute(add(f(X),negate(f(a_real_number)))),Y) | -less_or_equal(absolute(add(X,negate(a_real_number))),delta_1(Y)) | less_or_equal(Y,n0).
% 1066690 [] less_or_equal(absolute(add(g(X),negate(g(a_real_number)))),Y) | -less_or_equal(absolute(add(X,negate(a_real_number))),delta_2(Y)) | less_or_equal(Y,n0).
% 1066691 [] -less_or_equal(epsilon_0,n0).
% 1066692 [] less_or_equal(absolute(add(xs(X),negate(a_real_number))),X) | less_or_equal(X,n0).
% 1066693 [] -less_or_equal(absolute(add(add(f(xs(X)),negate(f(a_real_number))),add(g(xs(X)),negate(g(a_real_number))))),epsilon_0) | less_or_equal(X,n0).
% 1066713 [binary:1066682,1066692] less_or_equal(absolute(add(xs(minimum(X,Y)),negate(a_real_number))),X) | less_or_equal(minimum(X,Y),n0).
% 1066714 [binary:1066683,1066692] less_or_equal(absolute(add(xs(minimum(X,Y)),negate(a_real_number))),Y) | less_or_equal(minimum(X,Y),n0).
% 1066743 [binary:1066681,1066685] less_or_equal(absolute(add(X,Y)),Z) | -less_or_equal(absolute(X),half(Z)) | -less_or_equal(absolute(Y),half(Z)).
% 1066813 [binary:1066693,1066743] -less_or_equal(absolute(add(g(xs(X)),negate(g(a_real_number)))),half(epsilon_0)) | -less_or_equal(absolute(add(f(xs(X)),negate(f(a_real_number)))),half(epsilon_0)) | less_or_equal(X,n0).
% 1068096 [binary:1066690,1066813,binarydemod:1066686,cut:1066691] -less_or_equal(absolute(add(f(xs(X)),negate(f(a_real_number)))),half(epsilon_0)) | -less_or_equal(absolute(add(xs(X),negate(a_real_number))),delta_2(half(epsilon_0))) | less_or_equal(X,n0).
% 1068105 [binary:1066689,1068096,binarydemod:1066686,cut:1066691] -less_or_equal(absolute(add(xs(X),negate(a_real_number))),delta_2(half(epsilon_0))) | -less_or_equal(absolute(add(xs(X),negate(a_real_number))),delta_1(half(epsilon_0))) | less_or_equal(X,n0).
% 1068115 [binary:1066713,1068105] -less_or_equal(absolute(add(xs(minimum(delta_2(half(epsilon_0)),X)),negate(a_real_number))),delta_1(half(epsilon_0))) | less_or_equal(minimum(delta_2(half(epsilon_0)),X),n0).
% 1068134 [binary:1066714,1068115] less_or_equal(minimum(delta_2(half(epsilon_0)),delta_1(half(epsilon_0))),n0).
% 1068143 [binary:1066684,1068134,binarydemod:1066688,1066686,1066687,cut:1066691] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using weight-order strategy
% not using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 54
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 34065
% derived clauses: 3027889
% kept clauses: 488168
% kept size sum: 81580
% kept mid-nuclei: 15884
% kept new demods: 0
% forw unit-subs: 55221
% forw double-subs: 76321
% forw overdouble-subs: 51312
% backward subs: 1477
% fast unit cutoff: 20469
% full unit cutoff: 0
% dbl unit cutoff: 20232
% real runtime : 360.23
% process. runtime: 357.98
% specific non-discr-tree subsumption statistics:
% tried: 3103064
% length fails: 112525
% strength fails: 316802
% predlist fails: 142316
% aux str. fails: 104539
% by-lit fails: 99575
% full subs tried: 2248212
% full subs fail: 2193991
%
% ; 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/ANA/ANA004-4+noeq.in")
%
%------------------------------------------------------------------------------