%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET857-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 19.8s
% Output : Assurance 19.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/SystemOnTPTP9692/SET/SET857-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 *********
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(15,40,0,30,0,0,35765,4,2171)
%
%
% START OF PROOF
% 17 [] -c_lessequals(X,Y,tc_set(Z)) | -c_in(U,X,Z) | c_in(U,Y,Z).
% 18 [] c_in(c_^main_^osubset^i__1(X,Y,Z),X,Z) | c_lessequals(X,Y,tc_set(Z)).
% 19 [] -c_in(c_^main_^osubset^i__1(X,Y,Z),Y,Z) | c_lessequals(X,Y,tc_set(Z)).
% 20 [] c_lessequals(X,c_^zorn_^osucc(Y,X,Z),tc_set(tc_set(Z))).
% 21 [] 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))).
% 22 [] 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))).
% 23 [] 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).
% 24 [] -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))).
% 25 [] c_lessequals(v_^y,c_^zorn_^o^t^fin(v_^s,t_a),tc_set(tc_set(tc_set(t_a)))).
% 26 [] c_in(v_n,c_^zorn_^o^t^fin(v_^s,t_a),tc_set(tc_set(t_a))).
% 27 [] c_in(v_x,v_^y,tc_set(tc_set(t_a))).
% 28 [] -c_lessequals(v_x,v_n,tc_set(tc_set(t_a))).
% 29 [] -c_lessequals(c_^zorn_^osucc(v_^s,v_n,t_a),v_x,tc_set(tc_set(t_a))).
% 30 [] 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).
% 51 [hyper:17,25,27] c_in(v_x,c_^zorn_^o^t^fin(v_^s,t_a),tc_set(tc_set(t_a))).
% 57 [hyper:21,51,26] 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))) | c_lessequals(c_^zorn_^osucc(v_^s,v_x,t_a),v_n,tc_set(tc_set(t_a))) | c_lessequals(v_n,v_x,tc_set(tc_set(t_a))).
% 62 [hyper:22,51,26] c_lessequals(c_^zorn_^o^t^fin__linear__lemma1__1(v_^s,v_x,t_a),v_x,tc_set(tc_set(t_a))) | c_lessequals(c_^zorn_^osucc(v_^s,v_x,t_a),v_n,tc_set(tc_set(t_a))) | c_lessequals(v_n,v_x,tc_set(tc_set(t_a))).
% 122 [hyper:28,18] c_in(c_^main_^osubset^i__1(v_x,v_n,tc_set(t_a)),v_x,tc_set(t_a)).
% 138 [hyper:17,18,18,factor:binarycut:19] c_lessequals(X,X,tc_set(Y)).
% 179 [hyper:17,122,20] c_in(c_^main_^osubset^i__1(v_x,v_n,tc_set(t_a)),c_^zorn_^osucc(X,v_x,t_a),tc_set(t_a)).
% 1630 [hyper:30,57,cut:27,cut:26,cut:29] 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))) | c_lessequals(c_^zorn_^osucc(v_^s,v_x,t_a),v_n,tc_set(tc_set(t_a))) | equal(v_n,v_x).
% 1664 [hyper:17,1630,179] 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))) | c_in(c_^main_^osubset^i__1(v_x,v_n,tc_set(t_a)),v_n,tc_set(t_a)) | equal(v_n,v_x).
% 1895 [hyper:30,62,cut:27,cut:26,cut:29] c_lessequals(c_^zorn_^o^t^fin__linear__lemma1__1(v_^s,v_x,t_a),v_x,tc_set(tc_set(t_a))) | c_lessequals(c_^zorn_^osucc(v_^s,v_x,t_a),v_n,tc_set(tc_set(t_a))) | equal(v_n,v_x).
% 1909 [hyper:17,1895,179] c_lessequals(c_^zorn_^o^t^fin__linear__lemma1__1(v_^s,v_x,t_a),v_x,tc_set(tc_set(t_a))) | c_in(c_^main_^osubset^i__1(v_x,v_n,tc_set(t_a)),v_n,tc_set(t_a)) | equal(v_n,v_x).
% 1974 [hyper:19,1909,cut:28] c_lessequals(c_^zorn_^o^t^fin__linear__lemma1__1(v_^s,v_x,t_a),v_x,tc_set(tc_set(t_a))) | equal(v_n,v_x).
% 2430 [hyper:19,1664,cut:28] 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))) | equal(v_n,v_x).
% 2650 [hyper:30,2430,1974,cut:27] 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))) | equal(c_^zorn_^o^t^fin__linear__lemma1__1(v_^s,v_x,t_a),v_x) | equal(v_n,v_x).
% 2777 [hyper:24,2650,26,cut:51] c_lessequals(c_^zorn_^osucc(v_^s,v_x,t_a),v_n,tc_set(tc_set(t_a))) | c_lessequals(v_n,v_x,tc_set(tc_set(t_a))) | equal(c_^zorn_^o^t^fin__linear__lemma1__1(v_^s,v_x,t_a),v_x) | equal(v_n,v_x).
% 4988 [hyper:23,2777,26,cut:51] c_lessequals(c_^zorn_^osucc(v_^s,v_x,t_a),v_n,tc_set(tc_set(t_a))) | c_lessequals(v_n,v_x,tc_set(tc_set(t_a))) | equal(v_n,v_x).
% 4997 [hyper:17,4988,179] c_in(c_^main_^osubset^i__1(v_x,v_n,tc_set(t_a)),v_n,tc_set(t_a)) | c_lessequals(v_n,v_x,tc_set(tc_set(t_a))) | equal(v_n,v_x).
% 5055 [hyper:19,4997,cut:28] c_lessequals(v_n,v_x,tc_set(tc_set(t_a))) | equal(v_n,v_x).
% 5119 [hyper:30,5055,cut:27,cut:26,cut:29] equal(v_n,v_x).
% 38488 [para:5119.1.1,28.1.2,cut:138] 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 9
% clause depth limited to 4
% seconds given: 25
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 365
% derived clauses: 194438
% kept clauses: 15806
% kept size sum: 0
% kept mid-nuclei: 9325
% kept new demods: 0
% forw unit-subs: 44008
% forw double-subs: 19771
% forw overdouble-subs: 46350
% backward subs: 140
% fast unit cutoff: 9066
% full unit cutoff: 0
% dbl unit cutoff: 855
% real runtime : 22.16
% process. runtime: 21.98
% specific non-discr-tree subsumption statistics:
% tried: 3077380
% length fails: 67032
% strength fails: 213690
% predlist fails: 200506
% aux str. fails: 21911
% by-lit fails: 201534
% full subs tried: 2294396
% full subs fail: 2250877
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP9692/SET/SET857-2+eq_r.in")
% WARNING: TreeLimitedRun lost 19.82s, total lost is 19.82s
%
%------------------------------------------------------------------------------