TSTP Solution File: SET863-2 by Gandalf---c-2.6

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SET863-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 : art05.cs.miami.edu
% Model    : i686 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2795MHz
% 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/SystemOnTPTP18774/SET/SET863-2+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: nne
% detected subclass: medium
% 
% strategies selected: 
% (hyper 27 #f 4 9)
% (binary-unit 10 #f 4 9)
% (binary-double 16 #f 4 9)
% (binary 54 #t 4 9)
% (binary-order 27 #f 4 9)
% (binary-posweight-order 125 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 27 #f)
% (binary-weightorder 54 #f)
% (binary-order 54 #f)
% (hyper-order 43 #f)
% (binary 109 #t)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(14,40,0,28,0,0)
% 
% 
% START OF PROOF
% 15 [] -c_lessequals(X,Y,tc_set(Z)) | -c_in(U,X,Z) | c_in(U,Y,Z).
% 16 [] c_in(c_^main_^osubset^i__1(X,Y,Z),X,Z) | c_lessequals(X,Y,tc_set(Z)).
% 17 [] -c_in(c_^main_^osubset^i__1(X,Y,Z),Y,Z) | c_lessequals(X,Y,tc_set(Z)).
% 18 [] c_in(c_union(c_insert(X,c_emptyset,tc_set(Y)),Z,tc_set(Y)),c_^zorn_^ochain(U,Y),tc_set(tc_set(Y))) | -c_in(Z,c_^zorn_^ochain(U,Y),tc_set(tc_set(Y))) | c_in(c_^zorn_^ochain__extend__1(Z,X,Y),Z,tc_set(Y)) | -c_in(X,U,tc_set(Y)).
% 19 [] c_in(c_union(c_insert(X,c_emptyset,tc_set(Y)),Z,tc_set(Y)),c_^zorn_^ochain(U,Y),tc_set(tc_set(Y))) | -c_in(Z,c_^zorn_^ochain(U,Y),tc_set(tc_set(Y))) | -c_lessequals(c_^zorn_^ochain__extend__1(Z,X,Y),X,tc_set(Y)) | -c_in(X,U,tc_set(Y)).
% 20 [] -c_in(c_union(c_insert(X,c_emptyset,tc_set(Y)),Z,tc_set(Y)),c_^zorn_^ochain(U,Y),tc_set(tc_set(Y))) | -c_in(Z,c_^zorn_^omaxchain(U,Y),tc_set(tc_set(Y))) | c_in(c_^zorn_^omaxchain__super__lemma__1(Z,V,Y),Z,tc_set(Y)) | -c_in(W,X,Y) | c_in(W,V,Y).
% 21 [] -c_in(c_union(c_insert(X,c_emptyset,tc_set(Y)),Z,tc_set(Y)),c_^zorn_^ochain(U,Y),tc_set(tc_set(Y))) | -c_in(Z,c_^zorn_^omaxchain(U,Y),tc_set(tc_set(Y))) | -c_lessequals(c_^zorn_^omaxchain__super__lemma__1(Z,V,Y),V,tc_set(Y)) | -c_in(W,X,Y) | c_in(W,V,Y).
% 22 [] c_in(v_c,c_^zorn_^omaxchain(v_^s,t_a),tc_set(tc_set(t_a))).
% 23 [] c_in(v_c,c_^zorn_^ochain(v_^s,t_a),tc_set(tc_set(t_a))).
% 24 [] c_in(v_x,v_^s,tc_set(t_a)).
% 25 [] c_lessequals(v_y,v_x,tc_set(t_a)).
% 26 [] c_in(v_xa,v_x,t_a).
% 27 [] -c_in(v_xa,v_y,t_a).
% 28 [] -c_in(X,v_c,tc_set(t_a)) | c_lessequals(X,v_y,tc_set(t_a)).
% 41 [hyper:18,23,24] c_in(c_union(c_insert(v_x,c_emptyset,tc_set(t_a)),v_c,tc_set(t_a)),c_^zorn_^ochain(v_^s,t_a),tc_set(tc_set(t_a))) | c_in(c_^zorn_^ochain__extend__1(v_c,v_x,t_a),v_c,tc_set(t_a)).
% 758 [hyper:20,41,26,cut:22] c_in(c_^zorn_^ochain__extend__1(v_c,v_x,t_a),v_c,tc_set(t_a)) | c_in(c_^zorn_^omaxchain__super__lemma__1(v_c,X,t_a),v_c,tc_set(t_a)) | c_in(v_xa,X,t_a).
% 912 [hyper:27,758] c_in(c_^zorn_^omaxchain__super__lemma__1(v_c,v_y,t_a),v_c,tc_set(t_a)) | c_in(c_^zorn_^ochain__extend__1(v_c,v_x,t_a),v_c,tc_set(t_a)).
% 1169 [hyper:28,912] c_lessequals(c_^zorn_^omaxchain__super__lemma__1(v_c,v_y,t_a),v_y,tc_set(t_a)) | c_in(c_^zorn_^ochain__extend__1(v_c,v_x,t_a),v_c,tc_set(t_a)).
% 1276 [hyper:21,1169,41,26,cut:22,cut:27] c_in(c_^zorn_^ochain__extend__1(v_c,v_x,t_a),v_c,tc_set(t_a)).
% 1285 [hyper:28,1276] c_lessequals(c_^zorn_^ochain__extend__1(v_c,v_x,t_a),v_y,tc_set(t_a)).
% 1315 [hyper:15,1285,16] c_in(c_^main_^osubset^i__1(c_^zorn_^ochain__extend__1(v_c,v_x,t_a),X,t_a),v_y,t_a) | c_lessequals(c_^zorn_^ochain__extend__1(v_c,v_x,t_a),X,tc_set(t_a)).
% 1665 [hyper:15,1315,25] c_in(c_^main_^osubset^i__1(c_^zorn_^ochain__extend__1(v_c,v_x,t_a),X,t_a),v_x,t_a) | c_lessequals(c_^zorn_^ochain__extend__1(v_c,v_x,t_a),X,tc_set(t_a)).
% 1722 [hyper:15,1665,16,factor:binarycut:17] c_lessequals(c_^zorn_^ochain__extend__1(v_c,v_x,t_a),v_x,tc_set(t_a)).
% 1771 [hyper:19,1722,23,cut:24] c_in(c_union(c_insert(v_x,c_emptyset,tc_set(t_a)),v_c,tc_set(t_a)),c_^zorn_^ochain(v_^s,t_a),tc_set(tc_set(t_a))).
% 1840 [hyper:20,1771,26,cut:22] c_in(c_^zorn_^omaxchain__super__lemma__1(v_c,X,t_a),v_c,tc_set(t_a)) | c_in(v_xa,X,t_a).
% 2021 [hyper:27,1840] c_in(c_^zorn_^omaxchain__super__lemma__1(v_c,v_y,t_a),v_c,tc_set(t_a)).
% 2072 [hyper:28,2021] c_lessequals(c_^zorn_^omaxchain__super__lemma__1(v_c,v_y,t_a),v_y,tc_set(t_a)).
% 2119 [hyper:21,2072,1771,26,cut:22,cut:27] 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 9
% clause depth limited to 4
% seconds given: 27
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    61
%  derived clauses:   5637
%  kept clauses:      744
%  kept size sum:     29234
%  kept mid-nuclei:   740
%  kept new demods:   0
%  forw unit-subs:    827
%  forw double-subs: 873
%  forw overdouble-subs: 1481
%  backward subs:     9
%  fast unit cutoff:  113
%  full unit cutoff:  0
%  dbl  unit cutoff:  61
%  real runtime  :  0.25
%  process. runtime:  0.22
% specific non-discr-tree subsumption statistics: 
%  tried:           37869
%  length fails:    3208
%  strength fails:  6859
%  predlist fails:  10309
%  aux str. fails:  841
%  by-lit fails:    787
%  full subs tried: 15378
%  full subs fail:  13952
% 
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP18774/SET/SET863-2+noeq.in")
% Killed 1 orphans
% 
%------------------------------------------------------------------------------