TSTP Solution File: MGT009-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : MGT009-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 1.29s 1.48s
% Output : Refutation 1.29s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : MGT009-1 : TPTP v8.1.0. Released v2.4.0.
% 0.13/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n027.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.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Thu Jun 9 12:42:12 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.36 ----- Otter 3.2, August 2001 -----
% 0.20/0.36 The process was started by sandbox on n027.cluster.edu,
% 0.20/0.36 Thu Jun 9 12:42:12 2022
% 0.20/0.36 The command was "./sos". The process ID is 6534.
% 0.20/0.36
% 0.20/0.36 set(prolog_style_variables).
% 0.20/0.36 set(auto).
% 0.20/0.36 dependent: set(auto1).
% 0.20/0.36 dependent: set(process_input).
% 0.20/0.36 dependent: clear(print_kept).
% 0.20/0.36 dependent: clear(print_new_demod).
% 0.20/0.36 dependent: clear(print_back_demod).
% 0.20/0.36 dependent: clear(print_back_sub).
% 0.20/0.36 dependent: set(control_memory).
% 0.20/0.36 dependent: assign(max_mem, 12000).
% 0.20/0.36 dependent: assign(pick_given_ratio, 4).
% 0.20/0.36 dependent: assign(stats_level, 1).
% 0.20/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.20/0.36 dependent: assign(sos_limit, 5000).
% 0.20/0.36 dependent: assign(max_weight, 60).
% 0.20/0.36 clear(print_given).
% 0.20/0.36
% 0.20/0.36 list(usable).
% 0.20/0.36
% 0.20/0.36 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=10.
% 0.20/0.36
% 0.20/0.36 This is a Horn set without equality. The strategy will
% 0.20/0.36 be hyperresolution, with satellites in sos and nuclei
% 0.20/0.36 in usable.
% 0.20/0.36
% 0.20/0.36 dependent: set(hyper_res).
% 0.20/0.36 dependent: clear(order_hyper).
% 0.20/0.36
% 0.20/0.36 ------------> process usable:
% 0.20/0.36
% 0.20/0.36 ------------> process sos:
% 0.20/0.36
% 0.20/0.36 ======= end of input processing =======
% 0.20/0.48
% 0.20/0.48 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.48
% 0.20/0.48 Stopped by limit on number of solutions
% 0.20/0.48
% 0.20/0.48
% 0.20/0.48 -------------- Softie stats --------------
% 0.20/0.48
% 0.20/0.48 UPDATE_STOP: 300
% 0.20/0.48 SFINDER_TIME_LIMIT: 2
% 0.20/0.48 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.48 number of clauses in intial UL: 5
% 0.20/0.48 number of clauses initially in problem: 16
% 0.20/0.48 percentage of clauses intially in UL: 31
% 0.20/0.48 percentage of distinct symbols occuring in initial UL: 58
% 0.20/0.48 percent of all initial clauses that are short: 100
% 0.20/0.48 absolute distinct symbol count: 17
% 0.20/0.48 distinct predicate count: 7
% 0.20/0.48 distinct function count: 1
% 0.20/0.48 distinct constant count: 9
% 0.20/0.48
% 0.20/0.48 ---------- no more Softie stats ----------
% 0.20/0.48
% 0.20/0.48
% 0.20/0.48
% 0.20/0.48 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.48
% 0.20/0.48 Stopped by limit on number of solutions
% 0.20/0.48
% 0.20/0.48 =========== start of search ===========
% 1.29/1.48
% 1.29/1.48 -------- PROOF --------
% 1.29/1.48 % SZS status Unsatisfiable
% 1.29/1.48 % SZS output start Refutation
% 1.29/1.48
% 1.29/1.48 Stopped by limit on insertions
% 1.29/1.48
% 1.29/1.48 Stopped by limit on insertions
% 1.29/1.48
% 1.29/1.48 Model 3 [ 1 1 1303 ] (0.00 seconds, 250000 Inserts)
% 1.29/1.48
% 1.29/1.48 Stopped by limit on insertions
% 1.29/1.48
% 1.29/1.48 Model 4 [ 1 1 1090 ] (0.00 seconds, 250000 Inserts)
% 1.29/1.48
% 1.29/1.48 Model 5 (0.00 seconds, 250000 Inserts)
% 1.29/1.48
% 1.29/1.48 Stopped by limit on number of solutions
% 1.29/1.48
% 1.29/1.48 Model 6 (0.00 seconds, 250000 Inserts)
% 1.29/1.48
% 1.29/1.48 Stopped by limit on number of solutions
% 1.29/1.48
% 1.29/1.48 Model 7 (0.00 seconds, 250000 Inserts)
% 1.29/1.48
% 1.29/1.48 Stopped by limit on number of solutions
% 1.29/1.48
% 1.29/1.48 Stopped by limit on insertions
% 1.29/1.48
% 1.29/1.48 Model 8 [ 1 2 402 ] (0.00 seconds, 250000 Inserts)
% 1.29/1.48
% 1.29/1.48 Stopped by limit on insertions
% 1.29/1.48
% 1.29/1.48 Model 9 [ 1 10 1571 ] (0.00 seconds, 250000 Inserts)
% 1.29/1.48
% 1.29/1.48 ----> UNIT CONFLICT at 0.96 sec ----> 21 [binary,20.1,5.1] {+} $F.
% 1.29/1.48
% 1.29/1.48 Length of proof is 4. Level of proof is 3.
% 1.29/1.48
% 1.29/1.48 ---------------- PROOF ----------------
% 1.29/1.48 % SZS status Unsatisfiable
% 1.29/1.48 % SZS output start Refutation
% 1.29/1.48
% 1.29/1.48 1 [] {+} -organization(A,B)|inertia(A,sk1(B,A),B).
% 1.29/1.48 3 [] {+} -organization(A,B)| -organization(C,D)| -reorganization_free(A,B,B)| -reorganization_free(C,D,D)| -reproducibility(A,E,B)| -reproducibility(C,F,D)| -inertia(A,G,B)| -inertia(C,H,D)| -greater(H,G)|greater(F,E).
% 1.29/1.48 4 [] {+} -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).
% 1.29/1.48 5 [] {+} -greater(sk6,sk5).
% 1.29/1.48 6 [] {+} organization(sk2,sk9).
% 1.29/1.48 7 [] {+} organization(sk3,sk10).
% 1.29/1.48 8 [] {+} reorganization_free(sk2,sk9,sk9).
% 1.29/1.48 9 [] {+} reorganization_free(sk3,sk10,sk10).
% 1.29/1.48 10 [] {+} class(sk2,sk4,sk9).
% 1.29/1.48 11 [] {+} class(sk3,sk4,sk10).
% 1.29/1.48 12 [] {+} reproducibility(sk2,sk5,sk9).
% 1.29/1.48 13 [] {+} reproducibility(sk3,sk6,sk10).
% 1.29/1.48 14 [] {+} size(sk2,sk7,sk9).
% 1.29/1.48 15 [] {+} size(sk3,sk8,sk10).
% 1.29/1.48 16 [] {-} greater(sk8,sk7).
% 1.29/1.48 17 [hyper,6,1] {+} inertia(sk2,sk1(sk9,sk2),sk9).
% 1.29/1.48 18 [hyper,7,1] {+} inertia(sk3,sk1(sk10,sk3),sk10).
% 1.29/1.48 19 [hyper,18,4,6,7,10,11,14,15,17,16] {-} greater(sk1(sk10,sk3),sk1(sk9,sk2)).
% 1.29/1.48 20 [hyper,19,3,6,7,8,9,12,13,17,18] {-} greater(sk6,sk5).
% 1.29/1.48 21 [binary,20.1,5.1] {+} $F.
% 1.29/1.48
% 1.29/1.48 % SZS output end Refutation
% 1.29/1.48 ------------ end of proof -------------
% 1.29/1.48
% 1.29/1.48
% 1.29/1.48 Search stopped by max_proofs option.
% 1.29/1.48
% 1.29/1.48
% 1.29/1.48 Search stopped by max_proofs option.
% 1.29/1.48
% 1.29/1.48 ============ end of search ============
% 1.29/1.48
% 1.29/1.48 ----------- soft-scott stats ----------
% 1.29/1.48
% 1.29/1.48 true clauses given 4 (28.6%)
% 1.29/1.48 false clauses given 10
% 1.29/1.48
% 1.29/1.48 FALSE TRUE
% 1.29/1.48 tot: 0 0 (-nan% true)
% 1.29/1.48
% 1.29/1.48
% 1.29/1.48 Model 9 [ 1 10 1571 ] (0.00 seconds, 250000 Inserts)
% 1.29/1.48
% 1.29/1.48 That finishes the proof of the theorem.
% 1.29/1.48
% 1.29/1.48 Process 6534 finished Thu Jun 9 12:42:13 2022
%------------------------------------------------------------------------------