TSTP Solution File: SET831-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET831-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 29.8s
% Output : Assurance 29.8s
% 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/SystemOnTPTP27700/SET/SET831-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 2 7)
% (binary-unit 9 #f 2 7)
% (binary-double 9 #f 2 7)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 2 7)
% (binary-order 25 #f 2 7)
% (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(14,40,0,28,0,0,30716,4,2378,32607,5,2503,32607,1,2503,32607,50,2504,32607,40,2504,32621,0,2504,32635,50,2504,32649,0,2504,32663,50,2504,32677,0,2506,32691,50,2506,32705,0,2506,32719,50,2506,32733,0,2506,32747,50,2506,32761,0,2507,32775,50,2508,32789,0,2508,32803,50,2508,32817,0,2509,32831,50,2509,32845,0,2509,32859,50,2509,32873,0,2509,32887,50,2509,32901,0,2511,32915,50,2511,32929,0,2511,32943,50,2511,32957,0,2512,32971,50,2512,32985,0,2512,32999,50,2512,33013,0,2512,33027,50,2512,33041,0,2514,33055,50,2514,33069,0,2514,33083,50,2514,33097,0,2515,33111,50,2515,33125,0,2515,33139,50,2515,33153,0,2515,33167,50,2515,33167,40,2515,33181,0,2517,49089,3,2968)
%
%
% START OF PROOF
% 33169 [] -c_in(X,c_inter(Y,Z,U),U) | c_in(X,Z,U).
% 33170 [] -c_in(X,c_inter(Y,Z,U),U) | c_in(X,Y,U).
% 33171 [] c_in(X,c_inter(Y,Z,U),U) | -c_in(X,Y,U) | -c_in(X,Z,U).
% 33172 [] -c_lessequals(X,Y,tc_set(Z)) | -c_in(U,X,Z) | c_in(U,Y,Z).
% 33173 [] c_in(c_^main_^osubset^i__1(X,Y,Z),X,Z) | c_lessequals(X,Y,tc_set(Z)).
% 33174 [] -c_in(c_^main_^osubset^i__1(X,Y,Z),Y,Z) | c_lessequals(X,Y,tc_set(Z)).
% 33175 [] -c_lessequals(Y,X,tc_set(Z)) | -c_lessequals(X,Y,tc_set(Z)) | equal(Y,X).
% 33176 [] equal(v_^x,c_inter(v_^y,v_^z,t_a)) | c_lessequals(v_^x,v_^y,tc_set(t_a)).
% 33177 [] equal(v_^x,c_inter(v_^y,v_^z,t_a)) | c_lessequals(v_^x,v_^z,tc_set(t_a)).
% 33178 [] -equal(v_^x,c_inter(v_^y,v_^z,t_a)) | -c_lessequals(v_^x,v_^y,tc_set(t_a)) | -c_lessequals(v_^x,v_^z,tc_set(t_a)) | c_lessequals(v_x,v_^y,tc_set(t_a)).
% 33179 [] -equal(v_^x,c_inter(v_^y,v_^z,t_a)) | -c_lessequals(v_^x,v_^y,tc_set(t_a)) | -c_lessequals(v_^x,v_^z,tc_set(t_a)) | c_lessequals(v_x,v_^z,tc_set(t_a)).
% 33180 [?] ?
% 33181 [] equal(v_^x,c_inter(v_^y,v_^z,t_a)) | -c_lessequals(X,v_^z,tc_set(t_a)) | -c_lessequals(X,v_^y,tc_set(t_a)) | c_lessequals(X,v_^x,tc_set(t_a)).
% 33187 [para:33176.1.2,33170.1.2] c_lessequals(v_^x,v_^y,tc_set(t_a)) | -c_in(X,v_^x,t_a) | c_in(X,v_^y,t_a).
% 33189 [para:33177.1.2,33169.1.2] c_lessequals(v_^x,v_^z,tc_set(t_a)) | -c_in(X,v_^x,t_a) | c_in(X,v_^z,t_a).
% 33196 [binary:33169.2,33174] -c_in(c_^main_^osubset^i__1(X,Y,Z),c_inter(U,Y,Z),Z) | c_lessequals(X,Y,tc_set(Z)).
% 33197 [binary:33170.2,33174] -c_in(c_^main_^osubset^i__1(X,Y,Z),c_inter(Y,U,Z),Z) | c_lessequals(X,Y,tc_set(Z)).
% 33200 [binary:33173,33174] c_lessequals(X,X,tc_set(Y)).
% 33202 [binary:33169.2,33172.2] -c_in(X,c_inter(Y,Z,U),U) | -c_lessequals(Z,V,tc_set(U)) | c_in(X,V,U).
% 33244 [binary:33173,33187.2,factor:binarycut:33174] c_lessequals(v_^x,v_^y,tc_set(t_a)).
% 33246 [binary:33172,33244] -c_in(X,v_^x,t_a) | c_in(X,v_^y,t_a).
% 33252 [binary:33170.2,33246] -c_in(X,c_inter(v_^x,Y,t_a),t_a) | c_in(X,v_^y,t_a).
% 33257 [input:33180,cut:33244] -equal(v_^x,c_inter(v_^y,v_^z,t_a)) | -c_lessequals(v_x,v_^x,tc_set(t_a)) | -c_lessequals(v_^x,v_^z,tc_set(t_a)).
% 33279 [binary:33173,33189.2,factor:binarycut:33174] c_lessequals(v_^x,v_^z,tc_set(t_a)).
% 33280 [binary:33172,33279] -c_in(X,v_^x,t_a) | c_in(X,v_^z,t_a).
% 33283 [binary:33257.3,33279] -equal(v_^x,c_inter(v_^y,v_^z,t_a)) | -c_lessequals(v_x,v_^x,tc_set(t_a)).
% 33319 [binary:33169.2,33171.2] -c_in(X,c_inter(Y,Z,U),U) | c_in(X,c_inter(Z,V,U),U) | -c_in(X,V,U).
% 33321 [binary:33170.2,33171.2] -c_in(X,c_inter(Y,Z,U),U) | c_in(X,c_inter(Y,V,U),U) | -c_in(X,V,U).
% 33324 [binary:33173,33171.3] c_in(c_^main_^osubset^i__1(X,Y,Z),c_inter(U,X,Z),Z) | -c_in(c_^main_^osubset^i__1(X,Y,Z),U,Z) | c_lessequals(X,Y,tc_set(Z)).
% 33334 [binary:33280.2,33171.3,factor] c_in(X,c_inter(v_^x,v_^z,t_a),t_a) | -c_in(X,v_^x,t_a).
% 33347 [binary:33173.2,33283.2] c_in(c_^main_^osubset^i__1(v_x,v_^x,t_a),v_x,t_a) | -equal(v_^x,c_inter(v_^y,v_^z,t_a)).
% 33349 [binary:33175.3,33283] -c_lessequals(v_x,v_^x,tc_set(t_a)) | -c_lessequals(c_inter(v_^y,v_^z,t_a),v_^x,tc_set(X)) | -c_lessequals(v_^x,c_inter(v_^y,v_^z,t_a),tc_set(X)).
% 33451 [binary:33173,33196] c_lessequals(c_inter(X,Y,Z),Y,tc_set(Z)).
% 33500 [binary:33173,33197] c_lessequals(c_inter(X,Y,Z),X,tc_set(Z)).
% 35779 [binary:33178.2,33244,cut:33279] -equal(v_^x,c_inter(v_^y,v_^z,t_a)) | c_lessequals(v_x,v_^y,tc_set(t_a)).
% 35931 [binary:33179.2,33244,cut:33279] -equal(v_^x,c_inter(v_^y,v_^z,t_a)) | c_lessequals(v_x,v_^z,tc_set(t_a)).
% 35932 [binary:33172,35931.2] -equal(v_^x,c_inter(v_^y,v_^z,t_a)) | -c_in(X,v_x,t_a) | c_in(X,v_^z,t_a).
% 36435 [binary:33347,35932.2] c_in(c_^main_^osubset^i__1(v_x,v_^x,t_a),v_^z,t_a) | -equal(v_^x,c_inter(v_^y,v_^z,t_a)).
% 38549 [binary:33170.2,33319.3,factor] -c_in(X,c_inter(Y,Z,U),U) | c_in(X,c_inter(Z,Y,U),U).
% 38560 [binary:33252.2,33319.3,factor] -c_in(X,c_inter(v_^x,Y,t_a),t_a) | c_in(X,c_inter(Y,v_^y,t_a),t_a).
% 38643 [binary:33334,38560] c_in(X,c_inter(v_^z,v_^y,t_a),t_a) | -c_in(X,v_^x,t_a).
% 38681 [binary:38549,38643] c_in(X,c_inter(v_^y,v_^z,t_a),t_a) | -c_in(X,v_^x,t_a).
% 38685 [binary:33173,38681.2] c_in(c_^main_^osubset^i__1(v_^x,X,t_a),c_inter(v_^y,v_^z,t_a),t_a) | c_lessequals(v_^x,X,tc_set(t_a)).
% 50130 [binary:33174,38685] c_lessequals(v_^x,c_inter(v_^y,v_^z,t_a),tc_set(t_a)).
% 50143 [binary:33175,50130] -c_lessequals(c_inter(v_^y,v_^z,t_a),v_^x,tc_set(t_a)) | equal(v_^x,c_inter(v_^y,v_^z,t_a)).
% 50145 [binary:33349.3,50130] -c_lessequals(c_inter(v_^y,v_^z,t_a),v_^x,tc_set(t_a)) | -c_lessequals(v_x,v_^x,tc_set(t_a)).
% 50150 [binary:33181.4,50145,cut:33500,cut:33451,binarycut:33283] -c_lessequals(v_x,v_^x,tc_set(t_a)).
% 50161 [binary:33174.2,50150] -c_in(c_^main_^osubset^i__1(v_x,v_^x,t_a),v_^x,t_a).
% 50706 [binary:33181.4,50143,cut:33500,cut:33451] equal(v_^x,c_inter(v_^y,v_^z,t_a)).
% 50710 [binary:35779,50143.2,demod:50706,cut:33200] c_lessequals(v_x,v_^y,tc_set(t_a)).
% 50715 [binary:36435.2,50143.2,demod:50706,cut:33200] c_in(c_^main_^osubset^i__1(v_x,v_^x,t_a),v_^z,t_a).
% 50720 [binary:33202.2,50710] -c_in(X,c_inter(Y,v_x,t_a),t_a) | c_in(X,v_^y,t_a).
% 50761 [binary:33324.2,50715,cut:50150] c_in(c_^main_^osubset^i__1(v_x,v_^x,t_a),c_inter(v_^z,v_x,t_a),t_a).
% 51029 [binary:33321.3,50720.2,factor] -c_in(X,c_inter(Y,v_x,t_a),t_a) | c_in(X,c_inter(Y,v_^y,t_a),t_a).
% 52463 [binary:50761,51029] c_in(c_^main_^osubset^i__1(v_x,v_^x,t_a),c_inter(v_^z,v_^y,t_a),t_a).
% 52469 [binary:38549,52463,demod:50706,cut:50161] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using unit paramodulation strategy
% using unit strategy
% using double 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 7
% clause depth limited to 2
% seconds given: 9
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 1301
% derived clauses: 401648
% kept clauses: 32406
% kept size sum: 0
% kept mid-nuclei: 15307
% kept new demods: 6
% forw unit-subs: 29908
% forw double-subs: 67105
% forw overdouble-subs: 126436
% backward subs: 633
% fast unit cutoff: 8529
% full unit cutoff: 42
% dbl unit cutoff: 491
% real runtime : 32.0
% process. runtime: 31.80
% specific non-discr-tree subsumption statistics:
% tried: 8774159
% length fails: 645763
% strength fails: 1423460
% predlist fails: 2406058
% aux str. fails: 36373
% by-lit fails: 475385
% full subs tried: 3441357
% full subs fail: 3337612
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP27700/SET/SET831-2+eq_r.in")
% WARNING: TreeLimitedRun lost 29.83s, total lost is 29.83s
%
%------------------------------------------------------------------------------