TSTP Solution File: SET844-2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET844-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n004.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:11 EDT 2022
% Result : Unsatisfiable 0.19s 0.53s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET844-2 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.13 % Command : sos-script %s
% 0.12/0.33 % Computer : n004.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.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jul 10 23:04:37 EDT 2022
% 0.19/0.34 % CPUTime :
% 0.19/0.35 ----- Otter 3.2, August 2001 -----
% 0.19/0.35 The process was started by sandbox on n004.cluster.edu,
% 0.19/0.35 Sun Jul 10 23:04:37 2022
% 0.19/0.35 The command was "./sos". The process ID is 26780.
% 0.19/0.35
% 0.19/0.35 set(prolog_style_variables).
% 0.19/0.35 set(auto).
% 0.19/0.35 dependent: set(auto1).
% 0.19/0.35 dependent: set(process_input).
% 0.19/0.35 dependent: clear(print_kept).
% 0.19/0.35 dependent: clear(print_new_demod).
% 0.19/0.35 dependent: clear(print_back_demod).
% 0.19/0.35 dependent: clear(print_back_sub).
% 0.19/0.35 dependent: set(control_memory).
% 0.19/0.35 dependent: assign(max_mem, 12000).
% 0.19/0.35 dependent: assign(pick_given_ratio, 4).
% 0.19/0.35 dependent: assign(stats_level, 1).
% 0.19/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.19/0.35 dependent: assign(sos_limit, 5000).
% 0.19/0.35 dependent: assign(max_weight, 60).
% 0.19/0.35 clear(print_given).
% 0.19/0.35
% 0.19/0.35 list(usable).
% 0.19/0.35
% 0.19/0.35 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=4.
% 0.19/0.35
% 0.19/0.35 This is a Horn set with equality. The strategy will be
% 0.19/0.35 Knuth-Bendix and hyper_res, with positive clauses in
% 0.19/0.35 sos and nonpositive clauses in usable.
% 0.19/0.35
% 0.19/0.35 dependent: set(knuth_bendix).
% 0.19/0.35 dependent: set(para_from).
% 0.19/0.35 dependent: set(para_into).
% 0.19/0.35 dependent: clear(para_from_right).
% 0.19/0.35 dependent: clear(para_into_right).
% 0.19/0.35 dependent: set(para_from_vars).
% 0.19/0.35 dependent: set(eq_units_both_ways).
% 0.19/0.35 dependent: set(dynamic_demod_all).
% 0.19/0.35 dependent: set(dynamic_demod).
% 0.19/0.35 dependent: set(order_eq).
% 0.19/0.35 dependent: set(back_demod).
% 0.19/0.35 dependent: set(lrpo).
% 0.19/0.35 dependent: set(hyper_res).
% 0.19/0.35 dependent: clear(order_hyper).
% 0.19/0.35
% 0.19/0.35 ------------> process usable:
% 0.19/0.35
% 0.19/0.35 ------------> process sos:
% 0.19/0.35 Following clause subsumed by 10 during input processing: 0 [copy,10,flip.1] {-} A=A.
% 0.19/0.35
% 0.19/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: 3
% 0.19/0.53 number of clauses initially in problem: 8
% 0.19/0.53 percentage of clauses intially in UL: 37
% 0.19/0.53 percentage of distinct symbols occuring in initial UL: 100
% 0.19/0.53 percent of all initial clauses that are short: 87
% 0.19/0.53 absolute distinct symbol count: 10
% 0.19/0.53 distinct predicate count: 3
% 0.19/0.53 distinct function count: 4
% 0.19/0.53 distinct constant count: 3
% 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 ===========
% 0.19/0.53
% 0.19/0.53 -------- PROOF --------
% 0.19/0.53 % SZS status Unsatisfiable
% 0.19/0.53 % SZS output start Refutation
% 0.19/0.53
% 0.19/0.53 ----> UNIT CONFLICT at 0.15 sec ----> 14 [binary,13.1,4.1] {-} $F.
% 0.19/0.53
% 0.19/0.53 Length of proof is 4. Level of proof is 2.
% 0.19/0.53
% 0.19/0.53 ---------------- PROOF ----------------
% 0.19/0.53 % SZS status Unsatisfiable
% 0.19/0.53 % SZS output start Refutation
% 0.19/0.53
% 0.19/0.53 1 [] {+} -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.19/0.53 2 [] {-} -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.19/0.53 3 [copy,2,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.19/0.53 4 [] {+} -c_lessequals(c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),v_m,tc_set(tc_set(t_a))).
% 0.19/0.53 5 [] {-} c_lessequals(A,A,tc_set(B)).
% 0.19/0.53 6 [] {-} c_in(v_m,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))).
% 0.19/0.53 7 [] {-} v_m=c_Zorn_Osucc(v_S,v_m,t_a).
% 0.19/0.53 8 [copy,7,flip.1] {-} c_Zorn_Osucc(v_S,v_m,t_a)=v_m.
% 0.19/0.53 11 [hyper,5,1] {-} c_in(c_Union(c_Zorn_OTFin(A,B),tc_set(B)),c_Zorn_OTFin(A,B),tc_set(tc_set(B))).
% 0.19/0.53 13 [hyper,11,3,6,8] {-} c_lessequals(c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),v_m,tc_set(tc_set(t_a))).
% 0.19/0.53 14 [binary,13.1,4.1] {-} $F.
% 0.19/0.53
% 0.19/0.53 % SZS output end Refutation
% 0.19/0.53 ------------ end of proof -------------
% 0.19/0.53
% 0.19/0.53
% 0.19/0.53 Search stopped by max_proofs option.
% 0.19/0.53
% 0.19/0.53
% 0.19/0.53 Search stopped by max_proofs option.
% 0.19/0.53
% 0.19/0.53 ============ end of search ============
% 0.19/0.53
% 0.19/0.53 ----------- soft-scott stats ----------
% 0.19/0.53
% 0.19/0.53 true clauses given 0 (0.0%)
% 0.19/0.53 false clauses given 4
% 0.19/0.53
% 0.19/0.53 FALSE TRUE
% 0.19/0.53 3 0 1
% 0.19/0.53 25 0 1
% 0.19/0.53 tot: 0 2 (100.0% true)
% 0.19/0.53
% 0.19/0.53
% 0.19/0.53 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.53
% 0.19/0.53 That finishes the proof of the theorem.
% 0.19/0.53
% 0.19/0.53 Process 26780 finished Sun Jul 10 23:04:37 2022
%------------------------------------------------------------------------------