TSTP Solution File: MGT027-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : MGT027-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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 : Tue May 21 00:40:03 EDT 2024
% Result : Unsatisfiable 0.21s 0.50s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 16
% Syntax : Number of clauses : 70 ( 7 unt; 16 nHn; 69 RR)
% Number of literals : 287 ( 12 equ; 202 neg)
% Maximal clause size : 9 ( 4 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 : 119 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(mp_greater_transitivity_30,axiom,
( greater(X1,X3)
| ~ greater(X1,X2)
| ~ greater(X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_greater_transitivity_30) ).
cnf(l10_35,hypothesis,
( greater(sk2(X1),appear(efficient_producers,X1))
| ~ environment(X1)
| ~ stable(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l10_35) ).
cnf(mp_greater_or_equal_31,axiom,
( greater(X1,X2)
| X1 = X2
| ~ greater_or_equal(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_greater_or_equal_31) ).
cnf(mp_contracts_from_25,axiom,
( greater_or_equal(sk1(X2,X1),X2)
| contracts_from(X2,first_movers)
| ~ environment(X1)
| ~ stable(X1)
| ~ in_environment(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_contracts_from_25) ).
cnf(l10_36,hypothesis,
( greater(zero,growth_rate(first_movers,X2))
| ~ environment(X1)
| ~ stable(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ greater_or_equal(X2,sk2(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l10_36) ).
cnf(mp_contracts_from_26,axiom,
( contracts_from(X2,first_movers)
| ~ environment(X1)
| ~ stable(X1)
| ~ in_environment(X1,X2)
| ~ greater(zero,growth_rate(first_movers,sk1(X2,X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_contracts_from_26) ).
cnf(t6_34,hypothesis,
( greater(cardinality_at_time(efficient_producers,X2),zero)
| ~ environment(X1)
| ~ in_environment(X1,X2)
| ~ greater_or_equal(X2,appear(efficient_producers,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t6_34) ).
cnf(mp_greater_or_equal_32,axiom,
( greater_or_equal(X1,X2)
| ~ greater(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_greater_or_equal_32) ).
cnf(mp_non_empty_fm_and_ep_27,axiom,
( subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1)
| ~ in_environment(X1,X2)
| ~ greater(cardinality_at_time(first_movers,X2),zero)
| ~ greater(cardinality_at_time(efficient_producers,X2),zero) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_non_empty_fm_and_ep_27) ).
cnf(mp_contracts_from_24,axiom,
( greater(cardinality_at_time(first_movers,sk1(X2,X1)),zero)
| contracts_from(X2,first_movers)
| ~ environment(X1)
| ~ stable(X1)
| ~ in_environment(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_contracts_from_24) ).
cnf(mp_long_stable_environments_28,axiom,
( in_environment(X1,X3)
| ~ environment(X1)
| ~ stable(X1)
| ~ in_environment(X1,X2)
| ~ greater(X3,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_long_stable_environments_28) ).
cnf(mp_greater_or_equal_33,axiom,
( greater_or_equal(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_greater_or_equal_33) ).
cnf(mp_EP_in_stable_environments_29,axiom,
( in_environment(X1,appear(efficient_producers,X1))
| ~ environment(X1)
| ~ stable(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_EP_in_stable_environments_29) ).
cnf(prove_l9_39,negated_conjecture,
( ~ greater(X1,appear(efficient_producers,sk3))
| ~ contracts_from(X1,first_movers) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_l9_39) ).
cnf(prove_l9_38,negated_conjecture,
stable(sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_l9_38) ).
cnf(prove_l9_37,negated_conjecture,
environment(sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_l9_37) ).
cnf(c_0_16,plain,
( greater(X1,X3)
| ~ greater(X1,X2)
| ~ greater(X2,X3) ),
inference(fof_simplification,[status(thm)],[mp_greater_transitivity_30]) ).
cnf(c_0_17,hypothesis,
( greater(sk2(X1),appear(efficient_producers,X1))
| ~ environment(X1)
| ~ stable(X1) ),
inference(fof_simplification,[status(thm)],[l10_35]) ).
cnf(c_0_18,plain,
( greater(X1,X2)
| X1 = X2
| ~ greater_or_equal(X1,X2) ),
inference(fof_simplification,[status(thm)],[mp_greater_or_equal_31]) ).
cnf(c_0_19,plain,
( greater_or_equal(sk1(X2,X1),X2)
| contracts_from(X2,first_movers)
| ~ environment(X1)
| ~ stable(X1)
| ~ in_environment(X1,X2) ),
inference(fof_simplification,[status(thm)],[mp_contracts_from_25]) ).
cnf(c_0_20,hypothesis,
( greater(zero,growth_rate(first_movers,X2))
| ~ environment(X1)
| ~ stable(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ greater_or_equal(X2,sk2(X1)) ),
inference(fof_simplification,[status(thm)],[l10_36]) ).
cnf(c_0_21,plain,
( contracts_from(X2,first_movers)
| ~ environment(X1)
| ~ stable(X1)
| ~ in_environment(X1,X2)
| ~ greater(zero,growth_rate(first_movers,sk1(X2,X1))) ),
inference(fof_simplification,[status(thm)],[mp_contracts_from_26]) ).
cnf(c_0_22,hypothesis,
( greater(cardinality_at_time(efficient_producers,X2),zero)
| ~ environment(X1)
| ~ in_environment(X1,X2)
| ~ greater_or_equal(X2,appear(efficient_producers,X1)) ),
inference(fof_simplification,[status(thm)],[t6_34]) ).
cnf(c_0_23,plain,
( greater_or_equal(X1,X2)
| ~ greater(X1,X2) ),
inference(fof_simplification,[status(thm)],[mp_greater_or_equal_32]) ).
cnf(c_0_24,plain,
( greater(X1,X3)
| ~ greater(X1,X2)
| ~ greater(X2,X3) ),
c_0_16 ).
cnf(c_0_25,hypothesis,
( greater(sk2(X1),appear(efficient_producers,X1))
| ~ environment(X1)
| ~ stable(X1) ),
c_0_17 ).
cnf(c_0_26,plain,
( greater(X1,X2)
| X1 = X2
| ~ greater_or_equal(X1,X2) ),
c_0_18 ).
cnf(c_0_27,plain,
( greater_or_equal(sk1(X2,X1),X2)
| contracts_from(X2,first_movers)
| ~ environment(X1)
| ~ stable(X1)
| ~ in_environment(X1,X2) ),
c_0_19 ).
cnf(c_0_28,hypothesis,
( greater(zero,growth_rate(first_movers,X2))
| ~ environment(X1)
| ~ stable(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ greater_or_equal(X2,sk2(X1)) ),
c_0_20 ).
cnf(c_0_29,plain,
( contracts_from(X2,first_movers)
| ~ environment(X1)
| ~ stable(X1)
| ~ in_environment(X1,X2)
| ~ greater(zero,growth_rate(first_movers,sk1(X2,X1))) ),
c_0_21 ).
cnf(c_0_30,plain,
( subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1)
| ~ in_environment(X1,X2)
| ~ greater(cardinality_at_time(first_movers,X2),zero)
| ~ greater(cardinality_at_time(efficient_producers,X2),zero) ),
inference(fof_simplification,[status(thm)],[mp_non_empty_fm_and_ep_27]) ).
cnf(c_0_31,plain,
( greater(cardinality_at_time(first_movers,sk1(X2,X1)),zero)
| contracts_from(X2,first_movers)
| ~ environment(X1)
| ~ stable(X1)
| ~ in_environment(X1,X2) ),
inference(fof_simplification,[status(thm)],[mp_contracts_from_24]) ).
cnf(c_0_32,hypothesis,
( greater(cardinality_at_time(efficient_producers,X2),zero)
| ~ environment(X1)
| ~ in_environment(X1,X2)
| ~ greater_or_equal(X2,appear(efficient_producers,X1)) ),
c_0_22 ).
cnf(c_0_33,plain,
( greater_or_equal(X1,X2)
| ~ greater(X1,X2) ),
c_0_23 ).
cnf(c_0_34,hypothesis,
( greater(X1,appear(efficient_producers,X2))
| ~ greater(X1,sk2(X2))
| ~ stable(X2)
| ~ environment(X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_35,plain,
( sk1(X1,X2) = X1
| contracts_from(X1,first_movers)
| greater(sk1(X1,X2),X1)
| ~ in_environment(X2,X1)
| ~ stable(X2)
| ~ environment(X2) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_36,hypothesis,
( contracts_from(sk2(X1),first_movers)
| ~ subpopulations(first_movers,efficient_producers,X1,sk1(sk2(X1),X2))
| ~ in_environment(X2,sk2(X1))
| ~ stable(X1)
| ~ stable(X2)
| ~ environment(X1)
| ~ environment(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_27]),c_0_29]) ).
cnf(c_0_37,plain,
( subpopulations(first_movers,efficient_producers,X1,X2)
| ~ environment(X1)
| ~ in_environment(X1,X2)
| ~ greater(cardinality_at_time(first_movers,X2),zero)
| ~ greater(cardinality_at_time(efficient_producers,X2),zero) ),
c_0_30 ).
cnf(c_0_38,plain,
( greater(cardinality_at_time(first_movers,sk1(X2,X1)),zero)
| contracts_from(X2,first_movers)
| ~ environment(X1)
| ~ stable(X1)
| ~ in_environment(X1,X2) ),
c_0_31 ).
cnf(c_0_39,plain,
( in_environment(X1,X3)
| ~ environment(X1)
| ~ stable(X1)
| ~ in_environment(X1,X2)
| ~ greater(X3,X2) ),
inference(fof_simplification,[status(thm)],[mp_long_stable_environments_28]) ).
cnf(c_0_40,plain,
( greater_or_equal(X1,X2)
| X1 != X2 ),
inference(fof_simplification,[status(thm)],[mp_greater_or_equal_33]) ).
cnf(c_0_41,hypothesis,
( greater(cardinality_at_time(efficient_producers,X1),zero)
| ~ greater(X1,appear(efficient_producers,X2))
| ~ in_environment(X2,X1)
| ~ environment(X2) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_42,hypothesis,
( sk1(sk2(X1),X2) = sk2(X1)
| contracts_from(sk2(X1),first_movers)
| greater(sk1(sk2(X1),X2),appear(efficient_producers,X1))
| ~ in_environment(X2,sk2(X1))
| ~ stable(X1)
| ~ stable(X2)
| ~ environment(X1)
| ~ environment(X2) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_43,hypothesis,
( contracts_from(sk2(X1),first_movers)
| ~ greater(cardinality_at_time(efficient_producers,sk1(sk2(X1),X2)),zero)
| ~ in_environment(X1,sk1(sk2(X1),X2))
| ~ in_environment(X2,sk2(X1))
| ~ stable(X1)
| ~ stable(X2)
| ~ environment(X1)
| ~ environment(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]) ).
cnf(c_0_44,plain,
( in_environment(X1,X3)
| ~ environment(X1)
| ~ stable(X1)
| ~ in_environment(X1,X2)
| ~ greater(X3,X2) ),
c_0_39 ).
cnf(c_0_45,plain,
( greater_or_equal(X1,X2)
| X1 != X2 ),
c_0_40 ).
cnf(c_0_46,plain,
( in_environment(X1,appear(efficient_producers,X1))
| ~ environment(X1)
| ~ stable(X1) ),
inference(fof_simplification,[status(thm)],[mp_EP_in_stable_environments_29]) ).
cnf(c_0_47,hypothesis,
( sk1(sk2(X1),X2) = sk2(X1)
| contracts_from(sk2(X1),first_movers)
| ~ in_environment(X1,sk1(sk2(X1),X2))
| ~ in_environment(X2,sk2(X1))
| ~ stable(X1)
| ~ stable(X2)
| ~ environment(X1)
| ~ environment(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]) ).
cnf(c_0_48,plain,
( sk1(X1,X2) = X1
| contracts_from(X1,first_movers)
| in_environment(X3,sk1(X1,X2))
| ~ in_environment(X3,X1)
| ~ in_environment(X2,X1)
| ~ stable(X3)
| ~ stable(X2)
| ~ environment(X3)
| ~ environment(X2) ),
inference(spm,[status(thm)],[c_0_44,c_0_35]) ).
cnf(c_0_49,plain,
greater_or_equal(X1,X1),
inference(er,[status(thm)],[c_0_45]) ).
cnf(c_0_50,hypothesis,
( greater(cardinality_at_time(efficient_producers,sk2(X1)),zero)
| ~ in_environment(X1,sk2(X1))
| ~ stable(X1)
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_41,c_0_25]) ).
cnf(c_0_51,hypothesis,
( in_environment(X1,sk2(X2))
| ~ in_environment(X1,appear(efficient_producers,X2))
| ~ stable(X1)
| ~ stable(X2)
| ~ environment(X1)
| ~ environment(X2) ),
inference(spm,[status(thm)],[c_0_44,c_0_25]) ).
cnf(c_0_52,plain,
( in_environment(X1,appear(efficient_producers,X1))
| ~ environment(X1)
| ~ stable(X1) ),
c_0_46 ).
cnf(c_0_53,hypothesis,
( sk1(sk2(X1),X2) = sk2(X1)
| contracts_from(sk2(X1),first_movers)
| ~ in_environment(X2,sk2(X1))
| ~ in_environment(X1,sk2(X1))
| ~ stable(X1)
| ~ stable(X2)
| ~ environment(X1)
| ~ environment(X2) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_54,hypothesis,
( greater(zero,growth_rate(first_movers,sk2(X1)))
| ~ subpopulations(first_movers,efficient_producers,X1,sk2(X1))
| ~ stable(X1)
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_49]) ).
cnf(c_0_55,hypothesis,
( greater(cardinality_at_time(efficient_producers,sk2(X1)),zero)
| ~ stable(X1)
| ~ environment(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52]) ).
cnf(c_0_56,hypothesis,
( sk1(sk2(X1),X2) = sk2(X1)
| contracts_from(sk2(X1),first_movers)
| ~ in_environment(X2,sk2(X1))
| ~ stable(X1)
| ~ stable(X2)
| ~ environment(X1)
| ~ environment(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_51]),c_0_52]) ).
cnf(c_0_57,hypothesis,
( greater(zero,growth_rate(first_movers,sk2(X1)))
| ~ greater(cardinality_at_time(first_movers,sk2(X1)),zero)
| ~ in_environment(X1,sk2(X1))
| ~ stable(X1)
| ~ environment(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_37]),c_0_55]) ).
cnf(c_0_58,hypothesis,
( contracts_from(sk2(X1),first_movers)
| ~ greater(zero,growth_rate(first_movers,sk2(X1)))
| ~ in_environment(X2,sk2(X1))
| ~ stable(X2)
| ~ stable(X1)
| ~ environment(X2)
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_56]) ).
cnf(c_0_59,hypothesis,
( greater(zero,growth_rate(first_movers,sk2(X1)))
| ~ greater(cardinality_at_time(first_movers,sk2(X1)),zero)
| ~ stable(X1)
| ~ environment(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_51]),c_0_52]) ).
cnf(c_0_60,hypothesis,
( contracts_from(sk2(X1),first_movers)
| greater(cardinality_at_time(first_movers,sk2(X1)),zero)
| ~ in_environment(X2,sk2(X1))
| ~ stable(X2)
| ~ stable(X1)
| ~ environment(X2)
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_56]) ).
cnf(c_0_61,negated_conjecture,
( ~ greater(X1,appear(efficient_producers,sk3))
| ~ contracts_from(X1,first_movers) ),
inference(fof_simplification,[status(thm)],[prove_l9_39]) ).
cnf(c_0_62,hypothesis,
( contracts_from(sk2(X1),first_movers)
| ~ in_environment(X2,sk2(X1))
| ~ stable(X2)
| ~ stable(X1)
| ~ environment(X2)
| ~ environment(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60]) ).
cnf(c_0_63,negated_conjecture,
( ~ greater(X1,appear(efficient_producers,sk3))
| ~ contracts_from(X1,first_movers) ),
c_0_61 ).
cnf(c_0_64,negated_conjecture,
stable(sk3),
prove_l9_38 ).
cnf(c_0_65,negated_conjecture,
environment(sk3),
prove_l9_37 ).
cnf(c_0_66,hypothesis,
( contracts_from(sk2(X1),first_movers)
| ~ in_environment(X2,appear(efficient_producers,X1))
| ~ stable(X2)
| ~ stable(X1)
| ~ environment(X2)
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_62,c_0_51]) ).
cnf(c_0_67,negated_conjecture,
~ contracts_from(sk2(sk3),first_movers),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_25]),c_0_64]),c_0_65])]) ).
cnf(c_0_68,hypothesis,
( contracts_from(sk2(X1),first_movers)
| ~ stable(X1)
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_66,c_0_52]) ).
cnf(c_0_69,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_64]),c_0_65])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : MGT027-1 : TPTP v8.2.0. Released v2.4.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n007.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun May 19 00:02:08 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running first-order model finding
% 0.21/0.48 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.50 # Version: 3.1.0
% 0.21/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50 # Starting sh5l with 300s (1) cores
% 0.21/0.50 # new_bool_1 with pid 5695 completed with status 0
% 0.21/0.50 # Result found by new_bool_1
% 0.21/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.50 # Search class: FGHSF-FFSF21-SFFFFFNN
% 0.21/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.50 # SAT001_MinMin_p005000_rr_RG with pid 5701 completed with status 0
% 0.21/0.50 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.50 # Search class: FGHSF-FFSF21-SFFFFFNN
% 0.21/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.50 # Preprocessing time : 0.001 s
% 0.21/0.50 # Presaturation interreduction done
% 0.21/0.50
% 0.21/0.50 # Proof found!
% 0.21/0.50 # SZS status Unsatisfiable
% 0.21/0.50 # SZS output start CNFRefutation
% See solution above
% 0.21/0.50 # Parsed axioms : 16
% 0.21/0.50 # Removed by relevancy pruning/SinE : 0
% 0.21/0.50 # Initial clauses : 16
% 0.21/0.50 # Removed in clause preprocessing : 0
% 0.21/0.50 # Initial clauses in saturation : 16
% 0.21/0.50 # Processed clauses : 84
% 0.21/0.50 # ...of these trivial : 0
% 0.21/0.50 # ...subsumed : 2
% 0.21/0.50 # ...remaining for further processing : 82
% 0.21/0.50 # Other redundant clauses eliminated : 1
% 0.21/0.50 # Clauses deleted for lack of memory : 0
% 0.21/0.50 # Backward-subsumed : 14
% 0.21/0.50 # Backward-rewritten : 0
% 0.21/0.50 # Generated clauses : 77
% 0.21/0.50 # ...of the previous two non-redundant : 74
% 0.21/0.50 # ...aggressively subsumed : 0
% 0.21/0.50 # Contextual simplify-reflections : 9
% 0.21/0.50 # Paramodulations : 76
% 0.21/0.50 # Factorizations : 0
% 0.21/0.50 # NegExts : 0
% 0.21/0.50 # Equation resolutions : 1
% 0.21/0.50 # Disequality decompositions : 0
% 0.21/0.50 # Total rewrite steps : 7
% 0.21/0.50 # ...of those cached : 4
% 0.21/0.50 # Propositional unsat checks : 0
% 0.21/0.50 # Propositional check models : 0
% 0.21/0.50 # Propositional check unsatisfiable : 0
% 0.21/0.50 # Propositional clauses : 0
% 0.21/0.50 # Propositional clauses after purity: 0
% 0.21/0.50 # Propositional unsat core size : 0
% 0.21/0.50 # Propositional preprocessing time : 0.000
% 0.21/0.50 # Propositional encoding time : 0.000
% 0.21/0.50 # Propositional solver time : 0.000
% 0.21/0.50 # Success case prop preproc time : 0.000
% 0.21/0.50 # Success case prop encoding time : 0.000
% 0.21/0.50 # Success case prop solver time : 0.000
% 0.21/0.50 # Current number of processed clauses : 51
% 0.21/0.50 # Positive orientable unit clauses : 3
% 0.21/0.50 # Positive unorientable unit clauses: 0
% 0.21/0.50 # Negative unit clauses : 1
% 0.21/0.50 # Non-unit-clauses : 47
% 0.21/0.50 # Current number of unprocessed clauses: 22
% 0.21/0.50 # ...number of literals in the above : 231
% 0.21/0.50 # Current number of archived formulas : 0
% 0.21/0.50 # Current number of archived clauses : 30
% 0.21/0.50 # Clause-clause subsumption calls (NU) : 1492
% 0.21/0.50 # Rec. Clause-clause subsumption calls : 183
% 0.21/0.50 # Non-unit clause-clause subsumptions : 25
% 0.21/0.50 # Unit Clause-clause subsumption calls : 1
% 0.21/0.50 # Rewrite failures with RHS unbound : 0
% 0.21/0.50 # BW rewrite match attempts : 0
% 0.21/0.50 # BW rewrite match successes : 0
% 0.21/0.50 # Condensation attempts : 0
% 0.21/0.50 # Condensation successes : 0
% 0.21/0.50 # Termbank termtop insertions : 4255
% 0.21/0.50 # Search garbage collected termcells : 62
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.012 s
% 0.21/0.50 # System time : 0.001 s
% 0.21/0.50 # Total time : 0.014 s
% 0.21/0.50 # Maximum resident set size: 1744 pages
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.012 s
% 0.21/0.50 # System time : 0.005 s
% 0.21/0.50 # Total time : 0.017 s
% 0.21/0.50 # Maximum resident set size: 1704 pages
% 0.21/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------