%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : MGT012-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n021.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:48 EDT 2022
% Result : Unsatisfiable 1.07s 1.26s
% Output : Refutation 1.07s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : MGT012-1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : sos-script %s
% 0.13/0.35 % Computer : n021.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Thu Jun 9 08:48:23 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 n021.cluster.edu,
% 0.13/0.37 Thu Jun 9 08:48:23 2022
% 0.13/0.37 The command was "./sos". The process ID is 26084.
% 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=1, equality=1, symmetry=0, max_lits=10.
% 0.13/0.37
% 0.13/0.37 This is a Horn set with equality. The strategy will be
% 0.13/0.37 Knuth-Bendix and hyper_res, with positive clauses in
% 0.13/0.37 sos and nonpositive 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: clear(order_hyper).
% 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 15 during input processing: 0 [copy,15,flip.1] {-} A=A.
% 0.13/0.37
% 0.13/0.37 ======= end of input processing =======
% 0.20/0.46
% 0.20/0.46 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.46
% 0.20/0.46 Stopped by limit on number of solutions
% 0.20/0.46
% 0.20/0.46
% 0.20/0.46 -------------- Softie stats --------------
% 0.20/0.46
% 0.20/0.46 UPDATE_STOP: 300
% 0.20/0.46 SFINDER_TIME_LIMIT: 2
% 0.20/0.46 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.46 number of clauses in intial UL: 7
% 0.20/0.46 number of clauses initially in problem: 15
% 0.20/0.46 percentage of clauses intially in UL: 46
% 0.20/0.46 percentage of distinct symbols occuring in initial UL: 64
% 0.20/0.46 percent of all initial clauses that are short: 100
% 0.20/0.46 absolute distinct symbol count: 14
% 0.20/0.46 distinct predicate count: 7
% 0.20/0.46 distinct function count: 2
% 0.20/0.46 distinct constant count: 5
% 0.20/0.46
% 0.20/0.46 ---------- no more Softie stats ----------
% 0.20/0.46
% 0.20/0.46
% 0.20/0.46
% 0.20/0.46 =========== start of search ===========
% 1.07/1.26
% 1.07/1.26 -------- PROOF --------
% 1.07/1.26 % SZS status Unsatisfiable
% 1.07/1.26 % SZS output start Refutation
% 1.07/1.26
% 1.07/1.26 Model 2 (0.00 seconds, 0 Inserts)
% 1.07/1.26
% 1.07/1.26 Stopped by limit on number of solutions
% 1.07/1.26
% 1.07/1.26 Model 3 (0.00 seconds, 0 Inserts)
% 1.07/1.26
% 1.07/1.26 Stopped by limit on number of solutions
% 1.07/1.26
% 1.07/1.26 Model 4 (0.00 seconds, 0 Inserts)
% 1.07/1.26
% 1.07/1.26 Stopped by limit on number of solutions
% 1.07/1.26
% 1.07/1.26 Stopped by limit on insertions
% 1.07/1.26
% 1.07/1.26 Model 5 [ 1 11 1635 ] (0.00 seconds, 250000 Inserts)
% 1.07/1.26
% 1.07/1.26 Stopped by limit on insertions
% 1.07/1.26
% 1.07/1.26 Model 6 [ 1 5 852 ] (0.00 seconds, 250000 Inserts)
% 1.07/1.26
% 1.07/1.26 Stopped by limit on insertions
% 1.07/1.26
% 1.07/1.26 Model 7 [ 1 12 1575 ] (0.00 seconds, 250000 Inserts)
% 1.07/1.26
% 1.07/1.26 Stopped by limit on insertions
% 1.07/1.26
% 1.07/1.26 Model 8 [ 2 2 267 ] (0.00 seconds, 250000 Inserts)
% 1.07/1.26
% 1.07/1.26 -----> EMPTY CLAUSE at 0.76 sec ----> 99 [hyper,91,3,58] {-} $F.
% 1.07/1.26
% 1.07/1.26 Length of proof is 8. Level of proof is 4.
% 1.07/1.26
% 1.07/1.26 ---------------- PROOF ----------------
% 1.07/1.26 % SZS status Unsatisfiable
% 1.07/1.26 % SZS output start Refutation
% 1.07/1.26
% 1.07/1.26 1 [] {+} -organization(A,B)|inertia(A,sk1(B,A),B).
% 1.07/1.26 3 [] {+} -greater(A,B)| -greater(B,A).
% 1.07/1.26 4 [] {+} -organization(A,B)|class(A,sk2(B,A),B).
% 1.07/1.26 5 [] {+} -organization(A,B)| -organization(A,C)| -reorganization_free(A,B,C)| -class(A,D,B)| -class(A,E,C)|D=E.
% 1.07/1.26 6 [] {+} -organization(A,B)| -organization(C,D)| -class(A,E,B)| -class(C,E,D)| -complexity(A,F,B)| -complexity(C,G,D)| -inertia(A,H,B)| -inertia(C,I,D)| -greater(G,F)|greater(I,H).
% 1.07/1.26 7 [] {+} -organization(A,B)| -organization(A,C)| -reorganization_free(A,B,C)| -inertia(A,D,B)| -inertia(A,E,C)| -greater(C,B)|greater(E,D).
% 1.07/1.26 8 [] {+} organization(sk3,sk6).
% 1.07/1.26 9 [] {+} organization(sk3,sk7).
% 1.07/1.26 10 [] {+} reorganization_free(sk3,sk6,sk7).
% 1.07/1.26 11 [] {+} complexity(sk3,sk4,sk6).
% 1.07/1.26 12 [] {+} complexity(sk3,sk5,sk7).
% 1.07/1.26 13 [] {+} greater(sk7,sk6).
% 1.07/1.26 14 [] {+} greater(sk4,sk5).
% 1.07/1.26 16 [hyper,8,4] {+} class(sk3,sk2(sk6,sk3),sk6).
% 1.07/1.26 17 [hyper,8,1] {+} inertia(sk3,sk1(sk6,sk3),sk6).
% 1.07/1.26 24 [hyper,9,4] {+} class(sk3,sk2(sk7,sk3),sk7).
% 1.07/1.26 25 [hyper,9,1] {+} inertia(sk3,sk1(sk7,sk3),sk7).
% 1.07/1.26 51,50 [hyper,24,5,8,9,10,16,flip.1] {+} sk2(sk7,sk3)=sk2(sk6,sk3).
% 1.07/1.26 52 [back_demod,24,demod,51] {+} class(sk3,sk2(sk6,sk3),sk7).
% 1.07/1.26 58 [hyper,25,7,8,9,10,17,13] {-} greater(sk1(sk7,sk3),sk1(sk6,sk3)).
% 1.07/1.26 91 [hyper,52,6,9,8,16,12,11,25,17,14] {-} greater(sk1(sk6,sk3),sk1(sk7,sk3)).
% 1.07/1.26 99 [hyper,91,3,58] {-} $F.
% 1.07/1.26
% 1.07/1.26 % SZS output end Refutation
% 1.07/1.26 ------------ end of proof -------------
% 1.07/1.26
% 1.07/1.26
% 1.07/1.26 Search stopped by max_proofs option.
% 1.07/1.26
% 1.07/1.26
% 1.07/1.26 Search stopped by max_proofs option.
% 1.07/1.26
% 1.07/1.26 ============ end of search ============
% 1.07/1.26
% 1.07/1.26 ----------- soft-scott stats ----------
% 1.07/1.26
% 1.07/1.26 true clauses given 9 (33.3%)
% 1.07/1.26 false clauses given 18
% 1.07/1.26
% 1.07/1.26 FALSE TRUE
% 1.07/1.26 7 0 1
% 1.07/1.26 21 0 1
% 1.07/1.26 22 0 9
% 1.07/1.26 24 0 20
% 1.07/1.26 25 1 0
% 1.07/1.26 39 6 5
% 1.07/1.26 43 20 0
% 1.07/1.26 tot: 27 36 (57.1% true)
% 1.07/1.26
% 1.07/1.26
% 1.07/1.26 Model 8 [ 2 2 267 ] (0.00 seconds, 250000 Inserts)
% 1.07/1.26
% 1.07/1.26 That finishes the proof of the theorem.
% 1.07/1.26
% 1.07/1.26 Process 26084 finished Thu Jun 9 08:48:24 2022
%------------------------------------------------------------------------------