TSTP Solution File: HWV019-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : HWV019-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 : art10.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 0.0s
% Output : Assurance 0.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/HWV019-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)
%
%
% SOS clause
% gt(fifo_length,level(t_139)) | p_^rd(t_139).
% was split for some strategies as:
% gt(fifo_length,level(t_139)).
% p_^rd(t_139).
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(95,40,1,190,0,1)
%
%
% START OF PROOF
% 130 [] -p_^wr_error(plus(X,n1)) | -gt(fifo_length,level(X)) | -p_^wr(X) | p_^rd(X) | p_^reset(X).
% 147 [] -p_^wr_error(plus(X,n1)) | -p_^rd(X) | -p_^wr(X) | p_^reset(X).
% 187 [] p_^wr_error(plus(t_139,n1)).
% 188 [] p_^wr(t_139).
% 189 [] -p_^reset(t_139).
% 190 [] gt(fifo_length,level(t_139)) | p_^rd(t_139).
% 193 [hyper:130,188,cut:187,binarycut:190] p_^rd(t_139) | p_^reset(t_139).
% 195 [hyper:147,188,cut:187,binarycut:193] p_^reset(t_139).
% 230 [hyper:189,195] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 13
% clause depth limited to 3
% seconds given: 12
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 3
% derived clauses: 38
% kept clauses: 7
% kept size sum: 67
% kept mid-nuclei: 13
% kept new demods: 2
% forw unit-subs: 2
% forw double-subs: 15
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 5
% full unit cutoff: 0
% dbl unit cutoff: 19
% real runtime : 0.1
% process. runtime: 0.0
% specific non-discr-tree subsumption statistics:
% tried: 34
% length fails: 0
% strength fails: 28
% predlist fails: 6
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 0
% full subs fail: 0
%
% ; 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/HWV019-1+eq_r.in")
%
%------------------------------------------------------------------------------