TSTP Solution File: SET849-2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET849-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n020.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:15 EDT 2022
% Result : Unsatisfiable 0.20s 0.60s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET849-2 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n020.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 : Sun Jul 10 14:44:43 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 sandbox on n020.cluster.edu,
% 0.13/0.36 Sun Jul 10 14:44:43 2022
% 0.13/0.36 The command was "./sos". The process ID is 10645.
% 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=1, equality=1, symmetry=0, max_lits=2.
% 0.13/0.36
% 0.13/0.36 This is a Horn set with equality. The strategy will be
% 0.13/0.36 Knuth-Bendix and hyper_res, with positive clauses in
% 0.13/0.36 sos and nonpositive 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: clear(order_hyper).
% 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 6 during input processing: 0 [copy,6,flip.1] {-} A=A.
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.20/0.60
% 0.20/0.60 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.60
% 0.20/0.60 Stopped by limit on number of solutions
% 0.20/0.60
% 0.20/0.60
% 0.20/0.60 -------------- Softie stats --------------
% 0.20/0.60
% 0.20/0.60 UPDATE_STOP: 300
% 0.20/0.60 SFINDER_TIME_LIMIT: 2
% 0.20/0.60 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.60 number of clauses in intial UL: 3
% 0.20/0.60 number of clauses initially in problem: 5
% 0.20/0.60 percentage of clauses intially in UL: 60
% 0.20/0.60 percentage of distinct symbols occuring in initial UL: 100
% 0.20/0.60 percent of all initial clauses that are short: 80
% 0.20/0.60 absolute distinct symbol count: 9
% 0.20/0.60 distinct predicate count: 3
% 0.20/0.60 distinct function count: 4
% 0.20/0.60 distinct constant count: 2
% 0.20/0.60
% 0.20/0.60 ---------- no more Softie stats ----------
% 0.20/0.60
% 0.20/0.60
% 0.20/0.60
% 0.20/0.60 Stopped by limit on insertions
% 0.20/0.60
% 0.20/0.60 =========== start of search ===========
% 0.20/0.60
% 0.20/0.60 -------- PROOF --------
% 0.20/0.60 % SZS status Unsatisfiable
% 0.20/0.60 % SZS output start Refutation
% 0.20/0.60
% 0.20/0.60 ----> UNIT CONFLICT at 0.21 sec ----> 10 [binary,8.1,4.1] {-} $F.
% 0.20/0.60
% 0.20/0.60 Length of proof is 3. Level of proof is 2.
% 0.20/0.60
% 0.20/0.60 ---------------- PROOF ----------------
% 0.20/0.60 % SZS status Unsatisfiable
% 0.20/0.60 % SZS output start Refutation
% 0.20/0.60
% 0.20/0.60 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.20/0.60 2 [] {-} -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).
% 0.20/0.60 3 [copy,2,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)).
% 0.20/0.60 4 [] {+} c_Zorn_Osucc(v_S,c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),t_a)!=c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)).
% 0.20/0.60 5 [] {-} c_lessequals(A,A,tc_set(B)).
% 0.20/0.60 7 [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.20/0.60 8 [hyper,7,3] {-} 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)).
% 0.20/0.60 10 [binary,8.1,4.1] {-} $F.
% 0.20/0.60
% 0.20/0.60 % SZS output end Refutation
% 0.20/0.60 ------------ end of proof -------------
% 0.20/0.60
% 0.20/0.60
% 0.20/0.60 Search stopped by max_proofs option.
% 0.20/0.60
% 0.20/0.60
% 0.20/0.60 Search stopped by max_proofs option.
% 0.20/0.60
% 0.20/0.60 ============ end of search ============
% 0.20/0.60
% 0.20/0.60 ----------- soft-scott stats ----------
% 0.20/0.60
% 0.20/0.60 true clauses given 0 (0.0%)
% 0.20/0.60 false clauses given 2
% 0.20/0.60
% 0.20/0.60 FALSE TRUE
% 0.20/0.60 3 0 1
% 0.20/0.60 tot: 0 1 (100.0% true)
% 0.20/0.60
% 0.20/0.60
% 0.20/0.60 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.60
% 0.20/0.60 That finishes the proof of the theorem.
% 0.20/0.60
% 0.20/0.60 Process 10645 finished Sun Jul 10 14:44:43 2022
%------------------------------------------------------------------------------