%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : COM011-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 : Fri Jul 15 01:43:28 EDT 2022
% Result : Unsatisfiable 0.90s 1.16s
% Output : Refutation 0.90s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : COM011-2 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n012.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 : Thu Jun 16 17:28:09 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 sandbox2 on n012.cluster.edu,
% 0.13/0.36 Thu Jun 16 17:28:09 2022
% 0.13/0.36 The command was "./sos". The process ID is 22295.
% 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=0, equality=0, symmetry=0, max_lits=3.
% 0.13/0.36
% 0.13/0.36 This is a non-Horn set without equality. The strategy
% 0.13/0.36 will be ordered hyper_res, ur_res, unit deletion, and
% 0.13/0.36 factoring, with satellites in sos and nuclei in usable.
% 0.13/0.36
% 0.13/0.36 dependent: set(hyper_res).
% 0.13/0.36 dependent: set(factor).
% 0.13/0.36 dependent: set(unit_deletion).
% 0.13/0.36
% 0.13/0.36 ------------> process usable:
% 0.13/0.36
% 0.13/0.36 ------------> process sos:
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.90/1.16
% 0.90/1.16 Stopped by limit on insertions
% 0.90/1.16
% 0.90/1.16 Stopped by limit on insertions
% 0.90/1.16
% 0.90/1.16 Stopped by limit on insertions
% 0.90/1.16
% 0.90/1.16 Stopped by limit on insertions
% 0.90/1.16
% 0.90/1.16 Stopped by limit on insertions
% 0.90/1.16
% 0.90/1.16
% 0.90/1.16 Failed to model usable list: disabling FINDER
% 0.90/1.16
% 0.90/1.16
% 0.90/1.16
% 0.90/1.16 -------------- Softie stats --------------
% 0.90/1.16
% 0.90/1.16 UPDATE_STOP: 300
% 0.90/1.16 SFINDER_TIME_LIMIT: 2
% 0.90/1.16 SHORT_CLAUSE_CUTOFF: 4
% 0.90/1.16 number of clauses in intial UL: 7
% 0.90/1.16 number of clauses initially in problem: 10
% 0.90/1.16 percentage of clauses intially in UL: 70
% 0.90/1.16 percentage of distinct symbols occuring in initial UL: 100
% 0.90/1.16 percent of all initial clauses that are short: 100
% 0.90/1.16 absolute distinct symbol count: 15
% 0.90/1.16 distinct predicate count: 2
% 0.90/1.16 distinct function count: 9
% 0.90/1.16 distinct constant count: 4
% 0.90/1.16
% 0.90/1.16 ---------- no more Softie stats ----------
% 0.90/1.16
% 0.90/1.16
% 0.90/1.16
% 0.90/1.16 =========== start of search ===========
% 0.90/1.16
% 0.90/1.16 -------- PROOF --------
% 0.90/1.16 % SZS status Unsatisfiable
% 0.90/1.16 % SZS output start Refutation
% 0.90/1.16
% 0.90/1.16 ----> UNIT CONFLICT at 0.77 sec ----> 44 [binary,43.1,1.1] {-} $F.
% 0.90/1.16
% 0.90/1.16 Length of proof is 12. Level of proof is 10.
% 0.90/1.16
% 0.90/1.16 ---------------- PROOF ----------------
% 0.90/1.16 % SZS status Unsatisfiable
% 0.90/1.16 % SZS output start Refutation
% 0.90/1.16
% 0.90/1.16 1 [] {+} -c_in(v_F,c_WFair_OleadsTo(v_A,v_B,t_a),tc_UNITY_Oprogram(t_a)).
% 0.90/1.16 2 [] {+} -c_in(A,c_minus(B,C,tc_set(D)),D)|c_in(A,B,D).
% 0.90/1.16 3 [] {+} -c_in(c_Main_OsubsetI__1(A,B,C),B,C)|c_lessequals(A,B,tc_set(C)).
% 0.90/1.16 4 [] {+} -c_in(A,c_UNITY_Oconstrains(B,C,D),tc_UNITY_Oprogram(D))| -c_lessequals(E,B,tc_set(D))|c_in(A,c_UNITY_Oconstrains(E,C,D),tc_UNITY_Oprogram(D)).
% 0.90/1.16 5 [] {+} -c_in(A,c_UNITY_Oconstrains(c_minus(B,C,tc_set(D)),c_union(B,C,D),D),tc_UNITY_Oprogram(D))| -c_in(A,c_WFair_Otransient(c_minus(B,C,tc_set(D)),D),tc_UNITY_Oprogram(D))|c_in(A,c_WFair_Oensures(B,C,D),tc_UNITY_Oprogram(D)).
% 0.90/1.16 6 [] {+} -c_in(A,c_WFair_Oensures(B,C,D),tc_UNITY_Oprogram(D))|c_in(A,c_WFair_OleadsTo(B,C,D),tc_UNITY_Oprogram(D)).
% 0.90/1.16 7 [] {+} -c_in(A,c_WFair_Otransient(B,C),tc_UNITY_Oprogram(C))| -c_lessequals(D,B,tc_set(C))|c_in(A,c_WFair_Otransient(D,C),tc_UNITY_Oprogram(C)).
% 0.90/1.16 8 [] {-} c_in(v_F,c_UNITY_Oconstrains(v_A,c_union(v_A,v_B,t_a),t_a),tc_UNITY_Oprogram(t_a)).
% 0.90/1.16 9 [] {-} c_in(v_F,c_WFair_Otransient(v_A,t_a),tc_UNITY_Oprogram(t_a)).
% 0.90/1.16 10 [] {-} c_in(c_Main_OsubsetI__1(A,B,C),A,C)|c_lessequals(A,B,tc_set(C)).
% 0.90/1.16 11 [hyper,10,7,9] {-} c_in(c_Main_OsubsetI__1(A,v_A,t_a),A,t_a)|c_in(v_F,c_WFair_Otransient(A,t_a),tc_UNITY_Oprogram(t_a)).
% 0.90/1.16 12 [hyper,10,4,8] {-} c_in(c_Main_OsubsetI__1(A,v_A,t_a),A,t_a)|c_in(v_F,c_UNITY_Oconstrains(A,c_union(v_A,v_B,t_a),t_a),tc_UNITY_Oprogram(t_a)).
% 0.90/1.16 13 [hyper,11,2] {-} c_in(v_F,c_WFair_Otransient(c_minus(A,B,tc_set(t_a)),t_a),tc_UNITY_Oprogram(t_a))|c_in(c_Main_OsubsetI__1(c_minus(A,B,tc_set(t_a)),v_A,t_a),A,t_a).
% 0.90/1.16 15 [hyper,12,2] {-} c_in(v_F,c_UNITY_Oconstrains(c_minus(A,B,tc_set(t_a)),c_union(v_A,v_B,t_a),t_a),tc_UNITY_Oprogram(t_a))|c_in(c_Main_OsubsetI__1(c_minus(A,B,tc_set(t_a)),v_A,t_a),A,t_a).
% 0.90/1.16 19 [hyper,13,3] {-} c_in(v_F,c_WFair_Otransient(c_minus(v_A,A,tc_set(t_a)),t_a),tc_UNITY_Oprogram(t_a))|c_lessequals(c_minus(v_A,A,tc_set(t_a)),v_A,tc_set(t_a)).
% 0.90/1.16 22 [hyper,19,7,9,factor_simp] {-} c_in(v_F,c_WFair_Otransient(c_minus(v_A,A,tc_set(t_a)),t_a),tc_UNITY_Oprogram(t_a)).
% 0.90/1.16 29 [hyper,15,5,22] {-} c_in(c_Main_OsubsetI__1(c_minus(v_A,v_B,tc_set(t_a)),v_A,t_a),v_A,t_a)|c_in(v_F,c_WFair_Oensures(v_A,v_B,t_a),tc_UNITY_Oprogram(t_a)).
% 0.90/1.16 34 [hyper,29,6,unit_del,1] {-} c_in(c_Main_OsubsetI__1(c_minus(v_A,v_B,tc_set(t_a)),v_A,t_a),v_A,t_a).
% 0.90/1.16 35 [hyper,34,3] {-} c_lessequals(c_minus(v_A,v_B,tc_set(t_a)),v_A,tc_set(t_a)).
% 0.90/1.16 37 [hyper,35,4,8] {-} c_in(v_F,c_UNITY_Oconstrains(c_minus(v_A,v_B,tc_set(t_a)),c_union(v_A,v_B,t_a),t_a),tc_UNITY_Oprogram(t_a)).
% 0.90/1.16 39 [hyper,37,5,22] {-} c_in(v_F,c_WFair_Oensures(v_A,v_B,t_a),tc_UNITY_Oprogram(t_a)).
% 0.90/1.16 43 [hyper,39,6] {-} c_in(v_F,c_WFair_OleadsTo(v_A,v_B,t_a),tc_UNITY_Oprogram(t_a)).
% 0.90/1.16 44 [binary,43.1,1.1] {-} $F.
% 0.90/1.16
% 0.90/1.16 % SZS output end Refutation
% 0.90/1.16 ------------ end of proof -------------
% 0.90/1.16
% 0.90/1.16
% 0.90/1.16 Search stopped by max_proofs option.
% 0.90/1.16
% 0.90/1.16
% 0.90/1.16 Search stopped by max_proofs option.
% 0.90/1.16
% 0.90/1.16 ============ end of search ============
% 0.90/1.16
% 0.90/1.16 That finishes the proof of the theorem.
% 0.90/1.16
% 0.90/1.16 Process 22295 finished Thu Jun 16 17:28:10 2022
%------------------------------------------------------------------------------