TSTP Solution File: MGT048-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : MGT048-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n019.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:01 EDT 2022
% Result : Unsatisfiable 1.35s 1.51s
% Output : Refutation 1.35s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : MGT048-1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n019.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 10:41:10 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.37 ----- Otter 3.2, August 2001 -----
% 0.13/0.37 The process was started by sandbox2 on n019.cluster.edu,
% 0.13/0.37 Thu Jun 9 10:41:10 2022
% 0.13/0.37 The command was "./sos". The process ID is 9157.
% 0.13/0.37
% 0.13/0.37 set(prolog_style_variables).
% 0.13/0.37 set(auto).
% 0.13/0.37 dependent: set(auto1).
% 0.13/0.37 dependent: set(process_input).
% 0.13/0.37 dependent: clear(print_kept).
% 0.13/0.37 dependent: clear(print_new_demod).
% 0.13/0.37 dependent: clear(print_back_demod).
% 0.13/0.37 dependent: clear(print_back_sub).
% 0.13/0.37 dependent: set(control_memory).
% 0.13/0.37 dependent: assign(max_mem, 12000).
% 0.13/0.37 dependent: assign(pick_given_ratio, 4).
% 0.13/0.37 dependent: assign(stats_level, 1).
% 0.13/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.37 dependent: assign(sos_limit, 5000).
% 0.13/0.37 dependent: assign(max_weight, 60).
% 0.13/0.37 clear(print_given).
% 0.13/0.37
% 0.13/0.37 list(usable).
% 0.13/0.37
% 0.13/0.37 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 0.13/0.37
% 0.13/0.37 This ia a non-Horn set with equality. The strategy will be
% 0.13/0.37 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.37 unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.37 clauses in usable.
% 0.13/0.37
% 0.13/0.37 dependent: set(knuth_bendix).
% 0.13/0.37 dependent: set(para_from).
% 0.13/0.37 dependent: set(para_into).
% 0.13/0.37 dependent: clear(para_from_right).
% 0.13/0.37 dependent: clear(para_into_right).
% 0.13/0.37 dependent: set(para_from_vars).
% 0.13/0.37 dependent: set(eq_units_both_ways).
% 0.13/0.37 dependent: set(dynamic_demod_all).
% 0.13/0.37 dependent: set(dynamic_demod).
% 0.13/0.37 dependent: set(order_eq).
% 0.13/0.37 dependent: set(back_demod).
% 0.13/0.37 dependent: set(lrpo).
% 0.13/0.37 dependent: set(hyper_res).
% 0.13/0.37 dependent: set(unit_deletion).
% 0.13/0.37 dependent: set(factor).
% 0.13/0.37
% 0.13/0.37 ------------> process usable:
% 0.13/0.37
% 0.13/0.37 ------------> process sos:
% 0.13/0.37 Following clause subsumed by 21 during input processing: 0 [copy,21,flip.1] {-} A=A.
% 0.13/0.37
% 0.13/0.37 ======= end of input processing =======
% 0.13/0.40
% 0.13/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.40
% 0.13/0.40 Stopped by limit on number of solutions
% 0.13/0.40
% 0.13/0.40
% 0.13/0.40 -------------- Softie stats --------------
% 0.13/0.40
% 0.13/0.40 UPDATE_STOP: 300
% 0.13/0.40 SFINDER_TIME_LIMIT: 2
% 0.13/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.40 number of clauses in intial UL: 17
% 0.13/0.40 number of clauses initially in problem: 21
% 0.13/0.40 percentage of clauses intially in UL: 80
% 0.13/0.40 percentage of distinct symbols occuring in initial UL: 100
% 0.13/0.40 percent of all initial clauses that are short: 100
% 0.13/0.40 absolute distinct symbol count: 13
% 0.13/0.40 distinct predicate count: 6
% 0.13/0.40 distinct function count: 4
% 0.13/0.40 distinct constant count: 3
% 0.13/0.40
% 0.13/0.40 ---------- no more Softie stats ----------
% 0.13/0.40
% 0.13/0.40
% 0.13/0.40
% 0.13/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.13/0.40
% 0.13/0.40 Stopped by limit on number of solutions
% 0.13/0.40
% 0.13/0.40 =========== start of search ===========
% 1.35/1.51
% 1.35/1.51 -------- PROOF --------
% 1.35/1.51 % SZS status Unsatisfiable
% 1.35/1.51 % SZS output start Refutation
% 1.35/1.51
% 1.35/1.51 Model 3 (0.00 seconds, 0 Inserts)
% 1.35/1.51
% 1.35/1.51 Stopped by limit on number of solutions
% 1.35/1.51
% 1.35/1.51 Model 4 (0.00 seconds, 0 Inserts)
% 1.35/1.51
% 1.35/1.51 Stopped by limit on number of solutions
% 1.35/1.51
% 1.35/1.51 ----> UNIT CONFLICT at 1.12 sec ----> 3872 [binary,3871.1,16.1] {-} $F.
% 1.35/1.51
% 1.35/1.51 Length of proof is 4. Level of proof is 3.
% 1.35/1.51
% 1.35/1.51 ---------------- PROOF ----------------
% 1.35/1.51 % SZS status Unsatisfiable
% 1.35/1.51 % SZS output start Refutation
% 1.35/1.51
% 1.35/1.51 3 [] {+} A!=B|smaller_or_equal(A,B).
% 1.35/1.51 12 [] {+} -organization(A)| -smaller_or_equal(stock_of_knowledge(A,B),stock_of_knowledge(A,C))| -greater(internal_friction(A,B),internal_friction(A,C))|smaller(capability(A,B),capability(A,C)).
% 1.35/1.51 14 [] {+} -organization(A)|stock_of_knowledge(A,B)=stock_of_knowledge(A,C).
% 1.35/1.51 15 [] {+} -organization(A)| -greater(age(A,B),age(A,C))|greater(internal_friction(A,B),internal_friction(A,C)).
% 1.35/1.51 16 [] {+} -smaller(capability(sk1,sk3),capability(sk1,sk2)).
% 1.35/1.51 19 [] {+} organization(sk1).
% 1.35/1.51 20 [] {-} greater(age(sk1,sk3),age(sk1,sk2)).
% 1.35/1.51 51 [hyper,19,14] {+} stock_of_knowledge(sk1,A)=stock_of_knowledge(sk1,B).
% 1.35/1.51 55 [hyper,20,15,19] {-} greater(internal_friction(sk1,sk3),internal_friction(sk1,sk2)).
% 1.35/1.51 2444 [hyper,51,3] {+} smaller_or_equal(stock_of_knowledge(sk1,A),stock_of_knowledge(sk1,B)).
% 1.35/1.51 3871 [hyper,2444,12,19,55] {-} smaller(capability(sk1,sk3),capability(sk1,sk2)).
% 1.35/1.51 3872 [binary,3871.1,16.1] {-} $F.
% 1.35/1.51
% 1.35/1.51 % SZS output end Refutation
% 1.35/1.51 ------------ end of proof -------------
% 1.35/1.51
% 1.35/1.51
% 1.35/1.51 Search stopped by max_proofs option.
% 1.35/1.51
% 1.35/1.51
% 1.35/1.51 Search stopped by max_proofs option.
% 1.35/1.51
% 1.35/1.51 ============ end of search ============
% 1.35/1.51
% 1.35/1.51 ----------- soft-scott stats ----------
% 1.35/1.51
% 1.35/1.52 true clauses given 40 (38.1%)
% 1.35/1.52 false clauses given 65
% 1.35/1.52
% 1.35/1.52 FALSE TRUE
% 1.35/1.52 8 0 5
% 1.35/1.52 9 0 3
% 1.35/1.52 12 0 228
% 1.35/1.52 13 32 143
% 1.35/1.52 14 1 5
% 1.35/1.52 15 32 81
% 1.35/1.52 16 1 25
% 1.35/1.52 17 5 10
% 1.35/1.52 18 0 2
% 1.35/1.52 19 863 435
% 1.35/1.52 20 0 45
% 1.35/1.52 21 466 240
% 1.35/1.52 22 6 44
% 1.35/1.52 23 21 45
% 1.35/1.52 24 40 83
% 1.35/1.52 25 26 34
% 1.35/1.52 26 0 11
% 1.35/1.52 27 5 17
% 1.35/1.52 28 45 71
% 1.35/1.52 29 0 16
% 1.35/1.52 30 0 8
% 1.35/1.52 31 10 57
% 1.35/1.52 32 5 98
% 1.35/1.52 33 0 4
% 1.35/1.52 34 0 6
% 1.35/1.52 36 0 7
% 1.35/1.52 37 0 41
% 1.35/1.52 39 0 173
% 1.35/1.52 40 0 13
% 1.35/1.52 44 0 50
% 1.35/1.52 45 0 14
% 1.35/1.52 tot: 1558 2014 (56.4% true)
% 1.35/1.52
% 1.35/1.52
% 1.35/1.52 Model 4 (0.00 seconds, 0 Inserts)
% 1.35/1.52
% 1.35/1.52 That finishes the proof of the theorem.
% 1.35/1.52
% 1.35/1.52 Process 9157 finished Thu Jun 9 10:41:11 2022
%------------------------------------------------------------------------------