%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : MGT005+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n027.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:25:45 EDT 2022
% Result : Theorem 6.43s 6.66s
% Output : Refutation 6.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : MGT005+1 : TPTP v8.1.0. Released v2.0.0.
% 0.04/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n027.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:41:57 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.37 ----- Otter 3.2, August 2001 -----
% 0.19/0.37 The process was started by sandbox2 on n027.cluster.edu,
% 0.19/0.37 Thu Jun 9 07:41:57 2022
% 0.19/0.37 The command was "./sos". The process ID is 27075.
% 0.19/0.37
% 0.19/0.37 set(prolog_style_variables).
% 0.19/0.37 set(auto).
% 0.19/0.37 dependent: set(auto1).
% 0.19/0.37 dependent: set(process_input).
% 0.19/0.37 dependent: clear(print_kept).
% 0.19/0.37 dependent: clear(print_new_demod).
% 0.19/0.37 dependent: clear(print_back_demod).
% 0.19/0.37 dependent: clear(print_back_sub).
% 0.19/0.37 dependent: set(control_memory).
% 0.19/0.37 dependent: assign(max_mem, 12000).
% 0.19/0.37 dependent: assign(pick_given_ratio, 4).
% 0.19/0.37 dependent: assign(stats_level, 1).
% 0.19/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.19/0.37 dependent: assign(sos_limit, 5000).
% 0.19/0.37 dependent: assign(max_weight, 60).
% 0.19/0.37 clear(print_given).
% 0.19/0.37
% 0.19/0.37 formula_list(usable).
% 0.19/0.37
% 0.19/0.37 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=19.
% 0.19/0.37
% 0.19/0.37 This ia a non-Horn set with equality. The strategy will be
% 0.19/0.37 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.19/0.37 unit deletion, with positive clauses in sos and nonpositive
% 0.19/0.37 clauses in usable.
% 0.19/0.37
% 0.19/0.37 dependent: set(knuth_bendix).
% 0.19/0.37 dependent: set(para_from).
% 0.19/0.37 dependent: set(para_into).
% 0.19/0.37 dependent: clear(para_from_right).
% 0.19/0.37 dependent: clear(para_into_right).
% 0.19/0.37 dependent: set(para_from_vars).
% 0.19/0.37 dependent: set(eq_units_both_ways).
% 0.19/0.37 dependent: set(dynamic_demod_all).
% 0.19/0.37 dependent: set(dynamic_demod).
% 0.19/0.37 dependent: set(order_eq).
% 0.19/0.37 dependent: set(back_demod).
% 0.19/0.37 dependent: set(lrpo).
% 0.19/0.37 dependent: set(hyper_res).
% 0.19/0.37 dependent: set(unit_deletion).
% 0.19/0.37 dependent: set(factor).
% 0.19/0.37
% 0.19/0.37 ------------> process usable:
% 0.19/0.37 18 back subsumes 16.
% 0.19/0.37 18 back subsumes 15.
% 0.19/0.37
% 0.19/0.37 ------------> process sos:
% 0.19/0.37 Following clause subsumed by 41 during input processing: 0 [copy,41,flip.1] {-} A=A.
% 0.19/0.37 41 back subsumes 22.
% 0.19/0.37
% 0.19/0.37 ======= end of input processing =======
% 0.19/0.46
% 0.19/0.46 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.46
% 0.19/0.46 Stopped by limit on number of solutions
% 0.19/0.46
% 0.19/0.46
% 0.19/0.46 -------------- Softie stats --------------
% 0.19/0.46
% 0.19/0.46 UPDATE_STOP: 300
% 0.19/0.46 SFINDER_TIME_LIMIT: 2
% 0.19/0.46 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.46 number of clauses in intial UL: 19
% 0.19/0.46 number of clauses initially in problem: 38
% 0.19/0.46 percentage of clauses intially in UL: 50
% 0.19/0.46 percentage of distinct symbols occuring in initial UL: 54
% 0.19/0.46 percent of all initial clauses that are short: 100
% 0.19/0.46 absolute distinct symbol count: 22
% 0.19/0.46 distinct predicate count: 9
% 0.19/0.46 distinct function count: 1
% 0.19/0.46 distinct constant count: 12
% 0.19/0.46
% 0.19/0.46 ---------- no more Softie stats ----------
% 0.19/0.46
% 0.19/0.46
% 0.19/0.46
% 0.19/0.46 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.46
% 0.19/0.46 Stopped by limit on number of solutions
% 0.19/0.46
% 0.19/0.46 =========== start of search ===========
% 6.43/6.66
% 6.43/6.66 -------- PROOF --------
% 6.43/6.66 % SZS status Theorem
% 6.43/6.66 % SZS output start Refutation
% 6.43/6.66
% 6.43/6.66 Model 3 (0.00 seconds, 0 Inserts)
% 6.43/6.66
% 6.43/6.66 Stopped by limit on number of solutions
% 6.43/6.66
% 6.43/6.66 Model 4 (0.00 seconds, 0 Inserts)
% 6.43/6.66
% 6.43/6.66 Stopped by limit on number of solutions
% 6.43/6.66
% 6.43/6.66 Model 5 (0.00 seconds, 0 Inserts)
% 6.43/6.66
% 6.43/6.66 Stopped by limit on number of solutions
% 6.43/6.66
% 6.43/6.66 Model 6 (0.00 seconds, 0 Inserts)
% 6.43/6.66
% 6.43/6.66 Stopped by limit on number of solutions
% 6.43/6.66
% 6.43/6.66 Model 7 (0.00 seconds, 0 Inserts)
% 6.43/6.66
% 6.43/6.66 Stopped by limit on number of solutions
% 6.43/6.66
% 6.43/6.66 Stopped by limit on insertions
% 6.43/6.66
% 6.43/6.66 Model 8 [ 2 2 314 ] (0.00 seconds, 250000 Inserts)
% 6.43/6.66
% 6.43/6.66 Stopped by limit on insertions
% 6.43/6.66
% 6.43/6.66 Model 9 [ 1 1 1459 ] (0.00 seconds, 250000 Inserts)
% 6.43/6.66
% 6.43/6.66 Stopped by limit on insertions
% 6.43/6.66
% 6.43/6.66 Model 10 [ 1 4 1350 ] (0.00 seconds, 250000 Inserts)
% 6.43/6.66
% 6.43/6.66 Stopped by limit on insertions
% 6.43/6.66
% 6.43/6.66 Model 11 [ 2 3 361 ] (0.00 seconds, 250000 Inserts)
% 6.43/6.66
% 6.43/6.66 Stopped by limit on insertions
% 6.43/6.66
% 6.43/6.66 Model 12 [ 2 6 394 ] (0.00 seconds, 250000 Inserts)
% 6.43/6.66
% 6.43/6.66 Stopped by limit on insertions
% 6.43/6.66
% 6.43/6.66 Model 13 [ 1 3 488 ] (0.00 seconds, 250000 Inserts)
% 6.43/6.66
% 6.43/6.66 Stopped by limit on insertions
% 6.43/6.66
% 6.43/6.66 Model 14 [ 4 2 227 ] (0.00 seconds, 250000 Inserts)
% 6.43/6.66
% 6.43/6.66 Stopped by limit on insertions
% 6.43/6.66
% 6.43/6.66 Model 15 [ 4 4 277 ] (0.00 seconds, 250000 Inserts)
% 6.43/6.66
% 6.43/6.66 Stopped by limit on insertions
% 6.43/6.66
% 6.43/6.66 Model 16 [ 1 7 814 ] (0.00 seconds, 250000 Inserts)
% 6.43/6.66
% 6.43/6.66 Stopped by limit on insertions
% 6.43/6.66
% 6.43/6.66 Model 17 [ 1 6 272 ] (0.00 seconds, 250000 Inserts)
% 6.43/6.66
% 6.43/6.66 Stopped by limit on insertions
% 6.43/6.66
% 6.43/6.66 Model 18 [ 2 4 1618 ] (0.00 seconds, 250000 Inserts)
% 6.43/6.66
% 6.43/6.66 Stopped by limit on insertions
% 6.43/6.66
% 6.43/6.66 Model 19 [ 3 5 1089 ] (0.00 seconds, 250000 Inserts)
% 6.43/6.67
% 6.43/6.67 ----> UNIT CONFLICT at 6.03 sec ----> 214 [binary,213.1,11.1] {+} $F.
% 6.43/6.67
% 6.43/6.67 Length of proof is 16. Level of proof is 8.
% 6.43/6.67
% 6.43/6.67 ---------------- PROOF ----------------
% 6.43/6.67 % SZS status Theorem
% 6.43/6.67 % SZS output start Refutation
% 6.43/6.67
% 6.43/6.67 2 [] {+} -greater(A,B)| -greater(B,A).
% 6.43/6.67 3 [] {+} -greater(A,B)| -greater(B,C)|greater(A,C).
% 6.43/6.67 4 [] {+} -organization(A,B)|survival_chance(A,$f1(A,B),B).
% 6.43/6.67 5 [] {+} -organization(A,B)| -organization(A,C)| -greater(D,B)| -greater(C,D)|organization(A,D).
% 6.43/6.67 6 [] {+} -reorganization(A,B,C)|greater(C,B).
% 6.43/6.67 7 [] {+} -organization(A,B)| -organization(A,C)| -reorganization_free(A,B,C)| -survival_chance(A,D,B)| -survival_chance(A,E,C)| -greater(C,B)|greater(E,D).
% 6.43/6.67 8 [] {+} -organization(A,B)| -organization(A,C)| -reorganization(A,D,E)| -survival_chance(A,F,B)| -survival_chance(A,G,C)|greater(D,B)| -greater(C,B)|greater(C,E)|greater(F,G).
% 6.43/6.67 9 [] {+} -organization(A,B)| -organization(C,B)| -organization(C,D)| -class(A,E,B)| -class(C,E,B)| -reorganization(A,B,F)| -reorganization(C,B,D)| -reorganization_type(A,G,B)| -reorganization_type(C,G,B)| -complexity(A,H,B)| -complexity(C,I,B)| -greater(I,H)|greater(D,F).
% 6.43/6.67 10 [] {+} -organization(A,B)| -organization(C,B)| -organization(A,D)| -organization(C,D)| -class(A,E,B)| -class(C,E,B)| -survival_chance(A,F,B)| -survival_chance(C,F,B)| -reorganization(A,B,D)| -reorganization(C,B,G)| -reorganization_type(A,H,B)| -reorganization_type(C,H,B)| -survival_chance(A,I,D)| -survival_chance(C,J,D)| -complexity(A,K,B)| -complexity(C,L,B)| -greater(L,K)|greater(I,J)|I=J.
% 6.43/6.67 11 [] {+} -greater($c7,$c6).
% 6.43/6.67 12 [factor,2.1.2] {+} -greater(A,A).
% 6.43/6.67 23 [] {+} organization($c12,$c3).
% 6.43/6.67 24 [] {+} organization($c11,$c3).
% 6.43/6.67 25 [] {+} organization($c12,$c1).
% 6.43/6.67 26 [] {+} organization($c11,$c1).
% 6.43/6.67 27 [] {+} class($c12,$c9,$c3).
% 6.43/6.67 28 [] {+} class($c11,$c9,$c3).
% 6.43/6.67 29 [] {+} survival_chance($c12,$c8,$c3).
% 6.43/6.67 30 [] {+} survival_chance($c11,$c8,$c3).
% 6.43/6.67 31 [] {+} reorganization($c12,$c3,$c2).
% 6.43/6.67 32 [] {+} reorganization($c11,$c3,$c1).
% 6.43/6.67 33 [] {+} reorganization_type($c12,$c10,$c3).
% 6.43/6.67 34 [] {+} reorganization_type($c11,$c10,$c3).
% 6.43/6.67 35 [] {+} reorganization_free($c12,$c2,$c1).
% 6.43/6.67 36 [] {+} survival_chance($c12,$c7,$c1).
% 6.43/6.67 37 [] {+} survival_chance($c11,$c6,$c1).
% 6.43/6.67 38 [] {+} complexity($c12,$c5,$c3).
% 6.43/6.67 39 [] {+} complexity($c11,$c4,$c3).
% 6.43/6.67 40 [] {+} greater($c4,$c5).
% 6.43/6.67 78 [hyper,31,6] {+} greater($c2,$c3).
% 6.43/6.67 157 [hyper,39,9,23,24,26,27,28,31,32,33,34,38,40] {+} greater($c1,$c2).
% 6.43/6.67 164 [hyper,157,5,24,26,78] {+} organization($c11,$c2).
% 6.43/6.67 165 [hyper,157,5,23,25,78] {+} organization($c12,$c2).
% 6.43/6.67 170 [hyper,164,4] {+} survival_chance($c11,$f1($c11,$c2),$c2).
% 6.43/6.67 175 [hyper,165,4] {+} survival_chance($c12,$f1($c12,$c2),$c2).
% 6.43/6.67 186 [hyper,170,8,164,26,32,37,157,unit_del,12] {-} greater($c3,$c2)|greater($f1($c11,$c2),$c6).
% 6.43/6.67 187 [hyper,186,3,78,unit_del,12] {-} greater($f1($c11,$c2),$c6).
% 6.43/6.67 190 [hyper,175,10,23,24,165,164,27,28,29,30,31,32,33,34,170,38,39,40] {+} greater($f1($c12,$c2),$f1($c11,$c2))|$f1($c12,$c2)=$f1($c11,$c2).
% 6.43/6.67 194 [hyper,175,7,165,25,35,36,157] {-} greater($c7,$f1($c12,$c2)).
% 6.43/6.67 196 [hyper,190,3,194] {-} $f1($c12,$c2)=$f1($c11,$c2)|greater($c7,$f1($c11,$c2)).
% 6.43/6.67 201 [para_from,190.2.1,194.1.2] {+} greater($c7,$f1($c11,$c2))|greater($f1($c12,$c2),$f1($c11,$c2)).
% 6.43/6.67 207,206 [hyper,196,3,187,unit_del,11] {-} $f1($c12,$c2)=$f1($c11,$c2).
% 6.43/6.67 211 [back_demod,201,demod,207,unit_del,12] {-} greater($c7,$f1($c11,$c2)).
% 6.43/6.67 213 [hyper,211,3,187] {-} greater($c7,$c6).
% 6.43/6.67 214 [binary,213.1,11.1] {+} $F.
% 6.43/6.67
% 6.43/6.67 % SZS output end Refutation
% 6.43/6.67 ------------ end of proof -------------
% 6.43/6.67
% 6.43/6.67
% 6.43/6.67 Search stopped by max_proofs option.
% 6.43/6.67
% 6.43/6.67
% 6.43/6.67 Search stopped by max_proofs option.
% 6.43/6.67
% 6.43/6.67 ============ end of search ============
% 6.43/6.67
% 6.43/6.67 ----------- soft-scott stats ----------
% 6.43/6.67
% 6.43/6.67 true clauses given 23 (40.4%)
% 6.43/6.67 false clauses given 34
% 6.43/6.67
% 6.43/6.67 FALSE TRUE
% 6.43/6.67 6 0 1
% 6.43/6.67 7 1 2
% 6.43/6.67 12 1 2
% 6.43/6.67 13 0 1
% 6.43/6.67 14 1 4
% 6.43/6.67 59 0 37
% 6.43/6.67 60 0 78
% 6.43/6.67 tot: 3 125 (97.7% true)
% 6.43/6.67
% 6.43/6.67
% 6.43/6.67 Model 19 [ 3 5 1089 ] (0.00 seconds, 250000 Inserts)
% 6.43/6.67
% 6.43/6.67 That finishes the proof of the theorem.
% 6.43/6.67
% 6.43/6.67 Process 27075 finished Thu Jun 9 07:42:03 2022
%------------------------------------------------------------------------------