TSTP Solution File: ANA002-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : ANA002-1 : TPTP v3.4.2. Bugfixed v1.0.1.
% 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 487.1s
% Output : Assurance 487.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/ANA002-1+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(18,40,0,36,0,1,39174,4,2053,79028,5,2716,79028,1,2716,79028,50,2718,79028,40,2718,79046,0,2718,79630,50,2721,79648,0,2721,86986,3,3172,88159,4,3397,89174,1,3622,89174,50,3622,89174,40,3622,89192,0,3629,143160,3,4430,155083,4,4830,163913,5,5231,163914,5,5231,163914,1,5231,163914,50,5234,163914,40,5234,163932,0,5234,261603,3,7956,262723,4,9285,263755,5,10635,263756,1,10635,263756,50,10638,263756,40,10638,263774,0,10638,310501,3,11992,311305,4,12664,313101,5,13339,313102,5,13339,313102,1,13339,313102,50,13340,313102,40,13340,313120,0,13340,531612,3,19592,536032,4,22716,540482,5,25842,540483,1,25842,540483,50,25845,540483,40,25845,540501,0,25845,607509,3,28554,608624,4,29896,611928,5,31246,611929,1,31246,611929,50,31248,611929,40,31248,611947,0,31248,630363,3,32599,634473,4,33274,644464,5,33949,644465,5,33949,644465,1,33949,644465,50,33951,644465,40,33951,644483,0,33951,700344,3,36655,701938,4,38002,704036,5,39352,704037,1,39352,704037,50,39353,704037,40,39353,704055,0,39353,770544,3,42079,771644,4,43404,774957,5,44754,774958,1,44754,774958,50,44755,774958,40,44755,774976,0,44755,829375,4,47983,881527,5,49069,881527,1,49069,881527,50,49071,881527,40,49071,881545,0,49073)
%
%
% START OF PROOF
% 704044 [?] ?
% 704049 [?] ?
% 704115 [?] ?
% 704297 [?] ?
% 704627 [?] ?
% 704736 [?] ?
% 721180 [binary:704049,704297,cut:704736,cut:704115] less_than_or_equal(l,h(upper_bound)).
% 721193 [?] ?
% 726980 [binary:704044.2,721193.2,cut:704627] less_than_or_equal(f(l),n0).
% 774970 [?] ?
% 774972 [?] ?
% 775669 [hyper:774972,774970] less_than_or_equal(l,upper_bound).
% 881528 [] in_interval(X,Y,Z) | -less_than_or_equal(X,Y) | -less_than_or_equal(Y,Z).
% 881529 [] less_than_or_equal(X,X).
% 881530 [] less_than_or_equal(X,Y) | less_than_or_equal(Y,X).
% 881531 [] -less_than_or_equal(X,Y) | -less_than_or_equal(Y,Z) | less_than_or_equal(X,Z).
% 881532 [] -less_than_or_equal(X,q(Y,X)) | less_than_or_equal(X,Y).
% 881533 [] -less_than_or_equal(q(X,Y),X) | less_than_or_equal(Y,X).
% 881534 [] less_than_or_equal(f(X),n0) | -less_than_or_equal(X,h(X)) | -in_interval(lower_bound,X,upper_bound).
% 881536 [] less_than_or_equal(n0,f(X)) | -less_than_or_equal(k(X),X) | -in_interval(lower_bound,X,upper_bound).
% 881537 [] -less_than_or_equal(n0,f(X)) | less_than_or_equal(n0,f(Y)) | less_than_or_equal(k(Y),X) | -in_interval(lower_bound,Y,upper_bound) | -less_than_or_equal(Y,X).
% 881538 [] -less_than_or_equal(f(X),n0) | -less_than_or_equal(X,upper_bound) | less_than_or_equal(X,l).
% 881542 [] less_than_or_equal(lower_bound,upper_bound).
% 881543 [] less_than_or_equal(f(lower_bound),n0).
% 881544 [] less_than_or_equal(n0,f(upper_bound)).
% 881545 [] -in_interval(f(X),n0,f(X)).
% 881546 [binary:881528.2,881542] in_interval(lower_bound,upper_bound,X) | -less_than_or_equal(upper_bound,X).
% 881552 [binary:881538.2,881542,cut:881543] less_than_or_equal(lower_bound,l).
% 881553 [binary:881528.2,881552] in_interval(lower_bound,l,X) | -less_than_or_equal(l,X).
% 881567 [binary:881528.3,881544] in_interval(X,n0,f(upper_bound)) | -less_than_or_equal(X,n0).
% 881573 [binary:881528,881545] -less_than_or_equal(f(X),n0) | -less_than_or_equal(n0,f(X)).
% 881575 [binary:881529,881546.2] in_interval(lower_bound,upper_bound,upper_bound).
% 881756 [binary:775669,881553.2] in_interval(lower_bound,l,upper_bound).
% 882295 [binary:881545,881567] -less_than_or_equal(f(upper_bound),n0).
% 882312 [binary:881534,882295,cut:881575] -less_than_or_equal(upper_bound,h(upper_bound)).
% 882315 [binary:881531.3,882312] -less_than_or_equal(X,h(upper_bound)) | -less_than_or_equal(upper_bound,X).
% 882568 [binary:726980,881573] -less_than_or_equal(n0,f(l)).
% 882590 [binary:881536,882568,cut:881756] -less_than_or_equal(k(l),l).
% 882601 [binary:881532.2,882590] -less_than_or_equal(k(l),q(l,k(l))).
% 882602 [binary:881533.2,882590] -less_than_or_equal(q(l,k(l)),l).
% 882627 [binary:881530,882602] less_than_or_equal(l,q(l,k(l))).
% 882647 [binary:881537.5,882627,cut:881756,cut:882601,cut:882568] -less_than_or_equal(n0,f(q(l,k(l)))).
% 883230 [binary:721180,882315] -less_than_or_equal(upper_bound,l).
% 883244 [binary:881530,883230] less_than_or_equal(l,upper_bound).
% 883272 [binary:881537.5,883244,cut:881756,cut:882568,cut:881544] less_than_or_equal(k(l),upper_bound).
% 883287 [binary:881531,883272] less_than_or_equal(k(l),X) | -less_than_or_equal(upper_bound,X).
% 884639 [binary:881530,883287.2] less_than_or_equal(k(l),X) | less_than_or_equal(X,upper_bound).
% 885541 [binary:884639,882601] less_than_or_equal(q(l,k(l)),upper_bound).
% 885576 [binary:881538.2,885541,cut:882602] -less_than_or_equal(f(q(l,k(l))),n0).
% 885596 [binary:881530,882647,cut:885576] 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
% seconds given: 109
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 37838
% derived clauses: 2748755
% kept clauses: 569060
% kept size sum: 46780
% kept mid-nuclei: 40495
% kept new demods: 0
% forw unit-subs: 909041
% forw double-subs: 479655
% forw overdouble-subs: 479496
% backward subs: 1612
% fast unit cutoff: 117971
% full unit cutoff: 0
% dbl unit cutoff: 5479
% real runtime : 494.41
% process. runtime: 491.10
% specific non-discr-tree subsumption statistics:
% tried: 75690767
% length fails: 1728207
% strength fails: 14265948
% predlist fails: 15571172
% aux str. fails: 4792155
% by-lit fails: 2709072
% full subs tried: 34832637
% full subs fail: 34424079
%
% ; 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-1+noeq.in")
%
%------------------------------------------------------------------------------