TSTP Solution File: MGT027-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : MGT027-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-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 : 300s
% DateTime : Wed Jul 27 13:06:04 EDT 2022
% Result : Unsatisfiable 4.71s 4.95s
% Output : Refutation 4.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 17
% Syntax : Number of clauses : 51 ( 14 unt; 26 nHn; 49 RR)
% Number of literals : 124 ( 5 equ; 38 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-4 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 29 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ environment(A)
| ~ stable(A)
| ~ in_environment(A,B)
| greater(cardinality_at_time(first_movers,sk1(B,A)),zero)
| contracts_from(B,first_movers) ),
file('MGT027-1.p',unknown),
[] ).
cnf(2,axiom,
( ~ environment(A)
| ~ stable(A)
| ~ in_environment(A,B)
| greater_or_e_qual(sk1(B,A),B)
| contracts_from(B,first_movers) ),
file('MGT027-1.p',unknown),
[] ).
cnf(3,axiom,
( ~ environment(A)
| ~ stable(A)
| ~ in_environment(A,B)
| ~ greater(zero,growth_rate(first_movers,sk1(B,A)))
| contracts_from(B,first_movers) ),
file('MGT027-1.p',unknown),
[] ).
cnf(4,axiom,
( ~ environment(A)
| ~ in_environment(A,B)
| ~ greater(cardinality_at_time(first_movers,B),zero)
| ~ greater(cardinality_at_time(efficient_producers,B),zero)
| subpopulations(first_movers,efficient_producers,A,B) ),
file('MGT027-1.p',unknown),
[] ).
cnf(5,axiom,
( ~ environment(A)
| ~ stable(A)
| ~ in_environment(A,B)
| ~ greater(C,B)
| in_environment(A,C) ),
file('MGT027-1.p',unknown),
[] ).
cnf(6,axiom,
( ~ environment(A)
| ~ stable(A)
| in_environment(A,appear(efficient_producers,A)) ),
file('MGT027-1.p',unknown),
[] ).
cnf(7,axiom,
( ~ greater(A,B)
| ~ greater(B,C)
| greater(A,C) ),
file('MGT027-1.p',unknown),
[] ).
cnf(8,axiom,
( ~ greater_or_e_qual(A,B)
| greater(A,B)
| A = B ),
file('MGT027-1.p',unknown),
[] ).
cnf(9,axiom,
( ~ greater(A,B)
| greater_or_e_qual(A,B) ),
file('MGT027-1.p',unknown),
[] ).
cnf(10,axiom,
( A != B
| greater_or_e_qual(A,B) ),
file('MGT027-1.p',unknown),
[] ).
cnf(11,axiom,
( ~ environment(A)
| ~ in_environment(A,B)
| ~ greater_or_e_qual(B,appear(efficient_producers,A))
| greater(cardinality_at_time(efficient_producers,B),zero) ),
file('MGT027-1.p',unknown),
[] ).
cnf(12,axiom,
( ~ environment(A)
| ~ stable(A)
| greater(sk2(A),appear(efficient_producers,A)) ),
file('MGT027-1.p',unknown),
[] ).
cnf(13,axiom,
( ~ environment(A)
| ~ stable(A)
| ~ subpopulations(first_movers,efficient_producers,A,B)
| ~ greater_or_e_qual(B,sk2(A))
| greater(zero,growth_rate(first_movers,B)) ),
file('MGT027-1.p',unknown),
[] ).
cnf(14,axiom,
( ~ greater(A,appear(efficient_producers,sk3))
| ~ contracts_from(A,first_movers) ),
file('MGT027-1.p',unknown),
[] ).
cnf(15,axiom,
A = A,
file('MGT027-1.p',unknown),
[] ).
cnf(16,axiom,
environment(sk3),
file('MGT027-1.p',unknown),
[] ).
cnf(17,axiom,
stable(sk3),
file('MGT027-1.p',unknown),
[] ).
cnf(18,plain,
greater_or_e_qual(A,A),
inference(hyper,[status(thm)],[15,10]),
[iquote('hyper,15,10')] ).
cnf(20,plain,
greater(sk2(sk3),appear(efficient_producers,sk3)),
inference(hyper,[status(thm)],[17,12,16]),
[iquote('hyper,17,12,16')] ).
cnf(21,plain,
in_environment(sk3,appear(efficient_producers,sk3)),
inference(hyper,[status(thm)],[17,6,16]),
[iquote('hyper,17,6,16')] ).
cnf(32,plain,
greater_or_e_qual(sk2(sk3),appear(efficient_producers,sk3)),
inference(hyper,[status(thm)],[20,9]),
[iquote('hyper,20,9')] ).
cnf(33,plain,
in_environment(sk3,sk2(sk3)),
inference(hyper,[status(thm)],[20,5,16,17,21]),
[iquote('hyper,20,5,16,17,21')] ).
cnf(39,plain,
( greater_or_e_qual(sk1(sk2(sk3),sk3),sk2(sk3))
| contracts_from(sk2(sk3),first_movers) ),
inference(hyper,[status(thm)],[33,2,16,17]),
[iquote('hyper,33,2,16,17')] ).
cnf(40,plain,
( greater(cardinality_at_time(first_movers,sk1(sk2(sk3),sk3)),zero)
| contracts_from(sk2(sk3),first_movers) ),
inference(hyper,[status(thm)],[33,1,16,17]),
[iquote('hyper,33,1,16,17')] ).
cnf(44,plain,
greater(cardinality_at_time(efficient_producers,sk2(sk3)),zero),
inference(hyper,[status(thm)],[32,11,16,33]),
[iquote('hyper,32,11,16,33')] ).
cnf(126,plain,
( contracts_from(sk2(sk3),first_movers)
| greater(sk1(sk2(sk3),sk3),sk2(sk3))
| sk1(sk2(sk3),sk3) = sk2(sk3) ),
inference(hyper,[status(thm)],[39,8]),
[iquote('hyper,39,8')] ).
cnf(1816,plain,
( contracts_from(sk2(sk3),first_movers)
| sk1(sk2(sk3),sk3) = sk2(sk3)
| in_environment(sk3,sk1(sk2(sk3),sk3)) ),
inference(hyper,[status(thm)],[126,5,16,17,33]),
[iquote('hyper,126,5,16,17,33')] ).
cnf(1834,plain,
( greater(cardinality_at_time(first_movers,sk2(sk3)),zero)
| contracts_from(sk2(sk3),first_movers)
| greater(sk1(sk2(sk3),sk3),sk2(sk3)) ),
inference(factor_simp,[status(thm)],[inference(para_from,[status(thm),theory(equality)],[126,40])]),
[iquote('para_from,126.3.1,40.1.1.2,factor_simp')] ).
cnf(1835,plain,
( ~ greater(zero,growth_rate(first_movers,sk2(sk3)))
| contracts_from(sk2(sk3),first_movers)
| greater(sk1(sk2(sk3),sk3),sk2(sk3)) ),
inference(factor_simp,[status(thm)],[inference(unit_del,[status(thm)],[inference(para_from,[status(thm),theory(equality)],[126,3]),16,17,33])]),
[iquote('para_from,126.3.1,3.4.2.2,unit_del,16,17,33,factor_simp')] ).
cnf(2133,plain,
( ~ greater(zero,growth_rate(first_movers,sk2(sk3)))
| contracts_from(sk2(sk3),first_movers)
| in_environment(sk3,sk1(sk2(sk3),sk3)) ),
inference(factor_simp,[status(thm)],[inference(unit_del,[status(thm)],[inference(para_from,[status(thm),theory(equality)],[1816,3]),16,17,33])]),
[iquote('para_from,1816.2.1,3.4.2.2,unit_del,16,17,33,factor_simp')] ).
cnf(2197,plain,
( contracts_from(sk2(sk3),first_movers)
| greater(sk1(sk2(sk3),sk3),sk2(sk3))
| subpopulations(first_movers,efficient_producers,sk3,sk2(sk3)) ),
inference(hyper,[status(thm)],[1834,4,16,33,44]),
[iquote('hyper,1834,4,16,33,44')] ).
cnf(2418,plain,
( contracts_from(sk2(sk3),first_movers)
| subpopulations(first_movers,efficient_producers,sk3,sk2(sk3))
| greater(sk1(sk2(sk3),sk3),appear(efficient_producers,sk3)) ),
inference(hyper,[status(thm)],[2197,7,20]),
[iquote('hyper,2197,7,20')] ).
cnf(2419,plain,
( contracts_from(sk2(sk3),first_movers)
| subpopulations(first_movers,efficient_producers,sk3,sk2(sk3))
| in_environment(sk3,sk1(sk2(sk3),sk3)) ),
inference(hyper,[status(thm)],[2197,5,16,17,33]),
[iquote('hyper,2197,5,16,17,33')] ).
cnf(3390,plain,
( contracts_from(sk2(sk3),first_movers)
| subpopulations(first_movers,efficient_producers,sk3,sk2(sk3))
| greater_or_e_qual(sk1(sk2(sk3),sk3),appear(efficient_producers,sk3)) ),
inference(hyper,[status(thm)],[2418,9]),
[iquote('hyper,2418,9')] ).
cnf(3392,plain,
( contracts_from(sk2(sk3),first_movers)
| subpopulations(first_movers,efficient_producers,sk3,sk2(sk3))
| greater(cardinality_at_time(efficient_producers,sk1(sk2(sk3),sk3)),zero) ),
inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[3390,11,16,2419])])]),
[iquote('hyper,3390,11,16,2419,factor_simp,factor_simp')] ).
cnf(3397,plain,
( contracts_from(sk2(sk3),first_movers)
| subpopulations(first_movers,efficient_producers,sk3,sk2(sk3))
| subpopulations(first_movers,efficient_producers,sk3,sk1(sk2(sk3),sk3)) ),
inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[3392,4,16,2419,40])])])]),
[iquote('hyper,3392,4,16,2419,40,factor_simp,factor_simp,factor_simp')] ).
cnf(3399,plain,
( subpopulations(first_movers,efficient_producers,sk3,sk2(sk3))
| subpopulations(first_movers,efficient_producers,sk3,sk1(sk2(sk3),sk3)) ),
inference(hyper,[status(thm)],[3397,14,20]),
[iquote('hyper,3397,14,20')] ).
cnf(3401,plain,
( subpopulations(first_movers,efficient_producers,sk3,sk2(sk3))
| greater(zero,growth_rate(first_movers,sk1(sk2(sk3),sk3)))
| contracts_from(sk2(sk3),first_movers) ),
inference(hyper,[status(thm)],[3399,13,16,17,39]),
[iquote('hyper,3399,13,16,17,39')] ).
cnf(3434,plain,
( subpopulations(first_movers,efficient_producers,sk3,sk2(sk3))
| contracts_from(sk2(sk3),first_movers) ),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[3401,3,16,17,33])]),
[iquote('hyper,3401,3,16,17,33,factor_simp')] ).
cnf(3435,plain,
subpopulations(first_movers,efficient_producers,sk3,sk2(sk3)),
inference(hyper,[status(thm)],[3434,14,20]),
[iquote('hyper,3434,14,20')] ).
cnf(3436,plain,
greater(zero,growth_rate(first_movers,sk2(sk3))),
inference(hyper,[status(thm)],[3435,13,16,17,18]),
[iquote('hyper,3435,13,16,17,18')] ).
cnf(3442,plain,
( contracts_from(sk2(sk3),first_movers)
| in_environment(sk3,sk1(sk2(sk3),sk3)) ),
inference(hyper,[status(thm)],[3436,2133]),
[iquote('hyper,3436,2133')] ).
cnf(3443,plain,
( contracts_from(sk2(sk3),first_movers)
| greater(sk1(sk2(sk3),sk3),sk2(sk3)) ),
inference(hyper,[status(thm)],[3436,1835]),
[iquote('hyper,3436,1835')] ).
cnf(3504,plain,
( contracts_from(sk2(sk3),first_movers)
| greater(sk1(sk2(sk3),sk3),appear(efficient_producers,sk3)) ),
inference(hyper,[status(thm)],[3443,7,20]),
[iquote('hyper,3443,7,20')] ).
cnf(3557,plain,
( contracts_from(sk2(sk3),first_movers)
| greater_or_e_qual(sk1(sk2(sk3),sk3),appear(efficient_producers,sk3)) ),
inference(hyper,[status(thm)],[3504,9]),
[iquote('hyper,3504,9')] ).
cnf(3572,plain,
( contracts_from(sk2(sk3),first_movers)
| greater(cardinality_at_time(efficient_producers,sk1(sk2(sk3),sk3)),zero) ),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[3557,11,16,3442])]),
[iquote('hyper,3557,11,16,3442,factor_simp')] ).
cnf(3584,plain,
( contracts_from(sk2(sk3),first_movers)
| subpopulations(first_movers,efficient_producers,sk3,sk1(sk2(sk3),sk3)) ),
inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[3572,4,16,3442,40])])]),
[iquote('hyper,3572,4,16,3442,40,factor_simp,factor_simp')] ).
cnf(3601,plain,
subpopulations(first_movers,efficient_producers,sk3,sk1(sk2(sk3),sk3)),
inference(hyper,[status(thm)],[3584,14,20]),
[iquote('hyper,3584,14,20')] ).
cnf(3602,plain,
( greater(zero,growth_rate(first_movers,sk1(sk2(sk3),sk3)))
| contracts_from(sk2(sk3),first_movers) ),
inference(hyper,[status(thm)],[3601,13,16,17,39]),
[iquote('hyper,3601,13,16,17,39')] ).
cnf(3615,plain,
contracts_from(sk2(sk3),first_movers),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[3602,3,16,17,33])]),
[iquote('hyper,3602,3,16,17,33,factor_simp')] ).
cnf(3616,plain,
$false,
inference(hyper,[status(thm)],[3615,14,20]),
[iquote('hyper,3615,14,20')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : MGT027-1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n023.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 : 300
% 0.12/0.33 % DateTime : Wed Jul 27 04:22:03 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.93/2.13 ----- Otter 3.3f, August 2004 -----
% 1.93/2.13 The process was started by sandbox on n023.cluster.edu,
% 1.93/2.13 Wed Jul 27 04:22:03 2022
% 1.93/2.13 The command was "./otter". The process ID is 8709.
% 1.93/2.13
% 1.93/2.13 set(prolog_style_variables).
% 1.93/2.13 set(auto).
% 1.93/2.13 dependent: set(auto1).
% 1.93/2.13 dependent: set(process_input).
% 1.93/2.13 dependent: clear(print_kept).
% 1.93/2.13 dependent: clear(print_new_demod).
% 1.93/2.13 dependent: clear(print_back_demod).
% 1.93/2.13 dependent: clear(print_back_sub).
% 1.93/2.13 dependent: set(control_memory).
% 1.93/2.13 dependent: assign(max_mem, 12000).
% 1.93/2.13 dependent: assign(pick_given_ratio, 4).
% 1.93/2.13 dependent: assign(stats_level, 1).
% 1.93/2.13 dependent: assign(max_seconds, 10800).
% 1.93/2.13 clear(print_given).
% 1.93/2.13
% 1.93/2.13 list(usable).
% 1.93/2.13 0 [] A=A.
% 1.93/2.13 0 [] -environment(A)| -stable(A)| -in_environment(A,B)|greater(cardinality_at_time(first_movers,sk1(B,A)),zero)|contracts_from(B,first_movers).
% 1.93/2.13 0 [] -environment(A)| -stable(A)| -in_environment(A,B)|greater_or_e_qual(sk1(B,A),B)|contracts_from(B,first_movers).
% 1.93/2.13 0 [] -environment(A)| -stable(A)| -in_environment(A,B)| -greater(zero,growth_rate(first_movers,sk1(B,A)))|contracts_from(B,first_movers).
% 1.93/2.13 0 [] -environment(A)| -in_environment(A,B)| -greater(cardinality_at_time(first_movers,B),zero)| -greater(cardinality_at_time(efficient_producers,B),zero)|subpopulations(first_movers,efficient_producers,A,B).
% 1.93/2.13 0 [] -environment(A)| -stable(A)| -in_environment(A,B)| -greater(C,B)|in_environment(A,C).
% 1.93/2.13 0 [] -environment(A)| -stable(A)|in_environment(A,appear(efficient_producers,A)).
% 1.93/2.13 0 [] -greater(A,B)| -greater(B,C)|greater(A,C).
% 1.93/2.13 0 [] -greater_or_e_qual(A,B)|greater(A,B)|A=B.
% 1.93/2.13 0 [] -greater(A,B)|greater_or_e_qual(A,B).
% 1.93/2.13 0 [] A!=B|greater_or_e_qual(A,B).
% 1.93/2.13 0 [] -environment(A)| -in_environment(A,B)| -greater_or_e_qual(B,appear(efficient_producers,A))|greater(cardinality_at_time(efficient_producers,B),zero).
% 1.93/2.13 0 [] -environment(A)| -stable(A)|greater(sk2(A),appear(efficient_producers,A)).
% 1.93/2.13 0 [] -environment(A)| -stable(A)| -subpopulations(first_movers,efficient_producers,A,B)| -greater_or_e_qual(B,sk2(A))|greater(zero,growth_rate(first_movers,B)).
% 1.93/2.13 0 [] environment(sk3).
% 1.93/2.13 0 [] stable(sk3).
% 1.93/2.13 0 [] -greater(A,appear(efficient_producers,sk3))| -contracts_from(A,first_movers).
% 1.93/2.13 end_of_list.
% 1.93/2.13
% 1.93/2.13 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 1.93/2.13
% 1.93/2.13 This ia a non-Horn set with equality. The strategy will be
% 1.93/2.13 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.93/2.13 deletion, with positive clauses in sos and nonpositive
% 1.93/2.13 clauses in usable.
% 1.93/2.13
% 1.93/2.13 dependent: set(knuth_bendix).
% 1.93/2.13 dependent: set(anl_eq).
% 1.93/2.13 dependent: set(para_from).
% 1.93/2.13 dependent: set(para_into).
% 1.93/2.13 dependent: clear(para_from_right).
% 1.93/2.13 dependent: clear(para_into_right).
% 1.93/2.13 dependent: set(para_from_vars).
% 1.93/2.13 dependent: set(eq_units_both_ways).
% 1.93/2.13 dependent: set(dynamic_demod_all).
% 1.93/2.13 dependent: set(dynamic_demod).
% 1.93/2.13 dependent: set(order_eq).
% 1.93/2.13 dependent: set(back_demod).
% 1.93/2.13 dependent: set(lrpo).
% 1.93/2.13 dependent: set(hyper_res).
% 1.93/2.13 dependent: set(unit_deletion).
% 1.93/2.13 dependent: set(factor).
% 1.93/2.13
% 1.93/2.13 ------------> process usable:
% 1.93/2.13 ** KEPT (pick-wt=17): 1 [] -environment(A)| -stable(A)| -in_environment(A,B)|greater(cardinality_at_time(first_movers,sk1(B,A)),zero)|contracts_from(B,first_movers).
% 1.93/2.13 ** KEPT (pick-wt=15): 2 [] -environment(A)| -stable(A)| -in_environment(A,B)|greater_or_e_qual(sk1(B,A),B)|contracts_from(B,first_movers).
% 1.93/2.13 ** KEPT (pick-wt=17): 3 [] -environment(A)| -stable(A)| -in_environment(A,B)| -greater(zero,growth_rate(first_movers,sk1(B,A)))|contracts_from(B,first_movers).
% 1.93/2.13 ** KEPT (pick-wt=20): 4 [] -environment(A)| -in_environment(A,B)| -greater(cardinality_at_time(first_movers,B),zero)| -greater(cardinality_at_time(efficient_producers,B),zero)|subpopulations(first_movers,efficient_producers,A,B).
% 1.93/2.13 ** KEPT (pick-wt=13): 5 [] -environment(A)| -stable(A)| -in_environment(A,B)| -greater(C,B)|in_environment(A,C).
% 1.93/2.13 ** KEPT (pick-wt=9): 6 [] -environment(A)| -stable(A)|in_environment(A,appear(efficient_producers,A)).
% 1.93/2.13 ** KEPT (pick-wt=9): 7 [] -greater(A,B)| -greater(B,C)|greater(A,C).
% 1.93/2.13 ** KEPT (pick-wt=9): 8 [] -greater_or_e_qual(A,B)|greater(A,B)|A=B.
% 1.93/2.13 ** KEPT (pick-wt=6): 9 [] -greater(A,B)|greater_or_e_qual(A,B).
% 1.93/2.13 ** KEPT (pick-wt=6): 10 [] A!=B|greater_or_e_qual(A,B).
% 4.71/4.95 ** KEPT (pick-wt=15): 11 [] -environment(A)| -in_environment(A,B)| -greater_or_e_qual(B,appear(efficient_producers,A))|greater(cardinality_at_time(efficient_producers,B),zero).
% 4.71/4.95 ** KEPT (pick-wt=10): 12 [] -environment(A)| -stable(A)|greater(sk2(A),appear(efficient_producers,A)).
% 4.71/4.95 ** KEPT (pick-wt=18): 13 [] -environment(A)| -stable(A)| -subpopulations(first_movers,efficient_producers,A,B)| -greater_or_e_qual(B,sk2(A))|greater(zero,growth_rate(first_movers,B)).
% 4.71/4.95 ** KEPT (pick-wt=8): 14 [] -greater(A,appear(efficient_producers,sk3))| -contracts_from(A,first_movers).
% 4.71/4.95
% 4.71/4.95 ------------> process sos:
% 4.71/4.95 ** KEPT (pick-wt=3): 15 [] A=A.
% 4.71/4.95 ** KEPT (pick-wt=2): 16 [] environment(sk3).
% 4.71/4.95 ** KEPT (pick-wt=2): 17 [] stable(sk3).
% 4.71/4.95 Following clause subsumed by 15 during input processing: 0 [copy,15,flip.1] A=A.
% 4.71/4.95
% 4.71/4.95 ======= end of input processing =======
% 4.71/4.95
% 4.71/4.95 =========== start of search ===========
% 4.71/4.95
% 4.71/4.95
% 4.71/4.95 Resetting weight limit to 20.
% 4.71/4.95
% 4.71/4.95
% 4.71/4.95 Resetting weight limit to 20.
% 4.71/4.95
% 4.71/4.95 sos_size=2838
% 4.71/4.95
% 4.71/4.95
% 4.71/4.95 Resetting weight limit to 19.
% 4.71/4.95
% 4.71/4.95
% 4.71/4.95 Resetting weight limit to 19.
% 4.71/4.95
% 4.71/4.95 sos_size=2761
% 4.71/4.95
% 4.71/4.95 -------- PROOF --------
% 4.71/4.95
% 4.71/4.95 -----> EMPTY CLAUSE at 2.82 sec ----> 3616 [hyper,3615,14,20] $F.
% 4.71/4.95
% 4.71/4.95 Length of proof is 33. Level of proof is 23.
% 4.71/4.95
% 4.71/4.95 ---------------- PROOF ----------------
% 4.71/4.95 % SZS status Unsatisfiable
% 4.71/4.95 % SZS output start Refutation
% See solution above
% 4.71/4.95 ------------ end of proof -------------
% 4.71/4.95
% 4.71/4.95
% 4.71/4.95 Search stopped by max_proofs option.
% 4.71/4.95
% 4.71/4.95
% 4.71/4.95 Search stopped by max_proofs option.
% 4.71/4.95
% 4.71/4.95 ============ end of search ============
% 4.71/4.95
% 4.71/4.95 -------------- statistics -------------
% 4.71/4.95 clauses given 492
% 4.71/4.95 clauses generated 10004
% 4.71/4.95 clauses kept 3615
% 4.71/4.95 clauses forward subsumed 5529
% 4.71/4.95 clauses back subsumed 609
% 4.71/4.95 Kbytes malloced 4882
% 4.71/4.95
% 4.71/4.95 ----------- times (seconds) -----------
% 4.71/4.95 user CPU time 2.82 (0 hr, 0 min, 2 sec)
% 4.71/4.95 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 4.71/4.95 wall-clock time 4 (0 hr, 0 min, 4 sec)
% 4.71/4.95
% 4.71/4.95 That finishes the proof of the theorem.
% 4.71/4.95
% 4.71/4.95 Process 8709 finished Wed Jul 27 04:22:07 2022
% 4.71/4.95 Otter interrupted
% 4.71/4.95 PROOF FOUND
%------------------------------------------------------------------------------