TSTP Solution File: MGT017-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : MGT017-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n023.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:49 EDT 2022
% Result : Unsatisfiable 1.13s 1.36s
% Output : Refutation 1.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : MGT017-1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12 % Command : sos-script %s
% 0.12/0.34 % Computer : n023.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jun 9 08:03:23 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.35 ----- Otter 3.2, August 2001 -----
% 0.19/0.35 The process was started by sandbox2 on n023.cluster.edu,
% 0.19/0.35 Thu Jun 9 08:03:23 2022
% 0.19/0.35 The command was "./sos". The process ID is 29656.
% 0.19/0.35
% 0.19/0.35 set(prolog_style_variables).
% 0.19/0.35 set(auto).
% 0.19/0.35 dependent: set(auto1).
% 0.19/0.35 dependent: set(process_input).
% 0.19/0.35 dependent: clear(print_kept).
% 0.19/0.35 dependent: clear(print_new_demod).
% 0.19/0.35 dependent: clear(print_back_demod).
% 0.19/0.35 dependent: clear(print_back_sub).
% 0.19/0.35 dependent: set(control_memory).
% 0.19/0.35 dependent: assign(max_mem, 12000).
% 0.19/0.35 dependent: assign(pick_given_ratio, 4).
% 0.19/0.35 dependent: assign(stats_level, 1).
% 0.19/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.19/0.35 dependent: assign(sos_limit, 5000).
% 0.19/0.35 dependent: assign(max_weight, 60).
% 0.19/0.35 clear(print_given).
% 0.19/0.35
% 0.19/0.35 list(usable).
% 0.19/0.35
% 0.19/0.35 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=13.
% 0.19/0.35
% 0.19/0.35 This is a Horn set without equality. The strategy will
% 0.19/0.35 be hyperresolution, with satellites in sos and nuclei
% 0.19/0.35 in usable.
% 0.19/0.35
% 0.19/0.35 dependent: set(hyper_res).
% 0.19/0.35 dependent: clear(order_hyper).
% 0.19/0.35
% 0.19/0.35 ------------> process usable:
% 0.19/0.35
% 0.19/0.35 ------------> process sos:
% 0.19/0.35
% 0.19/0.35 ======= end of input processing =======
% 0.19/0.42
% 0.19/0.42 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.42
% 0.19/0.42 Stopped by limit on number of solutions
% 0.19/0.42
% 0.19/0.42
% 0.19/0.42 -------------- Softie stats --------------
% 0.19/0.42
% 0.19/0.42 UPDATE_STOP: 300
% 0.19/0.42 SFINDER_TIME_LIMIT: 2
% 0.19/0.42 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.42 number of clauses in intial UL: 4
% 0.19/0.42 number of clauses initially in problem: 16
% 0.19/0.42 percentage of clauses intially in UL: 25
% 0.19/0.42 percentage of distinct symbols occuring in initial UL: 58
% 0.19/0.42 percent of all initial clauses that are short: 100
% 0.19/0.42 absolute distinct symbol count: 17
% 0.19/0.42 distinct predicate count: 7
% 0.19/0.42 distinct function count: 1
% 0.19/0.42 distinct constant count: 9
% 0.19/0.42
% 0.19/0.42 ---------- no more Softie stats ----------
% 0.19/0.42
% 0.19/0.42
% 0.19/0.42
% 0.19/0.42 =========== start of search ===========
% 1.13/1.36
% 1.13/1.36 -------- PROOF --------
% 1.13/1.36 % SZS status Unsatisfiable
% 1.13/1.36 % SZS output start Refutation
% 1.13/1.36
% 1.13/1.36 Model 2 (0.00 seconds, 0 Inserts)
% 1.13/1.36
% 1.13/1.36 Stopped by limit on number of solutions
% 1.13/1.36
% 1.13/1.36 Model 3 (0.00 seconds, 0 Inserts)
% 1.13/1.36
% 1.13/1.36 Stopped by limit on number of solutions
% 1.13/1.36
% 1.13/1.36 Model 4 (0.00 seconds, 0 Inserts)
% 1.13/1.36
% 1.13/1.36 Stopped by limit on number of solutions
% 1.13/1.36
% 1.13/1.36 Stopped by limit on insertions
% 1.13/1.36
% 1.13/1.36 Model 5 [ 1 11 1767 ] (0.00 seconds, 250000 Inserts)
% 1.13/1.36
% 1.13/1.36 Stopped by limit on insertions
% 1.13/1.36
% 1.13/1.36 Model 6 [ 1 5 1302 ] (0.00 seconds, 250000 Inserts)
% 1.13/1.36
% 1.13/1.36 Stopped by limit on insertions
% 1.13/1.36
% 1.13/1.36 Model 7 [ 1 5 1247 ] (0.00 seconds, 250000 Inserts)
% 1.13/1.36
% 1.13/1.36 Stopped by limit on insertions
% 1.13/1.36
% 1.13/1.36 Model 8 [ 2 9 1569 ] (0.00 seconds, 250000 Inserts)
% 1.13/1.36
% 1.13/1.36 Stopped by limit on insertions
% 1.13/1.36
% 1.13/1.36 Model 9 [ 1 2 304 ] (0.00 seconds, 250000 Inserts)
% 1.13/1.36
% 1.13/1.36 ----> UNIT CONFLICT at 0.86 sec ----> 22 [binary,21.1,4.1] {+} $F.
% 1.13/1.36
% 1.13/1.36 Length of proof is 4. Level of proof is 3.
% 1.13/1.36
% 1.13/1.36 ---------------- PROOF ----------------
% 1.13/1.36 % SZS status Unsatisfiable
% 1.13/1.36 % SZS output start Refutation
% 1.13/1.36
% 1.13/1.36 1 [] {+} -organization(A,B)|inertia(A,sk1(B,A),B).
% 1.13/1.36 2 [] {+} -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.13/1.36 3 [] {+} -organization(A,B)| -organization(C,B)| -organization(C,D)| -class(A,E,B)| -class(C,E,B)| -reorganization(A,B,F)| -reorganization(C,B,D)| -reorganization_type(A,G,B)| -reorganization_type(C,G,B)| -inertia(A,H,B)| -inertia(C,I,B)| -greater(I,H)|greater(D,F).
% 1.13/1.36 4 [] {+} -greater(sk10,sk9).
% 1.13/1.36 5 [] {+} organization(sk2,sk8).
% 1.13/1.36 6 [] {+} organization(sk3,sk8).
% 1.13/1.36 7 [] {+} organization(sk3,sk10).
% 1.13/1.36 8 [] {+} class(sk2,sk5,sk8).
% 1.13/1.36 9 [] {+} class(sk3,sk5,sk8).
% 1.13/1.36 10 [] {+} reorganization(sk2,sk8,sk9).
% 1.13/1.36 11 [] {+} reorganization(sk3,sk8,sk10).
% 1.13/1.36 12 [] {+} reorganization_type(sk2,sk4,sk8).
% 1.13/1.36 13 [] {+} reorganization_type(sk3,sk4,sk8).
% 1.13/1.36 14 [] {+} size(sk2,sk6,sk8).
% 1.13/1.36 15 [] {+} size(sk3,sk7,sk8).
% 1.13/1.36 16 [] {+} greater(sk7,sk6).
% 1.13/1.36 17 [hyper,5,1] {+} inertia(sk2,sk1(sk8,sk2),sk8).
% 1.13/1.36 19 [hyper,6,1] {+} inertia(sk3,sk1(sk8,sk3),sk8).
% 1.13/1.36 20 [hyper,19,2,5,6,8,9,14,15,17,16] {+} greater(sk1(sk8,sk3),sk1(sk8,sk2)).
% 1.13/1.36 21 [hyper,20,3,5,6,7,8,9,10,11,12,13,17,19] {-} greater(sk10,sk9).
% 1.13/1.36 22 [binary,21.1,4.1] {+} $F.
% 1.13/1.36
% 1.13/1.36 % SZS output end Refutation
% 1.13/1.36 ------------ end of proof -------------
% 1.13/1.36
% 1.13/1.36
% 1.13/1.36 Search stopped by max_proofs option.
% 1.13/1.36
% 1.13/1.36
% 1.13/1.36 Search stopped by max_proofs option.
% 1.13/1.36
% 1.13/1.36 ============ end of search ============
% 1.13/1.36
% 1.13/1.36 ----------- soft-scott stats ----------
% 1.13/1.36
% 1.13/1.36 true clauses given 8 (50.0%)
% 1.13/1.36 false clauses given 8
% 1.13/1.36
% 1.13/1.36 FALSE TRUE
% 1.13/1.36 tot: 0 0 (-nan% true)
% 1.13/1.36
% 1.13/1.36
% 1.13/1.36 Model 9 [ 1 2 304 ] (0.00 seconds, 250000 Inserts)
% 1.13/1.36
% 1.13/1.36 That finishes the proof of the theorem.
% 1.13/1.36
% 1.13/1.36 Process 29656 finished Thu Jun 9 08:03:24 2022
%------------------------------------------------------------------------------