TSTP Solution File: SET854-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET854-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 : art04.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 25.0s
% Output : Assurance 25.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/SystemOnTPTP9416/SET/SET854-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 9)
% (binary-unit 9 #f 4 9)
% (binary-double 9 #f 4 9)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 4 9)
% (binary-order 25 #f 4 9)
% (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)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(19,40,0,38,0,0,21930,4,2013,36995,5,2501,36996,1,2501,36996,50,2501,36996,40,2501,37015,0,2501,42674,50,2744,42693,0,2744)
%
%
% START OF PROOF
% 37167 [?] ?
% 37186 [?] ?
% 38577 [?] ?
% 42676 [] -c_lessequals(Y,X,tc_set(Z)) | -c_lessequals(X,Y,tc_set(Z)) | equal(Y,X).
% 42677 [] -c_lessequals(X,Y,tc_set(Z)) | -c_in(U,X,Z) | c_in(U,Y,Z).
% 42681 [] c_in(c_^zorn_^o^t^fin__linear__lemma1__1(X,Y,Z),c_^zorn_^o^t^fin(X,Z),tc_set(tc_set(Z))) | c_lessequals(c_^zorn_^osucc(X,Y,Z),U,tc_set(tc_set(Z))) | -c_in(Y,c_^zorn_^o^t^fin(X,Z),tc_set(tc_set(Z))) | -c_in(U,c_^zorn_^o^t^fin(X,Z),tc_set(tc_set(Z))) | c_lessequals(U,Y,tc_set(tc_set(Z))).
% 42682 [] c_lessequals(c_^zorn_^o^t^fin__linear__lemma1__1(X,Y,Z),Y,tc_set(tc_set(Z))) | c_lessequals(c_^zorn_^osucc(X,Y,Z),U,tc_set(tc_set(Z))) | -c_in(Y,c_^zorn_^o^t^fin(X,Z),tc_set(tc_set(Z))) | -c_in(U,c_^zorn_^o^t^fin(X,Z),tc_set(tc_set(Z))) | c_lessequals(U,Y,tc_set(tc_set(Z))).
% 42683 [] c_lessequals(c_^zorn_^osucc(X,Y,Z),U,tc_set(tc_set(Z))) | -c_in(Y,c_^zorn_^o^t^fin(X,Z),tc_set(tc_set(Z))) | -c_in(U,c_^zorn_^o^t^fin(X,Z),tc_set(tc_set(Z))) | c_lessequals(U,Y,tc_set(tc_set(Z))) | -equal(c_^zorn_^o^t^fin__linear__lemma1__1(X,Y,Z),Y).
% 42684 [] -c_lessequals(c_^zorn_^osucc(X,c_^zorn_^o^t^fin__linear__lemma1__1(X,Y,Z),Z),Y,tc_set(tc_set(Z))) | c_lessequals(c_^zorn_^osucc(X,Y,Z),U,tc_set(tc_set(Z))) | -c_in(Y,c_^zorn_^o^t^fin(X,Z),tc_set(tc_set(Z))) | -c_in(U,c_^zorn_^o^t^fin(X,Z),tc_set(tc_set(Z))) | c_lessequals(U,Y,tc_set(tc_set(Z))).
% 42685 [] 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)).
% 42687 [] -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)).
% 42688 [] c_lessequals(v_^y,c_^zorn_^o^t^fin(v_^s,t_a),tc_set(tc_set(tc_set(t_a)))).
% 42689 [] c_in(v_x,c_^zorn_^o^t^fin(v_^s,t_a),tc_set(tc_set(t_a))).
% 42690 [] c_lessequals(v_x,c_^union(v_^y,tc_set(t_a)),tc_set(tc_set(t_a))).
% 42691 [] -equal(v_x,c_^union(v_^y,tc_set(t_a))).
% 42692 [] -c_lessequals(c_^zorn_^osucc(v_^s,v_x,t_a),c_^union(v_^y,tc_set(t_a)),tc_set(tc_set(t_a))).
% 42693 [] c_lessequals(c_^zorn_^osucc(v_^s,X,t_a),Y,tc_set(tc_set(t_a))) | -c_in(X,c_^zorn_^o^t^fin(v_^s,t_a),tc_set(tc_set(t_a))) | -c_in(Y,v_^y,tc_set(tc_set(t_a))) | -c_lessequals(X,Y,tc_set(tc_set(t_a))) | equal(X,Y).
% 42712 [binary:42690,42676,cut:42691] -c_lessequals(c_^union(v_^y,tc_set(t_a)),v_x,tc_set(tc_set(t_a))).
% 42717 [binary:42689,42693.2] c_lessequals(c_^zorn_^osucc(v_^s,v_x,t_a),X,tc_set(tc_set(t_a))) | -c_in(X,v_^y,tc_set(tc_set(t_a))) | -c_lessequals(v_x,X,tc_set(tc_set(t_a))) | equal(v_x,X).
% 42722 [binary:42688,42677] c_in(X,c_^zorn_^o^t^fin(v_^s,t_a),tc_set(tc_set(t_a))) | -c_in(X,v_^y,tc_set(tc_set(t_a))).
% 42732 [binary:42689,42681.4] c_in(c_^zorn_^o^t^fin__linear__lemma1__1(v_^s,X,t_a),c_^zorn_^o^t^fin(v_^s,t_a),tc_set(tc_set(t_a))) | c_lessequals(c_^zorn_^osucc(v_^s,X,t_a),v_x,tc_set(tc_set(t_a))) | -c_in(X,c_^zorn_^o^t^fin(v_^s,t_a),tc_set(tc_set(t_a))) | c_lessequals(v_x,X,tc_set(tc_set(t_a))).
% 42746 [binary:42689,42682.4] c_lessequals(c_^zorn_^osucc(v_^s,X,t_a),v_x,tc_set(tc_set(t_a))) | c_lessequals(c_^zorn_^o^t^fin__linear__lemma1__1(v_^s,X,t_a),X,tc_set(tc_set(t_a))) | -c_in(X,c_^zorn_^o^t^fin(v_^s,t_a),tc_set(tc_set(t_a))) | c_lessequals(v_x,X,tc_set(tc_set(t_a))).
% 42764 [binary:42689,42683.3] c_lessequals(c_^zorn_^osucc(v_^s,X,t_a),v_x,tc_set(tc_set(t_a))) | -c_in(X,c_^zorn_^o^t^fin(v_^s,t_a),tc_set(tc_set(t_a))) | c_lessequals(v_x,X,tc_set(tc_set(t_a))) | -equal(c_^zorn_^o^t^fin__linear__lemma1__1(v_^s,X,t_a),X).
% 42787 [binary:42689,42684.4] -c_lessequals(c_^zorn_^osucc(v_^s,c_^zorn_^o^t^fin__linear__lemma1__1(v_^s,X,t_a),t_a),X,tc_set(tc_set(t_a))) | c_lessequals(c_^zorn_^osucc(v_^s,X,t_a),v_x,tc_set(tc_set(t_a))) | -c_in(X,c_^zorn_^o^t^fin(v_^s,t_a),tc_set(tc_set(t_a))) | c_lessequals(v_x,X,tc_set(tc_set(t_a))).
% 42801 [binary:42712,42685.3] c_in(c_^zorn_^o^union__lemma0__1(v_x,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))).
% 42814 [binary:42712,42687.3] -c_lessequals(X,c_^zorn_^o^union__lemma0__1(v_x,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))).
% 42864 [binary:42692,42814.2] -c_lessequals(c_^zorn_^osucc(v_^s,v_x,t_a),c_^zorn_^o^union__lemma0__1(v_x,c_^zorn_^osucc(v_^s,v_x,t_a),v_^y,tc_set(t_a)),tc_set(tc_set(t_a))).
% 42868 [binary:42681.2,42864,cut:42689,cut:37167,cut:37186] c_in(c_^zorn_^o^t^fin__linear__lemma1__1(v_^s,v_x,t_a),c_^zorn_^o^t^fin(v_^s,t_a),tc_set(tc_set(t_a))).
% 42870 [binary:42682.2,42864,cut:42689,cut:37167,cut:37186] c_lessequals(c_^zorn_^o^t^fin__linear__lemma1__1(v_^s,v_x,t_a),v_x,tc_set(tc_set(t_a))).
% 42872 [binary:42683,42864,cut:42689,cut:37167,cut:37186] -equal(c_^zorn_^o^t^fin__linear__lemma1__1(v_^s,v_x,t_a),v_x).
% 42874 [binary:42684.2,42864,cut:42689,cut:37167,cut:37186] -c_lessequals(c_^zorn_^osucc(v_^s,c_^zorn_^o^t^fin__linear__lemma1__1(v_^s,v_x,t_a),t_a),v_x,tc_set(tc_set(t_a))).
% 42877 [binary:42693.5,42872,cut:42870,cut:42868,cut:42874] -c_in(v_x,v_^y,tc_set(tc_set(t_a))).
% 43011 [para:42717.4.1,42877.1.1] c_lessequals(c_^zorn_^osucc(v_^s,v_x,t_a),X,tc_set(tc_set(t_a))) | -c_in(X,v_^y,tc_set(tc_set(t_a))) | -c_lessequals(v_x,X,tc_set(tc_set(t_a))).
% 43112 [binary:42692,42801.2] c_in(c_^zorn_^o^union__lemma0__1(v_x,c_^zorn_^osucc(v_^s,v_x,t_a),v_^y,tc_set(t_a)),v_^y,tc_set(tc_set(t_a))).
% 43116 [binary:42722.2,43112] c_in(c_^zorn_^o^union__lemma0__1(v_x,c_^zorn_^osucc(v_^s,v_x,t_a),v_^y,tc_set(t_a)),c_^zorn_^o^t^fin(v_^s,t_a),tc_set(tc_set(t_a))).
% 43192 [binary:42864,43011,cut:43112] -c_lessequals(v_x,c_^zorn_^o^union__lemma0__1(v_x,c_^zorn_^osucc(v_^s,v_x,t_a),v_^y,tc_set(t_a)),tc_set(tc_set(t_a))).
% 43199 [binary:42732.4,43192,cut:43116,cut:38577] c_in(c_^zorn_^o^t^fin__linear__lemma1__1(v_^s,c_^zorn_^o^union__lemma0__1(v_x,c_^zorn_^osucc(v_^s,v_x,t_a),v_^y,tc_set(t_a)),t_a),c_^zorn_^o^t^fin(v_^s,t_a),tc_set(tc_set(t_a))).
% 43200 [binary:42746.4,43192,cut:43116,cut:38577] c_lessequals(c_^zorn_^o^t^fin__linear__lemma1__1(v_^s,c_^zorn_^o^union__lemma0__1(v_x,c_^zorn_^osucc(v_^s,v_x,t_a),v_^y,tc_set(t_a)),t_a),c_^zorn_^o^union__lemma0__1(v_x,c_^zorn_^osucc(v_^s,v_x,t_a),v_^y,tc_set(t_a)),tc_set(tc_set(t_a))).
% 43322 [binary:43116,42764.2,cut:38577,cut:43192] -equal(c_^zorn_^o^t^fin__linear__lemma1__1(v_^s,c_^zorn_^o^union__lemma0__1(v_x,c_^zorn_^osucc(v_^s,v_x,t_a),v_^y,tc_set(t_a)),t_a),c_^zorn_^o^union__lemma0__1(v_x,c_^zorn_^osucc(v_^s,v_x,t_a),v_^y,tc_set(t_a))).
% 43448 [binary:42693.5,43322,cut:43200,cut:43112,cut:43199] c_lessequals(c_^zorn_^osucc(v_^s,c_^zorn_^o^t^fin__linear__lemma1__1(v_^s,c_^zorn_^o^union__lemma0__1(v_x,c_^zorn_^osucc(v_^s,v_x,t_a),v_^y,tc_set(t_a)),t_a),t_a),c_^zorn_^o^union__lemma0__1(v_x,c_^zorn_^osucc(v_^s,v_x,t_a),v_^y,tc_set(t_a)),tc_set(tc_set(t_a))).
% 43569 [binary:43116,42787.3,cut:38577,cut:43448,cut:43192] 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 9
% clause depth limited to 5
% seconds given: 9
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 3151
% derived clauses: 215505
% kept clauses: 26690
% kept size sum: 216910
% kept mid-nuclei: 4691
% kept new demods: 0
% forw unit-subs: 15579
% forw double-subs: 4853
% forw overdouble-subs: 32692
% backward subs: 572
% fast unit cutoff: 2213
% full unit cutoff: 2
% dbl unit cutoff: 305
% real runtime : 27.54
% process. runtime: 27.48
% specific non-discr-tree subsumption statistics:
% tried: 4957298
% length fails: 80274
% strength fails: 362206
% predlist fails: 1522032
% aux str. fails: 19813
% by-lit fails: 389883
% full subs tried: 2451016
% full subs fail: 2418486
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP9416/SET/SET854-2+eq_r.in")
% WARNING: TreeLimitedRun lost 24.97s, total lost is 24.97s
%
%------------------------------------------------------------------------------