TSTP Solution File: SYN659-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SYN659-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 : 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 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/SYN659-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 4 9)
% (binary-unit 10 #f 4 9)
% (binary-double 16 #f 4 9)
% (binary 54 #t 4 9)
% (binary-order 27 #f 4 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(51,40,0,102,0,0)
%
%
% START OF PROOF
% 58 [] p14(f15(X,Y),f15(Z,U)) | -p12(Y,U) | -p7(X,Z).
% 59 [] p12(f13(X,Y),f13(Z,U)) | -p2(Y,U) | -p10(X,Z).
% 62 [] -p24(X,Y) | -p12(Y,Z) | -p14(X,U) | p24(U,Z).
% 64 [] -p12(X,Z) | -p12(X,Y) | p12(Z,Y).
% 67 [] -p2(X,Z) | -p2(X,Y) | p2(Z,Y).
% 72 [] -p10(X,Z) | -p10(X,Y) | p10(Z,Y).
% 73 [] p12(f13(f16(c39),f17(c39)),f13(c40,c41)).
% 75 [] p24(f15(c29,f13(c40,c41)),f13(c32,c33)).
% 86 [] p2(f17(c31),c33).
% 89 [] p10(f16(c31),c32).
% 91 [] p12(X,X).
% 92 [] p14(X,X).
% 94 [] p2(X,X).
% 98 [] p7(X,X).
% 99 [] p10(X,X).
% 102 [] -p24(f15(c29,f13(f16(c39),f17(c39))),f13(c32,c33)).
% 168 [hyper:67,86,94] p2(c33,f17(c31)).
% 196 [hyper:59,89,86] p12(f13(f16(c31),f17(c31)),f13(c32,c33)).
% 202 [hyper:72,89,99] p10(c32,f16(c31)).
% 256 [hyper:59,202,168] p12(f13(c32,c33),f13(f16(c31),f17(c31))).
% 1447 [hyper:64,73,91] p12(f13(c40,c41),f13(f16(c39),f17(c39))).
% 3660 [hyper:62,256,75,92] p24(f15(c29,f13(c40,c41)),f13(f16(c31),f17(c31))).
% 3794 [hyper:58,1447,98] p14(f15(X,f13(c40,c41)),f15(X,f13(f16(c39),f17(c39)))).
% 14698 [hyper:62,3794,3660,196,cut:102] 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 4
% seconds given: 27
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 843
% derived clauses: 58371
% kept clauses: 4244
% kept size sum: 67454
% kept mid-nuclei: 10260
% kept new demods: 0
% forw unit-subs: 23183
% forw double-subs: 7962
% forw overdouble-subs: 732
% backward subs: 0
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime: 1.16
% process. runtime: 1.16
% specific non-discr-tree subsumption statistics:
% tried: 9334
% length fails: 1984
% strength fails: 24
% predlist fails: 4416
% aux str. fails: 512
% by-lit fails: 0
% full subs tried: 1168
% full subs fail: 1002
%
% ; 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/SYN659-1+noeq.in")
%
%------------------------------------------------------------------------------