TSTP Solution File: MGT060+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : MGT060+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n017.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:04 EDT 2022
% Result : Theorem 2.34s 2.51s
% Output : Refutation 2.34s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : MGT060+1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n017.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jun 9 07:22:49 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.36 ----- Otter 3.2, August 2001 -----
% 0.12/0.36 The process was started by sandbox on n017.cluster.edu,
% 0.12/0.36 Thu Jun 9 07:22:49 2022
% 0.12/0.36 The command was "./sos". The process ID is 11313.
% 0.12/0.36
% 0.12/0.36 set(prolog_style_variables).
% 0.12/0.36 set(auto).
% 0.12/0.36 dependent: set(auto1).
% 0.12/0.36 dependent: set(process_input).
% 0.12/0.36 dependent: clear(print_kept).
% 0.12/0.36 dependent: clear(print_new_demod).
% 0.12/0.36 dependent: clear(print_back_demod).
% 0.12/0.36 dependent: clear(print_back_sub).
% 0.12/0.36 dependent: set(control_memory).
% 0.12/0.36 dependent: assign(max_mem, 12000).
% 0.12/0.36 dependent: assign(pick_given_ratio, 4).
% 0.12/0.36 dependent: assign(stats_level, 1).
% 0.12/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.36 dependent: assign(sos_limit, 5000).
% 0.12/0.36 dependent: assign(max_weight, 60).
% 0.12/0.36 clear(print_given).
% 0.12/0.36
% 0.12/0.36 formula_list(usable).
% 0.12/0.36
% 0.12/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 0.12/0.36
% 0.12/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.12/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.36 clauses in usable.
% 0.12/0.36
% 0.12/0.36 dependent: set(knuth_bendix).
% 0.12/0.36 dependent: set(para_from).
% 0.12/0.36 dependent: set(para_into).
% 0.12/0.36 dependent: clear(para_from_right).
% 0.12/0.36 dependent: clear(para_into_right).
% 0.12/0.36 dependent: set(para_from_vars).
% 0.12/0.36 dependent: set(eq_units_both_ways).
% 0.12/0.36 dependent: set(dynamic_demod_all).
% 0.12/0.36 dependent: set(dynamic_demod).
% 0.12/0.36 dependent: set(order_eq).
% 0.12/0.36 dependent: set(back_demod).
% 0.12/0.36 dependent: set(lrpo).
% 0.12/0.36 dependent: set(hyper_res).
% 0.12/0.36 dependent: set(unit_deletion).
% 0.12/0.36 dependent: set(factor).
% 0.12/0.36
% 0.12/0.36 ------------> process usable:
% 0.12/0.36
% 0.12/0.36 ------------> process sos:
% 0.12/0.36 Following clause subsumed by 27 during input processing: 0 [copy,27,flip.1] {-} A=A.
% 0.12/0.36
% 0.12/0.36 ======= end of input processing =======
% 0.12/0.39
% 0.12/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.39
% 0.12/0.39 Stopped by limit on number of solutions
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39 -------------- Softie stats --------------
% 0.12/0.39
% 0.12/0.39 UPDATE_STOP: 300
% 0.12/0.39 SFINDER_TIME_LIMIT: 2
% 0.12/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.39 number of clauses in intial UL: 18
% 0.12/0.39 number of clauses initially in problem: 27
% 0.12/0.39 percentage of clauses intially in UL: 66
% 0.12/0.39 percentage of distinct symbols occuring in initial UL: 100
% 0.12/0.39 percent of all initial clauses that are short: 100
% 0.12/0.39 absolute distinct symbol count: 18
% 0.12/0.39 distinct predicate count: 9
% 0.12/0.39 distinct function count: 1
% 0.12/0.39 distinct constant count: 8
% 0.12/0.39
% 0.12/0.39 ---------- no more Softie stats ----------
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.12/0.39
% 0.12/0.39 Stopped by limit on number of solutions
% 0.12/0.39
% 0.12/0.39 =========== start of search ===========
% 2.34/2.51
% 2.34/2.51 -------- PROOF --------
% 2.34/2.51 % SZS status Theorem
% 2.34/2.51 % SZS output start Refutation
% 2.34/2.51
% 2.34/2.51 Model 3 (0.00 seconds, 0 Inserts)
% 2.34/2.51
% 2.34/2.51 Stopped by limit on number of solutions
% 2.34/2.51
% 2.34/2.51 Model 4 (0.00 seconds, 0 Inserts)
% 2.34/2.51
% 2.34/2.51 Stopped by limit on number of solutions
% 2.34/2.51
% 2.34/2.51 Stopped by limit on insertions
% 2.34/2.51
% 2.34/2.51 Model 5 [ 1 1 160 ] (0.00 seconds, 250000 Inserts)
% 2.34/2.51
% 2.34/2.51 Stopped by limit on insertions
% 2.34/2.51
% 2.34/2.51 Model 6 [ 4 0 159 ] (0.00 seconds, 250000 Inserts)
% 2.34/2.51
% 2.34/2.51 Stopped by limit on insertions
% 2.34/2.51
% 2.34/2.51 Model 7 [ 1 2 45843 ] (0.00 seconds, 250000 Inserts)
% 2.34/2.51
% 2.34/2.51 Stopped by limit on insertions
% 2.34/2.51
% 2.34/2.51 Model 8 [ 4 1 130 ] (0.00 seconds, 250000 Inserts)
% 2.34/2.51
% 2.34/2.51 Stopped by limit on insertions
% 2.34/2.51
% 2.34/2.51 Model 9 [ 1 1 186 ] (0.00 seconds, 250000 Inserts)
% 2.34/2.51
% 2.34/2.51 Stopped by limit on insertions
% 2.34/2.51
% 2.34/2.51 Model 10 [ 1 1 763 ] (0.00 seconds, 250000 Inserts)
% 2.34/2.51
% 2.34/2.51 Stopped by limit on insertions
% 2.34/2.51
% 2.34/2.51 Model 11 [ 5 1 192 ] (0.00 seconds, 250000 Inserts)
% 2.34/2.51
% 2.34/2.51 Stopped by limit on insertions
% 2.34/2.51
% 2.34/2.51 Model 12 [ 2 1 249 ] (0.00 seconds, 250000 Inserts)
% 2.34/2.51
% 2.34/2.51 Stopped by limit on insertions
% 2.34/2.51
% 2.34/2.51 Model 13 [ 5 0 5082 ] (0.00 seconds, 250000 Inserts)
% 2.34/2.51
% 2.34/2.51 Stopped by limit on insertions
% 2.34/2.51
% 2.34/2.51 Model 14 [ 15 2 28674 ] (0.00 seconds, 250000 Inserts)
% 2.34/2.51
% 2.34/2.51 Stopped by limit on insertions
% 2.34/2.51
% 2.34/2.51 Model 15 [ 15 1 187 ] (0.00 seconds, 250000 Inserts)
% 2.34/2.51
% 2.34/2.51 Stopped by limit on insertions
% 2.34/2.51
% 2.34/2.51 Model 16 [ 11 0 241 ] (0.00 seconds, 250000 Inserts)
% 2.34/2.51
% 2.34/2.51 Stopped by limit on insertions
% 2.34/2.51
% 2.34/2.51 Model 17 [ 5 1 177 ] (0.00 seconds, 250000 Inserts)
% 2.34/2.51
% 2.34/2.51 Stopped by limit on insertions
% 2.34/2.51
% 2.34/2.51 Model 18 [ 3 0 6610 ] (0.00 seconds, 250000 Inserts)
% 2.34/2.51
% 2.34/2.51 Stopped by limit on insertions
% 2.34/2.51
% 2.34/2.51 Model 19 [ 18 0 1114 ] (0.00 seconds, 250000 Inserts)
% 2.34/2.51
% 2.34/2.51 Stopped by limit on insertions
% 2.34/2.51
% 2.34/2.51 Model 20 [ 3 2 46370 ] (0.00 seconds, 250000 Inserts)
% 2.34/2.51
% 2.34/2.51 Stopped by limit on insertions
% 2.34/2.51
% 2.34/2.51 Model 21 [ 20 0 214 ] (0.00 seconds, 250000 Inserts)
% 2.34/2.51
% 2.34/2.51 Stopped by limit on insertions
% 2.34/2.51
% 2.34/2.51 Model 22 [ 4 1 314 ] (0.00 seconds, 250000 Inserts)
% 2.34/2.51
% 2.34/2.51 Stopped by limit on insertions
% 2.34/2.51
% 2.34/2.51 Model 23 [ 6 1 168 ] (0.00 seconds, 250000 Inserts)
% 2.34/2.51
% 2.34/2.51 Stopped by limit on insertions
% 2.34/2.51
% 2.34/2.51 Model 24 [ 13 0 106 ] (0.00 seconds, 250000 Inserts)
% 2.34/2.51
% 2.34/2.51 ----> UNIT CONFLICT at 2.12 sec ----> 2083 [binary,2082.1,18.1] {-} $F.
% 2.34/2.51
% 2.34/2.51 Length of proof is 24. Level of proof is 12.
% 2.34/2.51
% 2.34/2.51 ---------------- PROOF ----------------
% 2.34/2.51 % SZS status Theorem
% 2.34/2.51 % SZS output start Refutation
% 2.34/2.51
% 2.34/2.51 7 [] {+} -smaller(A,B)|greater(B,A).
% 2.34/2.51 9 [] {+} -greater(A,B)| -greater(B,A).
% 2.34/2.51 10 [] {+} -greater(A,B)| -greater(B,C)|greater(A,C).
% 2.34/2.51 11 [] {+} -organization(A)| -has_immunity(A,B)|hazard_of_mortality(A,B)=very_low.
% 2.34/2.51 12 [] {+} -organization(A)|has_immunity(A,B)| -is_aligned(A,B)| -positional_advantage(A,B)|hazard_of_mortality(A,B)=low.
% 2.34/2.51 13 [] {+} -organization(A)|has_immunity(A,B)|is_aligned(A,B)| -positional_advantage(A,B)|hazard_of_mortality(A,B)=mod1.
% 2.34/2.51 14 [] {+} -organization(A)|has_immunity(A,B)| -is_aligned(A,B)|positional_advantage(A,B)|hazard_of_mortality(A,B)=mod2.
% 2.34/2.51 15 [] {+} -organization(A)|has_immunity(A,B)|is_aligned(A,B)|positional_advantage(A,B)|hazard_of_mortality(A,B)=high.
% 2.34/2.51 16 [] {+} -has_immunity($c3,$c1).
% 2.34/2.51 17 [] {+} -greater(hazard_of_mortality($c3,$c1),hazard_of_mortality($c3,$c2)).
% 2.34/2.51 18 [factor,9.1.2] {+} -greater(A,A).
% 2.34/2.51 19 [] {+} smaller(A,B)|A=B|greater(A,B).
% 2.34/2.51 20 [] {+} greater(high,mod1).
% 2.34/2.51 21 [] {+} greater(mod1,low).
% 2.34/2.51 22 [] {+} greater(low,very_low).
% 2.34/2.51 24 [] {+} greater(mod2,low).
% 2.34/2.51 25 [] {+} organization($c3).
% 2.34/2.51 26 [] {+} has_immunity($c3,$c2).
% 2.34/2.51 28 [hyper,19,7] {+} A=B|greater(A,B)|greater(B,A).
% 2.34/2.51 30 [para_from,19.2.1,17.1.2] {+} -greater(hazard_of_mortality($c3,$c1),A)|smaller(hazard_of_mortality($c3,$c2),A)|greater(hazard_of_mortality($c3,$c2),A).
% 2.34/2.51 36 [para_from,19.2.1,17.1.1.1] {+} -greater(hazard_of_mortality(A,$c1),hazard_of_mortality($c3,$c2))|smaller($c3,A)|greater($c3,A).
% 2.34/2.51 59 [hyper,21,10,20] {-} greater(high,low).
% 2.34/2.51 81 [hyper,24,10,22] {+} greater(mod2,very_low).
% 2.34/2.51 91,90 [hyper,26,11,25] {-} hazard_of_mortality($c3,$c2)=very_low.
% 2.34/2.51 154 [hyper,28,10,22] {-} very_low=A|greater(A,very_low)|greater(low,A).
% 2.34/2.51 675 [para_into,36.1.1,14.5.1,demod,91,unit_del,81] {+} smaller($c3,A)|greater($c3,A)| -organization(A)|has_immunity(A,$c1)| -is_aligned(A,$c1)|positional_advantage(A,$c1).
% 2.34/2.51 677 [para_into,36.1.1,12.5.1,demod,91,unit_del,22] {+} smaller($c3,A)|greater($c3,A)| -organization(A)|has_immunity(A,$c1)| -is_aligned(A,$c1)| -positional_advantage(A,$c1).
% 2.34/2.51 763 [para_from,154.1.1,22.1.2,factor_simp] {+} greater(low,A)|greater(A,very_low).
% 2.34/2.51 774 [hyper,763,30,demod,91,91,unit_del,18] {-} greater(low,hazard_of_mortality($c3,$c1))|smaller(very_low,very_low).
% 2.34/2.51 889 [hyper,774,7,unit_del,18] {-} greater(low,hazard_of_mortality($c3,$c1)).
% 2.34/2.51 949 [hyper,889,10,59] {-} greater(high,hazard_of_mortality($c3,$c1)).
% 2.34/2.51 953 [hyper,889,10,21] {-} greater(mod1,hazard_of_mortality($c3,$c1)).
% 2.34/2.51 1018 [para_into,953.1.2,13.5.1,unit_del,18,25,16] {+} is_aligned($c3,$c1)| -positional_advantage($c3,$c1).
% 2.34/2.51 1283 [para_into,949.1.2,15.5.1,unit_del,18,25,16] {+} is_aligned($c3,$c1)|positional_advantage($c3,$c1).
% 2.34/2.51 1797 [hyper,1283,1018,factor_simp] {+} is_aligned($c3,$c1).
% 2.34/2.51 1901 [para_into,675.1.1,28.1.1] {+} smaller(A,B)|greater($c3,B)| -organization(B)|has_immunity(B,$c1)| -is_aligned(B,$c1)|positional_advantage(B,$c1)|greater($c3,A)|greater(A,$c3).
% 2.34/2.51 1927 [factor,1901.2.8,unit_del,18,25,16,1797,18] {+} smaller($c3,$c3)|positional_advantage($c3,$c1).
% 2.34/2.51 1978 [hyper,1927,7,unit_del,18] {+} positional_advantage($c3,$c1).
% 2.34/2.51 2050 [para_into,677.1.1,28.1.1] {+} smaller(A,B)|greater($c3,B)| -organization(B)|has_immunity(B,$c1)| -is_aligned(B,$c1)| -positional_advantage(B,$c1)|greater($c3,A)|greater(A,$c3).
% 2.34/2.51 2076 [factor,2050.2.8,unit_del,18,25,16,1797,1978,18] {-} smaller($c3,$c3).
% 2.34/2.51 2082 [hyper,2076,7] {-} greater($c3,$c3).
% 2.34/2.51 2083 [binary,2082.1,18.1] {-} $F.
% 2.34/2.51
% 2.34/2.51 % SZS output end Refutation
% 2.34/2.51 ------------ end of proof -------------
% 2.34/2.51
% 2.34/2.51
% 2.34/2.51 Search stopped by max_proofs option.
% 2.34/2.51
% 2.34/2.51
% 2.34/2.51 Search stopped by max_proofs option.
% 2.34/2.51
% 2.34/2.51 ============ end of search ============
% 2.34/2.51
% 2.34/2.51 ----------- soft-scott stats ----------
% 2.34/2.51
% 2.34/2.51 true clauses given 33 (32.4%)
% 2.34/2.51 false clauses given 69
% 2.34/2.51
% 2.34/2.51 FALSE TRUE
% 2.34/2.51 3 0 9
% 2.34/2.51 5 0 1
% 2.34/2.51 6 0 29
% 2.34/2.51 8 0 2
% 2.34/2.51 9 17 230
% 2.34/2.51 10 1 0
% 2.34/2.51 11 0 264
% 2.34/2.51 12 22 112
% 2.34/2.51 13 0 93
% 2.34/2.51 14 0 52
% 2.34/2.51 15 10 194
% 2.34/2.51 16 2 13
% 2.34/2.51 17 0 71
% 2.34/2.51 18 0 3
% 2.34/2.51 19 1 95
% 2.34/2.51 20 0 114
% 2.34/2.51 21 0 22
% 2.34/2.51 22 29 33
% 2.34/2.51 23 0 191
% 2.34/2.51 24 9 38
% 2.34/2.51 25 0 95
% 2.34/2.51 26 0 23
% 2.34/2.51 27 0 30
% 2.34/2.51 tot: 91 1714 (95.0% true)
% 2.34/2.51
% 2.34/2.51
% 2.34/2.51 Model 24 [ 13 -16 106 ] (0.00 seconds, 250000 Inserts)
% 2.34/2.51
% 2.34/2.51 That finishes the proof of the theorem.
% 2.34/2.51
% 2.34/2.51 Process 11313 finished Thu Jun 9 07:22:51 2022
%------------------------------------------------------------------------------