TSTP Solution File: SET842-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET842-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 : art08.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 20.0s
% Output : Assurance 20.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/SystemOnTPTP17986/SET/SET842-2+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: nne
% detected subclass: small
%
% strategies selected:
% (hyper 27 #f 3 5)
% (binary-unit 10 #f 3 5)
% (binary-double 16 #f)
% (binary 16 #t 3 5)
% (binary-posweight-order 181 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 54 #f)
% (binary-order 27 #f 3 5)
% (binary-weightorder 71 #f)
% (binary-order 27 #f)
% (hyper-order 54 #f)
% (binary 63 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(7,40,0,14,0,0,559,50,18,566,0,18,10279,4,1969)
%
%
% START OF PROOF
% 560 [] c_in(c_^main_^o^union^e__1(X,Y,Z),Y,tc_set(Z)) | -c_in(X,c_^union(Y,Z),Z).
% 561 [] c_in(X,c_^main_^o^union^e__1(X,Y,Z),Z) | -c_in(X,c_^union(Y,Z),Z).
% 562 [] -c_lessequals(X,Y,tc_set(Z)) | -c_in(U,X,Z) | c_in(U,Y,Z).
% 563 [] c_in(c_^main_^osubset^i__1(X,Y,Z),X,Z) | c_lessequals(X,Y,tc_set(Z)).
% 564 [] -c_in(c_^main_^osubset^i__1(X,Y,Z),Y,Z) | c_lessequals(X,Y,tc_set(Z)).
% 565 [] -c_lessequals(c_^union(v_^y,tc_set(t_a)),v_m,tc_set(tc_set(t_a))).
% 566 [] -c_in(X,v_^y,tc_set(tc_set(t_a))) | c_lessequals(X,v_m,tc_set(tc_set(t_a))).
% 568 [hyper:565,563] c_in(c_^main_^osubset^i__1(c_^union(v_^y,tc_set(t_a)),v_m,tc_set(t_a)),c_^union(v_^y,tc_set(t_a)),tc_set(t_a)).
% 571 [hyper:561,563] c_in(c_^main_^osubset^i__1(c_^union(X,Y),Z,Y),c_^main_^o^union^e__1(c_^main_^osubset^i__1(c_^union(X,Y),Z,Y),X,Y),Y) | c_lessequals(c_^union(X,Y),Z,tc_set(Y)).
% 573 [hyper:562,563,563] c_in(c_^main_^osubset^i__1(X,U,Z),X,Z) | c_in(c_^main_^osubset^i__1(X,Y,Z),U,Z) | c_lessequals(X,Y,tc_set(Z)).
% 648 [hyper:562,571,573] c_in(c_^main_^osubset^i__1(c_^union(X,Y),Z,Y),c_^main_^o^union^e__1(c_^main_^osubset^i__1(c_^union(X,Y),Z,Y),X,Y),Y) | c_in(c_^main_^osubset^i__1(c_^union(X,Y),V,Y),U,Y) | c_in(c_^main_^osubset^i__1(c_^union(X,Y),U,Y),Z,Y) | c_lessequals(c_^union(X,Y),V,tc_set(Y)).
% 10418 [binary:564.2,565] -c_in(c_^main_^osubset^i__1(c_^union(v_^y,tc_set(t_a)),v_m,tc_set(t_a)),v_m,tc_set(t_a)).
% 10423 [binary:562.3,10418] -c_in(c_^main_^osubset^i__1(c_^union(v_^y,tc_set(t_a)),v_m,tc_set(t_a)),X,tc_set(t_a)) | -c_lessequals(X,v_m,tc_set(tc_set(t_a))).
% 11302 [binary:566.2,10423.2] -c_in(c_^main_^osubset^i__1(c_^union(v_^y,tc_set(t_a)),v_m,tc_set(t_a)),X,tc_set(t_a)) | -c_in(X,v_^y,tc_set(tc_set(t_a))).
% 11674 [binary:560,11302.2] -c_in(c_^main_^osubset^i__1(c_^union(v_^y,tc_set(t_a)),v_m,tc_set(t_a)),c_^main_^o^union^e__1(X,v_^y,tc_set(t_a)),tc_set(t_a)) | -c_in(X,c_^union(v_^y,tc_set(t_a)),tc_set(t_a)).
% 14046 [binary:648,11674,cut:568] c_in(c_^main_^osubset^i__1(c_^union(v_^y,tc_set(t_a)),X,tc_set(t_a)),v_m,tc_set(t_a)) | c_in(c_^main_^osubset^i__1(c_^union(v_^y,tc_set(t_a)),Y,tc_set(t_a)),X,tc_set(t_a)) | c_lessequals(c_^union(v_^y,tc_set(t_a)),Y,tc_set(tc_set(t_a))).
% 14048 [binary:10418,14046.2,cut:10418,cut:565] 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
% clause length limited to 5
% clause depth limited to 4
% seconds given: 27
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 1312
% derived clauses: 1240446
% kept clauses: 6243
% kept size sum: 330517
% kept mid-nuclei: 2664
% kept new demods: 0
% forw unit-subs: 16442
% forw double-subs: 6471
% forw overdouble-subs: 19529
% backward subs: 146
% fast unit cutoff: 1373
% full unit cutoff: 0
% dbl unit cutoff: 81
% real runtime : 22.37
% process. runtime: 22.34
% specific non-discr-tree subsumption statistics:
% tried: 1400148
% length fails: 82957
% strength fails: 151796
% predlist fails: 236726
% aux str. fails: 7855
% by-lit fails: 16421
% full subs tried: 850291
% full subs fail: 830653
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP17986/SET/SET842-2+noeq.in")
% WARNING: TreeLimitedRun lost 19.98s, total lost is 19.98s
%
%------------------------------------------------------------------------------