%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : MGT016+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n025.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 : Theorem 1.20s 1.39s
% Output : Refutation 1.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : MGT016+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n025.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.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 9 09:22:35 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.36 ----- Otter 3.2, August 2001 -----
% 0.13/0.36 The process was started by sandbox2 on n025.cluster.edu,
% 0.13/0.36 Thu Jun 9 09:22:35 2022
% 0.13/0.36 The command was "./sos". The process ID is 8890.
% 0.13/0.36
% 0.13/0.36 set(prolog_style_variables).
% 0.13/0.36 set(auto).
% 0.13/0.36 dependent: set(auto1).
% 0.13/0.36 dependent: set(process_input).
% 0.13/0.36 dependent: clear(print_kept).
% 0.13/0.36 dependent: clear(print_new_demod).
% 0.13/0.36 dependent: clear(print_back_demod).
% 0.13/0.36 dependent: clear(print_back_sub).
% 0.13/0.36 dependent: set(control_memory).
% 0.13/0.36 dependent: assign(max_mem, 12000).
% 0.13/0.36 dependent: assign(pick_given_ratio, 4).
% 0.13/0.36 dependent: assign(stats_level, 1).
% 0.13/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.36 dependent: assign(sos_limit, 5000).
% 0.13/0.36 dependent: assign(max_weight, 60).
% 0.13/0.36 clear(print_given).
% 0.13/0.36
% 0.13/0.36 formula_list(usable).
% 0.13/0.36
% 0.13/0.36 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=13.
% 0.13/0.36
% 0.13/0.36 This is a non-Horn set without equality. The strategy
% 0.13/0.36 will be ordered hyper_res, ur_res, unit deletion, and
% 0.13/0.36 factoring, with satellites in sos and nuclei in usable.
% 0.13/0.36
% 0.13/0.36 dependent: set(hyper_res).
% 0.13/0.36 dependent: set(factor).
% 0.13/0.36 dependent: set(unit_deletion).
% 0.13/0.36
% 0.13/0.36 ------------> process usable:
% 0.13/0.36
% 0.13/0.36 ------------> process sos:
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.19/0.52
% 0.19/0.52 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.52
% 0.19/0.52 Stopped by limit on number of solutions
% 0.19/0.52
% 0.19/0.52
% 0.19/0.52 -------------- Softie stats --------------
% 0.19/0.52
% 0.19/0.52 UPDATE_STOP: 300
% 0.19/0.52 SFINDER_TIME_LIMIT: 2
% 0.19/0.52 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.52 number of clauses in intial UL: 13
% 0.19/0.52 number of clauses initially in problem: 24
% 0.19/0.52 percentage of clauses intially in UL: 54
% 0.19/0.52 percentage of distinct symbols occuring in initial UL: 64
% 0.19/0.52 percent of all initial clauses that are short: 100
% 0.19/0.52 absolute distinct symbol count: 17
% 0.19/0.52 distinct predicate count: 7
% 0.19/0.52 distinct function count: 1
% 0.19/0.52 distinct constant count: 9
% 0.19/0.52
% 0.19/0.52 ---------- no more Softie stats ----------
% 0.19/0.52
% 0.19/0.52
% 0.19/0.52
% 0.19/0.52 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.52
% 0.19/0.52 Stopped by limit on number of solutions
% 0.19/0.52
% 0.19/0.52 =========== start of search ===========
% 1.20/1.39
% 1.20/1.39 -------- PROOF --------
% 1.20/1.39 % SZS status Theorem
% 1.20/1.39 % SZS output start Refutation
% 1.20/1.39
% 1.20/1.39 Model 3 (0.00 seconds, 0 Inserts)
% 1.20/1.39
% 1.20/1.39 Stopped by limit on number of solutions
% 1.20/1.39
% 1.20/1.39 Stopped by limit on insertions
% 1.20/1.39
% 1.20/1.39 Model 4 [ 1 4 768 ] (0.00 seconds, 250000 Inserts)
% 1.20/1.39
% 1.20/1.39 Stopped by limit on insertions
% 1.20/1.39
% 1.20/1.39 Model 5 [ 1 3 396 ] (0.00 seconds, 250000 Inserts)
% 1.20/1.39
% 1.20/1.39 Stopped by limit on insertions
% 1.20/1.39
% 1.20/1.39 Stopped by limit on insertions
% 1.20/1.39
% 1.20/1.39 Model 6 [ 1 4 1005 ] (0.00 seconds, 250000 Inserts)
% 1.20/1.39
% 1.20/1.39 Stopped by limit on insertions
% 1.20/1.39
% 1.20/1.39 Model 7 [ 1 4 776 ] (0.00 seconds, 250000 Inserts)
% 1.20/1.39
% 1.20/1.39 Stopped by limit on insertions
% 1.20/1.39
% 1.20/1.39 Model 8 [ 1 6 1201 ] (0.00 seconds, 250000 Inserts)
% 1.20/1.39
% 1.20/1.39 Stopped by limit on insertions
% 1.20/1.39
% 1.20/1.39 Model 9 [ 1 5 1056 ] (0.00 seconds, 250000 Inserts)
% 1.20/1.39
% 1.20/1.39 -----> EMPTY CLAUSE at 0.89 sec ----> 28 [hyper,27,3,14,15,16,17,18,19,20,21,25,26,unit_del,4,5] {-} $F.
% 1.20/1.39
% 1.20/1.39 Length of proof is 3. Level of proof is 2.
% 1.20/1.39
% 1.20/1.39 ---------------- PROOF ----------------
% 1.20/1.39 % SZS status Theorem
% 1.20/1.39 % SZS output start Refutation
% 1.20/1.39
% 1.20/1.39 1 [] {+} -organization(A,B)|inertia(A,$f1(A,B),B).
% 1.20/1.39 2 [] {+} -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.20/1.39 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.20/1.39 4 [] {+} -organization($c8,$c1).
% 1.20/1.39 5 [] {+} -greater($c2,$c1).
% 1.20/1.39 14 [] {+} organization($c9,$c3).
% 1.20/1.39 15 [] {+} organization($c8,$c3).
% 1.20/1.39 16 [] {+} class($c9,$c6,$c3).
% 1.20/1.39 17 [] {+} class($c8,$c6,$c3).
% 1.20/1.39 18 [] {-} reorganization($c9,$c3,$c2).
% 1.20/1.39 19 [] {+} reorganization($c8,$c3,$c1).
% 1.20/1.39 20 [] {+} reorganization_type($c9,$c7,$c3).
% 1.20/1.39 21 [] {+} reorganization_type($c8,$c7,$c3).
% 1.20/1.39 22 [] {+} complexity($c9,$c5,$c3).
% 1.20/1.39 23 [] {+} complexity($c8,$c4,$c3).
% 1.20/1.39 24 [] {+} greater($c4,$c5).
% 1.20/1.39 25 [hyper,14,1] {+} inertia($c9,$f1($c9,$c3),$c3).
% 1.20/1.39 26 [hyper,15,1] {+} inertia($c8,$f1($c8,$c3),$c3).
% 1.20/1.39 27 [hyper,26,2,14,15,16,17,22,23,25,24] {-} greater($f1($c8,$c3),$f1($c9,$c3)).
% 1.20/1.39 28 [hyper,27,3,14,15,16,17,18,19,20,21,25,26,unit_del,4,5] {-} $F.
% 1.20/1.39
% 1.20/1.39 % SZS output end Refutation
% 1.20/1.39 ------------ end of proof -------------
% 1.20/1.39
% 1.20/1.39
% 1.20/1.39 Search stopped by max_proofs option.
% 1.20/1.39
% 1.20/1.39
% 1.20/1.39 Search stopped by max_proofs option.
% 1.20/1.39
% 1.20/1.39 ============ end of search ============
% 1.20/1.39
% 1.20/1.39 ----------- soft-scott stats ----------
% 1.20/1.39
% 1.20/1.39 true clauses given 4 (28.6%)
% 1.20/1.39 false clauses given 10
% 1.20/1.39
% 1.20/1.39 FALSE TRUE
% 1.20/1.39 tot: 0 0 (-nan% true)
% 1.20/1.39
% 1.20/1.39
% 1.20/1.39 Model 9 [ 1 5 1056 ] (0.00 seconds, 250000 Inserts)
% 1.20/1.39
% 1.20/1.39 That finishes the proof of the theorem.
% 1.20/1.39
% 1.20/1.39 Process 8890 finished Thu Jun 9 09:22:36 2022
%------------------------------------------------------------------------------