%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : ANA002-3 : 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 : art08.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 307.8s
% Output : Assurance 307.8s
% 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-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 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)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(17,40,0,34,0,0,27615,5,2702,27615,1,2702,27615,50,2703,27615,40,2703,27632,0,2703,27981,50,2704,27998,0,2704,34478,50,3126,34495,0,3126,41632,3,3377,42903,4,3502,46146,5,3627,46146,5,3627,46147,1,3627,46147,50,3628,46147,40,3628,46164,0,3628,80692,3,4443,93142,4,4829,100913,5,5229,100913,1,5229,100913,50,5231,100913,40,5231,100930,0,5231,166388,3,7933,167899,4,9283,169358,1,10632,169358,50,10634,169358,40,10634,169375,0,10634,199716,3,11987,201095,4,12660,202633,5,13335,202634,5,13335,202634,1,13335,202634,50,13335,202634,40,13335,202651,0,13335,361226,3,19594,366182,4,22712,372033,5,25836,372034,1,25836,372034,50,25839,372034,40,25839,372051,0,25839,418054,3,28546,420144,4,29890,424721,5,31240,424722,5,31240,424722,1,31240,424722,50,31241,424722,40,31241,424739,0,31241)
%
%
% START OF PROOF
% 372062 [?] ?
% 382095 [?] ?
% 424724 [] less_than_or_equal(X,Y) | less_than_or_equal(Y,X).
% 424725 [] -less_than_or_equal(Z,X) | -less_than_or_equal(X,Y) | less_than_or_equal(Z,Y).
% 424726 [] -less_than_or_equal(X,q(Y,X)) | less_than_or_equal(X,Y).
% 424727 [] -less_than_or_equal(q(X,Y),X) | less_than_or_equal(Y,X).
% 424730 [] 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).
% 424731 [] -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).
% 424732 [] -less_than_or_equal(f(X),n0) | -less_than_or_equal(X,upper_bound) | less_than_or_equal(X,l).
% 424736 [] less_than_or_equal(lower_bound,upper_bound).
% 424737 [] less_than_or_equal(f(lower_bound),n0).
% 424738 [] less_than_or_equal(n0,f(upper_bound)).
% 424862 [binary:424736,424732.2,cut:424737] less_than_or_equal(lower_bound,l).
% 424870 [binary:424730.3,424862,cut:382095,cut:372062] -less_than_or_equal(k(l),l).
% 424871 [binary:424731.4,424862,cut:382095,cut:372062] -less_than_or_equal(n0,f(X)) | less_than_or_equal(k(l),X) | -less_than_or_equal(l,X).
% 424874 [binary:424726.2,424870] -less_than_or_equal(k(l),q(l,k(l))).
% 424876 [binary:424727.2,424870] -less_than_or_equal(q(l,k(l)),l).
% 424968 [binary:424724,424876] less_than_or_equal(l,q(l,k(l))).
% 426074 [binary:424738,424871,cut:372062] less_than_or_equal(k(l),upper_bound).
% 426076 [binary:424968,424871.3,cut:424874] -less_than_or_equal(n0,f(q(l,k(l)))).
% 426089 [binary:424725,426074] less_than_or_equal(k(l),X) | -less_than_or_equal(upper_bound,X).
% 426373 [binary:424874,426089] -less_than_or_equal(upper_bound,q(l,k(l))).
% 426378 [binary:424724,426373] less_than_or_equal(q(l,k(l)),upper_bound).
% 426394 [binary:424732.2,426378,cut:424876] -less_than_or_equal(f(q(l,k(l))),n0).
% 426468 [binary:424724,426076,cut:426394] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using unit paramodulation strategy
% using unit strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 27
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 23599
% derived clauses: 1878384
% kept clauses: 256075
% kept size sum: 651457
% kept mid-nuclei: 24139
% kept new demods: 0
% forw unit-subs: 628379
% forw double-subs: 392961
% forw overdouble-subs: 340300
% backward subs: 1562
% fast unit cutoff: 103188
% full unit cutoff: 0
% dbl unit cutoff: 7500
% real runtime : 315.4
% process. runtime: 312.49
% specific non-discr-tree subsumption statistics:
% tried: 41023153
% length fails: 824937
% strength fails: 7968841
% predlist fails: 2317631
% aux str. fails: 4922052
% by-lit fails: 1053852
% full subs tried: 22520907
% full subs fail: 22215727
%
% ; 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-3+noeq.in")
%
%------------------------------------------------------------------------------