TSTP Solution File: SYN575-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SYN575-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 : art03.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/SYN/SYN575-1+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: nne
% detected subclass: medium
%
% strategies selected:
% (hyper 27 #f 3 9)
% (binary-unit 10 #f 3 9)
% (binary-double 16 #f 3 9)
% (binary 54 #t 3 9)
% (binary-order 27 #f 3 9)
% (binary-posweight-order 125 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 27 #f)
% (binary-weightorder 54 #f)
% (binary-order 54 #f)
% (hyper-order 43 #f)
% (binary 109 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(22,40,1,47,0,2)
%
%
% START OF PROOF
% 23 [] p9(f8(X,Y),f6(Y)) | p9(f8(X,Y),X) | -p2(Y,f5(Z)) | -p11(Z,c15) | -p9(c12,X).
% 25 [] -p9(X,Y) | -p3(Y,Z) | -p7(X,U) | p9(U,Z).
% 28 [] -p3(X,Z) | -p3(X,Y) | p3(Z,Y).
% 34 [] p9(X,f6(c14)) | -p9(X,c13).
% 35 [] -p9(X,f6(c14)) | p9(X,c13).
% 36 [] p3(f6(f5(X)),f6(X)).
% 38 [] p11(c14,c15).
% 39 [] p9(c12,c13).
% 40 [] p2(X,X).
% 41 [] p3(X,X).
% 42 [] p7(X,X).
% 44 [] -p9(f8(X,Y),f6(Y)) | -p9(f8(X,Y),X) | -p2(Y,f5(Z)) | -p11(Z,c15) | -p9(c12,X).
% 75 [hyper:23,39,40,38] p9(f8(c13,f5(c14)),f6(f5(c14))) | p9(f8(c13,f5(c14)),c13).
% 94 [hyper:28,36,41] p3(f6(X),f6(f5(X))).
% 183 [hyper:25,75,42,36,binarycut:35] p9(f8(c13,f5(c14)),c13).
% 196 [hyper:34,183] p9(f8(c13,f5(c14)),f6(c14)).
% 205 [hyper:25,196,42,94] p9(f8(c13,f5(c14)),f6(f5(c14))).
% 210 [hyper:44,205,40,cut:183,cut:39,cut:38] 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 9
% clause depth limited to 3
% seconds given: 27
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 34
% derived clauses: 287
% kept clauses: 11
% kept size sum: 92
% kept mid-nuclei: 132
% kept new demods: 0
% forw unit-subs: 75
% forw double-subs: 4
% forw overdouble-subs: 0
% backward subs: 1
% fast unit cutoff: 6
% full unit cutoff: 0
% dbl unit cutoff: 1
% real runtime: 0.1
% process. runtime: 0.1
% specific non-discr-tree subsumption statistics:
% tried: 47
% length fails: 0
% strength fails: 15
% predlist fails: 19
% aux str. fails: 0
% by-lit fails: 10
% full subs tried: 3
% full subs fail: 3
%
% ; 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/SYN575-1+noeq.in")
%
%------------------------------------------------------------------------------