TSTP Solution File: SET847-2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET847-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n018.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:13 EDT 2022
% Result : Unsatisfiable 14.12s 14.38s
% Output : Refutation 14.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : SET847-2 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n018.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 : Sat Jul 9 21:48:57 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 sandbox on n018.cluster.edu,
% 0.12/0.35 Sat Jul 9 21:48:57 2022
% 0.12/0.35 The command was "./sos". The process ID is 27802.
% 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=3.
% 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 Following clause subsumed by 14 during input processing: 0 [copy,14,flip.1] {-} A=A.
% 0.12/0.35 14 back subsumes 10.
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.18/0.41
% 0.18/0.41 Model 1 (0.00 seconds, 0 Inserts)
% 0.18/0.41
% 0.18/0.41 Stopped by limit on number of solutions
% 0.18/0.41
% 0.18/0.41
% 0.18/0.41 -------------- Softie stats --------------
% 0.18/0.41
% 0.18/0.41 UPDATE_STOP: 300
% 0.18/0.41 SFINDER_TIME_LIMIT: 2
% 0.18/0.41 SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.41 number of clauses in intial UL: 8
% 0.18/0.41 number of clauses initially in problem: 12
% 0.18/0.41 percentage of clauses intially in UL: 66
% 0.18/0.41 percentage of distinct symbols occuring in initial UL: 92
% 0.18/0.41 percent of all initial clauses that are short: 100
% 0.18/0.41 absolute distinct symbol count: 14
% 0.18/0.41 distinct predicate count: 3
% 0.18/0.41 distinct function count: 8
% 0.18/0.41 distinct constant count: 3
% 0.18/0.41
% 0.18/0.41 ---------- no more Softie stats ----------
% 0.18/0.41
% 0.18/0.41
% 0.18/0.41
% 0.18/0.41 Model 2 (0.00 seconds, 0 Inserts)
% 0.18/0.41
% 0.18/0.41 Stopped by limit on number of solutions
% 0.18/0.41
% 0.18/0.41 =========== start of search ===========
% 14.12/14.38
% 14.12/14.38 -- HEY sandbox, WE HAVE A PROOF!! --
% 14.12/14.38
% 14.12/14.38 Stopped by limit on insertions
% 14.12/14.38
% 14.12/14.38 Stopped by limit on insertions
% 14.12/14.38
% 14.12/14.38 Model 3 [ 3 8 94789 ] (0.00 seconds, 250000 Inserts)
% 14.12/14.38
% 14.12/14.38 ----> UNIT CONFLICT at 13.99 sec ----> 6322 [binary,6321.1,54.1] {+} $F.
% 14.12/14.38
% 14.12/14.38 Length of proof is 7. Level of proof is 4.
% 14.12/14.38
% 14.12/14.38 ---------------- PROOF ----------------
% 14.12/14.38 % SZS status Unsatisfiable
% 14.12/14.38 % SZS output start Refutation
% 14.12/14.38
% 14.12/14.38 1 [] {+} -c_in(A,B,C)|c_in(A,D,C)|c_in(A,c_minus(B,D,tc_set(C)),C).
% 14.12/14.38 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))).
% 14.12/14.38 5 [] {+} -c_in(A,c_Zorn_OTFin(B,C),tc_set(tc_set(C)))|c_in(A,c_Zorn_Ochain(B,C),tc_set(tc_set(C))).
% 14.12/14.38 6 [] {-} -c_in(c_Union(c_Zorn_OTFin(A,B),tc_set(B)),c_Zorn_OTFin(A,B),tc_set(tc_set(B)))|c_Union(c_Zorn_OTFin(A,B),tc_set(B))=c_Zorn_Osucc(A,c_Union(c_Zorn_OTFin(A,B),tc_set(B)),B).
% 14.12/14.38 7 [copy,6,flip.2] {+} -c_in(c_Union(c_Zorn_OTFin(A,B),tc_set(B)),c_Zorn_OTFin(A,B),tc_set(tc_set(B)))|c_Zorn_Osucc(A,c_Union(c_Zorn_OTFin(A,B),tc_set(B)),B)=c_Union(c_Zorn_OTFin(A,B),tc_set(B)).
% 14.12/14.38 8 [] {+} -c_in(A,c_minus(c_Zorn_Ochain(B,C),c_Zorn_Omaxchain(B,C),tc_set(tc_set(tc_set(C)))),tc_set(tc_set(C)))|c_Zorn_Osucc(B,A,C)!=A.
% 14.12/14.38 9 [] {+} -c_in(A,c_Zorn_Omaxchain(v_S,t_a),tc_set(tc_set(t_a))).
% 14.12/14.38 13 [] {-} c_lessequals(A,A,tc_set(B)).
% 14.12/14.38 14 [] {+} A=A.
% 14.12/14.38 18 [hyper,13,4] {-} c_in(c_Union(c_Zorn_OTFin(A,B),tc_set(B)),c_Zorn_OTFin(A,B),tc_set(tc_set(B))).
% 14.12/14.38 26 [hyper,18,7] {-} c_Zorn_Osucc(A,c_Union(c_Zorn_OTFin(A,B),tc_set(B)),B)=c_Union(c_Zorn_OTFin(A,B),tc_set(B)).
% 14.12/14.38 28 [hyper,18,5] {-} c_in(c_Union(c_Zorn_OTFin(A,B),tc_set(B)),c_Zorn_Ochain(A,B),tc_set(tc_set(B))).
% 14.12/14.38 44 [hyper,28,1] {-} c_in(c_Union(c_Zorn_OTFin(A,B),tc_set(B)),C,tc_set(tc_set(B)))|c_in(c_Union(c_Zorn_OTFin(A,B),tc_set(B)),c_minus(c_Zorn_Ochain(A,B),C,tc_set(tc_set(tc_set(B)))),tc_set(tc_set(B))).
% 14.12/14.38 54 [para_from,26.1.1,8.2.1,unit_del,14] {-} -c_in(c_Union(c_Zorn_OTFin(A,B),tc_set(B)),c_minus(c_Zorn_Ochain(A,B),c_Zorn_Omaxchain(A,B),tc_set(tc_set(tc_set(B)))),tc_set(tc_set(B))).
% 14.12/14.38 6321 [hyper,44,9] {-} c_in(c_Union(c_Zorn_OTFin(A,t_a),tc_set(t_a)),c_minus(c_Zorn_Ochain(A,t_a),c_Zorn_Omaxchain(v_S,t_a),tc_set(tc_set(tc_set(t_a)))),tc_set(tc_set(t_a))).
% 14.12/14.38 6322 [binary,6321.1,54.1] {+} $F.
% 14.12/14.38
% 14.12/14.38 % SZS output end Refutation
% 14.12/14.38 ------------ end of proof -------------
% 14.12/14.38
% 14.12/14.38
% 14.12/14.38 Search stopped by max_proofs option.
% 14.12/14.38
% 14.12/14.38
% 14.12/14.38 Search stopped by max_proofs option.
% 14.12/14.38
% 14.12/14.38 ============ end of search ============
% 14.12/14.38
% 14.12/14.38 ----------- soft-scott stats ----------
% 14.12/14.38
% 14.12/14.38 true clauses given 40 (37.7%)
% 14.12/14.38 false clauses given 66
% 14.12/14.38
% 14.12/14.38 FALSE TRUE
% 14.12/14.38 15 0 12
% 14.12/14.38 16 0 9
% 14.12/14.38 17 0 19
% 14.12/14.38 18 0 20
% 14.12/14.38 19 0 17
% 14.12/14.38 20 0 31
% 14.12/14.38 21 0 30
% 14.12/14.38 22 0 23
% 14.12/14.38 23 0 39
% 14.12/14.38 24 0 49
% 14.12/14.38 25 4 49
% 14.12/14.38 26 1 37
% 14.12/14.38 27 0 80
% 14.12/14.38 28 15 64
% 14.12/14.38 29 5 110
% 14.12/14.38 30 27 88
% 14.12/14.38 31 25 186
% 14.12/14.38 32 8 89
% 14.12/14.38 33 55 143
% 14.12/14.38 34 16 229
% 14.12/14.38 35 42 119
% 14.12/14.38 36 40 267
% 14.12/14.38 37 18 165
% 14.12/14.38 38 30 122
% 14.12/14.38 39 46 278
% 14.12/14.38 40 13 141
% 14.12/14.38 41 75 101
% 14.12/14.38 42 12 0
% 14.12/14.38 43 57 0
% 14.12/14.38 44 18 0
% 14.12/14.38 45 16 0
% 14.12/14.38 46 89 0
% 14.12/14.38 47 14 0
% 14.12/14.38 48 68 0
% 14.12/14.38 49 12 0
% 14.12/14.38 50 12 0
% 14.12/14.38 51 55 0
% 14.12/14.38 52 32 0
% 14.12/14.38 53 10 0
% 14.12/14.38 54 2 0
% 14.12/14.38 55 3 0
% 14.12/14.38 56 5 0
% 14.12/14.38 58 12 0
% 14.12/14.38 59 1 0
% 14.12/14.38 60 1 0
% 14.12/14.38 tot: 839 2517 (75.0% true)
% 14.12/14.38
% 14.12/14.38
% 14.12/14.38 Model 3 [ 3 8 94789 ] (0.00 seconds, 250000 Inserts)
% 14.12/14.38
% 14.12/14.38 That finishes the proof of the theorem.
% 14.12/14.38
% 14.12/14.38 Process 27802 finished Sat Jul 9 21:49:11 2022
%------------------------------------------------------------------------------