%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET851-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n012.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:16 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.04/0.13 % Problem : SET851-2 : TPTP v8.1.0. Released v3.2.0.
% 0.04/0.14 % Command : sos-script %s
% 0.13/0.35 % Computer : n012.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 : Sun Jul 10 18:16:58 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.21/0.37 ----- Otter 3.2, August 2001 -----
% 0.21/0.37 The process was started by sandbox2 on n012.cluster.edu,
% 0.21/0.37 Sun Jul 10 18:16:58 2022
% 0.21/0.37 The command was "./sos". The process ID is 3609.
% 0.21/0.37
% 0.21/0.37 set(prolog_style_variables).
% 0.21/0.37 set(auto).
% 0.21/0.37 dependent: set(auto1).
% 0.21/0.37 dependent: set(process_input).
% 0.21/0.37 dependent: clear(print_kept).
% 0.21/0.37 dependent: clear(print_new_demod).
% 0.21/0.37 dependent: clear(print_back_demod).
% 0.21/0.37 dependent: clear(print_back_sub).
% 0.21/0.37 dependent: set(control_memory).
% 0.21/0.37 dependent: assign(max_mem, 12000).
% 0.21/0.37 dependent: assign(pick_given_ratio, 4).
% 0.21/0.37 dependent: assign(stats_level, 1).
% 0.21/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.21/0.37 dependent: assign(sos_limit, 5000).
% 0.21/0.37 dependent: assign(max_weight, 60).
% 0.21/0.37 clear(print_given).
% 0.21/0.37
% 0.21/0.37 list(usable).
% 0.21/0.37
% 0.21/0.37 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 0.21/0.37
% 0.21/0.37 This ia a non-Horn set with equality. The strategy will be
% 0.21/0.37 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.21/0.37 unit deletion, with positive clauses in sos and nonpositive
% 0.21/0.37 clauses in usable.
% 0.21/0.37
% 0.21/0.37 dependent: set(knuth_bendix).
% 0.21/0.37 dependent: set(para_from).
% 0.21/0.37 dependent: set(para_into).
% 0.21/0.37 dependent: clear(para_from_right).
% 0.21/0.37 dependent: clear(para_into_right).
% 0.21/0.37 dependent: set(para_from_vars).
% 0.21/0.37 dependent: set(eq_units_both_ways).
% 0.21/0.37 dependent: set(dynamic_demod_all).
% 0.21/0.37 dependent: set(dynamic_demod).
% 0.21/0.37 dependent: set(order_eq).
% 0.21/0.37 dependent: set(back_demod).
% 0.21/0.37 dependent: set(lrpo).
% 0.21/0.37 dependent: set(hyper_res).
% 0.21/0.37 dependent: set(unit_deletion).
% 0.21/0.37 dependent: set(factor).
% 0.21/0.37
% 0.21/0.37 ------------> process usable:
% 0.21/0.37
% 0.21/0.37 ------------> process sos:
% 0.21/0.37 Following clause subsumed by 8 during input processing: 0 [copy,8,flip.1] {-} A=A.
% 0.21/0.37
% 0.21/0.37 ======= 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: 8
% 0.21/0.41 percentage of clauses intially in UL: 50
% 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: 3
% 0.21/0.41 distinct constant count: 4
% 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.02 sec ----> 44 [binary,43.1,3.1] {+} $F.
% 0.21/0.42
% 0.21/0.42 Length of proof is 3. Level of proof is 3.
% 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_lessequals(A,B,tc_set(tc_set(C)))|c_lessequals(A,c_Zorn_Osucc(D,B,C),tc_set(tc_set(C))).
% 0.21/0.42 2 [] {+} -c_lessequals(c_Zorn_Osucc(v_S,v_x,t_a),v_m,tc_set(tc_set(t_a))).
% 0.21/0.42 3 [] {+} -c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),c_Zorn_Osucc(v_S,v_x,t_a),tc_set(tc_set(t_a))).
% 0.21/0.42 4 [] {+} c_lessequals(c_Zorn_Osucc(v_S,A,t_a),v_m,tc_set(tc_set(t_a)))|A=v_m| -c_lessequals(A,v_m,tc_set(tc_set(t_a)))| -c_in(A,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))).
% 0.21/0.42 5 [] {+} c_lessequals(A,A,tc_set(B)).
% 0.21/0.42 6 [] {-} c_in(v_x,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))).
% 0.21/0.42 7 [] {-} c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),v_x,tc_set(tc_set(t_a)))|c_lessequals(v_x,v_m,tc_set(tc_set(t_a))).
% 0.21/0.42 19 [hyper,7,4,6,unit_del,2] {-} c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),v_x,tc_set(tc_set(t_a)))|v_x=v_m.
% 0.21/0.42 38 [para_from,19.2.1,3.1.2.2,unit_del,5] {-} c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),v_x,tc_set(tc_set(t_a))).
% 0.21/0.42 43 [hyper,38,1] {-} c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),c_Zorn_Osucc(A,v_x,t_a),tc_set(tc_set(t_a))).
% 0.21/0.42 44 [binary,43.1,3.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 2 (28.6%)
% 0.21/0.42 false clauses given 5
% 0.21/0.42
% 0.21/0.42 FALSE TRUE
% 0.21/0.42 12 0 1
% 0.21/0.42 14 0 1
% 0.21/0.42 18 1 1
% 0.21/0.42 30 0 1
% 0.21/0.42 31 0 3
% 0.21/0.42 33 0 1
% 0.21/0.42 34 0 1
% 0.21/0.42 35 1 4
% 0.21/0.42 36 0 1
% 0.21/0.42 37 0 1
% 0.21/0.42 38 0 4
% 0.21/0.42 39 0 1
% 0.21/0.42 40 0 1
% 0.21/0.42 41 0 1
% 0.21/0.42 42 0 1
% 0.21/0.42 44 0 1
% 0.21/0.42 tot: 2 24 (92.3% 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 3609 finished Sun Jul 10 18:16:58 2022
%------------------------------------------------------------------------------