TSTP Solution File: HWV023-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : HWV023-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 : art09.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/HWV023-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,1)
%
%
% START OF PROOF
% 97 [] equal(X,X).
% 99 [] gt(plus(X,n1),n0).
% 102 [] -equal(plus(X,Y),Z) | equal(minus(Z,Y),X) | def_10(Y,Z).
% 104 [] -def_10(X,Y) | -equal(Y,X).
% 112 [] gt(X,n0) | equal(X,n0).
% 114 [] -gt(X,X).
% 116 [] equal(plus(n0,X),X).
% 121 [] -equal(level(X),n0) | p_^empty(X).
% 122 [] equal(level(X),n0) | -p_^empty(X).
% 168 [] equal(level(plus(X,n1)),minus(level(X),n1)) | -gt(level(X),n0) | -p_^rd(X) | p_^wr(X) | p_^reset(X).
% 188 [] equal(level(t_139),n1).
% 189 [] -p_^wr(t_139).
% 190 [] p_^rd(t_139).
% 191 [] -p_^reset(t_139).
% 192 [] -p_^empty(plus(t_139,n1)).
% 209 [hyper:102,116] equal(minus(X,X),n0) | def_10(X,X).
% 226 [para:116.1.1,99.1.1] gt(n1,n0).
% 262 [hyper:121,112] gt(level(X),n0) | p_^empty(X).
% 295 [hyper:168,262,190,demod:188,cut:189,cut:191] equal(level(plus(t_139,n1)),minus(n1,n1)) | p_^empty(t_139).
% 355 [hyper:104,209,cut:97] equal(minus(X,X),n0).
% 1171 [hyper:122,295,demod:188,355] equal(level(plus(t_139,n1)),n0) | equal(n1,n0).
% 1197 [hyper:121,1171,cut:192] equal(n1,n0).
% 1202 [para:1197.1.2,226.1.2,cut:114] 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: 92
% derived clauses: 3072
% kept clauses: 382
% kept size sum: 5669
% kept mid-nuclei: 517
% kept new demods: 10
% forw unit-subs: 1193
% forw double-subs: 333
% forw overdouble-subs: 413
% backward subs: 17
% fast unit cutoff: 139
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.7
% process. runtime: 0.7
% specific non-discr-tree subsumption statistics:
% tried: 7216
% length fails: 248
% strength fails: 741
% predlist fails: 1861
% aux str. fails: 735
% by-lit fails: 46
% full subs tried: 3535
% full subs fail: 3146
%
% ; 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-1+eq_r.in")
%
%------------------------------------------------------------------------------