TSTP Solution File: ANA002-4 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : ANA002-4 : TPTP v3.4.2. Released v1.1.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art10.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 79.6s
% Output : Assurance 79.6s
% 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/ANA002-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 3 11)
% (binary-unit 10 #f 3 11)
% (binary-double 16 #f 3 11)
% (binary 54 #t 3 11)
% (binary-order 27 #f 3 11)
% (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)
%
%
% SOS clause
% -less_than_or_equal(f(l),n0) | -less_than_or_equal(n0,f(l)).
% was split for some strategies as:
% -less_than_or_equal(f(l),n0).
% -less_than_or_equal(n0,f(l)).
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(17,40,1,34,0,1,21355,5,1302,21355,1,1302,21355,50,1302,21355,40,1302,21372,0,1302,21451,50,1302,21468,0,1302,21547,50,1302,21564,0,1303,21643,50,1303,21660,0,1303,21739,50,1304,21756,0,1304,21835,50,1304,21852,0,1304,21931,50,1305,21948,0,1305,22027,50,1305,22044,0,1305,22123,50,1306,22140,0,1306,22219,50,1306,22236,0,1306,22315,50,1306,22332,0,1307,22411,50,1307,22428,0,1307,22507,50,1307,22524,0,1308,22603,50,1308,22620,0,1308,22699,50,1308,22716,0,1308,22795,50,1309,22812,0,1309,22891,50,1310,22908,0,1310,22987,50,1310,23004,0,1311,23083,50,1311,23100,0,1311,23179,50,1311,23179,40,1311,23196,0,1311,47656,3,1662,52760,4,1837,58348,5,2018,58348,1,2018,58348,50,2019,58348,40,2019,58365,0,2019,88454,3,3375,89612,4,4045,90765,5,4720,90766,1,4720,90766,50,4721,90766,40,4721,90783,0,4721,106385,3,5373,107746,4,5697,109059,5,6022,109060,1,6022,109060,50,6022,109060,40,6022,109077,0,6022)
%
%
% START OF PROOF
% 91024 [?] ?
% 109062 [] less_than_or_equal(X,Y) | less_than_or_equal(Y,X).
% 109063 [] -less_than_or_equal(Z,X) | -less_than_or_equal(X,Y) | less_than_or_equal(Z,Y).
% 109064 [] -less_than_or_equal(X,q(Y,X)) | less_than_or_equal(X,Y).
% 109065 [] -less_than_or_equal(q(X,Y),X) | less_than_or_equal(Y,X).
% 109066 [] less_than_or_equal(f(X),n0) | -less_than_or_equal(X,h(X)) | -less_than_or_equal(lower_bound,X) | -less_than_or_equal(X,upper_bound).
% 109067 [] -less_than_or_equal(f(X),n0) | less_than_or_equal(f(Y),n0) | less_than_or_equal(X,h(Y)) | -less_than_or_equal(lower_bound,Y) | -less_than_or_equal(Y,upper_bound) | -less_than_or_equal(X,Y).
% 109068 [] less_than_or_equal(n0,f(X)) | -less_than_or_equal(k(X),X) | -less_than_or_equal(lower_bound,X) | -less_than_or_equal(X,upper_bound).
% 109069 [] -less_than_or_equal(n0,f(X)) | less_than_or_equal(n0,f(Y)) | less_than_or_equal(k(Y),X) | -less_than_or_equal(lower_bound,Y) | -less_than_or_equal(Y,upper_bound) | -less_than_or_equal(Y,X).
% 109070 [] -less_than_or_equal(f(X),n0) | -less_than_or_equal(X,upper_bound) | less_than_or_equal(X,l).
% 109071 [] less_than_or_equal(g(X),upper_bound) | less_than_or_equal(l,X).
% 109072 [] less_than_or_equal(f(g(X)),n0) | less_than_or_equal(l,X).
% 109073 [] -less_than_or_equal(g(X),X) | less_than_or_equal(l,X).
% 109074 [] less_than_or_equal(lower_bound,upper_bound).
% 109075 [] less_than_or_equal(f(lower_bound),n0).
% 109076 [] less_than_or_equal(n0,f(upper_bound)).
% 109077 [] -less_than_or_equal(f(l),n0) | -less_than_or_equal(n0,f(l)).
% 109084 [binary:109073,109071] less_than_or_equal(l,upper_bound).
% 109193 [binary:109066.2,109072.2,cut:91024,cut:109084] less_than_or_equal(f(g(h(l))),n0) | less_than_or_equal(f(l),n0).
% 109245 [binary:109076,109069] less_than_or_equal(n0,f(X)) | less_than_or_equal(k(X),upper_bound) | -less_than_or_equal(lower_bound,X) | -less_than_or_equal(X,upper_bound).
% 109259 [binary:109075,109070,cut:109074] less_than_or_equal(lower_bound,l).
% 109260 [binary:109062,109070] less_than_or_equal(n0,f(X)) | -less_than_or_equal(X,upper_bound) | less_than_or_equal(X,l).
% 109265 [binary:109072,109070,binarycut:109071] less_than_or_equal(g(X),l) | less_than_or_equal(l,X).
% 109295 [binary:109066.2,109265.2,cut:109259,cut:109084] less_than_or_equal(g(h(l)),l) | less_than_or_equal(f(l),n0).
% 111802 [binary:109062,109260.2] less_than_or_equal(n0,f(X)) | less_than_or_equal(X,l) | less_than_or_equal(upper_bound,X).
% 112328 [binary:109067,109193,factor:cut:109084,cut:109259,binarycut:109295,binarydemod:109073] less_than_or_equal(l,h(l)) | less_than_or_equal(f(l),n0).
% 113073 [binary:109066.2,112328,cut:109259,cut:109084] less_than_or_equal(f(l),n0).
% 113087 [binary:109077,113073] -less_than_or_equal(n0,f(l)).
% 123117 [binary:109259,109245.3,cut:113087,cut:109084] less_than_or_equal(k(l),upper_bound).
% 123330 [binary:109063,123117] less_than_or_equal(k(l),X) | -less_than_or_equal(upper_bound,X).
% 123389 [binary:111802.3,123330.2] less_than_or_equal(n0,f(X)) | less_than_or_equal(k(l),X) | less_than_or_equal(X,l).
% 180936 [binary:109069,123389,factor:cut:113087,cut:109084,cut:109259,binarycut:109062] less_than_or_equal(k(l),X) | less_than_or_equal(X,l).
% 181061 [binary:109065,180936.2] less_than_or_equal(k(l),q(l,X)) | less_than_or_equal(X,l).
% 181191 [binary:109064,181061] less_than_or_equal(k(l),l).
% 181265 [binary:109068.2,181191,cut:113087,cut:109259,cut:109084] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using first neg lit preferred 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: 62
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 8491
% derived clauses: 700684
% kept clauses: 137042
% kept size sum: 0
% kept mid-nuclei: 12985
% kept new demods: 0
% forw unit-subs: 174313
% forw double-subs: 166261
% forw overdouble-subs: 157317
% backward subs: 520
% fast unit cutoff: 27238
% full unit cutoff: 0
% dbl unit cutoff: 2650
% real runtime : 82.9
% process. runtime: 81.56
% specific non-discr-tree subsumption statistics:
% tried: 13144433
% length fails: 282855
% strength fails: 2138964
% predlist fails: 778262
% aux str. fails: 1487850
% by-lit fails: 303617
% full subs tried: 7448713
% full subs fail: 7319705
%
% ; 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/ANA002-4+noeq.in")
%
%------------------------------------------------------------------------------