%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : MGT018-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:25:49 EDT 2022
% Result : Unsatisfiable 1.16s 1.37s
% Output : Refutation 1.16s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : MGT018-1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n017.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 07:20:49 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.36 ----- Otter 3.2, August 2001 -----
% 0.12/0.36 The process was started by sandbox on n017.cluster.edu,
% 0.12/0.36 Thu Jun 9 07:20:49 2022
% 0.12/0.36 The command was "./sos". The process ID is 2307.
% 0.12/0.36
% 0.12/0.36 set(prolog_style_variables).
% 0.12/0.36 set(auto).
% 0.12/0.36 dependent: set(auto1).
% 0.12/0.36 dependent: set(process_input).
% 0.12/0.36 dependent: clear(print_kept).
% 0.12/0.36 dependent: clear(print_new_demod).
% 0.12/0.36 dependent: clear(print_back_demod).
% 0.12/0.36 dependent: clear(print_back_sub).
% 0.12/0.36 dependent: set(control_memory).
% 0.12/0.36 dependent: assign(max_mem, 12000).
% 0.12/0.36 dependent: assign(pick_given_ratio, 4).
% 0.12/0.36 dependent: assign(stats_level, 1).
% 0.12/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.36 dependent: assign(sos_limit, 5000).
% 0.12/0.36 dependent: assign(max_weight, 60).
% 0.12/0.36 clear(print_given).
% 0.12/0.36
% 0.12/0.36 list(usable).
% 0.12/0.36
% 0.12/0.36 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=13.
% 0.12/0.36
% 0.12/0.36 This is a non-Horn set without equality. The strategy
% 0.12/0.36 will be ordered hyper_res, ur_res, unit deletion, and
% 0.12/0.36 factoring, with satellites in sos and nuclei in usable.
% 0.12/0.36
% 0.12/0.36 dependent: set(hyper_res).
% 0.12/0.36 dependent: set(factor).
% 0.12/0.36 dependent: set(unit_deletion).
% 0.12/0.36
% 0.12/0.36 ------------> process usable:
% 0.12/0.36
% 0.12/0.36 ------------> process sos:
% 0.12/0.36
% 0.12/0.36 ======= end of input processing =======
% 0.19/0.54
% 0.19/0.54 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.54
% 0.19/0.54 Stopped by limit on number of solutions
% 0.19/0.54
% 0.19/0.54
% 0.19/0.54 -------------- Softie stats --------------
% 0.19/0.54
% 0.19/0.54 UPDATE_STOP: 300
% 0.19/0.54 SFINDER_TIME_LIMIT: 2
% 0.19/0.54 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.54 number of clauses in intial UL: 13
% 0.19/0.54 number of clauses initially in problem: 24
% 0.19/0.54 percentage of clauses intially in UL: 54
% 0.19/0.54 percentage of distinct symbols occuring in initial UL: 64
% 0.19/0.54 percent of all initial clauses that are short: 100
% 0.19/0.54 absolute distinct symbol count: 17
% 0.19/0.54 distinct predicate count: 7
% 0.19/0.54 distinct function count: 1
% 0.19/0.54 distinct constant count: 9
% 0.19/0.54
% 0.19/0.54 ---------- no more Softie stats ----------
% 0.19/0.54
% 0.19/0.54
% 0.19/0.54
% 0.19/0.54 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.54
% 0.19/0.54 Stopped by limit on number of solutions
% 0.19/0.54
% 0.19/0.54 =========== start of search ===========
% 1.16/1.37
% 1.16/1.37 -------- PROOF --------
% 1.16/1.37 % SZS status Unsatisfiable
% 1.16/1.37 % SZS output start Refutation
% 1.16/1.37
% 1.16/1.37 Model 3 (0.00 seconds, 0 Inserts)
% 1.16/1.37
% 1.16/1.37 Stopped by limit on number of solutions
% 1.16/1.37
% 1.16/1.37 Stopped by limit on insertions
% 1.16/1.37
% 1.16/1.37 Model 4 [ 1 3 768 ] (0.00 seconds, 250000 Inserts)
% 1.16/1.37
% 1.16/1.37 Stopped by limit on insertions
% 1.16/1.37
% 1.16/1.37 Model 5 [ 1 2 396 ] (0.00 seconds, 250000 Inserts)
% 1.16/1.37
% 1.16/1.37 Stopped by limit on insertions
% 1.16/1.37
% 1.16/1.37 Stopped by limit on insertions
% 1.16/1.37
% 1.16/1.37 Model 6 [ 1 4 1005 ] (0.00 seconds, 250000 Inserts)
% 1.16/1.37
% 1.16/1.37 Stopped by limit on insertions
% 1.16/1.37
% 1.16/1.37 Model 7 [ 1 4 776 ] (0.00 seconds, 250000 Inserts)
% 1.16/1.37
% 1.16/1.37 Stopped by limit on insertions
% 1.16/1.37
% 1.16/1.37 Model 8 [ 1 5 1201 ] (0.00 seconds, 250000 Inserts)
% 1.16/1.37
% 1.16/1.37 Stopped by limit on insertions
% 1.16/1.37
% 1.16/1.37 Model 9 [ 1 5 1056 ] (0.00 seconds, 250000 Inserts)
% 1.16/1.37
% 1.16/1.37 -----> EMPTY CLAUSE at 0.86 sec ----> 28 [hyper,27,3,14,15,16,17,18,19,20,21,25,26,unit_del,4,5] {-} $F.
% 1.16/1.37
% 1.16/1.37 Length of proof is 3. Level of proof is 2.
% 1.16/1.37
% 1.16/1.37 ---------------- PROOF ----------------
% 1.16/1.37 % SZS status Unsatisfiable
% 1.16/1.37 % SZS output start Refutation
% 1.16/1.37
% 1.16/1.37 1 [] {+} -organization(A,B)|inertia(A,sk1(B,A),B).
% 1.16/1.37 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.16/1.37 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(F,D).
% 1.16/1.37 4 [] {+} -organization(sk3,sk10).
% 1.16/1.37 5 [] {+} -greater(sk9,sk10).
% 1.16/1.37 14 [] {+} organization(sk2,sk8).
% 1.16/1.37 15 [] {+} organization(sk3,sk8).
% 1.16/1.37 16 [] {+} class(sk2,sk5,sk8).
% 1.16/1.37 17 [] {+} class(sk3,sk5,sk8).
% 1.16/1.37 18 [] {-} reorganization(sk2,sk8,sk9).
% 1.16/1.37 19 [] {+} reorganization(sk3,sk8,sk10).
% 1.16/1.37 20 [] {+} reorganization_type(sk2,sk4,sk8).
% 1.16/1.37 21 [] {+} reorganization_type(sk3,sk4,sk8).
% 1.16/1.37 22 [] {+} size(sk2,sk6,sk8).
% 1.16/1.37 23 [] {+} size(sk3,sk7,sk8).
% 1.16/1.37 24 [] {+} greater(sk7,sk6).
% 1.16/1.37 25 [hyper,14,1] {+} inertia(sk2,sk1(sk8,sk2),sk8).
% 1.16/1.37 26 [hyper,15,1] {+} inertia(sk3,sk1(sk8,sk3),sk8).
% 1.16/1.37 27 [hyper,26,2,14,15,16,17,22,23,25,24] {-} greater(sk1(sk8,sk3),sk1(sk8,sk2)).
% 1.16/1.37 28 [hyper,27,3,14,15,16,17,18,19,20,21,25,26,unit_del,4,5] {-} $F.
% 1.16/1.37
% 1.16/1.37 % SZS output end Refutation
% 1.16/1.37 ------------ end of proof -------------
% 1.16/1.37
% 1.16/1.37
% 1.16/1.37 Search stopped by max_proofs option.
% 1.16/1.37
% 1.16/1.37
% 1.16/1.37 Search stopped by max_proofs option.
% 1.16/1.37
% 1.16/1.37 ============ end of search ============
% 1.16/1.37
% 1.16/1.37 ----------- soft-scott stats ----------
% 1.16/1.37
% 1.16/1.37 true clauses given 4 (28.6%)
% 1.16/1.37 false clauses given 10
% 1.16/1.37
% 1.16/1.37 FALSE TRUE
% 1.16/1.37 tot: 0 0 (-nan% true)
% 1.16/1.37
% 1.16/1.37
% 1.16/1.37 Model 9 [ 1 5 1056 ] (0.00 seconds, 250000 Inserts)
% 1.16/1.37
% 1.16/1.37 That finishes the proof of the theorem.
% 1.16/1.37
% 1.16/1.37 Process 2307 finished Thu Jun 9 07:20:50 2022
%------------------------------------------------------------------------------