TSTP Solution File: SWV249-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWV249-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 179.7s
% Output : Assurance 179.7s
% 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/SystemOnTPTP8834/SWV/SWV249-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 4 5)
% (binary-unit 28 #f 4 5)
% (binary-double 28 #f 4 5)
% (binary 45 #t 4 5)
% (hyper 11 #t 4 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(18,40,0,36,0,0,23307,3,2851,27403,4,4283,61317,5,5710,61317,5,5710,61317,1,5710,61317,50,5714,61317,40,5714,61335,0,5714,81524,3,7121,83219,4,7815,92220,5,8515,92220,5,8516,92221,1,8516,92221,50,8518,92221,40,8518,92239,0,8518,125375,3,9921,132756,4,10632,145834,5,11319,145835,5,11319,145835,1,11319,145835,50,11322,145835,40,11322,145853,0,11322,178602,3,13577,180935,4,14698,189609,5,15823,189611,5,15823,189611,1,15823,189611,50,15825,189611,40,15825,189629,0,15825,189630,50,15825,189648,0,15825,189649,50,15825,189667,0,15831,189668,50,15831,189686,0,15831,189687,50,15831,189705,0,15831,189706,50,15831,189724,0,15836,189725,50,15836,189743,0,15836,189744,50,15836,189762,0,15840,189763,50,15840,189781,0,15840,189782,50,15840,189800,0,15840,189801,50,15840,189819,0,15845,189820,50,15845,189838,0,15845,189839,50,15845,189857,0,15849,189858,50,15849,189876,0,15849,189877,50,15849,189895,0,15849,189896,50,15849,189914,0,15854,189915,50,15854,189933,0,15854,189934,50,15854,189952,0,15858,189953,50,15858,189953,40,15858,189971,0,15858,372015,4,17962)
%
%
% START OF PROOF
% 189955 [] equal(c_^message_^oanalz(c_union(c_^message_^oanalz(X),Y,tc_^message_^omsg)),c_^message_^oanalz(c_union(X,Y,tc_^message_^omsg))).
% 189956 [] c_lessequals(c_^message_^oanalz(X),c_^message_^oanalz(Y),tc_set(tc_^message_^omsg)) | -c_lessequals(X,Y,tc_set(tc_^message_^omsg)).
% 189957 [] equal(c_^message_^oanalz(c_union(c_^message_^osynth(X),Y,tc_^message_^omsg)),c_union(c_^message_^oanalz(c_union(X,Y,tc_^message_^omsg)),c_^message_^osynth(X),tc_^message_^omsg)).
% 189958 [] c_lessequals(X,X,Y) | -class_^orderings_^oorder(Y).
% 189960 [] equal(c_union(X,c_minus(Y,X,tc_set(Z)),Z),c_union(X,Y,Z)).
% 189962 [] equal(c_union(X,c_insert(Y,Z,U),U),c_union(c_insert(Y,X,U),Z,U)).
% 189963 [] -c_lessequals(c_union(X,Y,Z),U,tc_set(Z)) | c_lessequals(X,U,tc_set(Z)).
% 189964 [] -c_lessequals(c_union(X,Y,Z),U,tc_set(Z)) | c_lessequals(Y,U,tc_set(Z)).
% 189965 [] 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)).
% 189966 [] -c_lessequals(c_insert(X,Y,Z),U,tc_set(Z)) | c_lessequals(Y,U,tc_set(Z)).
% 189967 [] c_lessequals(c_insert(X,Y,Z),U,tc_set(Z)) | -c_lessequals(Y,U,tc_set(Z)) | -c_in(X,U,Z).
% 189968 [] -c_lessequals(Y,X,tc_set(Z)) | -c_lessequals(X,Y,tc_set(Z)) | equal(Y,X).
% 189969 [] class_^orderings_^oorder(tc_set(X)).
% 189970 [] c_in(v_^x,c_^message_^osynth(c_^message_^oanalz(v_^g)),tc_^message_^omsg).
% 189971 [] -c_lessequals(c_^message_^oanalz(c_insert(v_^x,v_^h,tc_^message_^omsg)),c_union(c_^message_^osynth(c_^message_^oanalz(v_^g)),c_^message_^oanalz(c_union(v_^g,v_^h,tc_^message_^omsg)),tc_^message_^omsg),tc_set(tc_^message_^omsg)).
% 189972 [hyper:189958,189969] c_lessequals(X,X,tc_set(Y)).
% 189973 [hyper:189963,189972] c_lessequals(X,c_union(X,Y,Z),tc_set(Z)).
% 189974 [hyper:189964,189972] c_lessequals(X,c_union(Y,X,Z),tc_set(Z)).
% 189978 [hyper:189966,189972] c_lessequals(X,c_insert(Y,X,Z),tc_set(Z)).
% 189982 [hyper:189967,189970,189972] c_lessequals(c_insert(v_^x,c_^message_^osynth(c_^message_^oanalz(v_^g)),tc_^message_^omsg),c_^message_^osynth(c_^message_^oanalz(v_^g)),tc_set(tc_^message_^omsg)).
% 189994 [hyper:189956,189974] c_lessequals(c_^message_^oanalz(X),c_^message_^oanalz(c_union(Y,X,tc_^message_^omsg)),tc_set(tc_^message_^omsg)).
% 189999 [hyper:189965,189974,189973] c_lessequals(c_union(X,Y,Z),c_union(Y,X,Z),tc_set(Z)).
% 190056 [hyper:189965,189994,189972] c_lessequals(c_union(c_^message_^oanalz(c_union(X,Y,tc_^message_^omsg)),c_^message_^oanalz(Y),tc_^message_^omsg),c_^message_^oanalz(c_union(X,Y,tc_^message_^omsg)),tc_set(tc_^message_^omsg)).
% 190135 [para:189955.1.1,189957.1.2.1] equal(c_^message_^oanalz(c_union(c_^message_^osynth(c_^message_^oanalz(X)),Y,tc_^message_^omsg)),c_union(c_^message_^oanalz(c_union(X,Y,tc_^message_^omsg)),c_^message_^osynth(c_^message_^oanalz(X)),tc_^message_^omsg)).
% 190182 [hyper:189968,189999,cut:189999] equal(c_union(X,Y,Z),c_union(Y,X,Z)).
% 190248 [para:189960.1.1,189955.1.1.1,demod:189955] equal(c_^message_^oanalz(c_union(X,Y,tc_^message_^omsg)),c_^message_^oanalz(c_union(X,c_minus(Y,c_^message_^oanalz(X),tc_set(tc_^message_^omsg)),tc_^message_^omsg))).
% 190302 [para:189962.1.2,189973.1.2] c_lessequals(c_insert(X,Y,Z),c_union(Y,c_insert(X,U,Z),Z),tc_set(Z)).
% 190503 [hyper:189968,189982,cut:189978] equal(c_insert(v_^x,c_^message_^osynth(c_^message_^oanalz(v_^g)),tc_^message_^omsg),c_^message_^osynth(c_^message_^oanalz(v_^g))).
% 193003 [hyper:189968,190056,cut:189973] equal(c_union(c_^message_^oanalz(c_union(X,Y,tc_^message_^omsg)),c_^message_^oanalz(Y),tc_^message_^omsg),c_^message_^oanalz(c_union(X,Y,tc_^message_^omsg))).
% 195126 [para:190503.1.1,190302.1.2.2] c_lessequals(c_insert(v_^x,X,tc_^message_^omsg),c_union(X,c_^message_^osynth(c_^message_^oanalz(v_^g)),tc_^message_^omsg),tc_set(tc_^message_^omsg)).
% 195161 [para:190182.1.1,195126.1.2] c_lessequals(c_insert(v_^x,X,tc_^message_^omsg),c_union(c_^message_^osynth(c_^message_^oanalz(v_^g)),X,tc_^message_^omsg),tc_set(tc_^message_^omsg)).
% 195191 [hyper:189956,195161] c_lessequals(c_^message_^oanalz(c_insert(v_^x,X,tc_^message_^omsg)),c_^message_^oanalz(c_union(c_^message_^osynth(c_^message_^oanalz(v_^g)),X,tc_^message_^omsg)),tc_set(tc_^message_^omsg)).
% 199823 [para:190135.1.2,190182.1.1] equal(c_^message_^oanalz(c_union(c_^message_^osynth(c_^message_^oanalz(X)),Y,tc_^message_^omsg)),c_union(c_^message_^osynth(c_^message_^oanalz(X)),c_^message_^oanalz(c_union(X,Y,tc_^message_^omsg)),tc_^message_^omsg)).
% 285601 [para:190248.1.2,193003.1.1.1,demod:190248] equal(c_union(c_^message_^oanalz(c_union(X,Y,tc_^message_^omsg)),c_^message_^oanalz(c_minus(Y,c_^message_^oanalz(X),tc_set(tc_^message_^omsg))),tc_^message_^omsg),c_^message_^oanalz(c_union(X,Y,tc_^message_^omsg))).
% 372016 [para:285601.1.2,189971.1.2.2,demod:199823,285601,cut:195191] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% seconds given: 28
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 10564
% derived clauses: 3379955
% kept clauses: 188643
% kept size sum: 0
% kept mid-nuclei: 74407
% kept new demods: 1736
% forw unit-subs: 854452
% forw double-subs: 242434
% forw overdouble-subs: 56977
% backward subs: 532
% fast unit cutoff: 20377
% full unit cutoff: 38
% dbl unit cutoff: 463
% real runtime : 180.40
% process. runtime: 179.96
% specific non-discr-tree subsumption statistics:
% tried: 1640646
% length fails: 53181
% strength fails: 111537
% predlist fails: 681172
% aux str. fails: 51377
% by-lit fails: 26826
% full subs tried: 688178
% full subs fail: 631099
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP8834/SWV/SWV249-2+eq_r.in")
% WARNING: TreeLimitedRun lost 179.71s, total lost is 179.71s
% Killed 1 orphans
%
%------------------------------------------------------------------------------