TSTP Solution File: MGT039+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : MGT039+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n022.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:57 EDT 2022
% Result : Theorem 3.47s 3.71s
% Output : Refutation 3.47s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : MGT039+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n022.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jun 9 07:57:34 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox on n022.cluster.edu,
% 0.12/0.35 Thu Jun 9 07:57:34 2022
% 0.12/0.35 The command was "./sos". The process ID is 31814.
% 0.12/0.35
% 0.12/0.35 set(prolog_style_variables).
% 0.12/0.35 set(auto).
% 0.12/0.35 dependent: set(auto1).
% 0.12/0.35 dependent: set(process_input).
% 0.12/0.35 dependent: clear(print_kept).
% 0.12/0.35 dependent: clear(print_new_demod).
% 0.12/0.35 dependent: clear(print_back_demod).
% 0.12/0.35 dependent: clear(print_back_sub).
% 0.12/0.35 dependent: set(control_memory).
% 0.12/0.35 dependent: assign(max_mem, 12000).
% 0.12/0.35 dependent: assign(pick_given_ratio, 4).
% 0.12/0.35 dependent: assign(stats_level, 1).
% 0.12/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.35 dependent: assign(sos_limit, 5000).
% 0.12/0.35 dependent: assign(max_weight, 60).
% 0.12/0.35 clear(print_given).
% 0.12/0.35
% 0.12/0.35 formula_list(usable).
% 0.12/0.35
% 0.12/0.35 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 0.12/0.35
% 0.12/0.35 This ia a non-Horn set with equality. The strategy will be
% 0.12/0.35 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.35 unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.35 clauses in usable.
% 0.12/0.35
% 0.12/0.35 dependent: set(knuth_bendix).
% 0.12/0.35 dependent: set(para_from).
% 0.12/0.35 dependent: set(para_into).
% 0.12/0.35 dependent: clear(para_from_right).
% 0.12/0.35 dependent: clear(para_into_right).
% 0.12/0.35 dependent: set(para_from_vars).
% 0.12/0.35 dependent: set(eq_units_both_ways).
% 0.12/0.35 dependent: set(dynamic_demod_all).
% 0.12/0.35 dependent: set(dynamic_demod).
% 0.12/0.35 dependent: set(order_eq).
% 0.12/0.35 dependent: set(back_demod).
% 0.12/0.35 dependent: set(lrpo).
% 0.12/0.35 dependent: set(hyper_res).
% 0.12/0.35 dependent: set(unit_deletion).
% 0.12/0.35 dependent: set(factor).
% 0.12/0.35
% 0.12/0.35 ------------> process usable:
% 0.12/0.35
% 0.12/0.35 ------------> process sos:
% 0.12/0.35 Following clause subsumed by 20 during input processing: 0 [copy,20,flip.1] {-} A=A.
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.18/0.38
% 0.18/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.18/0.38
% 0.18/0.38 Stopped by limit on number of solutions
% 0.18/0.38
% 0.18/0.38
% 0.18/0.38 -------------- Softie stats --------------
% 0.18/0.38
% 0.18/0.38 UPDATE_STOP: 300
% 0.18/0.38 SFINDER_TIME_LIMIT: 2
% 0.18/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.38 number of clauses in intial UL: 15
% 0.18/0.38 number of clauses initially in problem: 20
% 0.18/0.38 percentage of clauses intially in UL: 75
% 0.18/0.38 percentage of distinct symbols occuring in initial UL: 100
% 0.18/0.38 percent of all initial clauses that are short: 95
% 0.18/0.38 absolute distinct symbol count: 17
% 0.18/0.38 distinct predicate count: 9
% 0.18/0.38 distinct function count: 5
% 0.18/0.38 distinct constant count: 3
% 0.18/0.38
% 0.18/0.38 ---------- no more Softie stats ----------
% 0.18/0.38
% 0.18/0.38
% 0.18/0.38
% 0.18/0.38 Model 2 (0.00 seconds, 0 Inserts)
% 0.18/0.38
% 0.18/0.38 Stopped by limit on number of solutions
% 0.18/0.38
% 0.18/0.38 =========== start of search ===========
% 3.47/3.71
% 3.47/3.71 -------- PROOF --------
% 3.47/3.71 % SZS status Theorem
% 3.47/3.71 % SZS output start Refutation
% 3.47/3.71
% 3.47/3.71 Model 3 (0.00 seconds, 0 Inserts)
% 3.47/3.71
% 3.47/3.71 Stopped by limit on number of solutions
% 3.47/3.71
% 3.47/3.71 Stopped by limit on insertions
% 3.47/3.71
% 3.47/3.71 Model 4 [ 1 0 718 ] (0.00 seconds, 250000 Inserts)
% 3.47/3.71
% 3.47/3.71 Stopped by limit on insertions
% 3.47/3.71
% 3.47/3.71 Model 5 [ 1 0 115 ] (0.00 seconds, 250000 Inserts)
% 3.47/3.71
% 3.47/3.71 Stopped by limit on insertions
% 3.47/3.71
% 3.47/3.71 Model 6 [ 1 0 150 ] (0.00 seconds, 250000 Inserts)
% 3.47/3.71
% 3.47/3.71 Stopped by limit on insertions
% 3.47/3.71
% 3.47/3.71 Model 7 [ 4 1 114 ] (0.00 seconds, 250000 Inserts)
% 3.47/3.71
% 3.47/3.71 Stopped by limit on insertions
% 3.47/3.71
% 3.47/3.71 Model 8 [ 3 0 117 ] (0.00 seconds, 250000 Inserts)
% 3.47/3.71
% 3.47/3.71 Stopped by limit on insertions
% 3.47/3.71
% 3.47/3.71 Model 9 [ 2 0 115 ] (0.00 seconds, 250000 Inserts)
% 3.47/3.71
% 3.47/3.71 ----> UNIT CONFLICT at 3.34 sec ----> 3562 [binary,3561.1,15.1] {-} $F.
% 3.47/3.71
% 3.47/3.71 Length of proof is 20. Level of proof is 11.
% 3.47/3.71
% 3.47/3.71 ---------------- PROOF ----------------
% 3.47/3.71 % SZS status Theorem
% 3.47/3.71 % SZS output start Refutation
% 3.47/3.71
% 3.47/3.71 1 [] {+} -observational_period(A)| -propagation_strategy(first_movers)| -propagation_strategy(efficient_producers)|environment($f1(A))|selection_favors(efficient_producers,first_movers,A).
% 3.47/3.71 2 [] {+} -observational_period(A)| -propagation_strategy(first_movers)| -propagation_strategy(efficient_producers)|in_environment(A,$f1(A))|selection_favors(efficient_producers,first_movers,A).
% 3.47/3.71 3 [] {+} -observational_period(A)| -propagation_strategy(first_movers)| -propagation_strategy(efficient_producers)| -selection_favors(efficient_producers,first_movers,end_time($f1(A)))|selection_favors(efficient_producers,first_movers,A).
% 3.47/3.71 4 [] {+} -observational_period(A)| -slow_change(A)| -environment(B)| -in_environment(A,B)|in_environment(B,$f2(A,B)).
% 3.47/3.71 5 [] {+} -observational_period(A)| -slow_change(A)| -environment(B)| -in_environment(A,B)|greater($f2(A,B),critical_point(B)).
% 3.47/3.71 6 [] {+} -environment(A)| -greater_or_equal(B,start_time(A))| -greater_or_equal(end_time(A),B)|in_environment(A,B).
% 3.47/3.71 7 [] {+} -environment(A)| -in_environment(A,B)|greater_or_equal(end_time(A),B).
% 3.47/3.71 8 [] {+} -environment(A)|greater_or_equal(critical_point(A),start_time(A)).
% 3.47/3.71 9 [] {+} -greater(A,B)| -greater(B,C)|greater(A,C).
% 3.47/3.71 10 [] {+} -greater_or_equal(A,B)|greater(A,B)|A=B.
% 3.47/3.71 11 [] {+} greater_or_equal(A,B)| -greater(A,B).
% 3.47/3.71 12 [] {+} greater_or_equal(A,B)|A!=B.
% 3.47/3.71 14 [] {+} -environment(A)| -in_environment(A,B)| -greater(B,critical_point(A))|selection_favors(efficient_producers,first_movers,B).
% 3.47/3.71 15 [] {+} -selection_favors(efficient_producers,first_movers,$c1).
% 3.47/3.71 16 [] {+} propagation_strategy(first_movers).
% 3.47/3.71 17 [] {+} propagation_strategy(efficient_producers).
% 3.47/3.71 18 [] {+} observational_period($c1).
% 3.47/3.71 19 [] {+} slow_change($c1).
% 3.47/3.71 20 [] {+} A=A.
% 3.47/3.71 23 [hyper,18,2,16,17,unit_del,15] {+} in_environment($c1,$f1($c1)).
% 3.47/3.71 24 [hyper,18,1,16,17,unit_del,15] {+} environment($f1($c1)).
% 3.47/3.71 27 [hyper,24,8] {+} greater_or_equal(critical_point($f1($c1)),start_time($f1($c1))).
% 3.47/3.71 30 [hyper,20,12] {+} greater_or_equal(A,A).
% 3.47/3.71 31 [hyper,23,5,18,19,24] {-} greater($f2($c1,$f1($c1)),critical_point($f1($c1))).
% 3.47/3.71 32 [hyper,23,4,18,19,24] {+} in_environment($f1($c1),$f2($c1,$f1($c1))).
% 3.47/3.71 38 [hyper,32,7,24] {+} greater_or_equal(end_time($f1($c1)),$f2($c1,$f1($c1))).
% 3.47/3.71 47 [hyper,31,14,24,32] {-} selection_favors(efficient_producers,first_movers,$f2($c1,$f1($c1))).
% 3.47/3.71 55 [para_into,31.1.2,10.3.1] {-} greater($f2($c1,$f1($c1)),A)| -greater_or_equal(critical_point($f1($c1)),A)|greater(critical_point($f1($c1)),A).
% 3.47/3.71 138 [hyper,38,10] {+} greater(end_time($f1($c1)),$f2($c1,$f1($c1)))|end_time($f1($c1))=$f2($c1,$f1($c1)).
% 3.47/3.71 157 [hyper,55,27] {-} greater($f2($c1,$f1($c1)),start_time($f1($c1)))|greater(critical_point($f1($c1)),start_time($f1($c1))).
% 3.47/3.71 174 [hyper,157,9,31,factor_simp] {-} greater($f2($c1,$f1($c1)),start_time($f1($c1))).
% 3.47/3.71 3369 [hyper,138,9,174] {-} end_time($f1($c1))=$f2($c1,$f1($c1))|greater(end_time($f1($c1)),start_time($f1($c1))).
% 3.47/3.71 3370 [hyper,138,9,31] {-} end_time($f1($c1))=$f2($c1,$f1($c1))|greater(end_time($f1($c1)),critical_point($f1($c1))).
% 3.47/3.71 3407 [para_from,3369.1.1,3.4.3,unit_del,18,16,17,47,15] {-} greater(end_time($f1($c1)),start_time($f1($c1))).
% 3.47/3.71 3408 [hyper,3407,11] {+} greater_or_equal(end_time($f1($c1)),start_time($f1($c1))).
% 3.47/3.71 3417 [hyper,3408,6,24,30] {+} in_environment($f1($c1),end_time($f1($c1))).
% 3.47/3.71 3511 [para_from,3370.1.1,3.4.3,unit_del,18,16,17,47,15] {-} greater(end_time($f1($c1)),critical_point($f1($c1))).
% 3.47/3.71 3512 [hyper,3511,14,24,3417] {+} selection_favors(efficient_producers,first_movers,end_time($f1($c1))).
% 3.47/3.71 3561 [hyper,3512,3,18,16,17] {-} selection_favors(efficient_producers,first_movers,$c1).
% 3.47/3.71 3562 [binary,3561.1,15.1] {-} $F.
% 3.47/3.71
% 3.47/3.71 % SZS output end Refutation
% 3.47/3.71 ------------ end of proof -------------
% 3.47/3.71
% 3.47/3.71
% 3.47/3.71 Search stopped by max_proofs option.
% 3.47/3.71
% 3.47/3.71
% 3.47/3.71 Search stopped by max_proofs option.
% 3.47/3.71
% 3.47/3.71 ============ end of search ============
% 3.47/3.71
% 3.47/3.71 ----------- soft-scott stats ----------
% 3.47/3.71
% 3.47/3.71 true clauses given 126 (38.8%)
% 3.47/3.71 false clauses given 199
% 3.47/3.71
% 3.47/3.71 FALSE TRUE
% 3.47/3.71 7 0 1
% 3.47/3.71 8 0 1
% 3.47/3.71 12 0 4
% 3.47/3.71 13 0 11
% 3.47/3.71 14 0 9
% 3.47/3.71 15 3 4
% 3.47/3.71 16 0 10
% 3.47/3.71 17 0 10
% 3.47/3.71 18 0 2
% 3.47/3.71 19 0 52
% 3.47/3.71 20 8 230
% 3.47/3.71 21 14 149
% 3.47/3.71 22 6 112
% 3.47/3.71 23 5 59
% 3.47/3.71 24 1 21
% 3.47/3.71 25 28 54
% 3.47/3.71 26 19 126
% 3.47/3.71 27 62 220
% 3.47/3.71 28 181 270
% 3.47/3.71 29 219 223
% 3.47/3.71 30 184 155
% 3.47/3.71 31 113 71
% 3.47/3.71 32 23 64
% 3.47/3.71 33 4 55
% 3.47/3.71 34 0 66
% 3.47/3.71 35 0 23
% 3.47/3.71 36 0 11
% 3.47/3.71 37 0 21
% 3.47/3.71 38 0 14
% 3.47/3.71 39 3 5
% 3.47/3.71 40 0 8
% 3.47/3.71 41 0 7
% 3.47/3.71 43 0 1
% 3.47/3.71 tot: 873 2069 (70.3% true)
% 3.47/3.71
% 3.47/3.71
% 3.47/3.71 Model 9 [ 2 0 115 ] (0.00 seconds, 250000 Inserts)
% 3.47/3.71
% 3.47/3.71 That finishes the proof of the theorem.
% 3.47/3.71
% 3.47/3.71 Process 31814 finished Thu Jun 9 07:57:38 2022
%------------------------------------------------------------------------------