TSTP Solution File: SET846-2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET846-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n023.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 0.40s 0.59s
% Output : Refutation 0.40s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SET846-2 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n023.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 : Mon Jul 11 04:33:55 EDT 2022
% 0.18/0.33 % CPUTime :
% 0.18/0.34 ----- Otter 3.2, August 2001 -----
% 0.18/0.34 The process was started by sandbox2 on n023.cluster.edu,
% 0.18/0.34 Mon Jul 11 04:33:55 2022
% 0.18/0.34 The command was "./sos". The process ID is 17600.
% 0.18/0.34
% 0.18/0.34 set(prolog_style_variables).
% 0.18/0.34 set(auto).
% 0.18/0.34 dependent: set(auto1).
% 0.18/0.34 dependent: set(process_input).
% 0.18/0.34 dependent: clear(print_kept).
% 0.18/0.34 dependent: clear(print_new_demod).
% 0.18/0.34 dependent: clear(print_back_demod).
% 0.18/0.34 dependent: clear(print_back_sub).
% 0.18/0.34 dependent: set(control_memory).
% 0.18/0.34 dependent: assign(max_mem, 12000).
% 0.18/0.34 dependent: assign(pick_given_ratio, 4).
% 0.18/0.34 dependent: assign(stats_level, 1).
% 0.18/0.34 dependent: assign(pick_semantic_ratio, 3).
% 0.18/0.34 dependent: assign(sos_limit, 5000).
% 0.18/0.34 dependent: assign(max_weight, 60).
% 0.18/0.34 clear(print_given).
% 0.18/0.34
% 0.18/0.34 list(usable).
% 0.18/0.34
% 0.18/0.34 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=2.
% 0.18/0.34
% 0.18/0.35 This is a Horn set without equality. The strategy will
% 0.18/0.35 be hyperresolution, with satellites in sos and nuclei
% 0.18/0.35 in usable.
% 0.18/0.35
% 0.18/0.35 dependent: set(hyper_res).
% 0.18/0.35 dependent: clear(order_hyper).
% 0.18/0.35
% 0.18/0.35 ------------> process usable:
% 0.18/0.35
% 0.18/0.35 ------------> process sos:
% 0.18/0.35
% 0.18/0.35 ======= end of input processing =======
% 0.40/0.59
% 0.40/0.59 Model 1 (0.00 seconds, 0 Inserts)
% 0.40/0.59
% 0.40/0.59 Stopped by limit on number of solutions
% 0.40/0.59
% 0.40/0.59
% 0.40/0.59 -------------- Softie stats --------------
% 0.40/0.59
% 0.40/0.59 UPDATE_STOP: 300
% 0.40/0.59 SFINDER_TIME_LIMIT: 2
% 0.40/0.59 SHORT_CLAUSE_CUTOFF: 4
% 0.40/0.59 number of clauses in intial UL: 4
% 0.40/0.59 number of clauses initially in problem: 5
% 0.40/0.59 percentage of clauses intially in UL: 80
% 0.40/0.59 percentage of distinct symbols occuring in initial UL: 100
% 0.40/0.59 percent of all initial clauses that are short: 100
% 0.40/0.59 absolute distinct symbol count: 8
% 0.40/0.59 distinct predicate count: 2
% 0.40/0.59 distinct function count: 4
% 0.40/0.59 distinct constant count: 2
% 0.40/0.59
% 0.40/0.59 ---------- no more Softie stats ----------
% 0.40/0.59
% 0.40/0.59
% 0.40/0.59
% 0.40/0.59 Stopped by limit on insertions
% 0.40/0.59
% 0.40/0.59 =========== start of search ===========
% 0.40/0.59
% 0.40/0.59 -------- PROOF --------
% 0.40/0.59 % SZS status Unsatisfiable
% 0.40/0.59 % SZS output start Refutation
% 0.40/0.59
% 0.40/0.59 ----> UNIT CONFLICT at 0.22 sec ----> 10 [binary,9.1,4.1] {-} $F.
% 0.40/0.59
% 0.40/0.59 Length of proof is 3. Level of proof is 3.
% 0.40/0.59
% 0.40/0.59 ---------------- PROOF ----------------
% 0.40/0.59 % SZS status Unsatisfiable
% 0.40/0.59 % SZS output start Refutation
% 0.40/0.59
% 0.40/0.59 1 [] {+} -c_in(A,B,tc_set(C))|c_lessequals(A,c_Union(B,C),tc_set(C)).
% 0.40/0.59 2 [] {+} -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.40/0.59 3 [] {+} -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.40/0.59 4 [] {+} -c_lessequals(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)),tc_set(tc_set(t_a))).
% 0.40/0.59 5 [] {-} c_lessequals(A,A,tc_set(B)).
% 0.40/0.59 6 [hyper,5,3] {-} c_in(c_Union(c_Zorn_OTFin(A,B),tc_set(B)),c_Zorn_OTFin(A,B),tc_set(tc_set(B))).
% 0.40/0.59 7 [hyper,6,2] {-} c_in(c_Zorn_Osucc(A,c_Union(c_Zorn_OTFin(A,B),tc_set(B)),B),c_Zorn_OTFin(A,B),tc_set(tc_set(B))).
% 0.40/0.59 9 [hyper,7,1] {-} c_lessequals(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)),tc_set(tc_set(B))).
% 0.40/0.59 10 [binary,9.1,4.1] {-} $F.
% 0.40/0.59
% 0.40/0.59 % SZS output end Refutation
% 0.40/0.59 ------------ end of proof -------------
% 0.40/0.59
% 0.40/0.59
% 0.40/0.59 Search stopped by max_proofs option.
% 0.40/0.59
% 0.40/0.59
% 0.40/0.59 Search stopped by max_proofs option.
% 0.40/0.59
% 0.40/0.59 ============ end of search ============
% 0.40/0.59
% 0.40/0.59 ----------- soft-scott stats ----------
% 0.40/0.59
% 0.40/0.59 true clauses given 0 (0.0%)
% 0.40/0.59 false clauses given 3
% 0.40/0.59
% 0.40/0.59 FALSE TRUE
% 0.40/0.59 tot: 0 0 (-nan% true)
% 0.40/0.59
% 0.40/0.59
% 0.40/0.59 Model 1 (0.00 seconds, 0 Inserts)
% 0.40/0.59
% 0.40/0.59 That finishes the proof of the theorem.
% 0.40/0.59
% 0.40/0.59 Process 17600 finished Mon Jul 11 04:33:55 2022
%------------------------------------------------------------------------------