TSTP Solution File: HWV033-1 by Gandalf---c-2.6

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : HWV033-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 : art05.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 59.6s
% Output   : Assurance 59.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/HWV/HWV033-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 3 13)
% (binary-unit 9 #f 3 13)
% (binary-double 9 #f 3 13)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 3 13)
% (binary-order 25 #f 3 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,39056,4,1978,63134,5,2516,63135,1,2516,63135,50,2518,63135,40,2518,63229,0,2518,78333,3,2969,79087,4,3194,79767,1,3419,79767,50,3419,79767,40,3419,79861,0,3420,105589,3,3871,111934,4,4096,120758,5,4321,120759,5,4321,120759,1,4321,120759,50,4323,120759,40,4323,120853,0,4323,159739,3,5074,169182,4,5450,203815,5,5827,203817,5,5828,203817,1,5828,203817,50,5830,203817,40,5830,203911,0,5830,236906,3,6581)
% 
% 
% START OF PROOF
% 203818 [] equal(X,X).
% 203819 [] -equal(plus(X,n1),n0).
% 203820 [] gt(plus(X,n1),n0).
% 203821 [] gt(X,minus(X,n1)) | -gt(X,n0).
% 203822 [] -equal(minus(X,Y),Z) | equal(plus(Z,Y),X) | def_10(Y,X).
% 203823 [] -equal(plus(X,Y),Z) | equal(minus(Z,Y),X) | def_10(Y,Z).
% 203824 [] -def_10(X,Y) | -gt(Y,X).
% 203825 [] -def_10(X,Y) | -equal(Y,X).
% 203826 [] gt(plus(X,n1),plus(Y,n1)) | -gt(X,Y).
% 203827 [] -gt(plus(X,n1),plus(Y,n1)) | gt(X,Y).
% 203828 [] -gt(plus(X,n1),Y) | gt(X,Y) | equal(Y,X).
% 203830 [] gt(X,Y) | gt(Y,X) | equal(X,Y).
% 203831 [] -gt(X,Y) | -gt(Z,X) | gt(Z,Y).
% 203832 [] gt(X,plus(Y,n1)) | equal(plus(Y,n1),X) | -gt(X,Y).
% 203833 [] gt(X,n0) | equal(X,n0).
% 203834 [] equal(X,plus(y_27(X),n1)) | equal(X,n0).
% 203835 [] -gt(X,X).
% 203836 [] -equal(plus(X,n1),plus(Y,n1)) | equal(X,Y).
% 203837 [] equal(plus(n0,X),X).
% 203846 [] equal(rd_level(plus(X,n1)),n0) | -p_^reset(X).
% 203874 [] equal(rd_level(plus(X,n1)),plus(rd_level(X),n1)) | -gt(minus(fifo_length,n1),rd_level(X)) | -gt(level(X),n0) | -p_^rd(X) | -p_^wr(X) | p_^reset(X).
% 203875 [] equal(rd_level(plus(X,n1)),n0) | gt(minus(fifo_length,n1),rd_level(X)) | -gt(level(X),n0) | -p_^rd(X) | -p_^wr(X) | p_^reset(X).
% 203878 [] equal(rd_level(plus(X,n1)),rd_level(X)) | gt(level(X),n0) | -p_^rd(X) | -p_^wr(X) | p_^reset(X).
% 203892 [] equal(rd_level(plus(X,n1)),plus(rd_level(X),n1)) | -gt(minus(fifo_length,n1),rd_level(X)) | -gt(level(X),n0) | -p_^rd(X) | p_^wr(X) | p_^reset(X).
% 203893 [] equal(rd_level(plus(X,n1)),n0) | gt(minus(fifo_length,n1),rd_level(X)) | -gt(level(X),n0) | -p_^rd(X) | p_^wr(X) | p_^reset(X).
% 203895 [] equal(rd_level(plus(X,n1)),rd_level(X)) | gt(level(X),n0) | -p_^rd(X) | p_^wr(X) | p_^reset(X).
% 203899 [] equal(rd_level(plus(X,n1)),rd_level(X)) | p_^rd(X) | p_^wr(X) | p_^reset(X).
% 203909 [] -gt(rd_level(t_139),minus(fifo_length,n1)).
% 203910 [] gt(rd_level(plus(t_139,n1)),minus(fifo_length,n1)).
% 203911 [] gt(fifo_length,n0).
% 203912 [binary:203821.2,203911] gt(fifo_length,minus(fifo_length,n1)).
% 203914 [binary:203826.2,203911,demod:203837] gt(plus(fifo_length,n1),n1).
% 203915 [binary:203831,203911] -gt(X,fifo_length) | gt(X,n0).
% 203917 [binary:203832.3,203911,demod:203837] gt(fifo_length,n1) | equal(n1,fifo_length).
% 203918 [para:203833.2.2,203911.1.2] gt(fifo_length,X) | gt(X,n0).
% 203919 [para:203834.2.2,203911.1.2] equal(X,plus(y_27(X),n1)) | gt(fifo_length,X).
% 203924 [para:203823.2.1,203912.1.2] def_10(n1,fifo_length) | -equal(plus(X,n1),fifo_length) | gt(fifo_length,X).
% 203931 [binary:203824.2,203914] -def_10(n1,plus(fifo_length,n1)).
% 203944 [binary:203828.2,203909] -gt(plus(rd_level(t_139),n1),minus(fifo_length,n1)) | equal(minus(fifo_length,n1),rd_level(t_139)).
% 203947 [binary:203830.2,203909] gt(minus(fifo_length,n1),rd_level(t_139)) | equal(minus(fifo_length,n1),rd_level(t_139)).
% 203948 [binary:203831.3,203909] -gt(X,minus(fifo_length,n1)) | -gt(rd_level(t_139),X).
% 203950 [binary:203822.3,203931,binarydemod:203836] -equal(minus(plus(fifo_length,n1),n1),X) | equal(X,fifo_length).
% 204018 [para:203846.1.1,203910.1.1] gt(n0,minus(fifo_length,n1)) | -p_^reset(t_139).
% 204026 [para:203899.1.1,203910.1.1,cut:203909] p_^rd(t_139) | p_^wr(t_139) | p_^reset(t_139).
% 204038 [para:203834.2.2,203918.2.2,factor:cut:203835] equal(fifo_length,plus(y_27(fifo_length),n1)).
% 204110 [binary:203824.2,203917] -def_10(n1,fifo_length) | equal(n1,fifo_length).
% 204204 [para:203919.1.2,203819.1.1] -equal(X,n0) | gt(fifo_length,X).
% 204319 [binary:203835,204204.2] -equal(fifo_length,n0).
% 204345 [para:203833.2.2,204319.1.2] -equal(fifo_length,X) | gt(X,n0).
% 204857 [binary:203828.3,204345,binarycut:203915] -gt(plus(X,n1),fifo_length) | gt(X,n0).
% 205026 [binary:203825.2,204038,demod:204038] -def_10(fifo_length,fifo_length).
% 205029 [para:204038.1.2,203826.1.2,binarydemod:204857] -gt(X,y_27(fifo_length)) | gt(X,n0).
% 205573 [para:204110.2.2,205026.1.1] -def_10(n1,fifo_length).
% 206844 [para:203823.2.1,203909.1.2,cut:205573] -equal(plus(X,n1),fifo_length) | -gt(rd_level(t_139),X).
% 206876 [para:204038.1.2,206844.1.1,cut:203818] -gt(rd_level(t_139),y_27(fifo_length)).
% 207139 [para:204038.1.2,203924.2.1,cut:203818,cut:205573] gt(fifo_length,y_27(fifo_length)).
% 207141 [binary:203831,207139] gt(X,y_27(fifo_length)) | -gt(X,fifo_length).
% 207202 [binary:203835,207141] -gt(y_27(fifo_length),fifo_length).
% 207206 [binary:203827.2,207202,demod:204038] -gt(fifo_length,plus(fifo_length,n1)).
% 207213 [binary:203831.3,207206] -gt(X,plus(fifo_length,n1)) | -gt(fifo_length,X).
% 207215 [para:203832.2.1,207206.1.2,binarycut:207213] -gt(X,fifo_length) | -gt(fifo_length,X).
% 207233 [binary:204204.2,207215.2] -gt(X,fifo_length) | -equal(X,n0).
% 207416 [binary:204018,203948] -gt(rd_level(t_139),n0) | -p_^reset(t_139).
% 207422 [binary:203828.2,207416,cut:203820] equal(n0,rd_level(t_139)) | -p_^reset(t_139).
% 207556 [para:207422.1.2,203909.1.1,binarycut:204018] -p_^reset(t_139).
% 207620 [?] ?
% 207622 [binary:204026.3,207556,binarycut:207620] p_^rd(t_139).
% 207965 [binary:203818,203950] equal(minus(plus(fifo_length,n1),n1),fifo_length).
% 208031 [para:203950.2.2,204319.1.1,demod:207965] -equal(X,n0) | -equal(fifo_length,X).
% 208326 [binary:203828.3,208031.2,binarycut:207233] -gt(plus(X,n1),fifo_length) | -equal(X,n0).
% 214619 [para:203823.2.1,203910.1.2,cut:205573] gt(rd_level(plus(t_139,n1)),X) | -equal(plus(X,n1),fifo_length).
% 214654 [para:204038.1.2,214619.2.1,cut:203818] gt(rd_level(plus(t_139,n1)),y_27(fifo_length)).
% 214656 [binary:205029,214619,demod:204038,cut:203818] gt(rd_level(plus(t_139,n1)),n0).
% 214669 [binary:203826.2,214656,demod:203837] gt(plus(rd_level(plus(t_139,n1)),n1),n1).
% 214735 [binary:203826.2,214654,demod:204038] gt(plus(rd_level(plus(t_139,n1)),n1),fifo_length).
% 214742 [para:203878.1.1,214654.1.1,cut:206876,cut:207622,cut:207556] gt(level(t_139),n0) | -p_^wr(t_139).
% 214745 [para:203895.1.1,214654.1.1,cut:206876,cut:207622,cut:207556] gt(level(t_139),n0) | p_^wr(t_139).
% 214845 [binary:214742.2,214745.2] gt(level(t_139),n0).
% 215653 [para:203874.1.1,203910.1.1,cut:214845,cut:207622,cut:207556] gt(plus(rd_level(t_139),n1),minus(fifo_length,n1)) | -gt(minus(fifo_length,n1),rd_level(t_139)) | -p_^wr(t_139).
% 215660 [binary:203944,215653,binarycut:203947] equal(minus(fifo_length,n1),rd_level(t_139)) | -p_^wr(t_139).
% 216000 [para:203892.1.1,203910.1.1,cut:214845,cut:207622,cut:207556] gt(plus(rd_level(t_139),n1),minus(fifo_length,n1)) | -gt(minus(fifo_length,n1),rd_level(t_139)) | p_^wr(t_139).
% 216007 [binary:203944,216000,binarycut:203947] equal(minus(fifo_length,n1),rd_level(t_139)) | p_^wr(t_139).
% 232524 [para:203875.1.1,214669.1.1.1,demod:203837,cut:203835,cut:214845,cut:207622,cut:207556] gt(minus(fifo_length,n1),rd_level(t_139)) | -p_^wr(t_139).
% 232612 [binary:208326,214735] -equal(rd_level(plus(t_139,n1)),n0).
% 237154 [binary:215660.2,216007.2] equal(minus(fifo_length,n1),rd_level(t_139)).
% 239173 [binary:203893.5,232524.2,demod:237154,cut:207622,cut:214845,cut:203835,cut:232612,cut:207556] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% using sos strategy
% using unit paramodulation strategy
% using unit strategy
% using double strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 15
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    7764
%  derived clauses:   980017
%  kept clauses:      168796
%  kept size sum:     567339
%  kept mid-nuclei:   56026
%  kept new demods:   141
%  forw unit-subs:    364292
%  forw double-subs: 184184
%  forw overdouble-subs: 141607
%  backward subs:     1763
%  fast unit cutoff:  35608
%  full unit cutoff:  276
%  dbl  unit cutoff:  3306
%  real runtime  :  69.28
%  process. runtime:  68.85
% specific non-discr-tree subsumption statistics: 
%  tried:           13427571
%  length fails:    1203277
%  strength fails:  1826628
%  predlist fails:  4115191
%  aux str. fails:  406524
%  by-lit fails:    443780
%  full subs tried: 5250660
%  full subs fail:  5123344
% 
% ; 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/HWV033-1+eq_r.in")
% 
%------------------------------------------------------------------------------