TSTP Solution File: SET843-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET843-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 : art06.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 49.8s
% Output : Assurance 49.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/SystemOnTPTP18514/SET/SET843-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)
%
%
% 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(1368,40,6,2736,0,12,159785,4,990,170909,5,1313,170909,1,1313,170909,50,1319,170909,40,1319,172277,0,1320,199928,3,1971,200471,4,2296,205922,5,2621,205923,5,2621,205923,1,2621,205923,50,2624,205923,40,2624,207291,0,2625,219352,3,2876,221493,4,3001,231702,5,3126,231704,5,3126,231704,1,3126,231704,50,3127,231704,40,3127,233072,0,3128,253192,3,3529,259708,4,3729,268080,5,3929,268082,5,3929,268083,1,3929,268083,50,3931,268083,40,3931,269451,0,3932,295870,3,4333,301824,4,4533,304695,5,4733,304696,5,4733,304697,1,4733,304697,50,4736,304697,40,4736,306065,0,4737)
%
%
% START OF PROOF
% 304698 [] equal(X,X).
% 304897 [] -equal(c_^datatype__^universe_^o^leaf(X,Y,Z),c_^datatype__^universe_^o^leaf(U,Y,Z)) | equal(X,U).
% 305007 [] -c_lessequals(X,Y,tc_set(Z)) | -c_lessequals(Y,X,tc_set(Z)) | equal(X,Y).
% 306056 [] c_in(c_^main_^o^union__least__1(X,Y,Z),X,tc_set(Z)) | c_lessequals(c_^union(X,Z),Y,tc_set(Z)).
% 306057 [] -c_lessequals(c_^main_^o^union__least__1(X,Y,Z),Y,tc_set(Z)) | c_lessequals(c_^union(X,Z),Y,tc_set(Z)).
% 306058 [] c_lessequals(X,c_^union(Y,Z),tc_set(Z)) | -c_in(X,Y,tc_set(Z)).
% 306059 [] c_lessequals(X,c_^zorn_^osucc(Y,X,Z),tc_set(tc_set(Z))).
% 306060 [] 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))).
% 306062 [] -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)).
% 306063 [] c_in(v_m,c_^zorn_^o^t^fin(v_^s,t_a),tc_set(tc_set(t_a))).
% 306064 [] -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)).
% 306065 [] 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)).
% 306082 [binary:306058.2,306063] 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))).
% 306083 [binary:306060.2,306063] 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))).
% 306096 [binary:305007,306082] -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))).
% 306116 [binary:306058.2,306083] 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))).
% 306234 [para:306065.1.2,306116.1.2] c_lessequals(c_^zorn_^osucc(v_^s,v_m,t_a),v_m,tc_set(tc_set(t_a))) | equal(v_m,c_^zorn_^osucc(v_^s,v_m,t_a)).
% 320503 [binary:305007.2,306234,cut:306059] equal(v_m,c_^zorn_^osucc(v_^s,v_m,t_a)).
% 320504 [binary:304897.2,306064,cut:320503] -equal(c_^datatype__^universe_^o^leaf(v_m,X,Y),c_^datatype__^universe_^o^leaf(c_^union(c_^zorn_^o^t^fin(v_^s,t_a),tc_set(t_a)),X,Y)).
% 320510 [para:306096.2.2,320504.1.2.1,cut:304698] -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))).
% 320512 [para:320503.1.2,306062.4.2,cut:304698,cut:306063] -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))).
% 320575 [binary:306056.2,320510] c_in(c_^main_^o^union__least__1(c_^zorn_^o^t^fin(v_^s,t_a),v_m,tc_set(t_a)),c_^zorn_^o^t^fin(v_^s,t_a),tc_set(tc_set(t_a))).
% 320576 [binary:306057.2,320510] -c_lessequals(c_^main_^o^union__least__1(c_^zorn_^o^t^fin(v_^s,t_a),v_m,tc_set(t_a)),v_m,tc_set(tc_set(t_a))).
% 321291 [binary:320576,320512.2,cut:320575] 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: 43
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 10124
% derived clauses: 751980
% kept clauses: 184185
% kept size sum: 0
% kept mid-nuclei: 28821
% kept new demods: 145
% forw unit-subs: 125536
% forw double-subs: 28611
% forw overdouble-subs: 4690
% backward subs: 240
% fast unit cutoff: 10733
% full unit cutoff: 3721
% dbl unit cutoff: 54
% real runtime : 50.52
% process. runtime: 50.31
% specific non-discr-tree subsumption statistics:
% tried: 151912
% length fails: 13126
% strength fails: 15430
% predlist fails: 40584
% aux str. fails: 4028
% by-lit fails: 13538
% full subs tried: 42331
% full subs fail: 37651
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP18514/SET/SET843-1+eq_r.in")
% WARNING: TreeLimitedRun lost 49.83s, total lost is 49.83s
%
%------------------------------------------------------------------------------