TSTP Solution File: HWV023-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : HWV023-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 : art06.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 24.6s
% Output : Assurance 24.6s
% 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/HWV023-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(139,40,0,278,0,0,105009,4,2147,105497,5,2802,105499,5,2810,105499,1,2810,105499,50,2816,105499,40,2816,105638,0,2832)
%
%
% START OF PROOF
% 105500 [] equal(X,X).
% 105507 [] -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)).
% 105542 [] 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)).
% 105559 [] -p_^l^e^s_^e^q^u_(f_^a^d^d_(X,n1),n0).
% 105562 [] -equal(f_^a^d^d_(X,Y),Z) | equal(f_^s^u^b_(Z,Y),X) | def_89(Y,Z).
% 105563 [] -def_89(X,Y) | -equal(Y,X).
% 105576 [] equal(f_^a^d^d_(n0,X),X).
% 105634 [] equal(fwork_^d^o^tfifo_^d^o^trtl_^d^o^tlevel_(t_206),n1).
% 105635 [] p__pred_(fwork_^d^o^tfifo_^d^o^trtl_^d^o^trd_(t_206)).
% 105636 [] -p__pred_(fwork_^d^o^tfifo_^d^o^trtl_^d^o^treset_(t_206)).
% 105637 [] -p__pred_(fwork_^d^o^tfifo_^d^o^trtl_^d^o^twr_(t_206)).
% 105638 [] -p__pred_(fwork_^d^o^tfifo_^d^o^trtl_^d^o^tempty_(f_^a^d^d_(t_206,n1))).
% 105699 [binary:105638,105507.2] -equal(fwork_^d^o^tfifo_^d^o^trtl_^d^o^tlevel_(f_^a^d^d_(t_206,n1)),n0).
% 105703 [para:105576.1.1,105559.1.1] -p_^l^e^s_^e^q^u_(n1,n0).
% 105716 [binary:105500,105563.2] -def_89(X,X).
% 108185 [binary:105576,105562,cut:105716] equal(f_^s^u^b_(X,X),n0).
% 109070 [para:105542.1.1,105699.1.1,demod:108185,105634,cut:105500,cut:105703,cut:105635,cut:105637,cut:105636] 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 19
% clause depth limited to 5
% seconds given: 28
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 548
% derived clauses: 166603
% kept clauses: 73569
% kept size sum: 36968
% kept mid-nuclei: 28090
% kept new demods: 53
% forw unit-subs: 7481
% forw double-subs: 2057
% forw overdouble-subs: 41373
% backward subs: 38
% fast unit cutoff: 220
% full unit cutoff: 257
% dbl unit cutoff: 23
% real runtime : 29.36
% process. runtime: 28.96
% specific non-discr-tree subsumption statistics:
% tried: 1509087
% length fails: 239699
% strength fails: 581349
% predlist fails: 141281
% aux str. fails: 2422
% by-lit fails: 75435
% full subs tried: 434370
% full subs fail: 393014
%
% ; 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/HWV023-2+eq_r.in")
% WARNING: TreeLimitedRun lost 24.54s, total lost is 24.54s
%
%------------------------------------------------------------------------------