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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : HWV027-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 : art01.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/HWV027-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(95,40,1,190,0,1)
% 
% 
% START OF PROOF
% 96 [] equal(X,X).
% 100 [] -equal(minus(X,Y),Z) | equal(plus(Z,Y),X) | def_10(Y,X).
% 101 [] -equal(plus(X,Y),Z) | equal(minus(Z,Y),X) | def_10(Y,Z).
% 103 [] -def_10(X,Y) | -equal(Y,X).
% 104 [] gt(plus(X,n1),plus(Y,n1)) | -gt(X,Y).
% 111 [] gt(X,n0) | equal(X,n0).
% 113 [] -gt(X,X).
% 115 [] equal(plus(n0,X),X).
% 178 [] equal(level(plus(X,n1)),level(X)) | p_^rd(X) | p_^wr(X) | p_^reset(X).
% 187 [] -p_^wr(t_139).
% 188 [] -p_^rd(t_139).
% 189 [] -p_^reset(t_139).
% 190 [] -equal(level(t_139),level(plus(t_139,n1))).
% 195 [hyper:101,115] equal(minus(X,X),n0) | def_10(X,X).
% 237 [hyper:104,111,demod:115] gt(plus(X,n1),n1) | equal(X,n0).
% 315 [hyper:103,195,cut:96] equal(minus(X,X),n0).
% 359 [hyper:100,237,demod:115] gt(plus(minus(X,Y),n1),n1) | def_10(Y,X) | equal(Y,X).
% 7546 [hyper:187,178,cut:188,cut:189] equal(level(plus(t_139,n1)),level(t_139)).
% 8914 [hyper:190,359,demod:115,315,7546,cut:113] def_10(level(t_139),level(t_139)).
% 8971 [hyper:103,8914,cut:96] 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: 25
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    209
%  derived clauses:   34823
%  kept clauses:      3746
%  kept size sum:     91414
%  kept mid-nuclei:   4396
%  kept new demods:   13
%  forw unit-subs:    11538
%  forw double-subs: 3531
%  forw overdouble-subs: 8054
%  backward subs:     39
%  fast unit cutoff:  1350
%  full unit cutoff:  0
%  dbl  unit cutoff:  12
%  real runtime  :  1.77
%  process. runtime:  1.76
% specific non-discr-tree subsumption statistics: 
%  tried:           644931
%  length fails:    58314
%  strength fails:  109843
%  predlist fails:  152482
%  aux str. fails:  28356
%  by-lit fails:    26895
%  full subs tried: 263367
%  full subs fail:  255530
% 
% ; 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/HWV027-1+eq_r.in")
% 
%------------------------------------------------------------------------------