TSTP Solution File: SWV261-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWV261-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 : art09.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 25.0s
% Output : Assurance 25.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/SystemOnTPTP9094/SWV/SWV261-2+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: neq
% detected subclass: medium
%
% strategies selected:
% (hyper 25 #f 3 5)
% (binary-unit 9 #f 3 5)
% (binary-double 9 #f 3 5)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 3 5)
% (binary-order 25 #f 3 5)
% (binary-posweight-order 101 #f)
% (binary-posweight-lex-big-order 25 #f)
% (binary-posweight-lex-small-order 9 #f)
% (binary-order-sos 50 #t)
% (binary-unit-uniteq 25 #f)
% (binary-weightorder 50 #f)
% (binary-order 50 #f)
% (hyper-order 30 #f)
% (binary 112 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(11,40,0,22,0,0,38673,4,1901,62632,5,2501,62632,1,2501,62632,50,2502,62632,40,2502,62643,0,2502)
%
%
% START OF PROOF
% 62634 [] c_lessequals(c_^message_^oparts(c_union(X,Y,tc_^message_^omsg)),c_union(c_^message_^oparts(X),c_^message_^oparts(Y),tc_^message_^omsg),tc_set(tc_^message_^omsg)).
% 62635 [] c_lessequals(c_^message_^oparts(X),c_^message_^oparts(Y),tc_set(tc_^message_^omsg)) | -c_lessequals(X,Y,tc_set(tc_^message_^omsg)).
% 62636 [] c_in(X,c_union(Y,Z,U),U) | -c_in(X,Z,U).
% 62637 [] c_in(X,c_union(Y,Z,U),U) | -c_in(X,Y,U).
% 62638 [] -c_in(X,c_insert(Y,Z,U),U) | c_in(X,Z,U) | equal(X,Y).
% 62639 [] c_in(c_^main_^osubset^i__1(X,Y,Z),X,Z) | c_lessequals(X,Y,tc_set(Z)).
% 62640 [] -c_in(c_^main_^osubset^i__1(X,Y,Z),Y,Z) | c_lessequals(X,Y,tc_set(Z)).
% 62641 [] -c_lessequals(U,X,tc_set(Z)) | -c_lessequals(X,Y,tc_set(Z)) | c_lessequals(U,Y,tc_set(Z)).
% 62642 [] c_in(v_^x,v_^g,tc_^message_^omsg).
% 62643 [] -c_lessequals(c_^message_^oparts(c_insert(v_^x,v_^h,tc_^message_^omsg)),c_union(c_^message_^oparts(v_^g),c_^message_^oparts(v_^h),tc_^message_^omsg),tc_set(tc_^message_^omsg)).
% 62648 [binary:62642,62637.2] c_in(v_^x,c_union(v_^g,X,tc_^message_^omsg),tc_^message_^omsg).
% 62657 [binary:62643,62641.3] -c_lessequals(X,c_union(c_^message_^oparts(v_^g),c_^message_^oparts(v_^h),tc_^message_^omsg),tc_set(tc_^message_^omsg)) | -c_lessequals(c_^message_^oparts(c_insert(v_^x,v_^h,tc_^message_^omsg)),X,tc_set(tc_^message_^omsg)).
% 62661 [binary:62634,62657] -c_lessequals(c_^message_^oparts(c_insert(v_^x,v_^h,tc_^message_^omsg)),c_^message_^oparts(c_union(v_^g,v_^h,tc_^message_^omsg)),tc_set(tc_^message_^omsg)).
% 62662 [binary:62635,62661] -c_lessequals(c_insert(v_^x,v_^h,tc_^message_^omsg),c_union(v_^g,v_^h,tc_^message_^omsg),tc_set(tc_^message_^omsg)).
% 62664 [binary:62639.2,62662] c_in(c_^main_^osubset^i__1(c_insert(v_^x,v_^h,tc_^message_^omsg),c_union(v_^g,v_^h,tc_^message_^omsg),tc_^message_^omsg),c_insert(v_^x,v_^h,tc_^message_^omsg),tc_^message_^omsg).
% 62665 [binary:62640.2,62662] -c_in(c_^main_^osubset^i__1(c_insert(v_^x,v_^h,tc_^message_^omsg),c_union(v_^g,v_^h,tc_^message_^omsg),tc_^message_^omsg),c_union(v_^g,v_^h,tc_^message_^omsg),tc_^message_^omsg).
% 62671 [binary:62636,62665] -c_in(c_^main_^osubset^i__1(c_insert(v_^x,v_^h,tc_^message_^omsg),c_union(v_^g,v_^h,tc_^message_^omsg),tc_^message_^omsg),v_^h,tc_^message_^omsg).
% 62679 [binary:62638,62664,cut:62671] equal(c_^main_^osubset^i__1(c_insert(v_^x,v_^h,tc_^message_^omsg),c_union(v_^g,v_^h,tc_^message_^omsg),tc_^message_^omsg),v_^x).
% 62681 [para:62679.1.1,62640.1.1,cut:62648,cut:62662] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using unit strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% clause length limited to 5
% clause depth limited to 3
% seconds given: 9
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 418
% derived clauses: 277031
% kept clauses: 47931
% kept size sum: 384
% kept mid-nuclei: 1257
% kept new demods: 1
% forw unit-subs: 4760
% forw double-subs: 8412
% forw overdouble-subs: 39229
% backward subs: 31
% fast unit cutoff: 2163
% full unit cutoff: 1
% dbl unit cutoff: 14
% real runtime : 25.6
% process. runtime: 25.2
% specific non-discr-tree subsumption statistics:
% tried: 8106676
% length fails: 502113
% strength fails: 2073063
% predlist fails: 274577
% aux str. fails: 186246
% by-lit fails: 391764
% full subs tried: 4129298
% full subs fail: 4089899
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP9094/SWV/SWV261-2+eq_r.in")
% WARNING: TreeLimitedRun lost 24.97s, total lost is 24.97s
% Killed 1 orphans
%
%------------------------------------------------------------------------------