%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : MGT058-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n020.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:26:04 EDT 2022
% Result : Unsatisfiable 0.91s 1.11s
% Output : Refutation 0.91s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : MGT058-1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.12 % Command : sos-script %s
% 0.13/0.33 % Computer : n020.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Thu Jun 9 12:09:36 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.34 ----- Otter 3.2, August 2001 -----
% 0.13/0.34 The process was started by sandbox on n020.cluster.edu,
% 0.13/0.34 Thu Jun 9 12:09:36 2022
% 0.13/0.34 The command was "./sos". The process ID is 3483.
% 0.13/0.34
% 0.13/0.34 set(prolog_style_variables).
% 0.13/0.34 set(auto).
% 0.13/0.34 dependent: set(auto1).
% 0.13/0.34 dependent: set(process_input).
% 0.13/0.34 dependent: clear(print_kept).
% 0.13/0.34 dependent: clear(print_new_demod).
% 0.13/0.34 dependent: clear(print_back_demod).
% 0.13/0.34 dependent: clear(print_back_sub).
% 0.13/0.34 dependent: set(control_memory).
% 0.13/0.34 dependent: assign(max_mem, 12000).
% 0.13/0.34 dependent: assign(pick_given_ratio, 4).
% 0.13/0.34 dependent: assign(stats_level, 1).
% 0.13/0.34 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.34 dependent: assign(sos_limit, 5000).
% 0.13/0.34 dependent: assign(max_weight, 60).
% 0.13/0.34 clear(print_given).
% 0.13/0.34
% 0.13/0.34 list(usable).
% 0.13/0.34
% 0.13/0.34 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 0.13/0.34
% 0.13/0.34 This ia a non-Horn set with equality. The strategy will be
% 0.13/0.34 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.34 unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.34 clauses in usable.
% 0.13/0.34
% 0.13/0.34 dependent: set(knuth_bendix).
% 0.13/0.34 dependent: set(para_from).
% 0.13/0.34 dependent: set(para_into).
% 0.13/0.34 dependent: clear(para_from_right).
% 0.13/0.34 dependent: clear(para_into_right).
% 0.13/0.34 dependent: set(para_from_vars).
% 0.13/0.34 dependent: set(eq_units_both_ways).
% 0.13/0.34 dependent: set(dynamic_demod_all).
% 0.13/0.34 dependent: set(dynamic_demod).
% 0.13/0.34 dependent: set(order_eq).
% 0.13/0.34 dependent: set(back_demod).
% 0.13/0.34 dependent: set(lrpo).
% 0.13/0.34 dependent: set(hyper_res).
% 0.13/0.34 dependent: set(unit_deletion).
% 0.13/0.34 dependent: set(factor).
% 0.13/0.34
% 0.13/0.34 ------------> process usable:
% 0.13/0.34
% 0.13/0.34 ------------> process sos:
% 0.13/0.34 Following clause subsumed by 30 during input processing: 0 [copy,30,flip.1] {-} A=A.
% 0.13/0.34
% 0.13/0.34 ======= end of input processing =======
% 0.13/0.37
% 0.13/0.37 Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.37
% 0.13/0.37 Stopped by limit on number of solutions
% 0.13/0.37
% 0.13/0.37
% 0.13/0.37 -------------- Softie stats --------------
% 0.13/0.37
% 0.13/0.37 UPDATE_STOP: 300
% 0.13/0.37 SFINDER_TIME_LIMIT: 2
% 0.13/0.37 SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.37 number of clauses in intial UL: 17
% 0.13/0.37 number of clauses initially in problem: 30
% 0.13/0.37 percentage of clauses intially in UL: 56
% 0.13/0.37 percentage of distinct symbols occuring in initial UL: 76
% 0.13/0.37 percent of all initial clauses that are short: 100
% 0.13/0.37 absolute distinct symbol count: 17
% 0.13/0.37 distinct predicate count: 9
% 0.13/0.37 distinct function count: 3
% 0.13/0.37 distinct constant count: 5
% 0.13/0.37
% 0.13/0.37 ---------- no more Softie stats ----------
% 0.13/0.37
% 0.13/0.37
% 0.13/0.37
% 0.13/0.37 =========== start of search ===========
% 0.91/1.11
% 0.91/1.11 -------- PROOF --------
% 0.91/1.11 % SZS status Unsatisfiable
% 0.91/1.11 % SZS output start Refutation
% 0.91/1.11
% 0.91/1.11 Model 2 (0.00 seconds, 0 Inserts)
% 0.91/1.11
% 0.91/1.11 Stopped by limit on number of solutions
% 0.91/1.11
% 0.91/1.11 Model 3 (0.00 seconds, 0 Inserts)
% 0.91/1.11
% 0.91/1.11 Stopped by limit on number of solutions
% 0.91/1.11
% 0.91/1.11 Model 4 (0.00 seconds, 0 Inserts)
% 0.91/1.11
% 0.91/1.11 Stopped by limit on number of solutions
% 0.91/1.11
% 0.91/1.11 Model 5 (0.00 seconds, 0 Inserts)
% 0.91/1.11
% 0.91/1.11 Stopped by limit on number of solutions
% 0.91/1.11
% 0.91/1.11 Model 6 (0.00 seconds, 0 Inserts)
% 0.91/1.11
% 0.91/1.11 Stopped by limit on number of solutions
% 0.91/1.11
% 0.91/1.11 Model 7 (0.00 seconds, 0 Inserts)
% 0.91/1.11
% 0.91/1.11 Stopped by limit on number of solutions
% 0.91/1.11
% 0.91/1.11 Model 8 (0.00 seconds, 0 Inserts)
% 0.91/1.11
% 0.91/1.11 Stopped by limit on number of solutions
% 0.91/1.11
% 0.91/1.11 Stopped by limit on insertions
% 0.91/1.11
% 0.91/1.11 Model 9 [ 1 0 591 ] (0.00 seconds, 250000 Inserts)
% 0.91/1.11
% 0.91/1.11 ----> UNIT CONFLICT at 0.74 sec ----> 2607 [binary,2606.1,2592.1] {-} $F.
% 0.91/1.11
% 0.91/1.11 Length of proof is 26. Level of proof is 13.
% 0.91/1.11
% 0.91/1.11 ---------------- PROOF ----------------
% 0.91/1.11 % SZS status Unsatisfiable
% 0.91/1.11 % SZS output start Refutation
% 0.91/1.11
% 0.91/1.11 2 [] {+} -smaller(A,B)|smaller_or_equal(A,B).
% 0.91/1.11 3 [] {+} A!=B|smaller_or_equal(A,B).
% 0.91/1.11 4 [] {+} -greater_or_equal(A,B)|greater(A,B)|A=B.
% 0.91/1.11 6 [] {+} A!=B|greater_or_equal(A,B).
% 0.91/1.11 7 [] {+} -smaller(A,B)|greater(B,A).
% 0.91/1.11 8 [] {+} -greater(A,B)|smaller(B,A).
% 0.91/1.11 9 [] {+} -greater(A,B)| -greater(B,A).
% 0.91/1.11 10 [] {+} -greater(A,B)| -greater(B,C)|greater(A,C).
% 0.91/1.11 11 [] {+} -fragile_position(A)| -smaller_or_equal(age(A,B),sigma)|positional_advantage(A,B).
% 0.91/1.11 14 [] {+} -robust_position(A)| -smaller_or_equal(age(A,B),tau)| -positional_advantage(A,B).
% 0.91/1.11 17 [factor,9.1.2] {+} -greater(A,A).
% 0.91/1.11 18 [] {+} smaller(A,B)|A=B|greater(A,B).
% 0.91/1.11 25,24 [] {-} age(sk3,sk4)=zero.
% 0.91/1.11 26 [] {+} greater_or_equal(sigma,zero).
% 0.91/1.11 27 [] {+} greater_or_equal(tau,zero).
% 0.91/1.11 28 [] {+} fragile_position(sk3).
% 0.91/1.11 29 [] {+} robust_position(sk3).
% 0.91/1.11 30 [] {+} A=A.
% 0.91/1.11 31 [hyper,18,7] {+} A=B|greater(A,B)|greater(B,A).
% 0.91/1.11 32 [hyper,18,2] {+} A=B|greater(A,B)|smaller_or_equal(A,B).
% 0.91/1.11 58 [hyper,26,4,flip.2] {+} greater(sigma,zero)|zero=sigma.
% 0.91/1.11 91 [para_into,24.1.1.2,4.3.1] {-} age(sk3,A)=zero| -greater_or_equal(sk4,A)|greater(sk4,A).
% 0.91/1.11 97 [para_from,24.1.1,14.2.1,unit_del,29] {+} -smaller_or_equal(zero,tau)| -positional_advantage(sk3,sk4).
% 0.91/1.11 99 [para_from,24.1.1,11.2.1,unit_del,28] {-} -smaller_or_equal(zero,sigma)|positional_advantage(sk3,sk4).
% 0.91/1.11 112 [hyper,27,4,flip.2] {+} greater(tau,zero)|zero=tau.
% 0.91/1.11 163 [hyper,30,6] {+} greater_or_equal(A,A).
% 0.91/1.11 164 [hyper,30,3] {+} smaller_or_equal(A,A).
% 0.91/1.11 222 [para_from,91.1.1,14.2.1,unit_del,29] {-} -smaller_or_equal(zero,tau)| -positional_advantage(sk3,A)| -greater_or_equal(sk4,A)|greater(sk4,A).
% 0.91/1.11 374 [para_from,31.1.1,99.1.1] {-} -smaller_or_equal(A,sigma)|positional_advantage(sk3,sk4)|greater(zero,A)|greater(A,zero).
% 0.91/1.11 520 [para_from,58.2.1,99.1.1,unit_del,164] {-} positional_advantage(sk3,sk4)|greater(sigma,zero).
% 0.91/1.11 540 [hyper,32,14,29,520,demod,25,25] {-} zero=tau|greater(zero,tau)|greater(sigma,zero).
% 0.91/1.11 675 [para_into,540.2.1,58.2.1,factor_simp] {-} zero=tau|greater(sigma,tau)|greater(sigma,zero).
% 0.91/1.11 1200 [hyper,112,10,675,factor_simp,factor_simp] {-} zero=tau|greater(sigma,zero).
% 0.91/1.11 1209 [hyper,112,8] {+} zero=tau|smaller(zero,tau).
% 0.91/1.11 1268 [para_from,1200.1.1,97.1.1,unit_del,164] {+} -positional_advantage(sk3,sk4)|greater(sigma,zero).
% 0.91/1.11 2366 [hyper,1268,520,factor_simp] {+} greater(sigma,zero).
% 0.91/1.11 2375 [hyper,2366,8] {+} smaller(zero,sigma).
% 0.91/1.11 2437 [hyper,2375,2] {+} smaller_or_equal(zero,sigma).
% 0.91/1.11 2548 [hyper,2437,374,unit_del,17,17] {-} positional_advantage(sk3,sk4).
% 0.91/1.11 2580 [para_into,222.3.1,31.1.1] {-} -smaller_or_equal(zero,tau)| -positional_advantage(sk3,A)| -greater_or_equal(B,A)|greater(sk4,A)|greater(sk4,B)|greater(B,sk4).
% 0.91/1.11 2592 [factor,2580.4.6,unit_del,2548,163,17,17] {+} -smaller_or_equal(zero,tau).
% 0.91/1.11 2594 [para_into,2592.1.1,1209.1.1,unit_del,164] {+} smaller(zero,tau).
% 0.91/1.11 2606 [hyper,2594,2] {-} smaller_or_equal(zero,tau).
% 0.91/1.11 2607 [binary,2606.1,2592.1] {-} $F.
% 0.91/1.11
% 0.91/1.11 % SZS output end Refutation
% 0.91/1.11 ------------ end of proof -------------
% 0.91/1.11
% 0.91/1.11
% 0.91/1.11 Search stopped by max_proofs option.
% 0.91/1.11
% 0.91/1.11
% 0.91/1.11 Search stopped by max_proofs option.
% 0.91/1.11
% 0.91/1.11 ============ end of search ============
% 0.91/1.11
% 0.91/1.11 ----------- soft-scott stats ----------
% 0.91/1.11
% 0.91/1.11 true clauses given 35 (35.0%)
% 0.91/1.11 false clauses given 65
% 0.91/1.11
% 0.91/1.11 FALSE TRUE
% 0.91/1.11 3 1 1
% 0.91/1.11 6 1 1
% 0.91/1.11 8 0 14
% 0.91/1.11 9 12 62
% 0.91/1.11 11 0 15
% 0.91/1.11 12 2 87
% 0.91/1.11 13 0 3
% 0.91/1.11 14 1 19
% 0.91/1.11 15 0 22
% 0.91/1.11 16 0 12
% 0.91/1.11 17 104 46
% 0.91/1.11 18 127 86
% 0.91/1.11 19 50 54
% 0.91/1.11 20 1 33
% 0.91/1.11 21 6 37
% 0.91/1.11 22 0 55
% 0.91/1.11 23 0 25
% 0.91/1.11 24 0 55
% 0.91/1.11 25 0 42
% 0.91/1.11 26 0 73
% 0.91/1.11 27 0 55
% 0.91/1.11 28 0 43
% 0.91/1.11 29 0 10
% 0.91/1.11 30 2 24
% 0.91/1.11 31 2 7
% 0.91/1.11 33 0 8
% 0.91/1.11 tot: 309 889 (74.2% true)
% 0.91/1.11
% 0.91/1.11
% 0.91/1.11 Model 9 [ 1 0 591 ] (0.00 seconds, 250000 Inserts)
% 0.91/1.11
% 0.91/1.11 That finishes the proof of the theorem.
% 0.91/1.11
% 0.91/1.11 Process 3483 finished Thu Jun 9 12:09:37 2022
%------------------------------------------------------------------------------