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.4.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 : Unsatisfiable 0.71s 0.88s
% Output : Refutation 0.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : MGT039-1 : TPTP v8.1.0. Released v2.4.0.
% 0.09/0.12 % Command : sos-script %s
% 0.13/0.33 % Computer : n022.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Thu Jun 9 09:56:34 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.34 ----- Otter 3.2, August 2001 -----
% 0.13/0.34 The process was started by sandbox on n022.cluster.edu,
% 0.13/0.34 Thu Jun 9 09:56:34 2022
% 0.13/0.34 The command was "./sos". The process ID is 21903.
% 0.13/0.34
% 0.13/0.34 set(prolog_style_variables).
% 0.13/0.34 set(auto).
% 0.13/0.34 dependent: set(auto1).
% 0.13/0.34 dependent: set(process_input).
% 0.13/0.34 dependent: clear(print_kept).
% 0.13/0.34 dependent: clear(print_new_demod).
% 0.13/0.34 dependent: clear(print_back_demod).
% 0.13/0.34 dependent: clear(print_back_sub).
% 0.13/0.34 dependent: set(control_memory).
% 0.13/0.34 dependent: assign(max_mem, 12000).
% 0.13/0.34 dependent: assign(pick_given_ratio, 4).
% 0.13/0.34 dependent: assign(stats_level, 1).
% 0.13/0.34 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.34 dependent: assign(sos_limit, 5000).
% 0.13/0.34 dependent: assign(max_weight, 60).
% 0.13/0.34 clear(print_given).
% 0.13/0.34
% 0.13/0.34 list(usable).
% 0.13/0.34
% 0.13/0.34 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 0.13/0.34
% 0.13/0.34 This ia a non-Horn set with equality. The strategy will be
% 0.13/0.34 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.34 unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.34 clauses in usable.
% 0.13/0.34
% 0.13/0.34 dependent: set(knuth_bendix).
% 0.13/0.34 dependent: set(para_from).
% 0.13/0.34 dependent: set(para_into).
% 0.13/0.34 dependent: clear(para_from_right).
% 0.13/0.34 dependent: clear(para_into_right).
% 0.13/0.34 dependent: set(para_from_vars).
% 0.13/0.34 dependent: set(eq_units_both_ways).
% 0.13/0.34 dependent: set(dynamic_demod_all).
% 0.13/0.34 dependent: set(dynamic_demod).
% 0.13/0.34 dependent: set(order_eq).
% 0.13/0.34 dependent: set(back_demod).
% 0.13/0.34 dependent: set(lrpo).
% 0.13/0.34 dependent: set(hyper_res).
% 0.13/0.34 dependent: set(unit_deletion).
% 0.13/0.34 dependent: set(factor).
% 0.13/0.34
% 0.13/0.34 ------------> process usable:
% 0.13/0.34
% 0.13/0.34 ------------> process sos:
% 0.13/0.34 Following clause subsumed by 20 during input processing: 0 [copy,20,flip.1] {-} A=A.
% 0.13/0.34
% 0.13/0.34 ======= end of input processing =======
% 0.13/0.38
% 0.13/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.38
% 0.13/0.38 Stopped by limit on number of solutions
% 0.13/0.38
% 0.13/0.38
% 0.13/0.38 -------------- Softie stats --------------
% 0.13/0.38
% 0.13/0.38 UPDATE_STOP: 300
% 0.13/0.38 SFINDER_TIME_LIMIT: 2
% 0.13/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.38 number of clauses in intial UL: 15
% 0.13/0.38 number of clauses initially in problem: 20
% 0.13/0.38 percentage of clauses intially in UL: 75
% 0.13/0.38 percentage of distinct symbols occuring in initial UL: 100
% 0.13/0.38 percent of all initial clauses that are short: 95
% 0.13/0.38 absolute distinct symbol count: 17
% 0.13/0.38 distinct predicate count: 9
% 0.13/0.38 distinct function count: 5
% 0.13/0.38 distinct constant count: 3
% 0.13/0.38
% 0.13/0.38 ---------- no more Softie stats ----------
% 0.13/0.38
% 0.13/0.38
% 0.13/0.38
% 0.13/0.38 Model 2 (0.00 seconds, 0 Inserts)
% 0.13/0.38
% 0.13/0.38 Stopped by limit on number of solutions
% 0.13/0.38
% 0.13/0.38 =========== start of search ===========
% 0.71/0.88
% 0.71/0.88 -------- PROOF --------
% 0.71/0.88 % SZS status Unsatisfiable
% 0.71/0.88 % SZS output start Refutation
% 0.71/0.88
% 0.71/0.88 Model 3 (0.00 seconds, 0 Inserts)
% 0.71/0.88
% 0.71/0.88 Stopped by limit on number of solutions
% 0.71/0.88
% 0.71/0.88 Stopped by limit on insertions
% 0.71/0.88
% 0.71/0.88 Model 4 [ 1 1 686 ] (0.00 seconds, 250000 Inserts)
% 0.71/0.88
% 0.71/0.88 Stopped by limit on insertions
% 0.71/0.88
% 0.71/0.88 Stopped by limit on insertions
% 0.71/0.88
% 0.71/0.88 Model 5 [ 1 1 201 ] (0.00 seconds, 250000 Inserts)
% 0.71/0.88
% 0.71/0.88 Stopped by limit on insertions
% 0.71/0.88
% 0.71/0.88 Model 6 [ 2 1 123 ] (0.00 seconds, 250000 Inserts)
% 0.71/0.88
% 0.71/0.88 ----> UNIT CONFLICT at 0.51 sec ----> 973 [binary,972.1,15.1] {-} $F.
% 0.71/0.88
% 0.71/0.88 Length of proof is 21. Level of proof is 12.
% 0.71/0.88
% 0.71/0.88 ---------------- PROOF ----------------
% 0.71/0.88 % SZS status Unsatisfiable
% 0.71/0.88 % SZS output start Refutation
% 0.71/0.88
% 0.71/0.88 1 [] {+} -observational_period(A)| -propagation_strategy(first_movers)| -propagation_strategy(efficient_producers)|environment(sk1(A))|selection_favors(efficient_producers,first_movers,A).
% 0.71/0.88 2 [] {+} -observational_period(A)| -propagation_strategy(first_movers)| -propagation_strategy(efficient_producers)|in_environment(A,sk1(A))|selection_favors(efficient_producers,first_movers,A).
% 0.71/0.88 3 [] {+} -observational_period(A)| -propagation_strategy(first_movers)| -propagation_strategy(efficient_producers)| -selection_favors(efficient_producers,first_movers,end_time(sk1(A)))|selection_favors(efficient_producers,first_movers,A).
% 0.71/0.88 4 [] {+} -observational_period(A)| -slow_change(A)| -environment(B)| -in_environment(A,B)|in_environment(B,sk2(B,A)).
% 0.71/0.88 5 [] {+} -observational_period(A)| -slow_change(A)| -environment(B)| -in_environment(A,B)|greater(sk2(B,A),critical_point(B)).
% 0.71/0.88 6 [] {+} -environment(A)| -greater_or_equal(B,start_time(A))| -greater_or_equal(end_time(A),B)|in_environment(A,B).
% 0.71/0.88 7 [] {+} -environment(A)| -in_environment(A,B)|greater_or_equal(end_time(A),B).
% 0.71/0.88 8 [] {+} -environment(A)|greater_or_equal(critical_point(A),start_time(A)).
% 0.71/0.88 9 [] {+} -greater(A,B)| -greater(B,C)|greater(A,C).
% 0.71/0.88 10 [] {+} -greater_or_equal(A,B)|greater(A,B)|A=B.
% 0.71/0.88 11 [] {+} -greater(A,B)|greater_or_equal(A,B).
% 0.71/0.88 12 [] {+} A!=B|greater_or_equal(A,B).
% 0.71/0.88 14 [] {+} -environment(A)| -in_environment(A,B)| -greater(B,critical_point(A))|selection_favors(efficient_producers,first_movers,B).
% 0.71/0.88 15 [] {+} -selection_favors(efficient_producers,first_movers,sk3).
% 0.71/0.88 16 [] {+} propagation_strategy(first_movers).
% 0.71/0.88 17 [] {+} propagation_strategy(efficient_producers).
% 0.71/0.88 18 [] {+} observational_period(sk3).
% 0.71/0.88 19 [] {-} slow_change(sk3).
% 0.71/0.88 20 [] {+} A=A.
% 0.71/0.88 23 [hyper,18,2,16,17,unit_del,15] {+} in_environment(sk3,sk1(sk3)).
% 0.71/0.88 24 [hyper,18,1,16,17,unit_del,15] {+} environment(sk1(sk3)).
% 0.71/0.88 27 [hyper,24,8] {+} greater_or_equal(critical_point(sk1(sk3)),start_time(sk1(sk3))).
% 0.71/0.88 30 [hyper,20,12] {+} greater_or_equal(A,A).
% 0.71/0.88 31 [hyper,23,5,18,19,24] {+} greater(sk2(sk1(sk3),sk3),critical_point(sk1(sk3))).
% 0.71/0.88 32 [hyper,23,4,18,19,24] {+} in_environment(sk1(sk3),sk2(sk1(sk3),sk3)).
% 0.71/0.88 36 [hyper,27,10,flip.2] {+} greater(critical_point(sk1(sk3)),start_time(sk1(sk3)))|start_time(sk1(sk3))=critical_point(sk1(sk3)).
% 0.71/0.88 43 [hyper,32,7,24] {+} greater_or_equal(end_time(sk1(sk3)),sk2(sk1(sk3),sk3)).
% 0.71/0.88 58 [hyper,31,14,24,32] {+} selection_favors(efficient_producers,first_movers,sk2(sk1(sk3),sk3)).
% 0.71/0.88 76 [hyper,43,10] {+} greater(end_time(sk1(sk3)),sk2(sk1(sk3),sk3))|end_time(sk1(sk3))=sk2(sk1(sk3),sk3).
% 0.71/0.88 119 [hyper,36,9,31] {+} start_time(sk1(sk3))=critical_point(sk1(sk3))|greater(sk2(sk1(sk3),sk3),start_time(sk1(sk3))).
% 0.71/0.88 640 [para_from,76.2.1,3.4.3,unit_del,18,16,17,58,15] {+} greater(end_time(sk1(sk3)),sk2(sk1(sk3),sk3)).
% 0.71/0.88 641 [hyper,640,9,119] {+} greater(end_time(sk1(sk3)),start_time(sk1(sk3)))|start_time(sk1(sk3))=critical_point(sk1(sk3)).
% 0.71/0.88 642 [hyper,640,9,31] {+} greater(end_time(sk1(sk3)),critical_point(sk1(sk3))).
% 0.71/0.88 650 [hyper,642,11] {+} greater_or_equal(end_time(sk1(sk3)),critical_point(sk1(sk3))).
% 0.71/0.88 776 [hyper,641,11] {+} start_time(sk1(sk3))=critical_point(sk1(sk3))|greater_or_equal(end_time(sk1(sk3)),start_time(sk1(sk3))).
% 0.71/0.88 908 [hyper,776,6,24,30] {+} start_time(sk1(sk3))=critical_point(sk1(sk3))|in_environment(sk1(sk3),end_time(sk1(sk3))).
% 0.71/0.88 958 [para_from,908.1.1,6.2.2,unit_del,24] {-} -greater_or_equal(A,critical_point(sk1(sk3)))| -greater_or_equal(end_time(sk1(sk3)),A)|in_environment(sk1(sk3),A)|in_environment(sk1(sk3),end_time(sk1(sk3))).
% 0.71/0.88 959 [factor,958.3.4,unit_del,650,30] {+} in_environment(sk1(sk3),end_time(sk1(sk3))).
% 0.71/0.88 960 [hyper,959,14,24,642] {+} selection_favors(efficient_producers,first_movers,end_time(sk1(sk3))).
% 0.71/0.88 972 [hyper,960,3,18,16,17] {-} selection_favors(efficient_producers,first_movers,sk3).
% 0.71/0.88 973 [binary,972.1,15.1] {-} $F.
% 0.71/0.88
% 0.71/0.88 % SZS output end Refutation
% 0.71/0.88 ------------ end of proof -------------
% 0.71/0.88
% 0.71/0.88
% 0.71/0.88 Search stopped by max_proofs option.
% 0.71/0.88
% 0.71/0.88
% 0.71/0.88 Search stopped by max_proofs option.
% 0.71/0.88
% 0.71/0.88 ============ end of search ============
% 0.71/0.88
% 0.71/0.88 ----------- soft-scott stats ----------
% 0.71/0.88
% 0.71/0.88 true clauses given 136 (95.8%)
% 0.71/0.88 false clauses given 6
% 0.71/0.88
% 0.71/0.88 FALSE TRUE
% 0.71/0.88 12 0 2
% 0.71/0.88 13 0 3
% 0.71/0.88 14 0 5
% 0.71/0.88 15 0 10
% 0.71/0.88 16 0 9
% 0.71/0.88 17 0 6
% 0.71/0.88 18 0 11
% 0.71/0.88 19 0 89
% 0.71/0.88 20 0 220
% 0.71/0.88 21 0 169
% 0.71/0.88 22 0 120
% 0.71/0.88 23 0 73
% 0.71/0.88 24 0 26
% 0.71/0.88 25 0 7
% 0.71/0.88 26 0 9
% 0.71/0.88 27 0 3
% 0.71/0.88 28 0 4
% 0.71/0.88 30 0 1
% 0.71/0.88 31 0 3
% 0.71/0.88 33 0 1
% 0.71/0.88 37 0 1
% 0.71/0.88 tot: 0 772 (100.0% true)
% 0.71/0.88
% 0.71/0.88
% 0.71/0.88 Model 6 [ 2 1 123 ] (0.00 seconds, 250000 Inserts)
% 0.71/0.88
% 0.71/0.88 That finishes the proof of the theorem.
% 0.71/0.88
% 0.71/0.88 Process 21903 finished Thu Jun 9 09:56:35 2022
%------------------------------------------------------------------------------