TSTP Solution File: SET863-2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET863-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n026.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:25 EDT 2022
% Result : Unsatisfiable 2.26s 2.47s
% Output : Refutation 2.26s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET863-2 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.13 % Command : sos-script %s
% 0.12/0.33 % Computer : n026.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jul 11 07:35:57 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox2 on n026.cluster.edu,
% 0.12/0.35 Mon Jul 11 07:35:57 2022
% 0.12/0.35 The command was "./sos". The process ID is 18423.
% 0.12/0.35
% 0.12/0.35 set(prolog_style_variables).
% 0.12/0.35 set(auto).
% 0.12/0.35 dependent: set(auto1).
% 0.12/0.35 dependent: set(process_input).
% 0.12/0.35 dependent: clear(print_kept).
% 0.12/0.35 dependent: clear(print_new_demod).
% 0.12/0.35 dependent: clear(print_back_demod).
% 0.12/0.35 dependent: clear(print_back_sub).
% 0.12/0.35 dependent: set(control_memory).
% 0.12/0.35 dependent: assign(max_mem, 12000).
% 0.12/0.35 dependent: assign(pick_given_ratio, 4).
% 0.12/0.35 dependent: assign(stats_level, 1).
% 0.12/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.35 dependent: assign(sos_limit, 5000).
% 0.12/0.35 dependent: assign(max_weight, 60).
% 0.12/0.35 clear(print_given).
% 0.12/0.35
% 0.12/0.35 list(usable).
% 0.12/0.35
% 0.12/0.35 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=5.
% 0.12/0.35
% 0.12/0.35 This is a non-Horn set without equality. The strategy
% 0.12/0.35 will be ordered hyper_res, ur_res, unit deletion, and
% 0.12/0.35 factoring, with satellites in sos and nuclei in usable.
% 0.12/0.35
% 0.12/0.35 dependent: set(hyper_res).
% 0.12/0.35 dependent: set(factor).
% 0.12/0.35 dependent: set(unit_deletion).
% 0.12/0.35
% 0.12/0.35 ------------> process usable:
% 0.12/0.35
% 0.12/0.35 ------------> process sos:
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.19/0.53
% 0.19/0.53 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.53
% 0.19/0.53 Stopped by limit on number of solutions
% 0.19/0.53
% 0.19/0.53
% 0.19/0.53 -------------- Softie stats --------------
% 0.19/0.53
% 0.19/0.53 UPDATE_STOP: 300
% 0.19/0.53 SFINDER_TIME_LIMIT: 2
% 0.19/0.53 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.53 number of clauses in intial UL: 8
% 0.19/0.53 number of clauses initially in problem: 14
% 0.19/0.53 percentage of clauses intially in UL: 57
% 0.19/0.53 percentage of distinct symbols occuring in initial UL: 88
% 0.19/0.53 percent of all initial clauses that are short: 100
% 0.19/0.53 absolute distinct symbol count: 17
% 0.19/0.53 distinct predicate count: 2
% 0.19/0.53 distinct function count: 8
% 0.19/0.53 distinct constant count: 7
% 0.19/0.53
% 0.19/0.53 ---------- no more Softie stats ----------
% 0.19/0.53
% 0.19/0.53
% 0.19/0.53
% 0.19/0.53 Stopped by limit on insertions
% 0.19/0.53
% 0.19/0.53 =========== start of search ===========
% 2.26/2.47
% 2.26/2.47 -------- PROOF --------
% 2.26/2.47 % SZS status Unsatisfiable
% 2.26/2.47 % SZS output start Refutation
% 2.26/2.47
% 2.26/2.47 Stopped by limit on insertions
% 2.26/2.47
% 2.26/2.47 Model 2 [ 6 2 5879 ] (0.00 seconds, 250000 Inserts)
% 2.26/2.47
% 2.26/2.47 ----> UNIT CONFLICT at 2.07 sec ----> 3711 [binary,3710.1,7.1] {-} $F.
% 2.26/2.47
% 2.26/2.47 Length of proof is 19. Level of proof is 14.
% 2.26/2.47
% 2.26/2.47 ---------------- PROOF ----------------
% 2.26/2.47 % SZS status Unsatisfiable
% 2.26/2.47 % SZS output start Refutation
% 2.26/2.47
% 2.26/2.47 1 [] {+} -c_in(A,B,C)| -c_lessequals(B,D,tc_set(C))|c_in(A,D,C).
% 2.26/2.47 2 [] {+} -c_in(c_Main_OsubsetI__1(A,B,C),B,C)|c_lessequals(A,B,tc_set(C)).
% 2.26/2.47 3 [] {+} -c_in(A,B,tc_set(C))| -c_in(D,c_Zorn_Ochain(B,C),tc_set(tc_set(C)))|c_in(c_Zorn_Ochain__extend__1(D,A,C),D,tc_set(C))|c_in(c_union(c_insert(A,c_emptyset,tc_set(C)),D,tc_set(C)),c_Zorn_Ochain(B,C),tc_set(tc_set(C))).
% 2.26/2.47 4 [] {+} -c_in(A,B,tc_set(C))| -c_in(D,c_Zorn_Ochain(B,C),tc_set(tc_set(C)))| -c_lessequals(c_Zorn_Ochain__extend__1(D,A,C),A,tc_set(C))|c_in(c_union(c_insert(A,c_emptyset,tc_set(C)),D,tc_set(C)),c_Zorn_Ochain(B,C),tc_set(tc_set(C))).
% 2.26/2.47 5 [] {+} -c_in(A,B,C)| -c_in(D,c_Zorn_Omaxchain(E,C),tc_set(tc_set(C)))| -c_in(c_union(c_insert(B,c_emptyset,tc_set(C)),D,tc_set(C)),c_Zorn_Ochain(E,C),tc_set(tc_set(C)))|c_in(A,F,C)|c_in(c_Zorn_Omaxchain__super__lemma__1(D,F,C),D,tc_set(C)).
% 2.26/2.47 6 [] {+} -c_in(A,B,C)| -c_in(D,c_Zorn_Omaxchain(E,C),tc_set(tc_set(C)))| -c_in(c_union(c_insert(B,c_emptyset,tc_set(C)),D,tc_set(C)),c_Zorn_Ochain(E,C),tc_set(tc_set(C)))| -c_lessequals(c_Zorn_Omaxchain__super__lemma__1(D,F,C),F,tc_set(C))|c_in(A,F,C).
% 2.26/2.47 7 [] {+} -c_in(v_xa,v_y,t_a).
% 2.26/2.47 8 [] {+} c_lessequals(A,v_y,tc_set(t_a))| -c_in(A,v_c,tc_set(t_a)).
% 2.26/2.47 9 [] {-} c_in(c_Main_OsubsetI__1(A,B,C),A,C)|c_lessequals(A,B,tc_set(C)).
% 2.26/2.47 10 [] {-} c_in(v_c,c_Zorn_Omaxchain(v_S,t_a),tc_set(tc_set(t_a))).
% 2.26/2.47 11 [] {+} c_in(v_c,c_Zorn_Ochain(v_S,t_a),tc_set(tc_set(t_a))).
% 2.26/2.47 12 [] {-} c_in(v_x,v_S,tc_set(t_a)).
% 2.26/2.47 13 [] {+} c_lessequals(v_y,v_x,tc_set(t_a)).
% 2.26/2.47 14 [] {+} c_in(v_xa,v_x,t_a).
% 2.26/2.47 18 [hyper,11,4,12,9] {+} c_in(c_union(c_insert(v_x,c_emptyset,tc_set(t_a)),v_c,tc_set(t_a)),c_Zorn_Ochain(v_S,t_a),tc_set(tc_set(t_a)))|c_in(c_Main_OsubsetI__1(c_Zorn_Ochain__extend__1(v_c,v_x,t_a),v_x,t_a),c_Zorn_Ochain__extend__1(v_c,v_x,t_a),t_a).
% 2.26/2.47 19 [hyper,11,3,12] {+} c_in(c_Zorn_Ochain__extend__1(v_c,v_x,t_a),v_c,tc_set(t_a))|c_in(c_union(c_insert(v_x,c_emptyset,tc_set(t_a)),v_c,tc_set(t_a)),c_Zorn_Ochain(v_S,t_a),tc_set(tc_set(t_a))).
% 2.26/2.47 70 [hyper,18,5,14,10] {+} c_in(c_Main_OsubsetI__1(c_Zorn_Ochain__extend__1(v_c,v_x,t_a),v_x,t_a),c_Zorn_Ochain__extend__1(v_c,v_x,t_a),t_a)|c_in(v_xa,A,t_a)|c_in(c_Zorn_Omaxchain__super__lemma__1(v_c,A,t_a),v_c,tc_set(t_a)).
% 2.26/2.47 119 [hyper,19,5,14,10] {-} c_in(c_Zorn_Ochain__extend__1(v_c,v_x,t_a),v_c,tc_set(t_a))|c_in(v_xa,A,t_a)|c_in(c_Zorn_Omaxchain__super__lemma__1(v_c,A,t_a),v_c,tc_set(t_a)).
% 2.26/2.47 125 [hyper,119,7] {-} c_in(c_Zorn_Ochain__extend__1(v_c,v_x,t_a),v_c,tc_set(t_a))|c_in(c_Zorn_Omaxchain__super__lemma__1(v_c,v_y,t_a),v_c,tc_set(t_a)).
% 2.26/2.47 133 [hyper,125,8] {-} c_in(c_Zorn_Ochain__extend__1(v_c,v_x,t_a),v_c,tc_set(t_a))|c_lessequals(c_Zorn_Omaxchain__super__lemma__1(v_c,v_y,t_a),v_y,tc_set(t_a)).
% 2.26/2.47 149 [hyper,133,6,14,10,19,unit_del,7,factor_simp] {-} c_in(c_Zorn_Ochain__extend__1(v_c,v_x,t_a),v_c,tc_set(t_a)).
% 2.26/2.47 158 [hyper,149,8] {-} c_lessequals(c_Zorn_Ochain__extend__1(v_c,v_x,t_a),v_y,tc_set(t_a)).
% 2.26/2.47 841 [hyper,70,7] {+} c_in(c_Main_OsubsetI__1(c_Zorn_Ochain__extend__1(v_c,v_x,t_a),v_x,t_a),c_Zorn_Ochain__extend__1(v_c,v_x,t_a),t_a)|c_in(c_Zorn_Omaxchain__super__lemma__1(v_c,v_y,t_a),v_c,tc_set(t_a)).
% 2.26/2.47 1779 [hyper,841,8] {+} c_in(c_Main_OsubsetI__1(c_Zorn_Ochain__extend__1(v_c,v_x,t_a),v_x,t_a),c_Zorn_Ochain__extend__1(v_c,v_x,t_a),t_a)|c_lessequals(c_Zorn_Omaxchain__super__lemma__1(v_c,v_y,t_a),v_y,tc_set(t_a)).
% 2.26/2.47 2364 [hyper,1779,6,14,10,18,unit_del,7,factor_simp] {+} c_in(c_Main_OsubsetI__1(c_Zorn_Ochain__extend__1(v_c,v_x,t_a),v_x,t_a),c_Zorn_Ochain__extend__1(v_c,v_x,t_a),t_a).
% 2.26/2.47 2379 [hyper,2364,1,158] {-} c_in(c_Main_OsubsetI__1(c_Zorn_Ochain__extend__1(v_c,v_x,t_a),v_x,t_a),v_y,t_a).
% 2.26/2.47 2381 [hyper,2379,1,13] {-} c_in(c_Main_OsubsetI__1(c_Zorn_Ochain__extend__1(v_c,v_x,t_a),v_x,t_a),v_x,t_a).
% 2.26/2.47 2383 [hyper,2381,2] {-} c_lessequals(c_Zorn_Ochain__extend__1(v_c,v_x,t_a),v_x,tc_set(t_a)).
% 2.26/2.47 2458 [hyper,2383,4,12,11] {+} c_in(c_union(c_insert(v_x,c_emptyset,tc_set(t_a)),v_c,tc_set(t_a)),c_Zorn_Ochain(v_S,t_a),tc_set(tc_set(t_a))).
% 2.26/2.47 3001 [hyper,2458,5,14,10] {-} c_in(v_xa,A,t_a)|c_in(c_Zorn_Omaxchain__super__lemma__1(v_c,A,t_a),v_c,tc_set(t_a)).
% 2.26/2.47 3021 [hyper,3001,7] {-} c_in(c_Zorn_Omaxchain__super__lemma__1(v_c,v_y,t_a),v_c,tc_set(t_a)).
% 2.26/2.47 3037 [hyper,3021,8] {-} c_lessequals(c_Zorn_Omaxchain__super__lemma__1(v_c,v_y,t_a),v_y,tc_set(t_a)).
% 2.26/2.47 3710 [hyper,3037,6,14,10,2458] {-} c_in(v_xa,v_y,t_a).
% 2.26/2.47 3711 [binary,3710.1,7.1] {-} $F.
% 2.26/2.47
% 2.26/2.47 % SZS output end Refutation
% 2.26/2.47 ------------ end of proof -------------
% 2.26/2.47
% 2.26/2.47
% 2.26/2.47 Search stopped by max_proofs option.
% 2.26/2.47
% 2.26/2.47
% 2.26/2.47 Search stopped by max_proofs option.
% 2.26/2.47
% 2.26/2.47 ============ end of search ============
% 2.26/2.47
% 2.26/2.47 ----------- soft-scott stats ----------
% 2.26/2.47
% 2.26/2.47 true clauses given 53 (35.6%)
% 2.26/2.47 false clauses given 96
% 2.26/2.47
% 2.26/2.47 FALSE TRUE
% 2.26/2.47 11 1 0
% 2.26/2.47 12 1 0
% 2.26/2.47 15 1 0
% 2.26/2.47 17 1 2
% 2.26/2.47 18 2 0
% 2.26/2.47 19 2 0
% 2.26/2.47 20 1 1
% 2.26/2.47 21 1 0
% 2.26/2.47 22 2 0
% 2.26/2.47 23 1 3
% 2.26/2.47 24 1 2
% 2.26/2.47 25 3 5
% 2.26/2.47 26 2 0
% 2.26/2.47 27 1 2
% 2.26/2.47 28 0 11
% 2.26/2.47 29 7 1
% 2.26/2.47 30 3 3
% 2.26/2.47 31 10 12
% 2.26/2.47 32 9 2
% 2.26/2.47 33 0 1
% 2.26/2.47 34 2 6
% 2.26/2.47 35 0 2
% 2.26/2.47 36 12 1
% 2.26/2.47 37 6 9
% 2.26/2.47 38 6 1
% 2.26/2.47 39 2 1
% 2.26/2.47 40 11 0
% 2.26/2.47 41 20 4
% 2.26/2.47 42 4 2
% 2.26/2.47 43 4 0
% 2.26/2.47 44 22 4
% 2.26/2.47 45 10 4
% 2.26/2.47 46 5 4
% 2.26/2.47 47 1 6
% 2.26/2.47 48 3 6
% 2.26/2.47 49 2 4
% 2.26/2.47 50 0 15
% 2.26/2.47 51 1 10
% 2.26/2.47 52 1 5
% 2.26/2.47 53 1 6
% 2.26/2.47 54 0 11
% 2.26/2.47 55 0 18
% 2.26/2.47 56 1 9
% 2.26/2.47 57 3 19
% 2.26/2.47 58 7 34
% 2.26/2.47 59 2 23
% 2.26/2.47 60 2 13
% 2.26/2.47 tot: 177 262 (59.7% true)
% 2.26/2.47
% 2.26/2.47
% 2.26/2.47 Model 2 [ 6 2 5879 ] (0.00 seconds, 250000 Inserts)
% 2.26/2.47
% 2.26/2.47 That finishes the proof of the theorem.
% 2.26/2.47
% 2.26/2.47 Process 18423 finished Mon Jul 11 07:35:59 2022
%------------------------------------------------------------------------------