TSTP Solution File: SET858-2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET858-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n013.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:22 EDT 2022
% Result : Unsatisfiable 0.19s 0.47s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SET858-2 : TPTP v8.1.0. Released v3.2.0.
% 0.10/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n013.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jul 11 00:59:14 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.36 ----- Otter 3.2, August 2001 -----
% 0.13/0.36 The process was started by sandbox2 on n013.cluster.edu,
% 0.13/0.36 Mon Jul 11 00:59:14 2022
% 0.13/0.36 The command was "./sos". The process ID is 23312.
% 0.13/0.36
% 0.13/0.36 set(prolog_style_variables).
% 0.13/0.36 set(auto).
% 0.13/0.36 dependent: set(auto1).
% 0.13/0.36 dependent: set(process_input).
% 0.13/0.36 dependent: clear(print_kept).
% 0.13/0.36 dependent: clear(print_new_demod).
% 0.13/0.36 dependent: clear(print_back_demod).
% 0.13/0.36 dependent: clear(print_back_sub).
% 0.13/0.36 dependent: set(control_memory).
% 0.13/0.36 dependent: assign(max_mem, 12000).
% 0.13/0.36 dependent: assign(pick_given_ratio, 4).
% 0.13/0.36 dependent: assign(stats_level, 1).
% 0.13/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.36 dependent: assign(sos_limit, 5000).
% 0.13/0.36 dependent: assign(max_weight, 60).
% 0.13/0.36 clear(print_given).
% 0.13/0.36
% 0.13/0.36 list(usable).
% 0.13/0.36
% 0.13/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 0.13/0.36
% 0.13/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.13/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.36 clauses in usable.
% 0.13/0.36
% 0.13/0.36 dependent: set(knuth_bendix).
% 0.13/0.36 dependent: set(para_from).
% 0.13/0.36 dependent: set(para_into).
% 0.13/0.36 dependent: clear(para_from_right).
% 0.13/0.36 dependent: clear(para_into_right).
% 0.13/0.36 dependent: set(para_from_vars).
% 0.13/0.36 dependent: set(eq_units_both_ways).
% 0.13/0.36 dependent: set(dynamic_demod_all).
% 0.13/0.36 dependent: set(dynamic_demod).
% 0.13/0.36 dependent: set(order_eq).
% 0.13/0.36 dependent: set(back_demod).
% 0.13/0.36 dependent: set(lrpo).
% 0.13/0.36 dependent: set(hyper_res).
% 0.13/0.36 dependent: set(unit_deletion).
% 0.13/0.36 dependent: set(factor).
% 0.13/0.36
% 0.13/0.36 ------------> process usable:
% 0.13/0.36
% 0.13/0.36 ------------> process sos:
% 0.13/0.36 Following clause subsumed by 18 during input processing: 0 [copy,18,flip.1] {-} A=A.
% 0.13/0.36 18 back subsumes 14.
% 0.13/0.36
% 0.13/0.36 ======= 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: 13
% 0.13/0.39 number of clauses initially in problem: 17
% 0.13/0.39 percentage of clauses intially in UL: 76
% 0.13/0.39 percentage of distinct symbols occuring in initial UL: 90
% 0.13/0.39 percent of all initial clauses that are short: 100
% 0.13/0.39 absolute distinct symbol count: 11
% 0.13/0.39 distinct predicate count: 3
% 0.13/0.39 distinct function count: 4
% 0.13/0.39 distinct constant count: 4
% 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 =========== start of search ===========
% 0.19/0.47
% 0.19/0.47 -------- PROOF --------
% 0.19/0.47 % SZS status Unsatisfiable
% 0.19/0.47 % SZS output start Refutation
% 0.19/0.47
% 0.19/0.47 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.47
% 0.19/0.47 Stopped by limit on number of solutions
% 0.19/0.47
% 0.19/0.47 ----> UNIT CONFLICT at 0.08 sec ----> 285 [binary,284.1,2.1] {-} $F.
% 0.19/0.47
% 0.19/0.47 Length of proof is 8. Level of proof is 6.
% 0.19/0.47
% 0.19/0.47 ---------------- PROOF ----------------
% 0.19/0.47 % SZS status Unsatisfiable
% 0.19/0.47 % SZS output start Refutation
% 0.19/0.47
% 0.19/0.47 1 [] {+} -c_lessequals(v_n,v_m,tc_set(tc_set(t_a))).
% 0.19/0.47 2 [] {+} -c_lessequals(v_m,v_n,tc_set(tc_set(t_a))).
% 0.19/0.47 3 [] {+} -c_lessequals(A,B,tc_set(C))| -c_lessequals(D,A,tc_set(C))|c_lessequals(D,B,tc_set(C)).
% 0.19/0.47 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_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))).
% 0.19/0.47 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_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))).
% 0.19/0.47 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_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))).
% 0.19/0.47 7 [] {+} -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))).
% 0.19/0.47 8 [] {+} -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(A,D,tc_set(tc_set(C)))|c_lessequals(c_Zorn_Osucc(B,A,C),D,tc_set(tc_set(C)))|A=D.
% 0.19/0.47 15 [] {-} c_in(v_m,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))).
% 0.19/0.47 16 [] {-} c_in(v_n,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))).
% 0.19/0.47 17 [] {+} c_lessequals(A,c_Zorn_Osucc(B,A,C),tc_set(tc_set(C))).
% 0.19/0.47 34 [hyper,16,5,15,unit_del,1] {-} c_lessequals(c_Zorn_OTFin__linear__lemma1__1(v_S,v_m,t_a),v_m,tc_set(tc_set(t_a)))|c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),v_n,tc_set(tc_set(t_a))).
% 0.19/0.47 36 [hyper,16,4,15,unit_del,1] {-} c_in(c_Zorn_OTFin__linear__lemma1__1(v_S,v_m,t_a),c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))|c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),v_n,tc_set(tc_set(t_a))).
% 0.19/0.47 47 [hyper,34,3,17,unit_del,2] {-} c_lessequals(c_Zorn_OTFin__linear__lemma1__1(v_S,v_m,t_a),v_m,tc_set(tc_set(t_a))).
% 0.19/0.47 121 [hyper,36,3,17,unit_del,2] {-} c_in(c_Zorn_OTFin__linear__lemma1__1(v_S,v_m,t_a),c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))).
% 0.19/0.47 124 [hyper,121,8,15,47] {-} c_lessequals(c_Zorn_Osucc(v_S,c_Zorn_OTFin__linear__lemma1__1(v_S,v_m,t_a),t_a),v_m,tc_set(tc_set(t_a)))|c_Zorn_OTFin__linear__lemma1__1(v_S,v_m,t_a)=v_m.
% 0.19/0.47 141 [hyper,124,6,15,16,unit_del,1] {-} c_lessequals(c_Zorn_Osucc(v_S,c_Zorn_OTFin__linear__lemma1__1(v_S,v_m,t_a),t_a),v_m,tc_set(tc_set(t_a)))|c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),v_n,tc_set(tc_set(t_a))).
% 0.19/0.47 276 [hyper,141,7,15,16,unit_del,1,factor_simp] {-} c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),v_n,tc_set(tc_set(t_a))).
% 0.19/0.47 284 [hyper,276,3,17] {-} c_lessequals(v_m,v_n,tc_set(tc_set(t_a))).
% 0.19/0.47 285 [binary,284.1,2.1] {-} $F.
% 0.19/0.47
% 0.19/0.47 % SZS output end Refutation
% 0.19/0.47 ------------ end of proof -------------
% 0.19/0.47
% 0.19/0.47
% 0.19/0.47 Search stopped by max_proofs option.
% 0.19/0.47
% 0.19/0.47
% 0.19/0.47 Search stopped by max_proofs option.
% 0.19/0.47
% 0.19/0.47 ============ end of search ============
% 0.19/0.47
% 0.19/0.47 ----------- soft-scott stats ----------
% 0.19/0.47
% 0.19/0.47 true clauses given 8 (24.2%)
% 0.19/0.47 false clauses given 25
% 0.19/0.47
% 0.19/0.47 FALSE TRUE
% 0.19/0.47 12 1 0
% 0.19/0.47 15 0 2
% 0.19/0.47 18 0 3
% 0.19/0.47 21 1 1
% 0.19/0.47 33 0 1
% 0.19/0.47 35 0 4
% 0.19/0.47 36 0 3
% 0.19/0.47 37 0 6
% 0.19/0.47 39 0 6
% 0.19/0.47 40 0 10
% 0.19/0.47 41 0 9
% 0.19/0.47 42 0 19
% 0.19/0.47 43 0 15
% 0.19/0.47 44 0 5
% 0.19/0.47 45 0 3
% 0.19/0.47 46 0 14
% 0.19/0.47 47 0 3
% 0.19/0.47 48 0 3
% 0.19/0.47 49 0 22
% 0.19/0.47 50 0 1
% 0.19/0.47 51 0 2
% 0.19/0.47 52 0 2
% 0.19/0.47 53 0 2
% 0.19/0.47 55 0 4
% 0.19/0.47 58 0 1
% 0.19/0.47 tot: 2 141 (98.6% true)
% 0.19/0.47
% 0.19/0.47
% 0.19/0.47 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.47
% 0.19/0.47 That finishes the proof of the theorem.
% 0.19/0.47
% 0.19/0.47 Process 23312 finished Mon Jul 11 00:59:15 2022
%------------------------------------------------------------------------------