TSTP Solution File: SET852-2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET852-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:17 EDT 2022
% Result : Unsatisfiable 0.19s 0.39s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET852-2 : TPTP v8.1.0. Released v3.2.0.
% 0.13/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 05:23:13 EDT 2022
% 0.19/0.34 % CPUTime :
% 0.19/0.36 ----- Otter 3.2, August 2001 -----
% 0.19/0.36 The process was started by sandbox2 on n020.cluster.edu,
% 0.19/0.36 Sun Jul 10 05:23:13 2022
% 0.19/0.36 The command was "./sos". The process ID is 29015.
% 0.19/0.36
% 0.19/0.36 set(prolog_style_variables).
% 0.19/0.36 set(auto).
% 0.19/0.36 dependent: set(auto1).
% 0.19/0.36 dependent: set(process_input).
% 0.19/0.36 dependent: clear(print_kept).
% 0.19/0.36 dependent: clear(print_new_demod).
% 0.19/0.36 dependent: clear(print_back_demod).
% 0.19/0.36 dependent: clear(print_back_sub).
% 0.19/0.36 dependent: set(control_memory).
% 0.19/0.36 dependent: assign(max_mem, 12000).
% 0.19/0.36 dependent: assign(pick_given_ratio, 4).
% 0.19/0.36 dependent: assign(stats_level, 1).
% 0.19/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.19/0.36 dependent: assign(sos_limit, 5000).
% 0.19/0.36 dependent: assign(max_weight, 60).
% 0.19/0.36 clear(print_given).
% 0.19/0.36
% 0.19/0.36 list(usable).
% 0.19/0.36
% 0.19/0.36 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=3.
% 0.19/0.36
% 0.19/0.36 This is a non-Horn set without equality. The strategy
% 0.19/0.36 will be ordered hyper_res, ur_res, unit deletion, and
% 0.19/0.36 factoring, with satellites in sos and nuclei in usable.
% 0.19/0.36
% 0.19/0.36 dependent: set(hyper_res).
% 0.19/0.36 dependent: set(factor).
% 0.19/0.36 dependent: set(unit_deletion).
% 0.19/0.36
% 0.19/0.36 ------------> process usable:
% 0.19/0.36
% 0.19/0.36 ------------> process sos:
% 0.19/0.36
% 0.19/0.36 ======= end of input processing =======
% 0.19/0.39
% 0.19/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.39
% 0.19/0.39 Stopped by limit on number of solutions
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39 -------------- Softie stats --------------
% 0.19/0.39
% 0.19/0.39 UPDATE_STOP: 300
% 0.19/0.39 SFINDER_TIME_LIMIT: 2
% 0.19/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.39 number of clauses in intial UL: 7
% 0.19/0.39 number of clauses initially in problem: 9
% 0.19/0.39 percentage of clauses intially in UL: 77
% 0.19/0.39 percentage of distinct symbols occuring in initial UL: 100
% 0.19/0.39 percent of all initial clauses that are short: 100
% 0.19/0.39 absolute distinct symbol count: 10
% 0.19/0.39 distinct predicate count: 2
% 0.19/0.39 distinct function count: 4
% 0.19/0.39 distinct constant count: 4
% 0.19/0.39
% 0.19/0.39 ---------- no more Softie stats ----------
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39 =========== start of search ===========
% 0.19/0.39
% 0.19/0.39 -------- PROOF --------
% 0.19/0.39 % SZS status Unsatisfiable
% 0.19/0.39 % SZS output start Refutation
% 0.19/0.39
% 0.19/0.39 -----> EMPTY CLAUSE at 0.01 sec ----> 33 [hyper,31,4,unit_del,2,1] {-} $F.
% 0.19/0.39
% 0.19/0.39 Length of proof is 4. Level of proof is 4.
% 0.19/0.39
% 0.19/0.39 ---------------- PROOF ----------------
% 0.19/0.39 % SZS status Unsatisfiable
% 0.19/0.39 % SZS output start Refutation
% 0.19/0.39
% 0.19/0.39 1 [] {+} -c_lessequals(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a))).
% 0.19/0.39 2 [] {+} -c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),c_Union(v_Y,tc_set(t_a)),tc_set(tc_set(t_a))).
% 0.19/0.39 3 [] {+} c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),A,tc_set(tc_set(t_a)))|c_lessequals(A,v_m,tc_set(tc_set(t_a)))| -c_in(A,v_Y,tc_set(tc_set(t_a))).
% 0.19/0.39 4 [] {+} -c_lessequals(c_Zorn_OUnion__lemma0__1(A,B,C,D),A,tc_set(D))|c_lessequals(B,c_Union(C,D),tc_set(D))|c_lessequals(c_Union(C,D),A,tc_set(D)).
% 0.19/0.39 5 [] {+} -c_lessequals(A,c_Zorn_OUnion__lemma0__1(B,A,C,D),tc_set(D))|c_lessequals(A,c_Union(C,D),tc_set(D))|c_lessequals(c_Union(C,D),B,tc_set(D)).
% 0.19/0.39 8 [] {-} c_in(c_Zorn_OUnion__lemma0__1(A,B,C,D),C,tc_set(D))|c_lessequals(B,c_Union(C,D),tc_set(D))|c_lessequals(c_Union(C,D),A,tc_set(D)).
% 0.19/0.39 15 [hyper,8,1] {-} c_in(c_Zorn_OUnion__lemma0__1(v_m,A,v_Y,tc_set(t_a)),v_Y,tc_set(tc_set(t_a)))|c_lessequals(A,c_Union(v_Y,tc_set(t_a)),tc_set(tc_set(t_a))).
% 0.19/0.39 24 [hyper,15,2] {-} c_in(c_Zorn_OUnion__lemma0__1(v_m,c_Zorn_Osucc(v_S,v_m,t_a),v_Y,tc_set(t_a)),v_Y,tc_set(tc_set(t_a))).
% 0.19/0.39 25 [hyper,24,3] {-} c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),c_Zorn_OUnion__lemma0__1(v_m,c_Zorn_Osucc(v_S,v_m,t_a),v_Y,tc_set(t_a)),tc_set(tc_set(t_a)))|c_lessequals(c_Zorn_OUnion__lemma0__1(v_m,c_Zorn_Osucc(v_S,v_m,t_a),v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a))).
% 0.19/0.39 31 [hyper,25,5,unit_del,2,1] {-} c_lessequals(c_Zorn_OUnion__lemma0__1(v_m,c_Zorn_Osucc(v_S,v_m,t_a),v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a))).
% 0.19/0.39 33 [hyper,31,4,unit_del,2,1] {-} $F.
% 0.19/0.39
% 0.19/0.39 % SZS output end Refutation
% 0.19/0.39 ------------ end of proof -------------
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39 Search stopped by max_proofs option.
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39 Search stopped by max_proofs option.
% 0.19/0.39
% 0.19/0.39 ============ end of search ============
% 0.19/0.39
% 0.19/0.39 ----------- soft-scott stats ----------
% 0.19/0.39
% 0.19/0.39 true clauses given 0 (0.0%)
% 0.19/0.39 false clauses given 10
% 0.19/0.39
% 0.19/0.39 FALSE TRUE
% 0.19/0.39 17 1 0
% 0.19/0.39 33 3 0
% 0.19/0.39 34 2 0
% 0.19/0.39 37 3 0
% 0.19/0.39 38 2 0
% 0.19/0.39 39 1 0
% 0.19/0.39 40 1 0
% 0.19/0.39 43 1 0
% 0.19/0.39 48 1 0
% 0.19/0.39 tot: 15 0 (0.0% true)
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.39
% 0.19/0.39 That finishes the proof of the theorem.
% 0.19/0.39
% 0.19/0.39 Process 29015 finished Sun Jul 10 05:23:13 2022
%------------------------------------------------------------------------------