TSTP Solution File: SET860-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET860-1 : 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 : art07.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 109.4s
% Output : Assurance 109.4s
% 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/SystemOnTPTP32684/SET/SET860-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: neq
% detected subclass: big
%
% strategies selected:
% (hyper 28 #f 4 7)
% (binary-unit 28 #f 4 7)
% (binary-double 11 #f 4 7)
% (binary-double 17 #f)
% (binary-double 17 #t)
% (binary 87 #t 4 7)
% (binary-order 28 #f 4 7)
% (binary-posweight-order 58 #f)
% (binary-posweight-lex-big-order 28 #f)
% (binary-posweight-lex-small-order 11 #f)
% (binary-order-sos 28 #t)
% (binary-unit-uniteq 28 #f)
% (binary-weightorder 28 #f)
% (binary-weightorder-sos 17 #f)
% (binary-order 28 #f)
% (hyper-order 17 #f)
% (binary 141 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(1361,40,6,2722,0,12,348016,4,2131,370690,5,2813,370690,1,2813,370690,50,2818,370690,40,2818,372051,0,2819,407787,3,4220,412389,4,4920,424832,5,5620,424833,5,5621,424834,1,5621,424834,50,5625,424834,40,5625,426195,0,5626,446343,3,6177,451809,4,6452,463630,5,6727,463632,1,6727,463632,50,6730,463632,40,6730,464993,0,6731,504629,3,7582,529952,4,8007,543164,5,8432,543165,5,8433,543166,1,8433,543166,50,8439,543166,40,8439,544527,0,8440,581163,3,9292,587417,4,9716,592792,5,10141,592792,5,10142,592793,1,10142,592793,50,10145,592793,40,10145,594154,0,10146)
%
%
% START OF PROOF
% 592967 [] c_in(X,c_^union(Y,Z),Z) | -c_in(U,Y,tc_set(Z)) | -c_in(X,U,Z).
% 593091 [] c_in(c_^main_^o^union^e__1(X,Y,Z),Y,tc_set(Z)) | -c_in(X,c_^union(Y,Z),Z).
% 593092 [] c_in(X,c_^main_^o^union^e__1(X,Y,Z),Z) | -c_in(X,c_^union(Y,Z),Z).
% 593100 [] -c_lessequals(X,Y,tc_set(Z)) | -c_in(U,X,Z) | c_in(U,Y,Z).
% 593101 [] c_in(c_^main_^osubset^i__1(X,Y,Z),X,Z) | c_lessequals(X,Y,tc_set(Z)).
% 593102 [] -c_in(c_^main_^osubset^i__1(X,Y,Z),Y,Z) | c_lessequals(X,Y,tc_set(Z)).
% 594152 [] -c_lessequals(c_^union(v_^c,t_a),v_^a,tc_set(t_a)).
% 594153 [] -c_lessequals(v_^b,c_^union(v_^c,t_a),tc_set(t_a)).
% 594154 [] -c_in(X,v_^c,tc_set(t_a)) | c_lessequals(X,v_^a,tc_set(t_a)) | c_lessequals(v_^b,X,tc_set(t_a)).
% 594164 [binary:593101.2,594152] c_in(c_^main_^osubset^i__1(c_^union(v_^c,t_a),v_^a,t_a),c_^union(v_^c,t_a),t_a).
% 594165 [binary:593102.2,594152] -c_in(c_^main_^osubset^i__1(c_^union(v_^c,t_a),v_^a,t_a),v_^a,t_a).
% 594175 [binary:593101.2,594153] c_in(c_^main_^osubset^i__1(v_^b,c_^union(v_^c,t_a),t_a),v_^b,t_a).
% 594176 [binary:593102.2,594153] -c_in(c_^main_^osubset^i__1(v_^b,c_^union(v_^c,t_a),t_a),c_^union(v_^c,t_a),t_a).
% 594234 [binary:593100,594154.3] -c_in(X,v_^c,tc_set(t_a)) | c_lessequals(X,v_^a,tc_set(t_a)) | -c_in(Y,v_^b,t_a) | c_in(Y,X,t_a).
% 594478 [binary:593091.2,594164] c_in(c_^main_^o^union^e__1(c_^main_^osubset^i__1(c_^union(v_^c,t_a),v_^a,t_a),v_^c,t_a),v_^c,tc_set(t_a)).
% 594479 [binary:593092.2,594164] c_in(c_^main_^osubset^i__1(c_^union(v_^c,t_a),v_^a,t_a),c_^main_^o^union^e__1(c_^main_^osubset^i__1(c_^union(v_^c,t_a),v_^a,t_a),v_^c,t_a),t_a).
% 594491 [binary:592967,594176] -c_in(c_^main_^osubset^i__1(v_^b,c_^union(v_^c,t_a),t_a),X,t_a) | -c_in(X,v_^c,tc_set(t_a)).
% 599482 [binary:594175,594234.3,binarycut:594491] -c_in(X,v_^c,tc_set(t_a)) | c_lessequals(X,v_^a,tc_set(t_a)).
% 599585 [binary:593100,599482.2] -c_in(X,v_^c,tc_set(t_a)) | c_in(Y,v_^a,t_a) | -c_in(Y,X,t_a).
% 633747 [binary:599585.3,594479,cut:594165,cut:594478] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% 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 7
% clause depth limited to 4
% seconds given: 87
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 13712
% derived clauses: 1407725
% kept clauses: 275156
% kept size sum: 0
% kept mid-nuclei: 47834
% kept new demods: 147
% forw unit-subs: 169182
% forw double-subs: 30094
% forw overdouble-subs: 14663
% backward subs: 193
% fast unit cutoff: 15340
% full unit cutoff: 8117
% dbl unit cutoff: 235
% real runtime : 113.19
% process. runtime: 112.53
% specific non-discr-tree subsumption statistics:
% tried: 705721
% length fails: 47599
% strength fails: 101473
% predlist fails: 85686
% aux str. fails: 29748
% by-lit fails: 136202
% full subs tried: 239358
% full subs fail: 225223
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP32684/SET/SET860-1+eq_r.in")
% WARNING: TreeLimitedRun lost 109.43s, total lost is 109.43s
%
%------------------------------------------------------------------------------