TSTP Solution File: SWV251-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWV251-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/SystemOnTPTP30633/SWV/SWV251-2+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: heq
% detected subclass: medium
% detected subclass: short
%
% strategies selected:
% (binary-posweight-order 57 #f 5 5)
% (binary-unit 28 #f 5 5)
% (binary-double 28 #f 5 5)
% (binary 45 #t 5 5)
% (hyper 11 #t 5 5)
% (hyper 28 #f)
% (binary-unit-uniteq 16 #f)
% (binary-weightorder 22 #f)
% (binary-posweight-order 159 #f)
% (binary-posweight-lex-big-order 57 #f)
% (binary-posweight-lex-small-order 11 #f)
% (binary-order 28 #f)
% (binary-unit 45 #f)
% (binary 65 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(14,40,0,28,0,0)
%
%
% START OF PROOF
% 16 [] c_lessequals(c_^message_^oanalz(X),c_^message_^oanalz(Y),tc_set(tc_^message_^omsg)) | -c_lessequals(X,Y,tc_set(tc_^message_^omsg)).
% 17 [] equal(c_union(c_minus(X,Y,tc_set(Z)),Y,Z),c_union(X,Y,Z)).
% 19 [] -c_lessequals(c_union(X,Y,Z),U,tc_set(Z)) | c_lessequals(X,U,tc_set(Z)).
% 20 [] -c_lessequals(c_union(X,Y,Z),U,tc_set(Z)) | c_lessequals(Y,U,tc_set(Z)).
% 21 [] 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)).
% 22 [] equal(c_minus(c_insert(X,Y,Z),U,tc_set(Z)),c_minus(Y,U,tc_set(Z))) | -c_in(X,U,Z).
% 23 [] -c_lessequals(X,Y,tc_set(Z)) | -c_in(U,X,Z) | c_in(U,Y,Z).
% 24 [] -c_lessequals(Y,X,tc_set(Z)) | -c_lessequals(X,Y,tc_set(Z)) | equal(Y,X).
% 25 [] c_lessequals(X,X,tc_set(Y)).
% 26 [] c_in(v_^x,c_^message_^osynth(c_^message_^oanalz(v_^g)),tc_^message_^omsg).
% 27 [] c_in(v_x,c_^message_^oanalz(c_insert(v_^x,v_^h,tc_^message_^omsg)),tc_^message_^omsg).
% 28 [] -c_in(v_x,c_^message_^oanalz(c_union(c_^message_^osynth(c_^message_^oanalz(v_^g)),v_^h,tc_^message_^omsg)),tc_^message_^omsg).
% 32 [binary:25,19] c_lessequals(X,c_union(X,Y,Z),tc_set(Z)).
% 34 [binary:16.2,32] c_lessequals(c_^message_^oanalz(X),c_^message_^oanalz(c_union(X,Y,tc_^message_^omsg)),tc_set(tc_^message_^omsg)).
% 40 [binary:25,20] c_lessequals(X,c_union(Y,X,Z),tc_set(Z)).
% 65 [binary:40,21.2] c_lessequals(c_union(X,Y,Z),c_union(U,X,Z),tc_set(Z)) | -c_lessequals(Y,c_union(U,X,Z),tc_set(Z)).
% 88 [binary:26,22.2] equal(c_minus(c_insert(v_^x,X,tc_^message_^omsg),c_^message_^osynth(c_^message_^oanalz(v_^g)),tc_set(tc_^message_^omsg)),c_minus(X,c_^message_^osynth(c_^message_^oanalz(v_^g)),tc_set(tc_^message_^omsg))).
% 92 [binary:34,23] c_in(X,c_^message_^oanalz(c_union(Y,Z,tc_^message_^omsg)),tc_^message_^omsg) | -c_in(X,c_^message_^oanalz(Y),tc_^message_^omsg).
% 251 [binary:27,92.2] c_in(v_x,c_^message_^oanalz(c_union(c_insert(v_^x,v_^h,tc_^message_^omsg),X,tc_^message_^omsg)),tc_^message_^omsg).
% 391 [binary:32,65.2] c_lessequals(c_union(X,Y,Z),c_union(Y,X,Z),tc_set(Z)).
% 413 [binary:24,391,cut:391] equal(c_union(X,Y,Z),c_union(Y,X,Z)).
% 417 [para:413.1.1,28.1.2.1] -c_in(v_x,c_^message_^oanalz(c_union(v_^h,c_^message_^osynth(c_^message_^oanalz(v_^g)),tc_^message_^omsg)),tc_^message_^omsg).
% 658 [para:88.1.1,17.1.1.1,demod:17] equal(c_union(X,c_^message_^osynth(c_^message_^oanalz(v_^g)),tc_^message_^omsg),c_union(c_insert(v_^x,X,tc_^message_^omsg),c_^message_^osynth(c_^message_^oanalz(v_^g)),tc_^message_^omsg)).
% 927 [para:658.1.2,251.1.2.1,cut:417] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using first neg lit preferred strategy
% not using sos 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 5
% seconds given: 57
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 152
% derived clauses: 3322
% kept clauses: 860
% kept size sum: 16774
% kept mid-nuclei: 0
% kept new demods: 22
% forw unit-subs: 2047
% forw double-subs: 181
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 5
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.7
% process. runtime: 0.5
% specific non-discr-tree subsumption statistics:
% tried: 1
% length fails: 0
% strength fails: 0
% predlist fails: 0
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 1
% full subs fail: 1
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP30633/SWV/SWV251-2+eq_r.in")
% Killed 1 orphans
%
%------------------------------------------------------------------------------