TSTP Solution File: MGT044-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : MGT044-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:00 EDT 2022
% Result : Unsatisfiable 1.43s 1.65s
% Output : Refutation 1.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : MGT044-1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n017.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 10:10: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 sandbox2 on n017.cluster.edu,
% 0.12/0.35 Thu Jun 9 10:10:34 2022
% 0.12/0.35 The command was "./sos". The process ID is 1686.
% 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 list(usable).
% 0.12/0.35
% 0.12/0.35 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 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 21 during input processing: 0 [copy,21,flip.1] {-} A=A.
% 0.12/0.35
% 0.12/0.35 ======= 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: 17
% 0.12/0.39 number of clauses initially in problem: 21
% 0.12/0.39 percentage of clauses intially in UL: 80
% 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: 13
% 0.12/0.39 distinct predicate count: 6
% 0.12/0.39 distinct function count: 4
% 0.12/0.39 distinct constant count: 3
% 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 ===========
% 1.43/1.65
% 1.43/1.65 -------- PROOF --------
% 1.43/1.65 % SZS status Unsatisfiable
% 1.43/1.65 % SZS output start Refutation
% 1.43/1.65
% 1.43/1.65 Model 3 (0.00 seconds, 0 Inserts)
% 1.43/1.65
% 1.43/1.65 Stopped by limit on number of solutions
% 1.43/1.65
% 1.43/1.65 -----> EMPTY CLAUSE at 1.27 sec ----> 4158 [hyper,2989,11,19,128,unit_del,16,17,17] {-} $F.
% 1.43/1.65
% 1.43/1.65 Length of proof is 6. Level of proof is 2.
% 1.43/1.65
% 1.43/1.65 ---------------- PROOF ----------------
% 1.43/1.65 % SZS status Unsatisfiable
% 1.43/1.65 % SZS output start Refutation
% 1.43/1.65
% 1.43/1.65 3 [] {+} A!=B|smaller_or_equal(A,B).
% 1.43/1.65 7 [] {+} -smaller(A,B)|greater(B,A).
% 1.43/1.65 9 [] {+} -greater(A,B)| -greater(B,A).
% 1.43/1.65 11 [] {+} -organization(A)| -greater(stock_of_knowledge(A,B),stock_of_knowledge(A,C))| -smaller_or_equal(internal_friction(A,B),internal_friction(A,C))|greater(capability(A,B),capability(A,C)).
% 1.43/1.65 14 [] {+} -organization(A)| -greater(age(A,B),age(A,C))|greater(stock_of_knowledge(A,B),stock_of_knowledge(A,C)).
% 1.43/1.65 15 [] {+} -organization(A)|internal_friction(A,B)=internal_friction(A,C).
% 1.43/1.65 16 [] {+} -greater(capability(sk1,sk3),capability(sk1,sk2)).
% 1.43/1.65 17 [factor,9.1.2] {+} -greater(A,A).
% 1.43/1.65 18 [] {+} smaller(A,B)|A=B|greater(A,B).
% 1.43/1.65 19 [] {+} organization(sk1).
% 1.43/1.65 20 [] {-} greater(age(sk1,sk3),age(sk1,sk2)).
% 1.43/1.65 22 [hyper,18,7] {+} A=B|greater(A,B)|greater(B,A).
% 1.43/1.65 50 [hyper,19,15] {+} internal_friction(sk1,A)=internal_friction(sk1,B).
% 1.43/1.65 54 [hyper,20,14,19] {-} greater(stock_of_knowledge(sk1,sk3),stock_of_knowledge(sk1,sk2)).
% 1.43/1.65 128 [para_from,22.1.1,54.1.1.1] {-} greater(stock_of_knowledge(A,sk3),stock_of_knowledge(sk1,sk2))|greater(sk1,A)|greater(A,sk1).
% 1.43/1.65 2989 [hyper,50,3] {+} smaller_or_equal(internal_friction(sk1,A),internal_friction(sk1,B)).
% 1.43/1.65 4158 [hyper,2989,11,19,128,unit_del,16,17,17] {-} $F.
% 1.43/1.65
% 1.43/1.65 % SZS output end Refutation
% 1.43/1.65 ------------ end of proof -------------
% 1.43/1.65
% 1.43/1.65
% 1.43/1.65 Search stopped by max_proofs option.
% 1.43/1.65
% 1.43/1.65
% 1.43/1.65 Search stopped by max_proofs option.
% 1.43/1.65
% 1.43/1.65 ============ end of search ============
% 1.43/1.65
% 1.43/1.65 ----------- soft-scott stats ----------
% 1.43/1.65
% 1.43/1.65 true clauses given 41 (39.0%)
% 1.43/1.65 false clauses given 64
% 1.43/1.65
% 1.43/1.65 FALSE TRUE
% 1.43/1.65 8 0 5
% 1.43/1.65 9 0 3
% 1.43/1.65 12 0 228
% 1.43/1.65 13 30 156
% 1.43/1.65 14 2 3
% 1.43/1.65 15 32 81
% 1.43/1.65 16 0 36
% 1.43/1.65 17 6 13
% 1.43/1.65 18 0 2
% 1.43/1.65 19 852 470
% 1.43/1.65 20 0 20
% 1.43/1.65 21 466 248
% 1.43/1.65 22 0 15
% 1.43/1.65 23 24 126
% 1.43/1.65 24 31 92
% 1.43/1.65 25 48 90
% 1.43/1.65 27 10 12
% 1.43/1.65 28 36 94
% 1.43/1.65 29 0 8
% 1.43/1.65 30 0 13
% 1.43/1.65 31 16 74
% 1.43/1.65 32 10 63
% 1.43/1.65 33 0 4
% 1.43/1.65 34 0 9
% 1.43/1.65 35 0 4
% 1.43/1.65 37 0 30
% 1.43/1.65 38 0 1
% 1.43/1.65 39 0 258
% 1.43/1.65 40 0 10
% 1.43/1.65 41 0 4
% 1.43/1.65 43 0 1
% 1.43/1.65 44 0 92
% 1.43/1.65 45 0 35
% 1.43/1.65 46 0 2
% 1.43/1.65 53 0 1
% 1.43/1.65 tot: 1563 2303 (59.6% true)
% 1.43/1.65
% 1.43/1.65
% 1.43/1.65 Model 3 (0.00 seconds, 0 Inserts)
% 1.43/1.65
% 1.43/1.65 That finishes the proof of the theorem.
% 1.43/1.65
% 1.43/1.65 Process 1686 finished Thu Jun 9 10:10:35 2022
%------------------------------------------------------------------------------