TSTP Solution File: HWV016-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : HWV016-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 : art07.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/HWV016-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(96,40,1,192,0,2,33354,4,1881,58301,5,2503,58301,1,2503,58301,50,2504,58301,40,2504,58397,0,2504)
%
%
% START OF PROOF
% 58302 [] equal(X,X).
% 58303 [] -equal(plus(X,n1),n0).
% 58304 [] gt(plus(X,n1),n0).
% 58306 [] -equal(minus(X,Y),Z) | equal(plus(Z,Y),X) | def_10(Y,X).
% 58307 [] -equal(plus(X,Y),Z) | equal(minus(Z,Y),X) | def_10(Y,Z).
% 58309 [] -def_10(X,Y) | -equal(Y,X).
% 58310 [] gt(plus(X,n1),plus(Y,n1)) | -gt(X,Y).
% 58312 [] -gt(plus(X,n1),Y) | gt(X,Y) | equal(Y,X).
% 58315 [] -gt(Y,Z) | -gt(X,Y) | gt(X,Z).
% 58317 [] gt(X,n0) | equal(X,n0).
% 58319 [] -gt(X,X).
% 58321 [] equal(plus(n0,X),X).
% 58326 [] -equal(level(X),n0) | p_^empty(X).
% 58327 [] equal(level(X),n0) | -p_^empty(X).
% 58336 [] -p_^wr_error(plus(X,n1)) | -gt(fifo_length,level(X)) | -p_^wr(X) | p_^rd(X) | p_^reset(X).
% 58337 [] equal(level(plus(X,n1)),plus(level(X),n1)) | -gt(fifo_length,level(X)) | -p_^wr(X) | p_^rd(X) | p_^reset(X).
% 58344 [] p_^wr_error(plus(X,n1)) | gt(fifo_length,level(X)) | -p_^wr(X) | p_^rd(X) | p_^reset(X).
% 58346 [] equal(level(plus(X,n1)),level(X)) | gt(fifo_length,level(X)) | -p_^wr(X) | p_^rd(X) | p_^reset(X).
% 58355 [] equal(level(plus(X,n1)),level(X)) | -gt(level(X),n0) | -p_^rd(X) | -p_^wr(X) | p_^reset(X).
% 58361 [] equal(level(plus(X,n1)),plus(level(X),n1)) | gt(level(X),n0) | -p_^rd(X) | -p_^wr(X) | p_^reset(X).
% 58394 [] p_^wr(t_139).
% 58395 [] -p_^reset(t_139).
% 58396 [] p_^empty(plus(t_139,n1)).
% 58397 [] gt(fifo_length,n0).
% 58418 [binary:58303,58306.2,slowcut:58302] def_10(n1,n0).
% 58430 [binary:58302,58309.2] -def_10(X,X).
% 58431 [binary:58418,58309] -equal(n0,n1).
% 58436 [binary:58321,58307,cut:58430] equal(minus(X,X),n0).
% 58446 [para:58436.1.1,58306.1.1,cut:58430] equal(plus(X,Y),Y) | -equal(n0,X).
% 58448 [para:58307.2.1,58436.1.1,cut:58430,binarydemod:58446] -equal(n0,X) | equal(X,n0).
% 58457 [para:58321.1.1,58310.1.1] gt(n1,plus(X,n1)) | -gt(n0,X).
% 58483 [binary:58303,58312.3,demod:58321,binarydemod:58457] gt(n0,plus(X,n1)) | -gt(n0,X).
% 58497 [binary:58396,58327.2] equal(level(plus(t_139,n1)),n0).
% 58535 [binary:58303,58448.2] -equal(n0,plus(X,n1)).
% 58546 [binary:58319,58315.3] -gt(X,Y) | -gt(Y,X).
% 58567 [binary:58304,58546,binarydemod:58483] -gt(n0,X).
% 58721 [binary:58394,58337.3,demod:58497,cut:58535,cut:58395] -gt(fifo_length,level(t_139)) | p_^rd(t_139).
% 58801 [binary:58394,58344.3,cut:58395,binarycut:58721] p_^wr_error(plus(t_139,n1)) | p_^rd(t_139).
% 58838 [para:58346.1.1,58497.1.1,cut:58394,cut:58395,binarycut:58721,binarydemod:58326] p_^rd(t_139) | p_^empty(t_139).
% 59359 [para:58355.1.1,58497.1.1,cut:58394,cut:58395,binarycut:58317,binarydemod:58326,binarycut:58838] p_^empty(t_139).
% 59361 [binary:58327.2,59359] equal(level(t_139),n0).
% 59364 [para:59361.1.1,58336.2.2,cut:58397,cut:58394,cut:58395,binarycut:58801] p_^rd(t_139).
% 59435 [binary:58394,58361.4,demod:58321,58497,59361,cut:59364,cut:58567,cut:58431,cut:58395] 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: 654
% derived clauses: 336577
% kept clauses: 40439
% kept size sum: 8486
% kept mid-nuclei: 15662
% kept new demods: 25
% forw unit-subs: 143134
% forw double-subs: 30143
% forw overdouble-subs: 88692
% backward subs: 253
% fast unit cutoff: 48547
% full unit cutoff: 13
% dbl unit cutoff: 462
% real runtime : 25.8
% process. runtime: 25.7
% specific non-discr-tree subsumption statistics:
% tried: 15444582
% length fails: 1056680
% strength fails: 3921721
% predlist fails: 3748336
% aux str. fails: 386279
% by-lit fails: 1709057
% full subs tried: 4017347
% full subs fail: 3962534
%
% ; 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/HWV016-1+eq_r.in")
%
%------------------------------------------------------------------------------