TSTP Solution File: SET843-2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET843-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n019.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:10 EDT 2022
% Result : Unsatisfiable 0.18s 0.44s
% Output : Refutation 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SET843-2 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n019.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.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jul 11 04:33:38 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox2 on n019.cluster.edu,
% 0.12/0.35 Mon Jul 11 04:33:38 2022
% 0.12/0.35 The command was "./sos". The process ID is 22181.
% 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=1, symmetry=0, max_lits=4.
% 0.12/0.35
% 0.12/0.35 This ia a non-Horn set with equality. The strategy will be
% 0.12/0.35 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.35 unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.35 clauses in usable.
% 0.12/0.35
% 0.12/0.35 dependent: set(knuth_bendix).
% 0.12/0.35 dependent: set(para_from).
% 0.12/0.35 dependent: set(para_into).
% 0.12/0.35 dependent: clear(para_from_right).
% 0.12/0.35 dependent: clear(para_into_right).
% 0.12/0.35 dependent: set(para_from_vars).
% 0.12/0.35 dependent: set(eq_units_both_ways).
% 0.12/0.35 dependent: set(dynamic_demod_all).
% 0.12/0.35 dependent: set(dynamic_demod).
% 0.12/0.35 dependent: set(order_eq).
% 0.12/0.35 dependent: set(back_demod).
% 0.12/0.35 dependent: set(lrpo).
% 0.12/0.35 dependent: set(hyper_res).
% 0.12/0.35 dependent: set(unit_deletion).
% 0.12/0.35 dependent: set(factor).
% 0.12/0.35
% 0.12/0.35 ------------> process usable:
% 0.12/0.35
% 0.12/0.35 ------------> process sos:
% 0.12/0.35 11 back subsumes 10.
% 0.12/0.35 Following clause subsumed by 16 during input processing: 0 [copy,16,flip.1] {-} A=A.
% 0.12/0.35 16 back subsumes 9.
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.18/0.39
% 0.18/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.18/0.39
% 0.18/0.39 Stopped by limit on number of solutions
% 0.18/0.39
% 0.18/0.39
% 0.18/0.39 -------------- Softie stats --------------
% 0.18/0.39
% 0.18/0.39 UPDATE_STOP: 300
% 0.18/0.39 SFINDER_TIME_LIMIT: 2
% 0.18/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.39 number of clauses in intial UL: 6
% 0.18/0.39 number of clauses initially in problem: 11
% 0.18/0.39 percentage of clauses intially in UL: 54
% 0.18/0.39 percentage of distinct symbols occuring in initial UL: 100
% 0.18/0.39 percent of all initial clauses that are short: 100
% 0.18/0.39 absolute distinct symbol count: 10
% 0.18/0.39 distinct predicate count: 3
% 0.18/0.39 distinct function count: 4
% 0.18/0.39 distinct constant count: 3
% 0.18/0.39
% 0.18/0.39 ---------- no more Softie stats ----------
% 0.18/0.39
% 0.18/0.39
% 0.18/0.39
% 0.18/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.18/0.39
% 0.18/0.39 Stopped by limit on number of solutions
% 0.18/0.39
% 0.18/0.39 =========== start of search ===========
% 0.18/0.44
% 0.18/0.44 -------- PROOF --------
% 0.18/0.44 % SZS status Unsatisfiable
% 0.18/0.44 % SZS output start Refutation
% 0.18/0.44
% 0.18/0.44 Model 3 (0.00 seconds, 0 Inserts)
% 0.18/0.44
% 0.18/0.44 Stopped by limit on number of solutions
% 0.18/0.44
% 0.18/0.44 ----> UNIT CONFLICT at 0.06 sec ----> 236 [binary,234.1,122.1] {-} $F.
% 0.18/0.44
% 0.18/0.44 Length of proof is 13. Level of proof is 7.
% 0.18/0.44
% 0.18/0.44 ---------------- PROOF ----------------
% 0.18/0.44 % SZS status Unsatisfiable
% 0.18/0.44 % SZS output start Refutation
% 0.18/0.44
% 0.18/0.44 1 [] {+} -c_in(A,B,tc_set(C))|c_lessequals(A,c_Union(B,C),tc_set(C)).
% 0.18/0.44 2 [] {+} -c_lessequals(A,B,tc_set(C))| -c_lessequals(B,A,tc_set(C))|B=A.
% 0.18/0.44 3 [] {+} -c_in(A,c_Zorn_OTFin(B,C),tc_set(tc_set(C)))|c_in(c_Zorn_Osucc(B,A,C),c_Zorn_OTFin(B,C),tc_set(tc_set(C))).
% 0.18/0.44 4 [] {+} -c_lessequals(A,c_Zorn_OTFin(B,C),tc_set(tc_set(tc_set(C))))|c_in(c_Union(A,tc_set(C)),c_Zorn_OTFin(B,C),tc_set(tc_set(C))).
% 0.18/0.44 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)))|A!=c_Zorn_Osucc(B,A,C)|c_lessequals(D,A,tc_set(tc_set(C))).
% 0.18/0.44 6 [copy,5,flip.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_Zorn_Osucc(B,A,C)!=A|c_lessequals(D,A,tc_set(tc_set(C))).
% 0.18/0.44 7 [] {-} v_m!=c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a))|v_m!=c_Zorn_Osucc(v_S,v_m,t_a).
% 0.18/0.44 8 [copy,7,flip.1,flip.2] {+} c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a))!=v_m|c_Zorn_Osucc(v_S,v_m,t_a)!=v_m.
% 0.18/0.44 11 [] {+} c_lessequals(A,A,tc_set(B)).
% 0.18/0.44 12 [] {+} c_lessequals(A,c_Zorn_Osucc(B,A,C),tc_set(tc_set(C))).
% 0.18/0.44 13 [] {-} c_in(v_m,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))).
% 0.18/0.44 14 [] {-} v_m=c_Zorn_Osucc(v_S,v_m,t_a)|v_m=c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)).
% 0.18/0.44 15 [copy,14,flip.1,flip.2] {-} c_Zorn_Osucc(v_S,v_m,t_a)=v_m|c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a))=v_m.
% 0.18/0.44 16 [] {+} A=A.
% 0.18/0.44 17 [hyper,11,4] {+} c_in(c_Union(c_Zorn_OTFin(A,B),tc_set(B)),c_Zorn_OTFin(A,B),tc_set(tc_set(B))).
% 0.18/0.44 22 [hyper,13,3] {+} c_in(c_Zorn_Osucc(v_S,v_m,t_a),c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))).
% 0.18/0.44 23 [hyper,13,1] {+} c_lessequals(v_m,c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),tc_set(tc_set(t_a))).
% 0.18/0.44 83 [hyper,22,6,13,15] {-} c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),v_m,tc_set(tc_set(t_a)))|c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a))=v_m.
% 0.18/0.44 112 [para_from,83.2.1,1.2.2] {-} -c_in(A,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))|c_lessequals(A,v_m,tc_set(tc_set(t_a)))|c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),v_m,tc_set(tc_set(t_a))).
% 0.18/0.44 113 [factor,112.2.3,unit_del,22] {-} c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),v_m,tc_set(tc_set(t_a))).
% 0.18/0.44 119,118 [hyper,113,2,12] {-} c_Zorn_Osucc(v_S,v_m,t_a)=v_m.
% 0.18/0.44 122 [back_demod,8,demod,119,unit_del,16] {+} c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a))!=v_m.
% 0.18/0.44 123 [hyper,118,6,13,17] {-} c_lessequals(c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),v_m,tc_set(tc_set(t_a))).
% 0.18/0.44 234 [hyper,23,2,123,flip.1] {-} c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a))=v_m.
% 0.18/0.44 236 [binary,234.1,122.1] {-} $F.
% 0.18/0.44
% 0.18/0.44 % SZS output end Refutation
% 0.18/0.44 ------------ end of proof -------------
% 0.18/0.44
% 0.18/0.44
% 0.18/0.44 Search stopped by max_proofs option.
% 0.18/0.44
% 0.18/0.44
% 0.18/0.44 Search stopped by max_proofs option.
% 0.18/0.44
% 0.18/0.44 ============ end of search ============
% 0.18/0.44
% 0.18/0.44 ----------- soft-scott stats ----------
% 0.18/0.44
% 0.18/0.44 true clauses given 8 (32.0%)
% 0.18/0.44 false clauses given 17
% 0.18/0.44
% 0.18/0.44 FALSE TRUE
% 0.18/0.44 14 0 2
% 0.18/0.44 16 0 6
% 0.18/0.44 18 0 11
% 0.18/0.44 19 1 2
% 0.18/0.44 20 4 3
% 0.18/0.44 21 5 7
% 0.18/0.44 22 4 4
% 0.18/0.44 23 2 3
% 0.18/0.44 24 8 5
% 0.18/0.44 25 4 3
% 0.18/0.44 26 14 0
% 0.18/0.44 27 12 6
% 0.18/0.44 28 19 1
% 0.18/0.44 29 20 7
% 0.18/0.44 30 11 0
% 0.18/0.44 31 0 5
% 0.18/0.44 32 0 2
% 0.18/0.44 33 0 3
% 0.18/0.44 34 0 2
% 0.18/0.44 35 0 2
% 0.18/0.44 tot: 104 74 (41.6% true)
% 0.18/0.44
% 0.18/0.44
% 0.18/0.44 Model 3 (0.00 seconds, 0 Inserts)
% 0.18/0.44
% 0.18/0.44 That finishes the proof of the theorem.
% 0.18/0.44
% 0.18/0.44 Process 22181 finished Mon Jul 11 04:33:38 2022
%------------------------------------------------------------------------------