TSTP Solution File: SET843-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET843-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 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/SystemOnTPTP7386/SET/SET843-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 4 7)
% (binary-unit 9 #f 4 7)
% (binary-double 9 #f 4 7)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 4 7)
% (binary-order 25 #f 4 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)
%
%
% SOS clause
% -equal(v_m,c_^union(c_^zorn_^o^t^fin(v_^s,t_a),tc_set(t_a))) | -equal(v_m,c_^zorn_^osucc(v_^s,v_m,t_a)).
% was split for some strategies as:
% -equal(v_m,c_^union(c_^zorn_^o^t^fin(v_^s,t_a),tc_set(t_a))).
% -equal(v_m,c_^zorn_^osucc(v_^s,v_m,t_a)).
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(11,40,0,22,0,0,110,50,1,121,0,1,223,50,1,234,0,1,336,50,2,347,0,2,449,50,2,460,0,2,562,50,2,573,0,2,675,50,3,686,0,3,788,50,3,799,0,3,901,50,4,912,0,4,1014,50,4,1025,0,4,1127,50,4,1138,0,4,1240,50,5,1251,0,5,1353,50,5,1364,0,5,1466,50,6,1477,0,6,1579,50,7,1590,0,7,1692,50,7,1703,0,7,1805,50,8,1816,0,8,1918,50,8,1929,0,8,2031,50,9,2031,40,9,2042,0,9)
%
%
% START OF PROOF
% 2032 [] equal(X,X).
% 2033 [] c_lessequals(X,c_^union(Y,Z),tc_set(Z)) | -c_in(X,Y,tc_set(Z)).
% 2034 [] -c_lessequals(Y,X,tc_set(Z)) | -c_lessequals(X,Y,tc_set(Z)) | equal(Y,X).
% 2035 [] c_lessequals(X,X,tc_set(Y)).
% 2036 [] c_lessequals(X,c_^zorn_^osucc(Y,X,Z),tc_set(tc_set(Z))).
% 2037 [] c_in(c_^zorn_^osucc(X,Y,Z),c_^zorn_^o^t^fin(X,Z),tc_set(tc_set(Z))) | -c_in(Y,c_^zorn_^o^t^fin(X,Z),tc_set(tc_set(Z))).
% 2038 [] -c_lessequals(X,c_^zorn_^o^t^fin(Y,Z),tc_set(tc_set(tc_set(Z)))) | c_in(c_^union(X,tc_set(Z)),c_^zorn_^o^t^fin(Y,Z),tc_set(tc_set(Z))).
% 2039 [] -c_in(X,c_^zorn_^o^t^fin(Y,Z),tc_set(tc_set(Z))) | -c_in(U,c_^zorn_^o^t^fin(Y,Z),tc_set(tc_set(Z))) | c_lessequals(U,X,tc_set(tc_set(Z))) | -equal(X,c_^zorn_^osucc(Y,X,Z)).
% 2040 [] c_in(v_m,c_^zorn_^o^t^fin(v_^s,t_a),tc_set(tc_set(t_a))).
% 2041 [] -equal(v_m,c_^union(c_^zorn_^o^t^fin(v_^s,t_a),tc_set(t_a))) | -equal(v_m,c_^zorn_^osucc(v_^s,v_m,t_a)).
% 2042 [] equal(v_m,c_^union(c_^zorn_^o^t^fin(v_^s,t_a),tc_set(t_a))) | equal(v_m,c_^zorn_^osucc(v_^s,v_m,t_a)).
% 2044 [binary:2040,2033.2] c_lessequals(v_m,c_^union(c_^zorn_^o^t^fin(v_^s,t_a),tc_set(t_a)),tc_set(tc_set(t_a))).
% 2047 [binary:2036,2034] -c_lessequals(c_^zorn_^osucc(X,Y,Z),Y,tc_set(tc_set(Z))) | equal(Y,c_^zorn_^osucc(X,Y,Z)).
% 2049 [binary:2044,2034] -c_lessequals(c_^union(c_^zorn_^o^t^fin(v_^s,t_a),tc_set(t_a)),v_m,tc_set(tc_set(t_a))) | equal(v_m,c_^union(c_^zorn_^o^t^fin(v_^s,t_a),tc_set(t_a))).
% 2055 [binary:2040,2037.2] c_in(c_^zorn_^osucc(v_^s,v_m,t_a),c_^zorn_^o^t^fin(v_^s,t_a),tc_set(tc_set(t_a))).
% 2056 [binary:2033.2,2055] c_lessequals(c_^zorn_^osucc(v_^s,v_m,t_a),c_^union(c_^zorn_^o^t^fin(v_^s,t_a),tc_set(t_a)),tc_set(tc_set(t_a))).
% 2061 [para:2042.1.2,2056.1.2,binarycut:2047] equal(v_m,c_^zorn_^osucc(v_^s,v_m,t_a)).
% 2062 [para:2061.1.2,2041.2.2,cut:2032] -equal(v_m,c_^union(c_^zorn_^o^t^fin(v_^s,t_a),tc_set(t_a))).
% 2064 [para:2049.2.2,2062.1.2,cut:2032] -c_lessequals(c_^union(c_^zorn_^o^t^fin(v_^s,t_a),tc_set(t_a)),v_m,tc_set(tc_set(t_a))).
% 2066 [binary:2035,2038] c_in(c_^union(c_^zorn_^o^t^fin(X,Y),tc_set(Y)),c_^zorn_^o^t^fin(X,Y),tc_set(tc_set(Y))).
% 2071 [binary:2040,2039,demod:2061,cut:2032] -c_in(X,c_^zorn_^o^t^fin(v_^s,t_a),tc_set(tc_set(t_a))) | c_lessequals(X,v_m,tc_set(tc_set(t_a))).
% 2077 [binary:2064,2071.2,cut:2066] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using unit 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: 4
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 580
% derived clauses: 5274
% kept clauses: 452
% kept size sum: 7050
% kept mid-nuclei: 1212
% kept new demods: 55
% forw unit-subs: 3007
% forw double-subs: 325
% forw overdouble-subs: 2
% backward subs: 168
% fast unit cutoff: 399
% full unit cutoff: 0
% dbl unit cutoff: 1
% real runtime : 0.11
% process. runtime: 0.9
% specific non-discr-tree subsumption statistics:
% tried: 3
% length fails: 0
% strength fails: 1
% predlist fails: 0
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 2
% full subs fail: 0
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP7386/SET/SET843-2+eq_r.in")
% Killed 1 orphans
%
%------------------------------------------------------------------------------