TSTP Solution File: MGT011-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : MGT011-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n027.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:47 EDT 2022
% Result : Unsatisfiable 0.99s 1.22s
% Output : Refutation 0.99s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : MGT011-1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13 % Command : sos-script %s
% 0.14/0.34 % Computer : n027.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Thu Jun 9 10:26:57 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.36 ----- Otter 3.2, August 2001 -----
% 0.14/0.36 The process was started by sandbox2 on n027.cluster.edu,
% 0.14/0.36 Thu Jun 9 10:26:57 2022
% 0.14/0.36 The command was "./sos". The process ID is 20614.
% 0.14/0.36
% 0.14/0.36 set(prolog_style_variables).
% 0.14/0.36 set(auto).
% 0.14/0.36 dependent: set(auto1).
% 0.14/0.36 dependent: set(process_input).
% 0.14/0.36 dependent: clear(print_kept).
% 0.14/0.36 dependent: clear(print_new_demod).
% 0.14/0.36 dependent: clear(print_back_demod).
% 0.14/0.36 dependent: clear(print_back_sub).
% 0.14/0.36 dependent: set(control_memory).
% 0.14/0.36 dependent: assign(max_mem, 12000).
% 0.14/0.36 dependent: assign(pick_given_ratio, 4).
% 0.14/0.36 dependent: assign(stats_level, 1).
% 0.14/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.36 dependent: assign(sos_limit, 5000).
% 0.14/0.36 dependent: assign(max_weight, 60).
% 0.14/0.36 clear(print_given).
% 0.14/0.36
% 0.14/0.36 list(usable).
% 0.14/0.36
% 0.14/0.36 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=10.
% 0.14/0.36
% 0.14/0.36 This is a Horn set with equality. The strategy will be
% 0.14/0.36 Knuth-Bendix and hyper_res, with positive clauses in
% 0.14/0.36 sos and nonpositive clauses in usable.
% 0.14/0.36
% 0.14/0.36 dependent: set(knuth_bendix).
% 0.14/0.36 dependent: set(para_from).
% 0.14/0.36 dependent: set(para_into).
% 0.14/0.36 dependent: clear(para_from_right).
% 0.14/0.36 dependent: clear(para_into_right).
% 0.14/0.36 dependent: set(para_from_vars).
% 0.14/0.36 dependent: set(eq_units_both_ways).
% 0.14/0.36 dependent: set(dynamic_demod_all).
% 0.14/0.36 dependent: set(dynamic_demod).
% 0.14/0.36 dependent: set(order_eq).
% 0.14/0.36 dependent: set(back_demod).
% 0.14/0.36 dependent: set(lrpo).
% 0.14/0.36 dependent: set(hyper_res).
% 0.14/0.36 dependent: clear(order_hyper).
% 0.14/0.36
% 0.14/0.36 ------------> process usable:
% 0.14/0.36
% 0.14/0.36 ------------> process sos:
% 0.14/0.36 Following clause subsumed by 15 during input processing: 0 [copy,15,flip.1] {-} A=A.
% 0.14/0.36
% 0.14/0.36 ======= 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 ===========
% 0.99/1.22
% 0.99/1.22 -------- PROOF --------
% 0.99/1.22 % SZS status Unsatisfiable
% 0.99/1.22 % SZS output start Refutation
% 0.99/1.22
% 0.99/1.22 Model 2 (0.00 seconds, 0 Inserts)
% 0.99/1.22
% 0.99/1.22 Stopped by limit on number of solutions
% 0.99/1.22
% 0.99/1.22 Model 3 (0.00 seconds, 0 Inserts)
% 0.99/1.22
% 0.99/1.22 Stopped by limit on number of solutions
% 0.99/1.22
% 0.99/1.22 Model 4 (0.00 seconds, 0 Inserts)
% 0.99/1.22
% 0.99/1.22 Stopped by limit on number of solutions
% 0.99/1.22
% 0.99/1.22 Stopped by limit on insertions
% 0.99/1.22
% 0.99/1.22 Model 5 [ 1 11 1635 ] (0.00 seconds, 250000 Inserts)
% 0.99/1.22
% 0.99/1.22 Stopped by limit on insertions
% 0.99/1.22
% 0.99/1.22 Model 6 [ 1 4 852 ] (0.00 seconds, 250000 Inserts)
% 0.99/1.22
% 0.99/1.22 Stopped by limit on insertions
% 0.99/1.22
% 0.99/1.22 Model 7 [ 1 11 1575 ] (0.00 seconds, 250000 Inserts)
% 0.99/1.22
% 0.99/1.22 Stopped by limit on insertions
% 0.99/1.22
% 0.99/1.22 Model 8 [ 2 2 267 ] (0.00 seconds, 250000 Inserts)
% 0.99/1.22
% 0.99/1.22 -----> EMPTY CLAUSE at 0.73 sec ----> 99 [hyper,91,3,58] {-} $F.
% 0.99/1.22
% 0.99/1.22 Length of proof is 8. Level of proof is 4.
% 0.99/1.22
% 0.99/1.22 ---------------- PROOF ----------------
% 0.99/1.22 % SZS status Unsatisfiable
% 0.99/1.22 % SZS output start Refutation
% 0.99/1.22
% 0.99/1.22 1 [] {+} -organization(A,B)|inertia(A,sk1(B,A),B).
% 0.99/1.22 3 [] {+} -greater(A,B)| -greater(B,A).
% 0.99/1.22 4 [] {+} -organization(A,B)|class(A,sk2(B,A),B).
% 0.99/1.22 5 [] {+} -organization(A,B)| -organization(A,C)| -reorganization_free(A,B,C)| -class(A,D,B)| -class(A,E,C)|D=E.
% 0.99/1.22 6 [] {+} -organization(A,B)| -organization(C,D)| -class(A,E,B)| -class(C,E,D)| -size(A,F,B)| -size(C,G,D)| -inertia(A,H,B)| -inertia(C,I,D)| -greater(G,F)|greater(I,H).
% 0.99/1.22 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).
% 0.99/1.22 8 [] {+} organization(sk3,sk6).
% 0.99/1.22 9 [] {+} organization(sk3,sk7).
% 0.99/1.22 10 [] {+} reorganization_free(sk3,sk6,sk7).
% 0.99/1.22 11 [] {+} size(sk3,sk4,sk6).
% 0.99/1.22 12 [] {+} size(sk3,sk5,sk7).
% 0.99/1.22 13 [] {+} greater(sk7,sk6).
% 0.99/1.22 14 [] {+} greater(sk4,sk5).
% 0.99/1.22 16 [hyper,8,4] {+} class(sk3,sk2(sk6,sk3),sk6).
% 0.99/1.22 17 [hyper,8,1] {+} inertia(sk3,sk1(sk6,sk3),sk6).
% 0.99/1.22 24 [hyper,9,4] {+} class(sk3,sk2(sk7,sk3),sk7).
% 0.99/1.22 25 [hyper,9,1] {+} inertia(sk3,sk1(sk7,sk3),sk7).
% 0.99/1.22 51,50 [hyper,24,5,8,9,10,16,flip.1] {+} sk2(sk7,sk3)=sk2(sk6,sk3).
% 0.99/1.22 52 [back_demod,24,demod,51] {+} class(sk3,sk2(sk6,sk3),sk7).
% 0.99/1.22 58 [hyper,25,7,8,9,10,17,13] {-} greater(sk1(sk7,sk3),sk1(sk6,sk3)).
% 0.99/1.22 91 [hyper,52,6,9,8,16,12,11,25,17,14] {-} greater(sk1(sk6,sk3),sk1(sk7,sk3)).
% 0.99/1.22 99 [hyper,91,3,58] {-} $F.
% 0.99/1.22
% 0.99/1.22 % SZS output end Refutation
% 0.99/1.22 ------------ end of proof -------------
% 0.99/1.22
% 0.99/1.22
% 0.99/1.22 Search stopped by max_proofs option.
% 0.99/1.22
% 0.99/1.22
% 0.99/1.22 Search stopped by max_proofs option.
% 0.99/1.22
% 0.99/1.22 ============ end of search ============
% 0.99/1.22
% 0.99/1.22 ----------- soft-scott stats ----------
% 0.99/1.22
% 0.99/1.22 true clauses given 9 (33.3%)
% 0.99/1.22 false clauses given 18
% 0.99/1.22
% 0.99/1.22 FALSE TRUE
% 0.99/1.22 7 0 1
% 0.99/1.22 21 0 1
% 0.99/1.22 22 0 9
% 0.99/1.22 24 0 20
% 0.99/1.22 25 1 0
% 0.99/1.22 39 6 5
% 0.99/1.22 43 20 0
% 0.99/1.22 tot: 27 36 (57.1% true)
% 0.99/1.22
% 0.99/1.22
% 0.99/1.22 Model 8 [ 2 2 267 ] (0.00 seconds, 250000 Inserts)
% 0.99/1.22
% 0.99/1.22 That finishes the proof of the theorem.
% 0.99/1.22
% 0.99/1.22 Process 20614 finished Thu Jun 9 10:26:58 2022
%------------------------------------------------------------------------------