%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWV248-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 : art10.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2794MHz
% Memory : 1003MB
% OS : Linux 2.6.11-1.1369_FC4
% CPULimit : 600s
% Result : Unsatisfiable 5.0s
% Output : Assurance 5.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/SystemOnTPTP7427/SWV/SWV248-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(9,40,0,18,0,0)
%
%
% START OF PROOF
% 10 [] c_in(X,c_^message_^oanalz(Y),tc_^message_^omsg) | -c_in(X,Y,tc_^message_^omsg).
% 11 [] c_lessequals(c_^message_^oanalz(X),c_^message_^oanalz(Y),tc_set(tc_^message_^omsg)) | -c_lessequals(X,Y,tc_set(tc_^message_^omsg)).
% 12 [] c_in(X,c_^message_^osynth(Y),tc_^message_^omsg) | -c_in(X,Y,tc_^message_^omsg).
% 13 [] c_in(X,c_union(Y,Z,U),U) | -c_in(X,Z,U).
% 14 [] c_in(X,c_union(Y,Z,U),U) | -c_in(X,Y,U).
% 15 [] c_lessequals(c_union(X,Y,Z),U,tc_set(Z)) | -c_lessequals(X,U,tc_set(Z)) | -c_lessequals(Y,U,tc_set(Z)).
% 16 [] c_in(c_^main_^osubset^i__1(X,Y,Z),X,Z) | c_lessequals(X,Y,tc_set(Z)).
% 17 [] -c_in(c_^main_^osubset^i__1(X,Y,Z),Y,Z) | c_lessequals(X,Y,tc_set(Z)).
% 18 [] -c_lessequals(c_union(c_^message_^oanalz(c_union(v_^g,v_^h,tc_^message_^omsg)),c_^message_^osynth(v_^g),tc_^message_^omsg),c_^message_^oanalz(c_union(c_^message_^osynth(v_^g),v_^h,tc_^message_^omsg)),tc_set(tc_^message_^omsg)).
% 26 [hyper:12,16] c_in(c_^main_^osubset^i__1(X,Y,tc_^message_^omsg),c_^message_^osynth(X),tc_^message_^omsg) | c_lessequals(X,Y,tc_set(tc_^message_^omsg)).
% 27 [hyper:13,16] c_in(c_^main_^osubset^i__1(X,Y,Z),c_union(U,X,Z),Z) | c_lessequals(X,Y,tc_set(Z)).
% 28 [hyper:14,16] c_in(c_^main_^osubset^i__1(X,Y,Z),c_union(X,U,Z),Z) | c_lessequals(X,Y,tc_set(Z)).
% 299 [hyper:14,26] c_in(c_^main_^osubset^i__1(X,Y,tc_^message_^omsg),c_union(c_^message_^osynth(X),Z,tc_^message_^omsg),tc_^message_^omsg) | c_lessequals(X,Y,tc_set(tc_^message_^omsg)).
% 396 [hyper:17,27] c_lessequals(X,c_union(Y,X,Z),tc_set(Z)).
% 491 [hyper:10,28] c_in(c_^main_^osubset^i__1(X,Y,tc_^message_^omsg),c_^message_^oanalz(c_union(X,Z,tc_^message_^omsg)),tc_^message_^omsg) | c_lessequals(X,Y,tc_set(tc_^message_^omsg)).
% 24027 [hyper:17,299] c_lessequals(X,c_union(c_^message_^osynth(X),Y,tc_^message_^omsg),tc_set(tc_^message_^omsg)).
% 24037 [hyper:15,24027,396] c_lessequals(c_union(X,Y,tc_^message_^omsg),c_union(c_^message_^osynth(X),Y,tc_^message_^omsg),tc_set(tc_^message_^omsg)).
% 24183 [hyper:11,24037] c_lessequals(c_^message_^oanalz(c_union(X,Y,tc_^message_^omsg)),c_^message_^oanalz(c_union(c_^message_^osynth(X),Y,tc_^message_^omsg)),tc_set(tc_^message_^omsg)).
% 40317 [hyper:17,491] c_lessequals(X,c_^message_^oanalz(c_union(X,Y,tc_^message_^omsg)),tc_set(tc_^message_^omsg)).
% 40504 [hyper:15,40317,24183,slowcut:18] 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
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 1009
% derived clauses: 311162
% kept clauses: 38600
% kept size sum: 0
% kept mid-nuclei: 1710
% kept new demods: 0
% forw unit-subs: 10929
% forw double-subs: 18488
% forw overdouble-subs: 12290
% backward subs: 23
% fast unit cutoff: 0
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 8.98
% process. runtime: 8.96
% specific non-discr-tree subsumption statistics:
% tried: 339740
% length fails: 8234
% strength fails: 57722
% predlist fails: 208
% aux str. fails: 79392
% by-lit fails: 107
% full subs tried: 194077
% full subs fail: 181451
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP7427/SWV/SWV248-2+noeq.in")
% WARNING: TreeLimitedRun lost 4.97s, total lost is 4.97s
%
%------------------------------------------------------------------------------