TSTP Solution File: HWV017-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : HWV017-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 : art03.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 20.0s
% Output : Assurance 20.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/HWV017-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(97,40,3,194,0,3,38774,4,1895,63592,5,2504,63592,1,2504,63592,50,2505,63592,40,2505,63689,0,2505)
%
%
% START OF PROOF
% 63595 [] gt(plus(X,n1),n0).
% 63596 [] gt(X,minus(X,n1)) | -gt(X,n0).
% 63606 [] -gt(Y,Z) | -gt(X,Y) | gt(X,Z).
% 63608 [] gt(X,n0) | equal(X,n0).
% 63610 [] -gt(X,X).
% 63616 [] equal(level(X),fifo_length) | -p_^full(X).
% 63617 [] -equal(level(X),n0) | p_^empty(X).
% 63618 [] equal(level(X),n0) | -p_^empty(X).
% 63664 [] equal(level(plus(X,n1)),minus(level(X),n1)) | -gt(level(X),n0) | -p_^rd(X) | p_^wr(X) | p_^reset(X).
% 63671 [] equal(level(plus(X,n1)),level(X)) | gt(level(X),n0) | -p_^rd(X) | p_^wr(X) | p_^reset(X).
% 63684 [] -gt(level(t_139),fifo_length).
% 63685 [] p_^rd(t_139).
% 63686 [] -p_^wr(t_139).
% 63687 [] -p_^reset(t_139).
% 63688 [] p_^full(plus(t_139,n1)).
% 63689 [] gt(fifo_length,n0).
% 63775 [?] ?
% 63785 [binary:63688,63616.2] equal(level(plus(t_139,n1)),fifo_length).
% 63807 [para:63785.1.1,63618.1.1] -p_^empty(plus(t_139,n1)) | equal(fifo_length,n0).
% 63825 [binary:63610,63606.3] -gt(X,Y) | -gt(Y,X).
% 63843 [binary:63595,63825,binarydemod:63775] -gt(n0,X).
% 64116 [para:63807.2.1,63689.1.1,cut:63843] -p_^empty(plus(t_139,n1)).
% 64120 [binary:63617.2,64116,demod:63785] -equal(fifo_length,n0).
% 64122 [para:63608.2.2,64120.1.2] -equal(fifo_length,X) | gt(X,n0).
% 65117 [binary:63685,63671.3,demod:63785,cut:63686,cut:63687,binarycut:64122] gt(level(t_139),n0).
% 65136 [binary:63664.2,65117,demod:63785,cut:63685,cut:63686,cut:63687] equal(fifo_length,minus(level(t_139),n1)).
% 65213 [para:65136.1.2,63596.1.2,cut:63684,cut:65117] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using unit 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 3
% seconds given: 9
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 798
% derived clauses: 301895
% kept clauses: 45281
% kept size sum: 13172
% kept mid-nuclei: 15778
% kept new demods: 26
% forw unit-subs: 116571
% forw double-subs: 24293
% forw overdouble-subs: 74714
% backward subs: 241
% fast unit cutoff: 17292
% full unit cutoff: 13
% dbl unit cutoff: 130
% real runtime : 25.10
% process. runtime: 25.10
% specific non-discr-tree subsumption statistics:
% tried: 12230255
% length fails: 1193011
% strength fails: 2297827
% predlist fails: 2437398
% aux str. fails: 472997
% by-lit fails: 701183
% full subs tried: 4868941
% full subs fail: 4803955
%
% ; 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/HWV017-1+eq_r.in")
%
%------------------------------------------------------------------------------