TSTP Solution File: NUM172-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : NUM172-1 : 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 : art04.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 458.2s
% Output : Assurance 458.2s
% 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/NUM/NUM172-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: neq
% detected subclass: big
%
% strategies selected:
% (hyper 28 #f 6 9)
% (binary-unit 28 #f 6 9)
% (binary-double 11 #f 6 9)
% (binary-double 17 #f)
% (binary-double 17 #t)
% (binary 87 #t 6 9)
% (binary-order 28 #f 6 9)
% (binary-posweight-order 58 #f)
% (binary-posweight-lex-big-order 28 #f)
% (binary-posweight-lex-small-order 11 #f)
% (binary-order-sos 28 #t)
% (binary-unit-uniteq 28 #f)
% (binary-weightorder 28 #f)
% (binary-weightorder-sos 17 #f)
% (binary-order 28 #f)
% (hyper-order 17 #f)
% (binary 141 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(161,40,2,322,0,2,295999,4,2103,297065,5,2804,297066,1,2807,297066,50,2813,297066,40,2813,297227,0,2831,319513,3,4238,323041,4,4936,336649,5,5632,336650,5,5633,336651,1,5633,336651,50,5636,336651,40,5636,336812,0,5636,366823,3,6188,370260,4,6462,378413,5,6737,378414,5,6737,378415,1,6737,378415,50,6740,378415,40,6740,378576,0,6740,409356,3,7609,413015,4,8033,422102,5,8441,422103,5,8441,422104,1,8441,422104,50,8461,422104,40,8461,422265,0,8461,462493,3,9313,466823,4,9737,480911,5,10162,480912,5,10163,480912,1,10163,480912,50,10166,480912,40,10166,481073,0,10166,578272,3,14527,585600,4,16693,621871,5,18871,621872,5,18873,621873,1,18873,621873,50,18878,621873,40,18878,622034,0,18878,672474,3,20279,673565,4,20979,707130,1,21679,707130,50,21680,707130,40,21680,707291,0,21680,830365,3,24584,865133,4,26033,969077,62,27482,969077,1,27483,969077,50,27489,969077,40,27489,969238,0,27524,1032413,3,28926,1036748,4,29626,1051622,1,30325,1051622,50,30328,1051622,40,30328,1051783,0,30359,1081412,3,30910,1082422,4,31185,1084819,5,31460,1084820,1,31460,1084820,50,31461,1084820,40,31461,1084981,0,31462,1135593,3,32864,1136719,4,33563,1172737,5,34263,1172738,1,34263,1172738,50,34265,1172738,40,34265,1172899,0,34265,1196902,3,35666,1199610,4,36366,1216344,5,37066,1216345,5,37067,1216346,1,37067,1216346,50,37070,1216346,40,37070,1216507,0,37070,1262037,3,38472,1262976,4,39171,1268202,5,39871,1268203,1,39871,1268203,50,39873,1268203,40,39873,1268364,0,39873,1298915,3,40724,1300762,4,41149,1317614,5,41574,1317615,5,41574,1317616,1,41574,1317616,50,41576,1317616,40,41576,1317777,0,41576,1357550,3,42980,1360700,4,43677,1383204,5,44377,1383205,1,44377,1383205,50,44380,1383205,40,44380,1383366,0,44380,1564067,4,45656,1564641,5,46081,1564642,1,46081,1564642,50,46088,1564642,40,46088,1564803,0,46122)
%
%
% START OF PROOF
% 969102 [?] ?
% 1021876 [?] ?
% 1023588 [binary:969102,1021876] -member(x,complement(intersection(x,x))).
% 1269002 [?] ?
% 1299824 [?] ?
% 1299894 [binary:1269002.2,1299824] member(x,complement(intersection(x,X))).
% 1565260 [binary:1299894,1023588] 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: 141
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 34508
% derived clauses: 3281185
% kept clauses: 752650
% kept size sum: 2530
% kept mid-nuclei: 356707
% kept new demods: 2321
% forw unit-subs: 1169644
% forw double-subs: 403563
% forw overdouble-subs: 139548
% backward subs: 4046
% fast unit cutoff: 53842
% full unit cutoff: 10293
% dbl unit cutoff: 1993
% real runtime : 463.55
% process. runtime: 461.31
% specific non-discr-tree subsumption statistics:
% tried: 10714259
% length fails: 160361
% strength fails: 2352251
% predlist fails: 4423502
% aux str. fails: 749194
% by-lit fails: 770390
% full subs tried: 1652258
% full subs fail: 1513968
%
% ; 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/NUM/NUM172-1+eq_r.in")
%
%------------------------------------------------------------------------------