TSTP Solution File: HWV031-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : HWV031-1 : TPTP v3.4.2. Released v2.5.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art02.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 70.0s
% Output : Assurance 70.0s
% 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/HWV/HWV031-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: neq
% detected subclass: medium
%
% strategies selected:
% (hyper 25 #f 4 13)
% (binary-unit 9 #f 4 13)
% (binary-double 9 #f 4 13)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 4 13)
% (binary-order 25 #f 4 13)
% (binary-posweight-order 101 #f)
% (binary-posweight-lex-big-order 25 #f)
% (binary-posweight-lex-small-order 9 #f)
% (binary-order-sos 50 #t)
% (binary-unit-uniteq 25 #f)
% (binary-weightorder 50 #f)
% (binary-order 50 #f)
% (hyper-order 30 #f)
% (binary 112 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(94,40,1,188,0,2,41066,4,1901,69148,5,2503,69149,1,2503,69149,50,2504,69149,40,2504,69243,0,2504,89014,3,2955,89807,4,3180,91161,5,3405,91162,5,3405,91162,1,3405,91162,50,3406,91162,40,3406,91256,0,3406,119282,3,3857,126396,4,4082,142810,5,4307,142810,1,4307,142810,50,4308,142810,40,4308,142904,0,4308,183304,3,5060,191829,4,5434,226194,5,5809,226196,5,5810,226196,1,5810,226196,50,5812,226196,40,5812,226290,0,5812,254595,3,6563,258625,4,6938,266826,5,7313,266827,1,7313,266827,50,7314,266827,40,7314,266921,0,7314)
%
%
% START OF PROOF
% 226959 [?] ?
% 226962 [?] ?
% 238575 [?] ?
% 247784 [?] ?
% 266828 [] equal(X,X).
% 266829 [] -equal(plus(X,n1),n0).
% 266831 [] gt(X,minus(X,n1)) | -gt(X,n0).
% 266832 [] -equal(minus(X,Y),Z) | equal(plus(Z,Y),X) | def_10(Y,X).
% 266833 [] -equal(plus(X,Y),Z) | equal(minus(Z,Y),X) | def_10(Y,Z).
% 266834 [] -def_10(X,Y) | -gt(Y,X).
% 266836 [] gt(plus(X,n1),plus(Y,n1)) | -gt(X,Y).
% 266837 [] -gt(plus(X,n1),plus(Y,n1)) | gt(X,Y).
% 266838 [] -gt(plus(X,n1),Y) | gt(X,Y) | equal(Y,X).
% 266839 [] -gt(plus(X,n1),Y) | gt(X,Y) | equal(X,Y).
% 266840 [] gt(X,Y) | gt(Y,X) | equal(X,Y).
% 266841 [] -gt(X,Y) | -gt(Z,X) | gt(Z,Y).
% 266842 [] gt(X,plus(Y,n1)) | equal(plus(Y,n1),X) | -gt(X,Y).
% 266843 [] gt(X,n0) | equal(X,n0).
% 266844 [] equal(X,plus(y_27(X),n1)) | equal(X,n0).
% 266845 [] -gt(X,X).
% 266846 [] -equal(plus(X,n1),plus(Y,n1)) | equal(X,Y).
% 266847 [] equal(plus(n0,X),X).
% 266855 [] equal(wr_level(plus(X,n1)),n0) | -p_^reset(X).
% 266868 [] equal(wr_level(plus(X,n1)),plus(wr_level(X),n1)) | -gt(minus(fifo_length,n1),wr_level(X)) | -gt(fifo_length,level(X)) | -p_^wr(X) | p_^rd(X) | p_^reset(X).
% 266869 [] equal(wr_level(plus(X,n1)),n0) | gt(minus(fifo_length,n1),wr_level(X)) | -gt(fifo_length,level(X)) | -p_^wr(X) | p_^rd(X) | p_^reset(X).
% 266871 [] equal(wr_level(plus(X,n1)),wr_level(X)) | gt(fifo_length,level(X)) | -p_^wr(X) | p_^rd(X) | p_^reset(X).
% 266895 [] equal(wr_level(plus(X,n1)),plus(wr_level(X),n1)) | -gt(minus(fifo_length,n1),wr_level(X)) | -p_^rd(X) | -p_^wr(X) | p_^reset(X).
% 266896 [] equal(wr_level(plus(X,n1)),n0) | gt(minus(fifo_length,n1),wr_level(X)) | -p_^rd(X) | -p_^wr(X) | p_^reset(X).
% 266897 [] equal(wr_level(plus(X,n1)),wr_level(X)) | p_^wr(X) | p_^reset(X).
% 266919 [] -gt(plus(wr_level(x_139),n1),fifo_length).
% 266920 [] gt(plus(wr_level(plus(x_139,n1)),n1),fifo_length).
% 266921 [] gt(fifo_length,n0).
% 266922 [binary:266831.2,266921] gt(fifo_length,minus(fifo_length,n1)).
% 266924 [binary:266836.2,266921,demod:266847] gt(plus(fifo_length,n1),n1).
% 266926 [binary:266841.2,266921] -gt(n0,X) | gt(fifo_length,X).
% 266927 [binary:266842.3,266921,demod:266847,cut:247784] gt(fifo_length,n1).
% 266928 [para:266843.2.2,266921.1.2] gt(fifo_length,X) | gt(X,n0).
% 266934 [binary:266834.2,266927] -def_10(n1,fifo_length).
% 266939 [binary:266832.3,266934] -equal(minus(fifo_length,n1),X) | equal(plus(X,n1),fifo_length).
% 266940 [binary:266833.3,266934] -equal(plus(X,n1),fifo_length) | equal(minus(fifo_length,n1),X).
% 266941 [para:266833.2.1,266922.1.2,cut:266934] -equal(plus(X,n1),fifo_length) | gt(fifo_length,X).
% 266944 [binary:266841,266922] gt(X,minus(fifo_length,n1)) | -gt(X,fifo_length).
% 266963 [binary:266834.2,266924] -def_10(n1,plus(fifo_length,n1)).
% 266978 [binary:266832.3,266963,binarydemod:266846] -equal(minus(plus(fifo_length,n1),n1),X) | equal(X,fifo_length).
% 266988 [binary:266838,266920] gt(wr_level(plus(x_139,n1)),fifo_length) | equal(fifo_length,wr_level(plus(x_139,n1))).
% 266996 [para:266855.1.1,266920.1.1.1,demod:266847,cut:226959] -p_^reset(x_139).
% 267001 [para:266871.1.1,266920.1.1.1,cut:266919,cut:226962,cut:266996] gt(fifo_length,level(x_139)) | p_^rd(x_139).
% 267006 [para:266897.1.1,266920.1.1.1,cut:266919,cut:266996] p_^wr(x_139).
% 267081 [binary:266842,266926,cut:266829] gt(fifo_length,plus(X,n1)) | -gt(n0,X).
% 267110 [para:266844.2.2,266928.2.2,factor:cut:266845] equal(fifo_length,plus(y_27(fifo_length),n1)).
% 267574 [binary:266828,266939] equal(plus(minus(fifo_length,n1),n1),fifo_length).
% 267766 [binary:266845,266941.2] -equal(plus(fifo_length,n1),fifo_length).
% 267782 [binary:266832.2,267766,cut:266934] -equal(minus(fifo_length,n1),fifo_length).
% 267845 [binary:266845,266944] -gt(minus(fifo_length,n1),fifo_length).
% 267849 [binary:266837.2,267845,demod:267574] -gt(fifo_length,plus(fifo_length,n1)).
% 267853 [binary:266841.3,267849] -gt(X,plus(fifo_length,n1)) | -gt(fifo_length,X).
% 267855 [para:266842.2.1,267849.1.2,binarycut:267853] -gt(X,fifo_length) | -gt(fifo_length,X).
% 268230 [binary:266920,267855,binarydemod:267081] -gt(n0,wr_level(plus(x_139,n1))).
% 268675 [para:267110.1.2,266940.1.1,cut:266828] equal(minus(fifo_length,n1),y_27(fifo_length)).
% 269006 [binary:266840.2,268230,cut:238575] gt(wr_level(plus(x_139,n1)),n0).
% 269296 [para:266869.1.1,269006.1.1,demod:268675,cut:266845,cut:267006,cut:266996,binarycut:267001] gt(y_27(fifo_length),wr_level(x_139)) | p_^rd(x_139).
% 270635 [binary:266896.3,269296.2,demod:268675,cut:238575,cut:267006,cut:266996] gt(y_27(fifo_length),wr_level(x_139)).
% 270637 [binary:266836.2,270635,demod:267110] gt(fifo_length,plus(wr_level(x_139),n1)).
% 271912 [binary:266828,266978] equal(minus(plus(fifo_length,n1),n1),fifo_length).
% 272018 [para:266978.2.2,267782.1.2,demod:271912,268675] -equal(y_27(fifo_length),X) | -equal(fifo_length,X).
% 272034 [para:266978.2.2,267845.1.2,demod:271912,268675] -gt(y_27(fifo_length),X) | -equal(fifo_length,X).
% 272678 [binary:266839.3,272018,demod:267110,binarycut:272034] -gt(fifo_length,X) | -equal(fifo_length,X).
% 273328 [binary:272678.2,266988.2,binarycut:267855] -gt(fifo_length,wr_level(plus(x_139,n1))).
% 273366 [para:266868.1.1,273328.1.2,demod:268675,cut:270637,cut:270635,cut:267006,cut:266996,binarycut:267001] p_^rd(x_139).
% 273369 [para:266895.1.1,273328.1.2,demod:268675,cut:270637,cut:270635,cut:273366,cut:267006,cut:266996] 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
% clause length limited to 13
% clause depth limited to 4
% seconds given: 50
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 7600
% derived clauses: 1137911
% kept clauses: 187116
% kept size sum: 685700
% kept mid-nuclei: 71032
% kept new demods: 203
% forw unit-subs: 482998
% forw double-subs: 208728
% forw overdouble-subs: 141862
% backward subs: 1951
% fast unit cutoff: 41626
% full unit cutoff: 296
% dbl unit cutoff: 4171
% real runtime : 73.75
% process. runtime: 73.69
% specific non-discr-tree subsumption statistics:
% tried: 13110372
% length fails: 1056951
% strength fails: 1595416
% predlist fails: 4149521
% aux str. fails: 604089
% by-lit fails: 500214
% full subs tried: 4972588
% full subs fail: 4843760
%
% ; 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/HWV/HWV031-1+eq_r.in")
%
%------------------------------------------------------------------------------