%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET857-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n010.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Tue Jul 19 05:21:21 EDT 2022
% Result : Unsatisfiable 2.55s 2.78s
% Output : Refutation 2.55s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SET857-2 : TPTP v8.1.0. Released v3.2.0.
% 0.10/0.13 % Command : sos-script %s
% 0.13/0.33 % Computer : n010.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sun Jul 10 19:13:15 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.35 ----- Otter 3.2, August 2001 -----
% 0.13/0.35 The process was started by sandbox on n010.cluster.edu,
% 0.13/0.35 Sun Jul 10 19:13:15 2022
% 0.13/0.35 The command was "./sos". The process ID is 28904.
% 0.13/0.35
% 0.13/0.35 set(prolog_style_variables).
% 0.13/0.35 set(auto).
% 0.13/0.35 dependent: set(auto1).
% 0.13/0.35 dependent: set(process_input).
% 0.13/0.35 dependent: clear(print_kept).
% 0.13/0.35 dependent: clear(print_new_demod).
% 0.13/0.35 dependent: clear(print_back_demod).
% 0.13/0.35 dependent: clear(print_back_sub).
% 0.13/0.35 dependent: set(control_memory).
% 0.13/0.35 dependent: assign(max_mem, 12000).
% 0.13/0.35 dependent: assign(pick_given_ratio, 4).
% 0.13/0.35 dependent: assign(stats_level, 1).
% 0.13/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.35 dependent: assign(sos_limit, 5000).
% 0.13/0.35 dependent: assign(max_weight, 60).
% 0.13/0.35 clear(print_given).
% 0.13/0.35
% 0.13/0.35 list(usable).
% 0.13/0.35
% 0.13/0.35 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 0.13/0.35
% 0.13/0.35 This ia a non-Horn set with equality. The strategy will be
% 0.13/0.35 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.35 unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.35 clauses in usable.
% 0.13/0.35
% 0.13/0.35 dependent: set(knuth_bendix).
% 0.13/0.35 dependent: set(para_from).
% 0.13/0.35 dependent: set(para_into).
% 0.13/0.35 dependent: clear(para_from_right).
% 0.13/0.35 dependent: clear(para_into_right).
% 0.13/0.35 dependent: set(para_from_vars).
% 0.13/0.35 dependent: set(eq_units_both_ways).
% 0.13/0.35 dependent: set(dynamic_demod_all).
% 0.13/0.35 dependent: set(dynamic_demod).
% 0.13/0.35 dependent: set(order_eq).
% 0.13/0.35 dependent: set(back_demod).
% 0.13/0.35 dependent: set(lrpo).
% 0.13/0.35 dependent: set(hyper_res).
% 0.13/0.35 dependent: set(unit_deletion).
% 0.13/0.35 dependent: set(factor).
% 0.13/0.35
% 0.13/0.35 ------------> process usable:
% 0.13/0.35
% 0.13/0.35 ------------> process sos:
% 0.13/0.35 Following clause subsumed by 20 during input processing: 0 [copy,20,flip.1] {-} A=A.
% 0.13/0.35
% 0.13/0.35 ======= end of input processing =======
% 0.13/0.39
% 0.13/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.39
% 0.13/0.39 Stopped by limit on number of solutions
% 0.13/0.39
% 0.13/0.39
% 0.13/0.39 -------------- Softie stats --------------
% 0.13/0.39
% 0.13/0.39 UPDATE_STOP: 300
% 0.13/0.39 SFINDER_TIME_LIMIT: 2
% 0.13/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.39 number of clauses in intial UL: 14
% 0.13/0.39 number of clauses initially in problem: 20
% 0.13/0.39 percentage of clauses intially in UL: 70
% 0.13/0.39 percentage of distinct symbols occuring in initial UL: 100
% 0.13/0.39 percent of all initial clauses that are short: 100
% 0.13/0.39 absolute distinct symbol count: 13
% 0.13/0.39 distinct predicate count: 3
% 0.13/0.39 distinct function count: 5
% 0.13/0.39 distinct constant count: 5
% 0.13/0.39
% 0.13/0.39 ---------- no more Softie stats ----------
% 0.13/0.39
% 0.13/0.39
% 0.13/0.39
% 0.13/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.13/0.39
% 0.13/0.39 Stopped by limit on number of solutions
% 0.13/0.39
% 0.13/0.39 =========== start of search ===========
% 2.55/2.78
% 2.55/2.78 -------- PROOF --------
% 2.55/2.78 % SZS status Unsatisfiable
% 2.55/2.78 % SZS output start Refutation
% 2.55/2.78
% 2.55/2.78 Stopped by limit on insertions
% 2.55/2.78
% 2.55/2.78 ----> UNIT CONFLICT at 2.39 sec ----> 5458 [binary,5457.1,7.1] {-} $F.
% 2.55/2.78
% 2.55/2.78 Length of proof is 21. Level of proof is 13.
% 2.55/2.78
% 2.55/2.78 ---------------- PROOF ----------------
% 2.55/2.78 % SZS status Unsatisfiable
% 2.55/2.78 % SZS output start Refutation
% 2.55/2.78
% 2.55/2.78 1 [] {+} -c_in(A,B,C)| -c_lessequals(B,D,tc_set(C))|c_in(A,D,C).
% 2.55/2.78 2 [] {+} -c_in(c_Main_OsubsetI__1(A,B,C),B,C)|c_lessequals(A,B,tc_set(C)).
% 2.55/2.78 3 [] {+} -c_in(A,c_Zorn_OTFin(B,C),tc_set(tc_set(C)))| -c_in(D,c_Zorn_OTFin(B,C),tc_set(tc_set(C)))|c_in(c_Zorn_OTFin__linear__lemma1__1(B,A,C),c_Zorn_OTFin(B,C),tc_set(tc_set(C)))|c_lessequals(D,A,tc_set(tc_set(C)))|c_lessequals(c_Zorn_Osucc(B,A,C),D,tc_set(tc_set(C))).
% 2.55/2.78 4 [] {+} -c_in(A,c_Zorn_OTFin(B,C),tc_set(tc_set(C)))| -c_in(D,c_Zorn_OTFin(B,C),tc_set(tc_set(C)))|c_lessequals(D,A,tc_set(tc_set(C)))|c_lessequals(c_Zorn_OTFin__linear__lemma1__1(B,A,C),A,tc_set(tc_set(C)))|c_lessequals(c_Zorn_Osucc(B,A,C),D,tc_set(tc_set(C))).
% 2.55/2.78 5 [] {+} -c_in(A,c_Zorn_OTFin(B,C),tc_set(tc_set(C)))| -c_in(D,c_Zorn_OTFin(B,C),tc_set(tc_set(C)))|c_Zorn_OTFin__linear__lemma1__1(B,A,C)!=A|c_lessequals(D,A,tc_set(tc_set(C)))|c_lessequals(c_Zorn_Osucc(B,A,C),D,tc_set(tc_set(C))).
% 2.55/2.78 6 [] {+} -c_in(A,c_Zorn_OTFin(B,C),tc_set(tc_set(C)))| -c_in(D,c_Zorn_OTFin(B,C),tc_set(tc_set(C)))| -c_lessequals(c_Zorn_Osucc(B,c_Zorn_OTFin__linear__lemma1__1(B,A,C),C),A,tc_set(tc_set(C)))|c_lessequals(D,A,tc_set(tc_set(C)))|c_lessequals(c_Zorn_Osucc(B,A,C),D,tc_set(tc_set(C))).
% 2.55/2.78 7 [] {+} -c_lessequals(v_x,v_n,tc_set(tc_set(t_a))).
% 2.55/2.78 8 [] {+} -c_lessequals(c_Zorn_Osucc(v_S,v_n,t_a),v_x,tc_set(tc_set(t_a))).
% 2.55/2.78 9 [] {+} c_lessequals(c_Zorn_Osucc(v_S,A,t_a),B,tc_set(tc_set(t_a)))|A=B| -c_lessequals(A,B,tc_set(tc_set(t_a)))| -c_in(A,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))| -c_in(B,v_Y,tc_set(tc_set(t_a))).
% 2.55/2.78 15 [] {+} c_in(c_Main_OsubsetI__1(A,B,C),A,C)|c_lessequals(A,B,tc_set(C)).
% 2.55/2.78 16 [] {-} c_lessequals(A,c_Zorn_Osucc(B,A,C),tc_set(tc_set(C))).
% 2.55/2.78 17 [] {-} c_lessequals(v_Y,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(tc_set(t_a)))).
% 2.55/2.78 18 [] {+} c_in(v_n,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))).
% 2.55/2.78 19 [] {+} c_in(v_x,v_Y,tc_set(tc_set(t_a))).
% 2.55/2.78 22 [hyper,15,7] {+} c_in(c_Main_OsubsetI__1(v_x,v_n,tc_set(t_a)),v_x,tc_set(t_a)).
% 2.55/2.78 37 [hyper,19,1,17] {-} c_in(v_x,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))).
% 2.55/2.78 63 [hyper,37,4,18] {-} c_lessequals(v_n,v_x,tc_set(tc_set(t_a)))|c_lessequals(c_Zorn_OTFin__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))).
% 2.55/2.78 65 [hyper,37,3,18] {+} c_in(c_Zorn_OTFin__linear__lemma1__1(v_S,v_x,t_a),c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))|c_lessequals(v_n,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))).
% 2.55/2.78 83 [hyper,22,1,16] {-} c_in(c_Main_OsubsetI__1(v_x,v_n,tc_set(t_a)),c_Zorn_Osucc(A,v_x,t_a),tc_set(t_a)).
% 2.55/2.78 84 [hyper,22,1,15] {+} c_in(c_Main_OsubsetI__1(v_x,v_n,tc_set(t_a)),A,tc_set(t_a))|c_in(c_Main_OsubsetI__1(v_x,A,tc_set(t_a)),v_x,tc_set(t_a)).
% 2.55/2.78 528 [hyper,63,9,18,19,unit_del,8,flip.3] {-} c_lessequals(c_Zorn_OTFin__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)))|v_x=v_n.
% 2.55/2.78 579 [para_from,528.3.1,63.1.2,factor_simp,factor_simp] {+} c_lessequals(v_n,v_n,tc_set(tc_set(t_a)))|c_lessequals(c_Zorn_OTFin__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))).
% 2.55/2.78 597 [para_from,528.3.1,7.1.1] {-} -c_lessequals(v_n,v_n,tc_set(tc_set(t_a)))|c_lessequals(c_Zorn_OTFin__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))).
% 2.55/2.78 2844 [hyper,65,1,83] {+} c_in(c_Zorn_OTFin__linear__lemma1__1(v_S,v_x,t_a),c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))|c_lessequals(v_n,v_x,tc_set(tc_set(t_a)))|c_in(c_Main_OsubsetI__1(v_x,v_n,tc_set(t_a)),v_n,tc_set(t_a)).
% 2.55/2.78 3192 [hyper,579,597,factor_simp,factor_simp] {-} c_lessequals(c_Zorn_OTFin__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))).
% 2.55/2.78 3819 [hyper,2844,9,18,19,unit_del,8,flip.3] {+} c_in(c_Zorn_OTFin__linear__lemma1__1(v_S,v_x,t_a),c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))|c_in(c_Main_OsubsetI__1(v_x,v_n,tc_set(t_a)),v_n,tc_set(t_a))|v_x=v_n.
% 2.55/2.78 4119 [para_from,3819.3.1,84.2.2,factor_simp,factor_simp] {+} c_in(c_Main_OsubsetI__1(v_x,v_n,tc_set(t_a)),v_n,tc_set(t_a))|c_in(c_Zorn_OTFin__linear__lemma1__1(v_S,v_x,t_a),c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))).
% 2.55/2.78 4186 [hyper,4119,2,unit_del,7] {+} c_in(c_Zorn_OTFin__linear__lemma1__1(v_S,v_x,t_a),c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))).
% 2.55/2.78 4337 [hyper,4186,9,3192,19] {-} c_lessequals(c_Zorn_Osucc(v_S,c_Zorn_OTFin__linear__lemma1__1(v_S,v_x,t_a),t_a),v_x,tc_set(tc_set(t_a)))|c_Zorn_OTFin__linear__lemma1__1(v_S,v_x,t_a)=v_x|c_lessequals(c_Zorn_Osucc(v_S,v_x,t_a),v_n,tc_set(tc_set(t_a))).
% 2.55/2.78 4722 [hyper,4337,5,37,18,factor_simp] {-} c_lessequals(c_Zorn_Osucc(v_S,c_Zorn_OTFin__linear__lemma1__1(v_S,v_x,t_a),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))).
% 2.55/2.78 4838 [hyper,4722,6,37,18,factor_simp,factor_simp] {-} 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))).
% 2.55/2.78 4955 [hyper,4838,1,83] {-} c_lessequals(v_n,v_x,tc_set(tc_set(t_a)))|c_in(c_Main_OsubsetI__1(v_x,v_n,tc_set(t_a)),v_n,tc_set(t_a)).
% 2.55/2.78 5344 [hyper,4955,9,18,19,unit_del,8,flip.2] {-} c_in(c_Main_OsubsetI__1(v_x,v_n,tc_set(t_a)),v_n,tc_set(t_a))|v_x=v_n.
% 2.55/2.78 5456 [para_from,5344.2.1,84.2.2,factor_simp,factor_simp] {-} c_in(c_Main_OsubsetI__1(v_x,v_n,tc_set(t_a)),v_n,tc_set(t_a)).
% 2.55/2.78 5457 [hyper,5456,2] {-} c_lessequals(v_x,v_n,tc_set(tc_set(t_a))).
% 2.55/2.78 5458 [binary,5457.1,7.1] {-} $F.
% 2.55/2.78
% 2.55/2.78 % SZS output end Refutation
% 2.55/2.78 ------------ end of proof -------------
% 2.55/2.78
% 2.55/2.78
% 2.55/2.78 Search stopped by max_proofs option.
% 2.55/2.78
% 2.55/2.78
% 2.55/2.78 Search stopped by max_proofs option.
% 2.55/2.78
% 2.55/2.78 ============ end of search ============
% 2.55/2.78
% 2.55/2.78 ----------- soft-scott stats ----------
% 2.55/2.78
% 2.55/2.78 true clauses given 84 (36.7%)
% 2.55/2.78 false clauses given 145
% 2.55/2.78
% 2.55/2.78 FALSE TRUE
% 2.55/2.78 15 2 1
% 2.55/2.78 18 5 4
% 2.55/2.78 19 1 0
% 2.55/2.78 21 2 6
% 2.55/2.78 23 1 0
% 2.55/2.78 24 6 7
% 2.55/2.78 26 1 0
% 2.55/2.78 27 15 17
% 2.55/2.78 28 0 4
% 2.55/2.78 29 0 4
% 2.55/2.78 30 50 26
% 2.55/2.78 31 8 0
% 2.55/2.78 32 8 7
% 2.55/2.78 33 67 35
% 2.55/2.78 34 3 4
% 2.55/2.78 35 3 7
% 2.55/2.78 36 68 55
% 2.55/2.78 37 3 8
% 2.55/2.78 38 6 12
% 2.55/2.78 39 42 60
% 2.55/2.78 40 6 27
% 2.55/2.78 41 4 39
% 2.55/2.78 42 39 64
% 2.55/2.78 43 3 24
% 2.55/2.78 44 6 62
% 2.55/2.78 45 39 83
% 2.55/2.78 46 7 39
% 2.55/2.78 47 2 83
% 2.55/2.78 48 71 97
% 2.55/2.78 49 2 63
% 2.55/2.78 50 13 147
% 2.55/2.78 51 25 54
% 2.55/2.78 52 1 123
% 2.55/2.78 53 2 190
% 2.55/2.78 54 6 114
% 2.55/2.78 55 1 101
% 2.55/2.78 56 5 324
% 2.55/2.78 57 8 70
% 2.55/2.78 58 3 302
% 2.55/2.78 59 1 148
% 2.55/2.78 60 7 101
% 2.55/2.78 tot: 542 2512 (82.3% true)
% 2.55/2.78
% 2.55/2.78
% 2.55/2.78 Model 2 (0.00 seconds, 0 Inserts)
% 2.55/2.78
% 2.55/2.78 That finishes the proof of the theorem.
% 2.55/2.78
% 2.55/2.78 Process 28904 finished Sun Jul 10 19:13:18 2022
%------------------------------------------------------------------------------