TSTP Solution File: HWV017-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : HWV017-2 : 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 119.0s
% Output : Assurance 119.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-2+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: neq
% detected subclass: big
%
% strategies selected:
% (hyper 28 #f 5 19)
% (binary-unit 28 #f 5 19)
% (binary-double 11 #f 5 19)
% (binary-double 17 #f)
% (binary-double 17 #t)
% (binary 87 #t 5 19)
% (binary-order 28 #f 5 19)
% (binary-posweight-order 58 #f)
% (binary-posweight-lex-big-order 28 #f)
% (binary-posweight-lex-small-order 11 #f)
% (binary-order-sos 28 #t)
% (binary-unit-uniteq 28 #f)
% (binary-weightorder 28 #f)
% (binary-weightorder-sos 17 #f)
% (binary-order 28 #f)
% (hyper-order 17 #f)
% (binary 141 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(140,40,1,280,0,1,110090,4,2128,110372,5,2806,110374,5,2814,110374,1,2814,110374,50,2820,110374,40,2820,110514,0,2837,130761,3,4242,133284,4,4942,133464,5,5638,133464,5,5638,133465,1,5638,133465,50,5641,133465,40,5641,133605,0,5641,151013,3,6193,156053,4,6481,156786,5,6742,156786,5,6742,156787,1,6742,156787,50,6744,156787,40,6744,156927,0,6744,178809,3,7606,184549,4,8039,185320,5,8445,185320,5,8445,185321,1,8445,185321,50,8448,185321,40,8448,185461,0,8448,214942,3,9301,217694,4,9725,217750,5,10149,217750,5,10150,217751,1,10150,217751,50,10153,217751,40,10153,217891,0,10153)
%
%
% START OF PROOF
% 217758 [] equal(fwork_^d^o^tfifo_^d^o^trtl_^d^o^tlevel_(X),fwork_^d^o^tfifo_^d^o^trtl_^d^o^tfifo__length_) | -p__pred_(fwork_^d^o^tfifo_^d^o^trtl_^d^o^tfull_(X)).
% 217759 [] -equal(fwork_^d^o^tfifo_^d^o^trtl_^d^o^tlevel_(X),n0) | p__pred_(fwork_^d^o^tfifo_^d^o^trtl_^d^o^tempty_(X)).
% 217760 [] equal(fwork_^d^o^tfifo_^d^o^trtl_^d^o^tlevel_(X),n0) | -p__pred_(fwork_^d^o^tfifo_^d^o^trtl_^d^o^tempty_(X)).
% 217794 [] equal(fwork_^d^o^tfifo_^d^o^trtl_^d^o^tlevel_(f_^a^d^d_(X,n1)),f_^s^u^b_(fwork_^d^o^tfifo_^d^o^trtl_^d^o^tlevel_(X),n1)) | p_^l^e^s_^e^q^u_(fwork_^d^o^tfifo_^d^o^trtl_^d^o^tlevel_(X),n0) | -p__pred_(fwork_^d^o^tfifo_^d^o^trtl_^d^o^trd_(X)) | p__pred_(fwork_^d^o^tfifo_^d^o^trtl_^d^o^twr_(X)) | p__pred_(fwork_^d^o^tfifo_^d^o^trtl_^d^o^treset_(X)).
% 217798 [] equal(fwork_^d^o^tfifo_^d^o^trtl_^d^o^tlevel_(f_^a^d^d_(X,n1)),fwork_^d^o^tfifo_^d^o^trtl_^d^o^tlevel_(X)) | -p_^l^e^s_^e^q^u_(fwork_^d^o^tfifo_^d^o^trtl_^d^o^tlevel_(X),n0) | -p__pred_(fwork_^d^o^tfifo_^d^o^trtl_^d^o^trd_(X)) | p__pred_(fwork_^d^o^tfifo_^d^o^trtl_^d^o^twr_(X)) | p__pred_(fwork_^d^o^tfifo_^d^o^trtl_^d^o^treset_(X)).
% 217810 [] -equal(f_^a^d^d_(X,n1),n0).
% 217811 [] -p_^l^e^s_^e^q^u_(f_^a^d^d_(X,n1),n0).
% 217812 [] -p_^l^e^s_^e^q^u_(X,f_^s^u^b_(X,n1)) | p_^l^e^s_^e^q^u_(X,n0).
% 217820 [] p_^l^e^s_^e^q^u_(f_^a^d^d_(X,n1),Y) | -p_^l^e^s_^e^q^u_(X,Y) | equal(X,Y).
% 217825 [] equal(X,f_^a^d^d_(y_105(X),n1)) | equal(X,n0).
% 217826 [] p_^l^e^s_^e^q^u_(X,X).
% 217886 [] p_^l^e^s_^e^q^u_(fwork_^d^o^tfifo_^d^o^trtl_^d^o^tlevel_(t_206),fwork_^d^o^tfifo_^d^o^trtl_^d^o^tfifo__length_).
% 217887 [] -p__pred_(fwork_^d^o^tfifo_^d^o^trtl_^d^o^twr_(t_206)).
% 217888 [] -p__pred_(fwork_^d^o^tfifo_^d^o^trtl_^d^o^treset_(t_206)).
% 217889 [] p__pred_(fwork_^d^o^tfifo_^d^o^trtl_^d^o^trd_(t_206)).
% 217890 [] p__pred_(fwork_^d^o^tfifo_^d^o^trtl_^d^o^tfull_(f_^a^d^d_(t_206,n1))).
% 217891 [] -p_^l^e^s_^e^q^u_(fwork_^d^o^tfifo_^d^o^trtl_^d^o^tfifo__length_,n0).
% 217897 [binary:217798.4,217887,cut:217889,cut:217888] equal(fwork_^d^o^tfifo_^d^o^trtl_^d^o^tlevel_(f_^a^d^d_(t_206,n1)),fwork_^d^o^tfifo_^d^o^trtl_^d^o^tlevel_(t_206)) | -p_^l^e^s_^e^q^u_(fwork_^d^o^tfifo_^d^o^trtl_^d^o^tlevel_(t_206),n0).
% 217974 [para:217825.2.2,217891.1.2] equal(X,f_^a^d^d_(y_105(X),n1)) | -p_^l^e^s_^e^q^u_(fwork_^d^o^tfifo_^d^o^trtl_^d^o^tfifo__length_,X).
% 218104 [binary:217758.2,217890] equal(fwork_^d^o^tfifo_^d^o^trtl_^d^o^tlevel_(f_^a^d^d_(t_206,n1)),fwork_^d^o^tfifo_^d^o^trtl_^d^o^tfifo__length_).
% 239564 [para:217974.1.2,217810.1.1] -p_^l^e^s_^e^q^u_(fwork_^d^o^tfifo_^d^o^trtl_^d^o^tfifo__length_,X) | -equal(X,n0).
% 240206 [binary:217760,239564.2] -p_^l^e^s_^e^q^u_(fwork_^d^o^tfifo_^d^o^trtl_^d^o^tfifo__length_,fwork_^d^o^tfifo_^d^o^trtl_^d^o^tlevel_(X)) | -p__pred_(fwork_^d^o^tfifo_^d^o^trtl_^d^o^tempty_(X)).
% 258526 [para:217758.1.1,240206.1.2,cut:217826] -p__pred_(fwork_^d^o^tfifo_^d^o^trtl_^d^o^tempty_(X)) | -p__pred_(fwork_^d^o^tfifo_^d^o^trtl_^d^o^tfull_(X)).
% 259055 [binary:217759.2,258526] -equal(fwork_^d^o^tfifo_^d^o^trtl_^d^o^tlevel_(X),n0) | -p__pred_(fwork_^d^o^tfifo_^d^o^trtl_^d^o^tfull_(X)).
% 260273 [binary:217820.3,259055,cut:217811] -p_^l^e^s_^e^q^u_(fwork_^d^o^tfifo_^d^o^trtl_^d^o^tlevel_(X),n0) | -p__pred_(fwork_^d^o^tfifo_^d^o^trtl_^d^o^tfull_(X)).
% 260385 [para:217897.1.1,260273.1.1,cut:217890] -p_^l^e^s_^e^q^u_(fwork_^d^o^tfifo_^d^o^trtl_^d^o^tlevel_(t_206),n0).
% 260888 [binary:217794.2,260385,demod:218104,cut:217889,cut:217887,cut:217888] equal(fwork_^d^o^tfifo_^d^o^trtl_^d^o^tfifo__length_,f_^s^u^b_(fwork_^d^o^tfifo_^d^o^trtl_^d^o^tlevel_(t_206),n1)).
% 260891 [binary:217812.2,260385,demod:260888,cut:217886] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using sos 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 19
% clause depth limited to 5
% seconds given: 87
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 3358
% derived clauses: 836597
% kept clauses: 219173
% kept size sum: 523802
% kept mid-nuclei: 31554
% kept new demods: 227
% forw unit-subs: 463148
% forw double-subs: 14812
% forw overdouble-subs: 55308
% backward subs: 353
% fast unit cutoff: 1551
% full unit cutoff: 168
% dbl unit cutoff: 146
% real runtime : 123.26
% process. runtime: 122.5
% specific non-discr-tree subsumption statistics:
% tried: 2143092
% length fails: 317290
% strength fails: 811188
% predlist fails: 235906
% aux str. fails: 3256
% by-lit fails: 133256
% full subs tried: 580073
% full subs fail: 524823
%
% ; 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-2+eq_r.in")
% WARNING: TreeLimitedRun lost 118.98s, total lost is 118.98s
%
%------------------------------------------------------------------------------