TSTP Solution File: SET852-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET852-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 84.7s
% Output : Assurance 84.7s
% 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/SystemOnTPTP19448/SET/SET852-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(1368,40,6,2736,0,12,464586,4,2120,485557,5,2813,485558,1,2813,485558,50,2819,485558,40,2819,486926,0,2820,522004,3,4221,525289,4,4921,537654,5,5621,537655,5,5622,537656,1,5622,537656,50,5626,537656,40,5626,539024,0,5627,560814,3,6178,564314,4,6453,584436,5,6728,584438,5,6728,584439,1,6728,584439,50,6730,584439,40,6730,585807,0,6732,623505,3,7583,641776,4,8008,655620,5,8433,655622,5,8434,655622,1,8434,655622,50,8439,655622,40,8439,656990,0,8440)
%
%
% START OF PROOF
% 656981 [] c_in(c_^zorn_^o^union__lemma0__1(X,Y,Z,U),Z,tc_set(U)) | c_lessequals(Y,c_^union(Z,U),tc_set(U)) | c_lessequals(c_^union(Z,U),X,tc_set(U)).
% 656982 [] -c_lessequals(c_^zorn_^o^union__lemma0__1(X,Y,Z,U),X,tc_set(U)) | c_lessequals(Y,c_^union(Z,U),tc_set(U)) | c_lessequals(c_^union(Z,U),X,tc_set(U)).
% 656983 [] -c_lessequals(X,c_^zorn_^o^union__lemma0__1(Y,X,Z,U),tc_set(U)) | c_lessequals(X,c_^union(Z,U),tc_set(U)) | c_lessequals(c_^union(Z,U),Y,tc_set(U)).
% 656987 [] -c_lessequals(c_^union(v_^y,tc_set(t_a)),v_m,tc_set(tc_set(t_a))).
% 656988 [] -c_lessequals(c_^zorn_^osucc(v_^s,v_m,t_a),c_^union(v_^y,tc_set(t_a)),tc_set(tc_set(t_a))).
% 656989 [] c_lessequals(c_^zorn_^osucc(v_^s,v_m,t_a),X,tc_set(tc_set(t_a))) | -c_in(X,v_^y,tc_set(tc_set(t_a))) | c_lessequals(X,v_m,tc_set(tc_set(t_a))).
% 657035 [binary:656981.3,656987] c_in(c_^zorn_^o^union__lemma0__1(v_m,X,v_^y,tc_set(t_a)),v_^y,tc_set(tc_set(t_a))) | c_lessequals(X,c_^union(v_^y,tc_set(t_a)),tc_set(tc_set(t_a))).
% 657036 [binary:656982.3,656987] -c_lessequals(c_^zorn_^o^union__lemma0__1(v_m,X,v_^y,tc_set(t_a)),v_m,tc_set(tc_set(t_a))) | c_lessequals(X,c_^union(v_^y,tc_set(t_a)),tc_set(tc_set(t_a))).
% 657037 [binary:656983.3,656987] -c_lessequals(X,c_^zorn_^o^union__lemma0__1(v_m,X,v_^y,tc_set(t_a)),tc_set(tc_set(t_a))) | c_lessequals(X,c_^union(v_^y,tc_set(t_a)),tc_set(tc_set(t_a))).
% 662126 [binary:656988,657035.2] c_in(c_^zorn_^o^union__lemma0__1(v_m,c_^zorn_^osucc(v_^s,v_m,t_a),v_^y,tc_set(t_a)),v_^y,tc_set(tc_set(t_a))).
% 662242 [binary:656988,657036.2] -c_lessequals(c_^zorn_^o^union__lemma0__1(v_m,c_^zorn_^osucc(v_^s,v_m,t_a),v_^y,tc_set(t_a)),v_m,tc_set(tc_set(t_a))).
% 662488 [binary:656989,657037,cut:656988,cut:662126,cut:662242] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using sos strategy
% using double strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 17
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 11246
% derived clauses: 1481380
% kept clauses: 186892
% kept size sum: 122037
% kept mid-nuclei: 46995
% kept new demods: 141
% forw unit-subs: 143539
% forw double-subs: 25687
% forw overdouble-subs: 6270
% backward subs: 73
% fast unit cutoff: 15186
% full unit cutoff: 9838
% dbl unit cutoff: 6
% real runtime : 85.15
% process. runtime: 84.78
% specific non-discr-tree subsumption statistics:
% tried: 1622911
% length fails: 191755
% strength fails: 454636
% predlist fails: 426959
% aux str. fails: 68700
% by-lit fails: 177879
% full subs tried: 212367
% full subs fail: 206129
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP19448/SET/SET852-1+eq_r.in")
% WARNING: TreeLimitedRun lost 84.69s, total lost is 84.69s
%
%------------------------------------------------------------------------------