TSTP Solution File: SYN313-1.001.002 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SYN313-1.001.002 : TPTP v3.4.2. Released v1.2.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 9.6s
% Output : Assurance 9.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/SYN/SYN313-1.001.002+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: nne
% detected subclass: small
%
% strategies selected:
% (hyper 27 #f 2 5)
% (binary-unit 10 #f 2 5)
% (binary-double 16 #f)
% (binary 16 #t 2 5)
% (binary-posweight-order 181 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 54 #f)
% (binary-order 27 #f 2 5)
% (binary-weightorder 71 #f)
% (binary-order 27 #f)
% (hyper-order 54 #f)
% (binary 63 #t)
%
%
% **** EMPTY CLAUSE DERIVED ****
%
%
% timer checkpoints: c(2,40,0,4,0,0,6,50,0,8,0,0,18,50,0,20,0,0,46,50,0,48,0,0,254,50,4,256,0,4,800,50,24,802,0,24,1500,50,51,1502,0,51,2602,50,91,2604,0,91,4188,50,169,4190,0,169,7252,50,470,7254,0,470,14267,50,1866,14267,40,1866,14269,0,1866,14271,50,1866,14273,0,1866,14275,50,1866,14277,0,1867,14279,50,1867,14281,0,1867,14283,50,1867,14285,0,1867,14287,50,1867,14289,0,1867,14291,50,1867,14293,0,1867,14295,50,1867,14297,0,1867,14299,50,1867,14301,0,1867,14303,50,1867,14305,0,1867,14307,50,1867,14309,0,1868,14311,50,1868,14313,0,1868,14315,50,1868,14317,0,1868,14319,50,1868,14321,0,1868,14323,50,1868,14325,0,1868,14327,50,1868,14329,0,1868,14331,50,1868,14333,0,1868,14335,50,1868,14337,0,1868,14339,50,1868,14341,0,1868,14343,50,1868,14345,0,1868,14347,50,1868,14347,40,1868,14349,0,1869,14403,50,1869,14403,40,1869,14405,0,1869,14406,50,1869,14408,0,1869,14419,50,1869,14421,0,1869,14465,50,1869,14467,0,1869,14818,50,1894,14820,0,1894)
%
%
% START OF PROOF
% 14819 [] p(h1(X),Y,j1(Z)) | p(h2(Y),Z,j2(Z)) | p(h0,X,j0(Z)).
% 14820 [] -p(X,f0(X),Y) | -p(X,f1(Y),Z).
% 14825 [binary:14819,14820.2] -p(h1(X),f0(h1(X)),Y) | p(h2(f1(Y)),Z,j2(Z)) | p(h0,X,j0(Z)).
% 14826 [binary:14819.2,14820.2] -p(h2(X),f0(h2(X)),Y) | p(h1(Z),X,j1(f1(Y))) | p(h0,Z,j0(f1(Y))).
% 14827 [binary:14819.3,14820.2] p(h1(f1(X)),Y,j1(Z)) | p(h2(Y),Z,j2(Z)) | -p(h0,f0(h0),X).
% 14832 [binary:14820.2,14827] -p(h1(f1(X)),f0(h1(f1(X))),Y) | p(h2(f1(Y)),Z,j2(Z)) | -p(h0,f0(h0),X).
% 14834 [binary:14820.2,14827.2] p(h1(f1(X)),Y,j1(f1(Z))) | -p(h2(Y),f0(h2(Y)),Z) | -p(h0,f0(h0),X).
% 14838 [binary:14820,14825.2] -p(h2(f1(X)),f1(j2(f0(h2(f1(X))))),Y) | p(h0,Z,j0(f0(h2(f1(X))))) | -p(h1(Z),f0(h1(Z)),X).
% 14875 [binary:14820.2,14834] -p(h1(f1(Z)),f0(h1(f1(Z))),X) | -p(h2(f1(X)),f0(h2(f1(X))),Y) | -p(h0,f0(h0),Z).
% 15004 [binary:14832.2,14875.2,factor] -p(h1(f1(X)),f0(h1(f1(X))),Y) | -p(h0,f0(h0),X).
% 15010 [binary:14827,15004] p(h2(f0(h1(f1(X)))),Y,j2(Y)) | -p(h0,f0(h0),X).
% 15015 [binary:14834,15004] -p(h2(f0(h1(f1(X)))),f0(h2(f0(h1(f1(X))))),Y) | -p(h0,f0(h0),X).
% 15025 [binary:15010,15015] -p(h0,f0(h0),X).
% 15030 [binary:14825.3,15025] -p(h1(f0(h0)),f0(h1(f0(h0))),X) | p(h2(f1(X)),Y,j2(Y)).
% 15051 [binary:15030.2,14838,factor:cut:15025] -p(h1(f0(h0)),f0(h1(f0(h0))),X).
% 15052 [binary:14819,15051,cut:15025] p(h2(f0(h1(f0(h0)))),X,j2(X)).
% 15054 [binary:14826.2,15051,cut:15025,slowcut:15052] 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 5
% clause depth limited to 6
% seconds given: 16
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 1741
% derived clauses: 852069
% kept clauses: 2235
% kept size sum: 131861
% kept mid-nuclei: 10575
% kept new demods: 0
% forw unit-subs: 3
% forw double-subs: 298
% forw overdouble-subs: 7433
% backward subs: 484
% fast unit cutoff: 15
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime: 19.50
% process. runtime: 18.95
% specific non-discr-tree subsumption statistics:
% tried: 423801
% length fails: 28046
% strength fails: 14994
% predlist fails: 79807
% aux str. fails: 29491
% by-lit fails: 25773
% full subs tried: 203372
% full subs fail: 196683
%
% ; 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/SYN/SYN313-1.001.002+noeq.in")
%
%------------------------------------------------------------------------------