%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWV279-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 : art01.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 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/SystemOnTPTP31981/SWV/SWV279-2+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: hne
% detected subclass: small
% detected subclass: short
%
% strategies selected:
% (hyper 29 #f 3 5)
% (binary-unit 11 #f 3 5)
% (binary-double 17 #f 3 5)
% (hyper 29 #f)
% (binary-unit 34 #f)
% (binary-weightorder 40 #f)
% (binary 17 #t)
% (binary-order 29 #f)
% (binary-posweight-order 111 #f 3 5)
% (binary-posweight-order 283 #f)
%
%
% SOS clause
% -c_in(v_^y,c_^event_^oused(v_^h),tc_^message_^omsg) | -c_in(v_^x,c_^event_^oused(v_^h),tc_^message_^omsg).
% was split for some strategies as:
% -c_in(v_^y,c_^event_^oused(v_^h),tc_^message_^omsg).
% -c_in(v_^x,c_^event_^oused(v_^h),tc_^message_^omsg).
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(8,40,0,16,0,0,32,50,0,40,0,0)
%
%
% START OF PROOF
% 33 [] -c_in(c_^message_^omsg_^o^m^pair(X,Y),c_^message_^oparts(Z),tc_^message_^omsg) | c_in(Y,c_^message_^oparts(Z),tc_^message_^omsg).
% 34 [] -c_in(c_^message_^omsg_^o^m^pair(X,Y),c_^message_^oparts(Z),tc_^message_^omsg) | c_in(X,c_^message_^oparts(Z),tc_^message_^omsg).
% 35 [] c_in(X,c_^message_^oparts(Y),tc_^message_^omsg) | -c_in(X,Y,tc_^message_^omsg).
% 36 [] c_lessequals(c_^message_^oparts(c_insert(X,c_emptyset,tc_^message_^omsg)),c_^event_^oused(Y),tc_set(tc_^message_^omsg)) | -c_in(X,c_^event_^oused(Y),tc_^message_^omsg).
% 37 [] c_in(X,c_insert(X,Y,Z),Z).
% 38 [] -c_lessequals(X,Y,tc_set(Z)) | -c_in(U,X,Z) | c_in(U,Y,Z).
% 39 [] c_in(c_^message_^omsg_^o^m^pair(v_^x,v_^y),c_^event_^oused(v_^h),tc_^message_^omsg).
% 40 [] -c_in(v_^y,c_^event_^oused(v_^h),tc_^message_^omsg) | -c_in(v_^x,c_^event_^oused(v_^h),tc_^message_^omsg).
% 41 [hyper:35,37] c_in(X,c_^message_^oparts(c_insert(X,Y,tc_^message_^omsg)),tc_^message_^omsg).
% 44 [hyper:36,39] c_lessequals(c_^message_^oparts(c_insert(c_^message_^omsg_^o^m^pair(v_^x,v_^y),c_emptyset,tc_^message_^omsg)),c_^event_^oused(v_^h),tc_set(tc_^message_^omsg)).
% 46 [hyper:33,41] c_in(X,c_^message_^oparts(c_insert(c_^message_^omsg_^o^m^pair(Y,X),Z,tc_^message_^omsg)),tc_^message_^omsg).
% 47 [hyper:34,41] c_in(X,c_^message_^oparts(c_insert(c_^message_^omsg_^o^m^pair(X,Y),Z,tc_^message_^omsg)),tc_^message_^omsg).
% 69 [hyper:38,44,46] c_in(v_^y,c_^event_^oused(v_^h),tc_^message_^omsg).
% 70 [hyper:38,44,47] c_in(v_^x,c_^event_^oused(v_^h),tc_^message_^omsg).
% 72 [hyper:40,69,cut:70] 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: 14
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 31
% derived clauses: 106
% kept clauses: 17
% kept size sum: 130
% kept mid-nuclei: 19
% kept new demods: 0
% forw unit-subs: 20
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 1
% full unit cutoff: 0
% 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/SystemOnTPTP31981/SWV/SWV279-2+noeq.in")
%
%------------------------------------------------------------------------------