%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : MGT013+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n021.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:48 EDT 2022
% Result : Theorem 0.59s 0.83s
% Output : Refutation 0.59s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : MGT013+1 : TPTP v8.1.0. Released v2.0.0.
% 0.12/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n021.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jun 9 09:26:38 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox on n021.cluster.edu,
% 0.12/0.35 Thu Jun 9 09:26:38 2022
% 0.12/0.35 The command was "./sos". The process ID is 21479.
% 0.12/0.35
% 0.12/0.35 set(prolog_style_variables).
% 0.12/0.35 set(auto).
% 0.12/0.35 dependent: set(auto1).
% 0.12/0.35 dependent: set(process_input).
% 0.12/0.35 dependent: clear(print_kept).
% 0.12/0.35 dependent: clear(print_new_demod).
% 0.12/0.35 dependent: clear(print_back_demod).
% 0.12/0.35 dependent: clear(print_back_sub).
% 0.12/0.35 dependent: set(control_memory).
% 0.12/0.35 dependent: assign(max_mem, 12000).
% 0.12/0.35 dependent: assign(pick_given_ratio, 4).
% 0.12/0.35 dependent: assign(stats_level, 1).
% 0.12/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.35 dependent: assign(sos_limit, 5000).
% 0.12/0.35 dependent: assign(max_weight, 60).
% 0.12/0.35 clear(print_given).
% 0.12/0.35
% 0.12/0.35 formula_list(usable).
% 0.12/0.35
% 0.12/0.35 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=7.
% 0.12/0.35
% 0.12/0.35 This ia a non-Horn set with equality. The strategy will be
% 0.12/0.35 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.35 unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.35 clauses in usable.
% 0.12/0.35
% 0.12/0.35 dependent: set(knuth_bendix).
% 0.12/0.35 dependent: set(para_from).
% 0.12/0.35 dependent: set(para_into).
% 0.12/0.35 dependent: clear(para_from_right).
% 0.12/0.35 dependent: clear(para_into_right).
% 0.12/0.35 dependent: set(para_from_vars).
% 0.12/0.35 dependent: set(eq_units_both_ways).
% 0.12/0.35 dependent: set(dynamic_demod_all).
% 0.12/0.35 dependent: set(dynamic_demod).
% 0.12/0.35 dependent: set(order_eq).
% 0.12/0.35 dependent: set(back_demod).
% 0.12/0.35 dependent: set(lrpo).
% 0.12/0.35 dependent: set(hyper_res).
% 0.12/0.35 dependent: set(unit_deletion).
% 0.12/0.35 dependent: set(factor).
% 0.12/0.35
% 0.12/0.35 ------------> process usable:
% 0.12/0.35
% 0.12/0.35 ------------> process sos:
% 0.12/0.35 Following clause subsumed by 24 during input processing: 0 [copy,24,flip.1] {-} A=A.
% 0.12/0.35 24 back subsumes 12.
% 0.12/0.35 24 back subsumes 10.
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.12/0.37
% 0.12/0.37 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.37
% 0.12/0.37 Stopped by limit on number of solutions
% 0.12/0.37
% 0.12/0.37
% 0.12/0.37 -------------- Softie stats --------------
% 0.12/0.37
% 0.12/0.37 UPDATE_STOP: 300
% 0.12/0.37 SFINDER_TIME_LIMIT: 2
% 0.12/0.37 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.37 number of clauses in intial UL: 12
% 0.12/0.37 number of clauses initially in problem: 22
% 0.12/0.37 percentage of clauses intially in UL: 54
% 0.12/0.37 percentage of distinct symbols occuring in initial UL: 50
% 0.12/0.37 percent of all initial clauses that are short: 100
% 0.12/0.37 absolute distinct symbol count: 14
% 0.12/0.37 distinct predicate count: 7
% 0.12/0.37 distinct function count: 0
% 0.12/0.37 distinct constant count: 7
% 0.12/0.37
% 0.12/0.37 ---------- no more Softie stats ----------
% 0.12/0.37
% 0.12/0.37
% 0.12/0.37
% 0.12/0.37 =========== start of search ===========
% 0.59/0.83
% 0.59/0.83 -------- PROOF --------
% 0.59/0.83 % SZS status Theorem
% 0.59/0.83 % SZS output start Refutation
% 0.59/0.83
% 0.59/0.83 Model 2 (0.00 seconds, 0 Inserts)
% 0.59/0.83
% 0.59/0.83 Stopped by limit on number of solutions
% 0.59/0.83
% 0.59/0.83 Model 3 (0.00 seconds, 0 Inserts)
% 0.59/0.83
% 0.59/0.83 Stopped by limit on number of solutions
% 0.59/0.83
% 0.59/0.83 Model 4 (0.00 seconds, 0 Inserts)
% 0.59/0.83
% 0.59/0.83 Stopped by limit on number of solutions
% 0.59/0.83
% 0.59/0.83 Stopped by limit on insertions
% 0.59/0.83
% 0.59/0.83 Model 5 [ 1 0 657 ] (0.00 seconds, 250000 Inserts)
% 0.59/0.83
% 0.59/0.83 Model 6 (0.00 seconds, 250000 Inserts)
% 0.59/0.83
% 0.59/0.83 Stopped by limit on number of solutions
% 0.59/0.83
% 0.59/0.83 Model 7 (0.00 seconds, 250000 Inserts)
% 0.59/0.83
% 0.59/0.83 Stopped by limit on number of solutions
% 0.59/0.83
% 0.59/0.83 Stopped by limit on insertions
% 0.59/0.83
% 0.59/0.83 Model 8 [ 1 0 477 ] (0.00 seconds, 250000 Inserts)
% 0.59/0.83
% 0.59/0.83 Stopped by limit on insertions
% 0.59/0.83
% 0.59/0.83 Model 9 [ 1 0 690 ] (0.00 seconds, 250000 Inserts)
% 0.59/0.83
% 0.59/0.83 Stopped by limit on insertions
% 0.59/0.83
% 0.59/0.83 Model 10 [ 1 1 816 ] (0.00 seconds, 250000 Inserts)
% 0.59/0.83
% 0.59/0.83 -----> EMPTY CLAUSE at 0.46 sec ----> 337 [hyper,144,275,16,16,19,24] {-} $F.
% 0.59/0.83
% 0.59/0.83 Length of proof is 14. Level of proof is 6.
% 0.59/0.83
% 0.59/0.83 ---------------- PROOF ----------------
% 0.59/0.83 % SZS status Theorem
% 0.59/0.83 % SZS output start Refutation
% 0.59/0.83
% 0.59/0.83 2 [] {+} -greater(A,B)| -greater(B,A).
% 0.59/0.83 3 [] {+} -organization(A,B)|time(B).
% 0.59/0.83 4 [] {+} -time(A)| -time(B)|greater(A,B)|A=B|greater(B,A).
% 0.59/0.83 5 [] {+} -reorganization_free(A,B,C)|reorganization_free(A,C,B).
% 0.59/0.83 6 [] {+} -organization(A,B)| -organization(A,C)| -complexity(A,D,B)| -complexity(A,E,C)|B!=C|D=E.
% 0.59/0.83 7 [] {+} -organization(A,B)| -organization(A,C)| -reorganization_free(A,B,C)| -size(A,D,B)| -size(A,E,C)| -greater(C,B)| -greater(D,E).
% 0.59/0.83 8 [] {+} -organization(A,B)| -organization(A,C)| -reorganization_free(A,B,C)| -complexity(A,D,B)| -complexity(A,E,C)| -greater(C,B)| -greater(D,E).
% 0.59/0.83 9 [factor,2.1.2] {+} -greater(A,A).
% 0.59/0.83 11 [factor,6.1.2] {+} -organization(A,B)| -complexity(A,C,B)| -complexity(A,D,B)|B!=B|C=D.
% 0.59/0.83 15 [] {+} organization($c7,$c2).
% 0.59/0.83 16 [] {+} organization($c7,$c1).
% 0.59/0.83 17 [] {+} reorganization_free($c7,$c2,$c1).
% 0.59/0.83 18 [] {+} complexity($c7,$c6,$c2).
% 0.59/0.83 19 [] {+} complexity($c7,$c5,$c1).
% 0.59/0.83 20 [] {+} size($c7,$c4,$c2).
% 0.59/0.83 21 [] {+} size($c7,$c3,$c1).
% 0.59/0.83 22 [] {+} greater($c5,$c6).
% 0.59/0.83 23 [] {+} greater($c4,$c3).
% 0.59/0.83 24 [] {+} A=A.
% 0.59/0.83 25 [hyper,15,3] {+} time($c2).
% 0.59/0.83 40 [hyper,16,3] {+} time($c1).
% 0.59/0.83 47 [hyper,40,4,25] {-} greater($c2,$c1)|$c2=$c1|greater($c1,$c2).
% 0.59/0.83 50 [hyper,17,5] {+} reorganization_free($c7,$c1,$c2).
% 0.59/0.83 69 [para_into,22.1.1,11.5.1,unit_del,24] {-} greater(A,$c6)| -organization(B,C)| -complexity(B,$c5,C)| -complexity(B,A,C).
% 0.59/0.83 111 [hyper,47,8,16,15,50,19,18,22] {+} $c2=$c1|greater($c1,$c2).
% 0.59/0.83 114,113 [hyper,111,7,15,16,17,20,21,23] {+} $c2=$c1.
% 0.59/0.83 144 [back_demod,18,demod,114] {+} complexity($c7,$c6,$c1).
% 0.59/0.83 259 [para_into,69.1.2,11.5.1,unit_del,24] {-} greater(A,B)| -organization(C,D)| -complexity(C,$c5,D)| -complexity(C,A,D)| -organization(E,F)| -complexity(E,$c6,F)| -complexity(E,B,F).
% 0.59/0.83 268 [factor,259.4.7,unit_del,9,factor_simp,factor_simp] {-} -organization(A,B)| -complexity(A,$c5,B)| -complexity(A,$c6,B).
% 0.59/0.83 273 [para_into,268.2.2,6.6.1] {-} -organization(A,B)| -complexity(A,C,B)| -complexity(A,$c6,B)| -organization(D,E)| -organization(D,F)| -complexity(D,$c5,E)| -complexity(D,C,F)|E!=F.
% 0.59/0.83 275 [factor,273.1.5,factor_simp,factor_simp] {-} -organization(A,B)| -complexity(A,$c6,B)| -organization(A,C)| -complexity(A,$c5,C)|C!=B.
% 0.59/0.83 337 [hyper,144,275,16,16,19,24] {-} $F.
% 0.59/0.83
% 0.59/0.83 % SZS output end Refutation
% 0.59/0.83 ------------ end of proof -------------
% 0.59/0.83
% 0.59/0.83
% 0.59/0.83 Search stopped by max_proofs option.
% 0.59/0.83
% 0.59/0.83
% 0.59/0.83 Search stopped by max_proofs option.
% 0.59/0.83
% 0.59/0.83 ============ end of search ============
% 0.59/0.83
% 0.59/0.83 ----------- soft-scott stats ----------
% 0.59/0.83
% 0.59/0.83 true clauses given 13 (39.4%)
% 0.59/0.83 false clauses given 20
% 0.59/0.83
% 0.59/0.83 FALSE TRUE
% 0.59/0.83 6 0 1
% 0.59/0.83 11 0 5
% 0.59/0.83 12 0 13
% 0.59/0.83 13 0 7
% 0.59/0.83 14 0 21
% 0.59/0.83 15 0 27
% 0.59/0.83 18 0 3
% 0.59/0.83 19 0 4
% 0.59/0.83 20 17 10
% 0.59/0.83 21 0 30
% 0.59/0.83 22 4 9
% 0.59/0.83 23 0 21
% 0.59/0.83 24 0 17
% 0.59/0.83 25 3 8
% 0.59/0.83 27 3 4
% 0.59/0.83 28 4 6
% 0.59/0.83 29 0 20
% 0.59/0.83 30 1 11
% 0.59/0.83 31 8 11
% 0.59/0.83 34 5 6
% 0.59/0.83 37 2 2
% 0.59/0.83 tot: 47 236 (83.4% true)
% 0.59/0.83
% 0.59/0.83
% 0.59/0.83 Model 10 [ 1 1 816 ] (0.00 seconds, 250000 Inserts)
% 0.59/0.83
% 0.59/0.83 That finishes the proof of the theorem.
% 0.59/0.83
% 0.59/0.83 Process 21479 finished Thu Jun 9 09:26:38 2022
%------------------------------------------------------------------------------