TSTP Solution File: SET845-2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET845-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n006.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:12 EDT 2022
% Result : Unsatisfiable 0.21s 0.42s
% Output : Refutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SET845-2 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.14 % Command : sos-script %s
% 0.13/0.35 % Computer : n006.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Mon Jul 11 08:24:35 EDT 2022
% 0.13/0.36 % CPUTime :
% 0.13/0.38 ----- Otter 3.2, August 2001 -----
% 0.13/0.38 The process was started by sandbox2 on n006.cluster.edu,
% 0.13/0.38 Mon Jul 11 08:24:35 2022
% 0.13/0.38 The command was "./sos". The process ID is 4454.
% 0.13/0.38
% 0.13/0.38 set(prolog_style_variables).
% 0.13/0.38 set(auto).
% 0.13/0.38 dependent: set(auto1).
% 0.13/0.38 dependent: set(process_input).
% 0.13/0.38 dependent: clear(print_kept).
% 0.13/0.38 dependent: clear(print_new_demod).
% 0.13/0.38 dependent: clear(print_back_demod).
% 0.13/0.38 dependent: clear(print_back_sub).
% 0.13/0.38 dependent: set(control_memory).
% 0.13/0.38 dependent: assign(max_mem, 12000).
% 0.13/0.38 dependent: assign(pick_given_ratio, 4).
% 0.13/0.38 dependent: assign(stats_level, 1).
% 0.13/0.38 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.38 dependent: assign(sos_limit, 5000).
% 0.13/0.38 dependent: assign(max_weight, 60).
% 0.13/0.38 clear(print_given).
% 0.13/0.38
% 0.13/0.38 list(usable).
% 0.13/0.38
% 0.13/0.38 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 0.13/0.38
% 0.13/0.38 This is a Horn set with equality. The strategy will be
% 0.13/0.38 Knuth-Bendix and hyper_res, with positive clauses in
% 0.13/0.38 sos and nonpositive clauses in usable.
% 0.13/0.38
% 0.13/0.38 dependent: set(knuth_bendix).
% 0.13/0.38 dependent: set(para_from).
% 0.13/0.38 dependent: set(para_into).
% 0.13/0.38 dependent: clear(para_from_right).
% 0.13/0.38 dependent: clear(para_into_right).
% 0.13/0.38 dependent: set(para_from_vars).
% 0.13/0.38 dependent: set(eq_units_both_ways).
% 0.13/0.38 dependent: set(dynamic_demod_all).
% 0.13/0.38 dependent: set(dynamic_demod).
% 0.13/0.38 dependent: set(order_eq).
% 0.13/0.38 dependent: set(back_demod).
% 0.13/0.38 dependent: set(lrpo).
% 0.13/0.38 dependent: set(hyper_res).
% 0.13/0.38 dependent: clear(order_hyper).
% 0.13/0.38
% 0.13/0.38 ------------> process usable:
% 0.13/0.38
% 0.13/0.38 ------------> process sos:
% 0.13/0.38 Following clause subsumed by 11 during input processing: 0 [copy,11,flip.1] {-} A=A.
% 0.13/0.38
% 0.13/0.38 ======= end of input processing =======
% 0.21/0.41
% 0.21/0.41 Model 1 (0.00 seconds, 0 Inserts)
% 0.21/0.41
% 0.21/0.41 Stopped by limit on number of solutions
% 0.21/0.41
% 0.21/0.41
% 0.21/0.41 -------------- Softie stats --------------
% 0.21/0.41
% 0.21/0.41 UPDATE_STOP: 300
% 0.21/0.41 SFINDER_TIME_LIMIT: 2
% 0.21/0.41 SHORT_CLAUSE_CUTOFF: 4
% 0.21/0.41 number of clauses in intial UL: 4
% 0.21/0.41 number of clauses initially in problem: 9
% 0.21/0.41 percentage of clauses intially in UL: 44
% 0.21/0.41 percentage of distinct symbols occuring in initial UL: 100
% 0.21/0.41 percent of all initial clauses that are short: 100
% 0.21/0.41 absolute distinct symbol count: 10
% 0.21/0.41 distinct predicate count: 3
% 0.21/0.41 distinct function count: 4
% 0.21/0.41 distinct constant count: 3
% 0.21/0.41
% 0.21/0.41 ---------- no more Softie stats ----------
% 0.21/0.41
% 0.21/0.41
% 0.21/0.41
% 0.21/0.41 Model 2 (0.00 seconds, 0 Inserts)
% 0.21/0.41
% 0.21/0.41 Stopped by limit on number of solutions
% 0.21/0.41
% 0.21/0.41 =========== start of search ===========
% 0.21/0.42
% 0.21/0.42 -------- PROOF --------
% 0.21/0.42 % SZS status Unsatisfiable
% 0.21/0.42 % SZS output start Refutation
% 0.21/0.42
% 0.21/0.42 ----> UNIT CONFLICT at 0.01 sec ----> 77 [binary,75.1,5.1] {-} $F.
% 0.21/0.42
% 0.21/0.42 Length of proof is 6. Level of proof is 4.
% 0.21/0.42
% 0.21/0.42 ---------------- PROOF ----------------
% 0.21/0.42 % SZS status Unsatisfiable
% 0.21/0.42 % SZS output start Refutation
% 0.21/0.42
% 0.21/0.42 1 [] {+} -c_in(A,B,tc_set(C))|c_lessequals(A,c_Union(B,C),tc_set(C)).
% 0.21/0.42 2 [] {+} -c_lessequals(A,B,tc_set(C))| -c_lessequals(B,A,tc_set(C))|B=A.
% 0.21/0.42 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.21/0.42 4 [] {-} v_m!=c_Zorn_Osucc(v_S,v_m,t_a).
% 0.21/0.42 5 [copy,4,flip.1] {+} c_Zorn_Osucc(v_S,v_m,t_a)!=v_m.
% 0.21/0.42 6 [] {+} c_lessequals(A,c_Zorn_Osucc(B,A,C),tc_set(tc_set(C))).
% 0.21/0.42 7 [] {+} c_in(v_m,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))).
% 0.21/0.42 8 [] {-} v_m=c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)).
% 0.21/0.42 9 [copy,8,flip.1] {-} c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a))=v_m.
% 0.21/0.42 20 [para_from,9.1.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))).
% 0.21/0.42 41 [hyper,7,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.21/0.42 63 [hyper,41,20] {-} c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),v_m,tc_set(tc_set(t_a))).
% 0.21/0.42 75 [hyper,63,2,6] {-} c_Zorn_Osucc(v_S,v_m,t_a)=v_m.
% 0.21/0.42 77 [binary,75.1,5.1] {-} $F.
% 0.21/0.42
% 0.21/0.42 % SZS output end Refutation
% 0.21/0.42 ------------ end of proof -------------
% 0.21/0.42
% 0.21/0.42
% 0.21/0.42 Search stopped by max_proofs option.
% 0.21/0.42
% 0.21/0.42
% 0.21/0.42 Search stopped by max_proofs option.
% 0.21/0.42
% 0.21/0.42 ============ end of search ============
% 0.21/0.42
% 0.21/0.42 ----------- soft-scott stats ----------
% 0.21/0.42
% 0.21/0.42 true clauses given 3 (30.0%)
% 0.21/0.42 false clauses given 7
% 0.21/0.42
% 0.21/0.42 FALSE TRUE
% 0.21/0.42 14 0 1
% 0.21/0.42 16 0 3
% 0.21/0.42 18 1 6
% 0.21/0.42 19 1 1
% 0.21/0.42 20 1 3
% 0.21/0.42 21 0 7
% 0.21/0.42 22 0 2
% 0.21/0.42 23 0 2
% 0.21/0.42 24 1 5
% 0.21/0.42 25 2 0
% 0.21/0.42 26 3 0
% 0.21/0.42 27 0 4
% 0.21/0.42 28 7 2
% 0.21/0.42 29 3 0
% 0.21/0.42 30 1 0
% 0.21/0.42 33 1 0
% 0.21/0.42 tot: 21 36 (63.2% true)
% 0.21/0.42
% 0.21/0.42
% 0.21/0.42 Model 2 (0.00 seconds, 0 Inserts)
% 0.21/0.42
% 0.21/0.42 That finishes the proof of the theorem.
% 0.21/0.42
% 0.21/0.42 Process 4454 finished Mon Jul 11 08:24:35 2022
%------------------------------------------------------------------------------