TSTP Solution File: SWV246-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWV246-2 : TPTP v3.4.2. Released v3.2.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 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 1003MB
% OS : Linux 2.6.11-1.1369_FC4
% 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: /tmp/SystemOnTPTP20323/SWV/SWV246-2+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 4 5)
% (binary-unit 10 #f 4 5)
% (binary-double 16 #f)
% (binary 16 #t 4 5)
% (binary-posweight-order 181 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 54 #f)
% (binary-order 27 #f 4 5)
% (binary-weightorder 71 #f)
% (binary-order 27 #f)
% (hyper-order 54 #f)
% (binary 63 #t)
%
%
% **** EMPTY CLAUSE DERIVED ****
%
%
% timer checkpoints: c(8,40,0,16,0,0)
%
%
% START OF PROOF
% 9 [] -c_in(c_^message_^omsg_^o^m^pair(X,Y),c_^message_^oanalz(Z),tc_^message_^omsg) | c_in(Y,c_^message_^oanalz(Z),tc_^message_^omsg).
% 10 [] -c_in(c_^message_^omsg_^o^m^pair(X,Y),c_^message_^osynth(Z),tc_^message_^omsg) | c_in(c_^message_^omsg_^o^m^pair(X,Y),Z,tc_^message_^omsg) | c_in(Y,c_^message_^osynth(Z),tc_^message_^omsg).
% 11 [] c_in(X,c_^message_^oanalz(Y),tc_^message_^omsg) | -c_in(X,Y,tc_^message_^omsg).
% 12 [] c_in(X,c_union(Y,Z,U),U) | -c_in(X,Z,U).
% 13 [] c_in(X,c_union(Y,Z,U),U) | -c_in(X,Y,U).
% 14 [] -c_in(X,c_union(Y,Z,U),U) | c_in(X,Z,U) | c_in(X,Y,U).
% 15 [] c_in(c_^message_^omsg_^o^m^pair(v_^x,v_^y),c_union(c_^message_^oanalz(c_union(v_^g,v_^h,tc_^message_^omsg)),c_^message_^osynth(v_^g),tc_^message_^omsg),tc_^message_^omsg).
% 16 [] -c_in(v_^y,c_union(c_^message_^oanalz(c_union(v_^g,v_^h,tc_^message_^omsg)),c_^message_^osynth(v_^g),tc_^message_^omsg),tc_^message_^omsg).
% 21 [hyper:14,15] c_in(c_^message_^omsg_^o^m^pair(v_^x,v_^y),c_^message_^oanalz(c_union(v_^g,v_^h,tc_^message_^omsg)),tc_^message_^omsg) | c_in(c_^message_^omsg_^o^m^pair(v_^x,v_^y),c_^message_^osynth(v_^g),tc_^message_^omsg).
% 24 [hyper:9,21] c_in(v_^y,c_^message_^oanalz(c_union(v_^g,v_^h,tc_^message_^omsg)),tc_^message_^omsg) | c_in(c_^message_^omsg_^o^m^pair(v_^x,v_^y),c_^message_^osynth(v_^g),tc_^message_^omsg).
% 39 [hyper:13,24,slowcut:16] c_in(c_^message_^omsg_^o^m^pair(v_^x,v_^y),c_^message_^osynth(v_^g),tc_^message_^omsg).
% 41 [hyper:10,39] c_in(c_^message_^omsg_^o^m^pair(v_^x,v_^y),v_^g,tc_^message_^omsg) | c_in(v_^y,c_^message_^osynth(v_^g),tc_^message_^omsg).
% 65 [hyper:12,41,slowcut:16] c_in(c_^message_^omsg_^o^m^pair(v_^x,v_^y),v_^g,tc_^message_^omsg).
% 69 [hyper:13,65] c_in(c_^message_^omsg_^o^m^pair(v_^x,v_^y),c_union(v_^g,X,tc_^message_^omsg),tc_^message_^omsg).
% 92 [hyper:11,69] c_in(c_^message_^omsg_^o^m^pair(v_^x,v_^y),c_^message_^oanalz(c_union(v_^g,X,tc_^message_^omsg)),tc_^message_^omsg).
% 108 [hyper:9,92] c_in(v_^y,c_^message_^oanalz(c_union(v_^g,X,tc_^message_^omsg)),tc_^message_^omsg).
% 115 [hyper:13,108,slowcut:16] 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 5
% clause depth limited to 4
% seconds given: 27
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 48
% derived clauses: 324
% kept clauses: 86
% kept size sum: 1001
% kept mid-nuclei: 0
% kept new demods: 0
% forw unit-subs: 105
% forw double-subs: 16
% forw overdouble-subs: 0
% backward subs: 13
% fast unit cutoff: 0
% full unit cutoff: 2
% dbl unit cutoff: 0
% real runtime : 0.2
% process. runtime: 0.0
% specific non-discr-tree subsumption statistics:
% tried: 0
% length fails: 0
% strength fails: 0
% predlist fails: 0
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 0
% full subs fail: 0
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP20323/SWV/SWV246-2+noeq.in")
%
%------------------------------------------------------------------------------