%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : MGT056-1 : TPTP v8.1.0. Released v2.4.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 : Sun Jul 17 22:26:03 EDT 2022
% Result : Unsatisfiable 1.05s 1.24s
% Output : Refutation 1.05s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : MGT056-1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/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 : Thu Jun 9 11:31:51 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 n020.cluster.edu,
% 0.13/0.36 Thu Jun 9 11:31:51 2022
% 0.13/0.36 The command was "./sos". The process ID is 26824.
% 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=1, symmetry=0, max_lits=4.
% 0.13/0.36
% 0.13/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.13/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.36 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: set(unit_deletion).
% 0.13/0.36 dependent: set(factor).
% 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 31 during input processing: 0 [copy,31,flip.1] {-} A=A.
% 0.13/0.36 31 back subsumes 21.
% 0.13/0.36
% 0.13/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: 20
% 0.19/0.39 number of clauses initially in problem: 30
% 0.19/0.39 percentage of clauses intially in UL: 66
% 0.19/0.39 percentage of distinct symbols occuring in initial UL: 88
% 0.19/0.39 percent of all initial clauses that are short: 100
% 0.19/0.39 absolute distinct symbol count: 18
% 0.19/0.39 distinct predicate count: 8
% 0.19/0.39 distinct function count: 3
% 0.19/0.39 distinct constant count: 7
% 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 ===========
% 1.05/1.24
% 1.05/1.24 -------- PROOF --------
% 1.05/1.24 % SZS status Unsatisfiable
% 1.05/1.24 % SZS output start Refutation
% 1.05/1.24
% 1.05/1.24 Model 2 (0.00 seconds, 0 Inserts)
% 1.05/1.24
% 1.05/1.24 Stopped by limit on number of solutions
% 1.05/1.24
% 1.05/1.24 Model 3 (0.00 seconds, 0 Inserts)
% 1.05/1.24
% 1.05/1.24 Stopped by limit on number of solutions
% 1.05/1.24
% 1.05/1.24 Stopped by limit on insertions
% 1.05/1.24
% 1.05/1.24 Model 4 [ 1 1 311 ] (0.00 seconds, 250000 Inserts)
% 1.05/1.24
% 1.05/1.24 Model 5 (0.00 seconds, 250000 Inserts)
% 1.05/1.24
% 1.05/1.24 Stopped by limit on number of solutions
% 1.05/1.24
% 1.05/1.24 Stopped by limit on insertions
% 1.05/1.24
% 1.05/1.24 Model 6 [ 1 0 264 ] (0.00 seconds, 250000 Inserts)
% 1.05/1.24
% 1.05/1.24 Model 7 (0.00 seconds, 250000 Inserts)
% 1.05/1.24
% 1.05/1.24 Stopped by limit on number of solutions
% 1.05/1.24
% 1.05/1.24 ----> UNIT CONFLICT at 0.85 sec ----> 2885 [binary,2884.1,2858.1] {-} $F.
% 1.05/1.24
% 1.05/1.24 Length of proof is 16. Level of proof is 7.
% 1.05/1.24
% 1.05/1.24 ---------------- PROOF ----------------
% 1.05/1.24 % SZS status Unsatisfiable
% 1.05/1.24 % SZS output start Refutation
% 1.05/1.24
% 1.05/1.24 2 [] {+} -smaller(A,B)|smaller_or_equal(A,B).
% 1.05/1.24 3 [] {+} A!=B|smaller_or_equal(A,B).
% 1.05/1.24 4 [] {+} -greater_or_equal(A,B)|greater(A,B)|A=B.
% 1.05/1.24 9 [] {+} -greater(A,B)| -greater(B,A).
% 1.05/1.24 10 [] {+} -greater(A,B)| -greater(B,C)|greater(A,C).
% 1.05/1.24 12 [] {+} -has_endowment(A)| -smaller_or_equal(age(A,B),eta)|has_immunity(A,B).
% 1.05/1.24 13 [] {+} -has_endowment(A)| -greater(age(A,B),eta)| -has_immunity(A,B).
% 1.05/1.24 17 [] {+} -organization(A)| -has_immunity(A,B)| -has_immunity(A,C)|hazard_of_mortality(A,B)=hazard_of_mortality(A,C).
% 1.05/1.24 18 [] {+} -organization(A)| -has_immunity(A,B)|has_immunity(A,C)|greater(hazard_of_mortality(A,C),hazard_of_mortality(A,B)).
% 1.05/1.24 19 [] {+} -greater(hazard_of_mortality(sk2,sk5),hazard_of_mortality(sk2,sk4))|hazard_of_mortality(sk2,sk4)!=hazard_of_mortality(sk2,sk3).
% 1.05/1.24 20 [factor,9.1.2] {+} -greater(A,A).
% 1.05/1.24 22 [] {+} smaller(A,B)|A=B|greater(A,B).
% 1.05/1.24 23 [] {+} organization(sk2).
% 1.05/1.24 24 [] {+} has_endowment(sk2).
% 1.05/1.24 25 [] {+} age(sk2,sk3)=zero.
% 1.05/1.24 27 [] {+} smaller_or_equal(age(sk2,sk4),eta).
% 1.05/1.24 28 [] {+} greater(age(sk2,sk5),eta).
% 1.05/1.24 29 [] {+} greater_or_equal(eta,sigma).
% 1.05/1.24 30 [] {+} greater(sigma,zero).
% 1.05/1.24 31 [] {+} A=A.
% 1.05/1.24 33 [hyper,22,2] {+} A=B|greater(A,B)|smaller_or_equal(A,B).
% 1.05/1.24 77 [hyper,29,4,flip.2] {+} greater(eta,sigma)|sigma=eta.
% 1.05/1.24 99 [para_from,25.1.1,12.2.1,unit_del,24] {-} -smaller_or_equal(zero,eta)|has_immunity(sk2,sk3).
% 1.05/1.24 120 [hyper,31,3] {+} smaller_or_equal(A,A).
% 1.05/1.24 136 [hyper,27,12,24] {+} has_immunity(sk2,sk4).
% 1.05/1.24 501 [hyper,33,99] {-} zero=eta|greater(zero,eta)|has_immunity(sk2,sk3).
% 1.05/1.24 816 [hyper,136,18,23] {+} has_immunity(sk2,A)|greater(hazard_of_mortality(sk2,A),hazard_of_mortality(sk2,sk4)).
% 1.05/1.24 1530 [hyper,77,10,30] {+} sigma=eta|greater(eta,zero).
% 1.05/1.24 1615 [para_from,501.1.1,99.1.1,unit_del,120,factor_simp] {-} has_immunity(sk2,sk3)|greater(zero,eta).
% 1.05/1.24 1674 [hyper,1615,17,23,136] {-} greater(zero,eta)|hazard_of_mortality(sk2,sk4)=hazard_of_mortality(sk2,sk3).
% 1.05/1.24 2116 [para_from,1530.1.1,30.1.1,factor_simp] {+} greater(eta,zero).
% 1.05/1.24 2333,2332 [hyper,1674,10,2116,unit_del,20] {-} hazard_of_mortality(sk2,sk4)=hazard_of_mortality(sk2,sk3).
% 1.05/1.24 2762 [back_demod,816,demod,2333] {-} has_immunity(sk2,A)|greater(hazard_of_mortality(sk2,A),hazard_of_mortality(sk2,sk3)).
% 1.05/1.24 2858 [back_demod,19,demod,2333,2333,unit_del,31] {+} -greater(hazard_of_mortality(sk2,sk5),hazard_of_mortality(sk2,sk3)).
% 1.05/1.24 2884 [hyper,2762,13,24,28] {-} greater(hazard_of_mortality(sk2,sk5),hazard_of_mortality(sk2,sk3)).
% 1.05/1.24 2885 [binary,2884.1,2858.1] {-} $F.
% 1.05/1.24
% 1.05/1.24 % SZS output end Refutation
% 1.05/1.24 ------------ end of proof -------------
% 1.05/1.24
% 1.05/1.24
% 1.05/1.24 Search stopped by max_proofs option.
% 1.05/1.24
% 1.05/1.24
% 1.05/1.24 Search stopped by max_proofs option.
% 1.05/1.24
% 1.05/1.24 ============ end of search ============
% 1.05/1.24
% 1.05/1.24 ----------- soft-scott stats ----------
% 1.05/1.24
% 1.05/1.24 true clauses given 31 (38.8%)
% 1.05/1.24 false clauses given 49
% 1.05/1.24
% 1.05/1.24 FALSE TRUE
% 1.05/1.24 3 0 1
% 1.05/1.24 5 0 1
% 1.05/1.24 6 0 9
% 1.05/1.24 7 0 1
% 1.05/1.24 8 0 11
% 1.05/1.24 9 0 114
% 1.05/1.24 10 2 3
% 1.05/1.24 11 28 55
% 1.05/1.24 12 32 75
% 1.05/1.24 13 17 39
% 1.05/1.24 14 3 0
% 1.05/1.24 15 0 595
% 1.05/1.24 16 2 20
% 1.05/1.24 17 45 12
% 1.05/1.24 18 1 12
% 1.05/1.24 19 16 102
% 1.05/1.24 20 0 30
% 1.05/1.24 21 0 114
% 1.05/1.24 22 0 25
% 1.05/1.24 23 0 78
% 1.05/1.24 25 0 18
% 1.05/1.24 26 0 178
% 1.05/1.24 28 0 215
% 1.05/1.24 29 0 26
% 1.05/1.24 30 0 59
% 1.05/1.24 31 0 15
% 1.05/1.24 32 0 3
% 1.05/1.24 tot: 146 1811 (92.5% true)
% 1.05/1.24
% 1.05/1.24
% 1.05/1.24 Model 7 (0.00 seconds, 250000 Inserts)
% 1.05/1.24
% 1.05/1.24 That finishes the proof of the theorem.
% 1.05/1.24
% 1.05/1.24 Process 26824 finished Thu Jun 9 11:31:52 2022
%------------------------------------------------------------------------------