TSTP Solution File: MGT036-3 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : MGT036-3 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n028.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:13:54 EDT 2022
% Result : Unsatisfiable 0.20s 0.51s
% Output : CNFRefutation 0.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 16
% Syntax : Number of formulae : 101 ( 49 unt; 0 def)
% Number of atoms : 233 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 285 ( 153 ~; 132 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-4 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 156 ( 0 sgn 54 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
% Axioms transformation by autotheo
% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
fof(c_0_0,axiom,
! [X1,X2,X3,X4] :
( ~ environment(X4)
| ~ subpopulations(X3,X2,X4,X1)
| subpopulations(X2,X3,X4,X1) ),
file('<stdin>',mp_symmetry_of_subpopulations_1) ).
fof(c_0_1,plain,
! [X1,X2,X3,X4] :
( ~ environment(X4)
| ~ subpopulations(X3,X2,X4,X1)
| subpopulations(X2,X3,X4,X1) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_2,plain,
! [X5,X6,X7,X8] :
( ~ environment(X8)
| ~ subpopulations(X7,X6,X8,X5)
| subpopulations(X6,X7,X8,X5) ),
inference(variable_rename,[status(thm)],[c_0_1]) ).
cnf(c_0_3,plain,
( subpopulations(X1,X2,X3,X4)
| ~ subpopulations(X2,X1,X3,X4)
| ~ environment(X3) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,plain,
( subpopulations(X1,X2,X3,X4)
| ~ subpopulations(X2,X1,X3,X4)
| ~ environment(X3) ),
c_0_3,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_4_0,axiom,
( subpopulations(X1,X2,X3,X4)
| ~ subpopulations(X2,X1,X3,X4)
| ~ environment(X3) ),
inference(literals_permutation,[status(thm)],[c_0_4]) ).
cnf(c_0_4_1,axiom,
( ~ subpopulations(X2,X1,X3,X4)
| subpopulations(X1,X2,X3,X4)
| ~ environment(X3) ),
inference(literals_permutation,[status(thm)],[c_0_4]) ).
cnf(c_0_4_2,axiom,
( ~ environment(X3)
| ~ subpopulations(X2,X1,X3,X4)
| subpopulations(X1,X2,X3,X4) ),
inference(literals_permutation,[status(thm)],[c_0_4]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_001,hypothesis,
! [X1,X2,X3,X4] :
( ~ environment(X4)
| ~ subpopulations(X3,X2,X4,X1)
| ~ greater_or_equal(growth_rate(X2,X1),zero)
| ~ greater(zero,growth_rate(X3,X1))
| outcompetes(X2,X3,X1) ),
file('<stdin>',d2_2) ).
fof(c_0_1_002,hypothesis,
! [X1,X2,X3,X4] :
( ~ environment(X4)
| ~ subpopulations(X3,X2,X4,X1)
| ~ outcompetes(X2,X3,X1)
| greater(zero,growth_rate(X3,X1)) ),
file('<stdin>',d2_4) ).
fof(c_0_2_003,hypothesis,
! [X1,X2,X3,X4] :
( ~ environment(X4)
| ~ subpopulations(X3,X2,X4,X1)
| ~ outcompetes(X2,X3,X1)
| greater_or_equal(growth_rate(X2,X1),zero) ),
file('<stdin>',d2_3) ).
fof(c_0_3_004,negated_conjecture,
! [X3,X4] :
( ~ environment(X4)
| ~ subpopulations(first_movers,efficient_producers,X4,X3)
| ~ outcompetes(first_movers,efficient_producers,X3) ),
file('<stdin>',prove_t5_star_9) ).
fof(c_0_4_005,hypothesis,
subpopulations(first_movers,efficient_producers,sk1,sk2),
file('<stdin>',a13_star_6) ).
fof(c_0_5,hypothesis,
greater(zero,growth_rate(efficient_producers,sk2)),
file('<stdin>',a13_star_8) ).
fof(c_0_6,hypothesis,
greater_or_equal(growth_rate(first_movers,sk2),zero),
file('<stdin>',a13_star_7) ).
fof(c_0_7,hypothesis,
environment(sk1),
file('<stdin>',a13_star_5) ).
fof(c_0_8,hypothesis,
! [X1,X2,X3,X4] :
( ~ environment(X4)
| ~ subpopulations(X3,X2,X4,X1)
| ~ greater_or_equal(growth_rate(X2,X1),zero)
| ~ greater(zero,growth_rate(X3,X1))
| outcompetes(X2,X3,X1) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_9,hypothesis,
! [X1,X2,X3,X4] :
( ~ environment(X4)
| ~ subpopulations(X3,X2,X4,X1)
| ~ outcompetes(X2,X3,X1)
| greater(zero,growth_rate(X3,X1)) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_10,hypothesis,
! [X1,X2,X3,X4] :
( ~ environment(X4)
| ~ subpopulations(X3,X2,X4,X1)
| ~ outcompetes(X2,X3,X1)
| greater_or_equal(growth_rate(X2,X1),zero) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_11,negated_conjecture,
! [X3,X4] :
( ~ environment(X4)
| ~ subpopulations(first_movers,efficient_producers,X4,X3)
| ~ outcompetes(first_movers,efficient_producers,X3) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_12,hypothesis,
subpopulations(first_movers,efficient_producers,sk1,sk2),
c_0_4 ).
fof(c_0_13,hypothesis,
greater(zero,growth_rate(efficient_producers,sk2)),
c_0_5 ).
fof(c_0_14,hypothesis,
greater_or_equal(growth_rate(first_movers,sk2),zero),
c_0_6 ).
fof(c_0_15,hypothesis,
environment(sk1),
c_0_7 ).
fof(c_0_16,hypothesis,
! [X5,X6,X7,X8] :
( ~ environment(X8)
| ~ subpopulations(X7,X6,X8,X5)
| ~ greater_or_equal(growth_rate(X6,X5),zero)
| ~ greater(zero,growth_rate(X7,X5))
| outcompetes(X6,X7,X5) ),
inference(variable_rename,[status(thm)],[c_0_8]) ).
fof(c_0_17,hypothesis,
! [X5,X6,X7,X8] :
( ~ environment(X8)
| ~ subpopulations(X7,X6,X8,X5)
| ~ outcompetes(X6,X7,X5)
| greater(zero,growth_rate(X7,X5)) ),
inference(variable_rename,[status(thm)],[c_0_9]) ).
fof(c_0_18,hypothesis,
! [X5,X6,X7,X8] :
( ~ environment(X8)
| ~ subpopulations(X7,X6,X8,X5)
| ~ outcompetes(X6,X7,X5)
| greater_or_equal(growth_rate(X6,X5),zero) ),
inference(variable_rename,[status(thm)],[c_0_10]) ).
fof(c_0_19,negated_conjecture,
! [X5,X6] :
( ~ environment(X6)
| ~ subpopulations(first_movers,efficient_producers,X6,X5)
| ~ outcompetes(first_movers,efficient_producers,X5) ),
inference(variable_rename,[status(thm)],[c_0_11]) ).
fof(c_0_20,hypothesis,
subpopulations(first_movers,efficient_producers,sk1,sk2),
c_0_12 ).
fof(c_0_21,hypothesis,
greater(zero,growth_rate(efficient_producers,sk2)),
c_0_13 ).
fof(c_0_22,hypothesis,
greater_or_equal(growth_rate(first_movers,sk2),zero),
c_0_14 ).
fof(c_0_23,hypothesis,
environment(sk1),
c_0_15 ).
cnf(c_0_24,hypothesis,
( outcompetes(X1,X2,X3)
| ~ greater(zero,growth_rate(X2,X3))
| ~ greater_or_equal(growth_rate(X1,X3),zero)
| ~ subpopulations(X2,X1,X4,X3)
| ~ environment(X4) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_25,hypothesis,
( greater(zero,growth_rate(X1,X2))
| ~ outcompetes(X3,X1,X2)
| ~ subpopulations(X1,X3,X4,X2)
| ~ environment(X4) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_26,hypothesis,
( greater_or_equal(growth_rate(X1,X2),zero)
| ~ outcompetes(X1,X3,X2)
| ~ subpopulations(X3,X1,X4,X2)
| ~ environment(X4) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_27,negated_conjecture,
( ~ outcompetes(first_movers,efficient_producers,X1)
| ~ subpopulations(first_movers,efficient_producers,X2,X1)
| ~ environment(X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_28,hypothesis,
subpopulations(first_movers,efficient_producers,sk1,sk2),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_29,hypothesis,
greater(zero,growth_rate(efficient_producers,sk2)),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_30,hypothesis,
greater_or_equal(growth_rate(first_movers,sk2),zero),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_31,hypothesis,
environment(sk1),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_32,hypothesis,
( outcompetes(X1,X2,X3)
| ~ greater(zero,growth_rate(X2,X3))
| ~ greater_or_equal(growth_rate(X1,X3),zero)
| ~ subpopulations(X2,X1,X4,X3)
| ~ environment(X4) ),
c_0_24,
[final] ).
cnf(c_0_33,hypothesis,
( greater(zero,growth_rate(X1,X2))
| ~ outcompetes(X3,X1,X2)
| ~ subpopulations(X1,X3,X4,X2)
| ~ environment(X4) ),
c_0_25,
[final] ).
cnf(c_0_34,hypothesis,
( greater_or_equal(growth_rate(X1,X2),zero)
| ~ outcompetes(X1,X3,X2)
| ~ subpopulations(X3,X1,X4,X2)
| ~ environment(X4) ),
c_0_26,
[final] ).
cnf(c_0_35,negated_conjecture,
( ~ outcompetes(first_movers,efficient_producers,X1)
| ~ subpopulations(first_movers,efficient_producers,X2,X1)
| ~ environment(X2) ),
c_0_27,
[final] ).
cnf(c_0_36,hypothesis,
subpopulations(first_movers,efficient_producers,sk1,sk2),
c_0_28,
[final] ).
cnf(c_0_37,hypothesis,
greater(zero,growth_rate(efficient_producers,sk2)),
c_0_29,
[final] ).
cnf(c_0_38,hypothesis,
greater_or_equal(growth_rate(first_movers,sk2),zero),
c_0_30,
[final] ).
cnf(c_0_39,hypothesis,
environment(sk1),
c_0_31,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_3,plain,
( ~ environment(X0)
| ~ subpopulations(X1,X2,X0,X3)
| outcompetes(X2,X1,X3)
| ~ greater(zero,growth_rate(X1,X3))
| ~ greater_or_equal(growth_rate(X2,X3),zero) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_fd3f76.p',c_0_32) ).
cnf(c_15,plain,
( ~ environment(X0)
| ~ subpopulations(X1,X2,X0,X3)
| outcompetes(X2,X1,X3)
| ~ greater(zero,growth_rate(X1,X3))
| ~ greater_or_equal(growth_rate(X2,X3),zero) ),
inference(copy,[status(esa)],[c_3]) ).
cnf(c_33,plain,
( ~ environment(X0)
| ~ subpopulations(X1,X2,X0,X3)
| outcompetes(X2,X1,X3)
| ~ greater(zero,growth_rate(X1,X3))
| ~ greater_or_equal(growth_rate(X2,X3),zero) ),
inference(copy,[status(esa)],[c_15]) ).
cnf(c_48,plain,
( ~ environment(X0)
| ~ subpopulations(X1,X2,X0,X3)
| outcompetes(X2,X1,X3)
| ~ greater(zero,growth_rate(X1,X3))
| ~ greater_or_equal(growth_rate(X2,X3),zero) ),
inference(copy,[status(esa)],[c_33]) ).
cnf(c_147,plain,
( ~ environment(X0)
| ~ subpopulations(X1,X2,X0,X3)
| outcompetes(X2,X1,X3)
| ~ greater(zero,growth_rate(X1,X3))
| ~ greater_or_equal(growth_rate(X2,X3),zero) ),
inference(copy,[status(esa)],[c_48]) ).
cnf(c_172,plain,
( ~ environment(X0)
| ~ subpopulations(X1,X2,X0,X3)
| outcompetes(X2,X1,X3)
| ~ greater(zero,growth_rate(X1,X3))
| ~ greater_or_equal(growth_rate(X2,X3),zero) ),
inference(copy,[status(esa)],[c_147]) ).
cnf(c_9,plain,
greater_or_equal(growth_rate(first_movers,sk2),zero),
file('/export/starexec/sandbox2/tmp/iprover_modulo_fd3f76.p',c_0_38) ).
cnf(c_25,plain,
greater_or_equal(growth_rate(first_movers,sk2),zero),
inference(copy,[status(esa)],[c_9]) ).
cnf(c_39,plain,
greater_or_equal(growth_rate(first_movers,sk2),zero),
inference(copy,[status(esa)],[c_25]) ).
cnf(c_42,plain,
greater_or_equal(growth_rate(first_movers,sk2),zero),
inference(copy,[status(esa)],[c_39]) ).
cnf(c_153,plain,
greater_or_equal(growth_rate(first_movers,sk2),zero),
inference(copy,[status(esa)],[c_42]) ).
cnf(c_184,plain,
greater_or_equal(growth_rate(first_movers,sk2),zero),
inference(copy,[status(esa)],[c_153]) ).
cnf(c_293,plain,
( ~ environment(X0)
| ~ subpopulations(X1,first_movers,X0,sk2)
| outcompetes(first_movers,X1,sk2)
| ~ greater(zero,growth_rate(X1,sk2)) ),
inference(resolution,[status(thm)],[c_172,c_184]) ).
cnf(c_294,plain,
( ~ environment(X0)
| ~ subpopulations(X1,first_movers,X0,sk2)
| outcompetes(first_movers,X1,sk2)
| ~ greater(zero,growth_rate(X1,sk2)) ),
inference(rewriting,[status(thm)],[c_293]) ).
cnf(c_8,plain,
greater(zero,growth_rate(efficient_producers,sk2)),
file('/export/starexec/sandbox2/tmp/iprover_modulo_fd3f76.p',c_0_37) ).
cnf(c_23,plain,
greater(zero,growth_rate(efficient_producers,sk2)),
inference(copy,[status(esa)],[c_8]) ).
cnf(c_38,plain,
greater(zero,growth_rate(efficient_producers,sk2)),
inference(copy,[status(esa)],[c_23]) ).
cnf(c_43,plain,
greater(zero,growth_rate(efficient_producers,sk2)),
inference(copy,[status(esa)],[c_38]) ).
cnf(c_152,plain,
greater(zero,growth_rate(efficient_producers,sk2)),
inference(copy,[status(esa)],[c_43]) ).
cnf(c_182,plain,
greater(zero,growth_rate(efficient_producers,sk2)),
inference(copy,[status(esa)],[c_152]) ).
cnf(c_305,plain,
( ~ environment(X0)
| ~ subpopulations(efficient_producers,first_movers,X0,sk2)
| outcompetes(first_movers,efficient_producers,sk2) ),
inference(resolution,[status(thm)],[c_294,c_182]) ).
cnf(c_306,plain,
( ~ environment(X0)
| ~ subpopulations(efficient_producers,first_movers,X0,sk2)
| outcompetes(first_movers,efficient_producers,sk2) ),
inference(rewriting,[status(thm)],[c_305]) ).
cnf(c_7,plain,
subpopulations(first_movers,efficient_producers,sk1,sk2),
file('/export/starexec/sandbox2/tmp/iprover_modulo_fd3f76.p',c_0_36) ).
cnf(c_21,plain,
subpopulations(first_movers,efficient_producers,sk1,sk2),
inference(copy,[status(esa)],[c_7]) ).
cnf(c_37,plain,
subpopulations(first_movers,efficient_producers,sk1,sk2),
inference(copy,[status(esa)],[c_21]) ).
cnf(c_44,plain,
subpopulations(first_movers,efficient_producers,sk1,sk2),
inference(copy,[status(esa)],[c_37]) ).
cnf(c_151,plain,
subpopulations(first_movers,efficient_producers,sk1,sk2),
inference(copy,[status(esa)],[c_44]) ).
cnf(c_180,plain,
subpopulations(first_movers,efficient_producers,sk1,sk2),
inference(copy,[status(esa)],[c_151]) ).
cnf(c_6,negated_conjecture,
( ~ environment(X0)
| ~ subpopulations(first_movers,efficient_producers,X0,X1)
| ~ outcompetes(first_movers,efficient_producers,X1) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_fd3f76.p',c_0_35) ).
cnf(c_29,negated_conjecture,
( ~ environment(X0)
| ~ subpopulations(first_movers,efficient_producers,X0,X1)
| ~ outcompetes(first_movers,efficient_producers,X1) ),
inference(copy,[status(esa)],[c_6]) ).
cnf(c_36,negated_conjecture,
( ~ environment(X0)
| ~ subpopulations(first_movers,efficient_producers,X0,X1)
| ~ outcompetes(first_movers,efficient_producers,X1) ),
inference(copy,[status(esa)],[c_29]) ).
cnf(c_45,negated_conjecture,
( ~ environment(X0)
| ~ subpopulations(first_movers,efficient_producers,X0,X1)
| ~ outcompetes(first_movers,efficient_producers,X1) ),
inference(copy,[status(esa)],[c_36]) ).
cnf(c_150,negated_conjecture,
( ~ environment(X0)
| ~ subpopulations(first_movers,efficient_producers,X0,X1)
| ~ outcompetes(first_movers,efficient_producers,X1) ),
inference(copy,[status(esa)],[c_45]) ).
cnf(c_178,negated_conjecture,
( ~ environment(X0)
| ~ subpopulations(first_movers,efficient_producers,X0,X1)
| ~ outcompetes(first_movers,efficient_producers,X1) ),
inference(copy,[status(esa)],[c_150]) ).
cnf(c_210,plain,
( ~ environment(sk1)
| ~ outcompetes(first_movers,efficient_producers,sk2) ),
inference(resolution,[status(thm)],[c_180,c_178]) ).
cnf(c_211,plain,
( ~ environment(sk1)
| ~ outcompetes(first_movers,efficient_producers,sk2) ),
inference(rewriting,[status(thm)],[c_210]) ).
cnf(c_10,plain,
environment(sk1),
file('/export/starexec/sandbox2/tmp/iprover_modulo_fd3f76.p',c_0_39) ).
cnf(c_27,plain,
environment(sk1),
inference(copy,[status(esa)],[c_10]) ).
cnf(c_40,plain,
environment(sk1),
inference(copy,[status(esa)],[c_27]) ).
cnf(c_41,plain,
environment(sk1),
inference(copy,[status(esa)],[c_40]) ).
cnf(c_154,plain,
environment(sk1),
inference(copy,[status(esa)],[c_41]) ).
cnf(c_186,plain,
environment(sk1),
inference(copy,[status(esa)],[c_154]) ).
cnf(c_214,plain,
~ outcompetes(first_movers,efficient_producers,sk2),
inference(forward_subsumption_resolution,[status(thm)],[c_211,c_186]) ).
cnf(c_215,plain,
~ outcompetes(first_movers,efficient_producers,sk2),
inference(rewriting,[status(thm)],[c_214]) ).
cnf(c_312,plain,
( ~ environment(X0)
| ~ subpopulations(efficient_producers,first_movers,X0,sk2) ),
inference(forward_subsumption_resolution,[status(thm)],[c_306,c_215]) ).
cnf(c_313,plain,
( ~ environment(X0)
| ~ subpopulations(efficient_producers,first_movers,X0,sk2) ),
inference(rewriting,[status(thm)],[c_312]) ).
cnf(c_2,plain,
( ~ environment(X0)
| ~ subpopulations(X1,X2,X0,X3)
| subpopulations(X2,X1,X0,X3) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_fd3f76.p',c_0_4_0) ).
cnf(c_170,plain,
( ~ environment(X0)
| ~ subpopulations(X1,X2,X0,X3)
| subpopulations(X2,X1,X0,X3) ),
inference(copy,[status(esa)],[c_2]) ).
cnf(c_316,plain,
( ~ environment(X0)
| ~ subpopulations(first_movers,efficient_producers,X0,sk2) ),
inference(resolution,[status(thm)],[c_313,c_170]) ).
cnf(c_317,plain,
( ~ environment(X0)
| ~ subpopulations(first_movers,efficient_producers,X0,sk2) ),
inference(rewriting,[status(thm)],[c_316]) ).
cnf(c_348,plain,
~ environment(sk1),
inference(resolution,[status(thm)],[c_317,c_180]) ).
cnf(c_349,plain,
~ environment(sk1),
inference(rewriting,[status(thm)],[c_348]) ).
cnf(c_351,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_349,c_186]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : MGT036-3 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : iprover_modulo %s %d
% 0.14/0.34 % Computer : n028.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Thu Jun 9 10:19:17 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.34 % Running in mono-core mode
% 0.20/0.40 % Orienting using strategy Equiv(ClausalAll)
% 0.20/0.40 % Orientation found
% 0.20/0.40 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_a7d2df.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_fd3f76.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_33d009 | grep -v "SZS"
% 0.20/0.42
% 0.20/0.42 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.42
% 0.20/0.42 %
% 0.20/0.42 % ------ iProver source info
% 0.20/0.42
% 0.20/0.42 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.42 % git: non_committed_changes: true
% 0.20/0.42 % git: last_make_outside_of_git: true
% 0.20/0.42
% 0.20/0.42 %
% 0.20/0.42 % ------ Input Options
% 0.20/0.42
% 0.20/0.42 % --out_options all
% 0.20/0.42 % --tptp_safe_out true
% 0.20/0.42 % --problem_path ""
% 0.20/0.42 % --include_path ""
% 0.20/0.42 % --clausifier .//eprover
% 0.20/0.42 % --clausifier_options --tstp-format
% 0.20/0.42 % --stdin false
% 0.20/0.42 % --dbg_backtrace false
% 0.20/0.42 % --dbg_dump_prop_clauses false
% 0.20/0.42 % --dbg_dump_prop_clauses_file -
% 0.20/0.42 % --dbg_out_stat false
% 0.20/0.42
% 0.20/0.42 % ------ General Options
% 0.20/0.42
% 0.20/0.42 % --fof false
% 0.20/0.42 % --time_out_real 150.
% 0.20/0.42 % --time_out_prep_mult 0.2
% 0.20/0.42 % --time_out_virtual -1.
% 0.20/0.42 % --schedule none
% 0.20/0.42 % --ground_splitting input
% 0.20/0.42 % --splitting_nvd 16
% 0.20/0.42 % --non_eq_to_eq false
% 0.20/0.42 % --prep_gs_sim true
% 0.20/0.42 % --prep_unflatten false
% 0.20/0.42 % --prep_res_sim true
% 0.20/0.42 % --prep_upred true
% 0.20/0.42 % --res_sim_input true
% 0.20/0.42 % --clause_weak_htbl true
% 0.20/0.42 % --gc_record_bc_elim false
% 0.20/0.42 % --symbol_type_check false
% 0.20/0.42 % --clausify_out false
% 0.20/0.42 % --large_theory_mode false
% 0.20/0.42 % --prep_sem_filter none
% 0.20/0.42 % --prep_sem_filter_out false
% 0.20/0.42 % --preprocessed_out false
% 0.20/0.42 % --sub_typing false
% 0.20/0.42 % --brand_transform false
% 0.20/0.42 % --pure_diseq_elim true
% 0.20/0.42 % --min_unsat_core false
% 0.20/0.42 % --pred_elim true
% 0.20/0.42 % --add_important_lit false
% 0.20/0.42 % --soft_assumptions false
% 0.20/0.42 % --reset_solvers false
% 0.20/0.42 % --bc_imp_inh []
% 0.20/0.42 % --conj_cone_tolerance 1.5
% 0.20/0.42 % --prolific_symb_bound 500
% 0.20/0.42 % --lt_threshold 2000
% 0.20/0.42
% 0.20/0.42 % ------ SAT Options
% 0.20/0.42
% 0.20/0.42 % --sat_mode false
% 0.20/0.42 % --sat_fm_restart_options ""
% 0.20/0.42 % --sat_gr_def false
% 0.20/0.42 % --sat_epr_types true
% 0.20/0.42 % --sat_non_cyclic_types false
% 0.20/0.42 % --sat_finite_models false
% 0.20/0.42 % --sat_fm_lemmas false
% 0.20/0.42 % --sat_fm_prep false
% 0.20/0.42 % --sat_fm_uc_incr true
% 0.20/0.42 % --sat_out_model small
% 0.20/0.42 % --sat_out_clauses false
% 0.20/0.42
% 0.20/0.42 % ------ QBF Options
% 0.20/0.42
% 0.20/0.42 % --qbf_mode false
% 0.20/0.42 % --qbf_elim_univ true
% 0.20/0.42 % --qbf_sk_in true
% 0.20/0.42 % --qbf_pred_elim true
% 0.20/0.42 % --qbf_split 32
% 0.20/0.42
% 0.20/0.42 % ------ BMC1 Options
% 0.20/0.42
% 0.20/0.42 % --bmc1_incremental false
% 0.20/0.42 % --bmc1_axioms reachable_all
% 0.20/0.42 % --bmc1_min_bound 0
% 0.20/0.42 % --bmc1_max_bound -1
% 0.20/0.42 % --bmc1_max_bound_default -1
% 0.20/0.42 % --bmc1_symbol_reachability true
% 0.20/0.42 % --bmc1_property_lemmas false
% 0.20/0.42 % --bmc1_k_induction false
% 0.20/0.42 % --bmc1_non_equiv_states false
% 0.20/0.42 % --bmc1_deadlock false
% 0.20/0.42 % --bmc1_ucm false
% 0.20/0.42 % --bmc1_add_unsat_core none
% 0.20/0.42 % --bmc1_unsat_core_children false
% 0.20/0.42 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.42 % --bmc1_out_stat full
% 0.20/0.42 % --bmc1_ground_init false
% 0.20/0.42 % --bmc1_pre_inst_next_state false
% 0.20/0.42 % --bmc1_pre_inst_state false
% 0.20/0.42 % --bmc1_pre_inst_reach_state false
% 0.20/0.42 % --bmc1_out_unsat_core false
% 0.20/0.42 % --bmc1_aig_witness_out false
% 0.20/0.42 % --bmc1_verbose false
% 0.20/0.42 % --bmc1_dump_clauses_tptp false
% 0.20/0.43 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.43 % --bmc1_dump_file -
% 0.20/0.43 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.43 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.43 % --bmc1_ucm_extend_mode 1
% 0.20/0.43 % --bmc1_ucm_init_mode 2
% 0.20/0.43 % --bmc1_ucm_cone_mode none
% 0.20/0.43 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.43 % --bmc1_ucm_relax_model 4
% 0.20/0.43 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.43 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.43 % --bmc1_ucm_layered_model none
% 0.20/0.43 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.43
% 0.20/0.43 % ------ AIG Options
% 0.20/0.43
% 0.20/0.43 % --aig_mode false
% 0.20/0.43
% 0.20/0.43 % ------ Instantiation Options
% 0.20/0.43
% 0.20/0.43 % --instantiation_flag true
% 0.20/0.43 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.43 % --inst_solver_per_active 750
% 0.20/0.43 % --inst_solver_calls_frac 0.5
% 0.20/0.43 % --inst_passive_queue_type priority_queues
% 0.20/0.43 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.43 % --inst_passive_queues_freq [25;2]
% 0.20/0.43 % --inst_dismatching true
% 0.20/0.43 % --inst_eager_unprocessed_to_passive true
% 0.20/0.43 % --inst_prop_sim_given true
% 0.20/0.43 % --inst_prop_sim_new false
% 0.20/0.43 % --inst_orphan_elimination true
% 0.20/0.43 % --inst_learning_loop_flag true
% 0.20/0.43 % --inst_learning_start 3000
% 0.20/0.43 % --inst_learning_factor 2
% 0.20/0.43 % --inst_start_prop_sim_after_learn 3
% 0.20/0.43 % --inst_sel_renew solver
% 0.20/0.43 % --inst_lit_activity_flag true
% 0.20/0.43 % --inst_out_proof true
% 0.20/0.43
% 0.20/0.43 % ------ Resolution Options
% 0.20/0.43
% 0.20/0.43 % --resolution_flag true
% 0.20/0.43 % --res_lit_sel kbo_max
% 0.20/0.43 % --res_to_prop_solver none
% 0.20/0.43 % --res_prop_simpl_new false
% 0.20/0.43 % --res_prop_simpl_given false
% 0.20/0.43 % --res_passive_queue_type priority_queues
% 0.20/0.43 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.43 % --res_passive_queues_freq [15;5]
% 0.20/0.43 % --res_forward_subs full
% 0.20/0.43 % --res_backward_subs full
% 0.20/0.43 % --res_forward_subs_resolution true
% 0.20/0.43 % --res_backward_subs_resolution true
% 0.20/0.43 % --res_orphan_elimination false
% 0.20/0.43 % --res_time_limit 1000.
% 0.20/0.43 % --res_out_proof true
% 0.20/0.43 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_a7d2df.s
% 0.20/0.43 % --modulo true
% 0.20/0.43
% 0.20/0.43 % ------ Combination Options
% 0.20/0.43
% 0.20/0.43 % --comb_res_mult 1000
% 0.20/0.43 % --comb_inst_mult 300
% 0.20/0.43 % ------
% 0.20/0.43
% 0.20/0.43 % ------ Parsing...% successful
% 0.20/0.43
% 0.20/0.43 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 0.20/0.43
% 0.20/0.43 % ------ Proving...
% 0.20/0.43 % ------ Problem Properties
% 0.20/0.43
% 0.20/0.43 %
% 0.20/0.43 % EPR false
% 0.20/0.43 % Horn true
% 0.20/0.43 % Has equality false
% 0.20/0.43
% 0.20/0.43 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 % % ------ Current options:
% 0.20/0.43
% 0.20/0.43 % ------ Input Options
% 0.20/0.43
% 0.20/0.43 % --out_options all
% 0.20/0.43 % --tptp_safe_out true
% 0.20/0.43 % --problem_path ""
% 0.20/0.43 % --include_path ""
% 0.20/0.43 % --clausifier .//eprover
% 0.20/0.43 % --clausifier_options --tstp-format
% 0.20/0.43 % --stdin false
% 0.20/0.43 % --dbg_backtrace false
% 0.20/0.43 % --dbg_dump_prop_clauses false
% 0.20/0.43 % --dbg_dump_prop_clauses_file -
% 0.20/0.43 % --dbg_out_stat false
% 0.20/0.43
% 0.20/0.43 % ------ General Options
% 0.20/0.43
% 0.20/0.43 % --fof false
% 0.20/0.43 % --time_out_real 150.
% 0.20/0.43 % --time_out_prep_mult 0.2
% 0.20/0.43 % --time_out_virtual -1.
% 0.20/0.43 % --schedule none
% 0.20/0.43 % --ground_splitting input
% 0.20/0.43 % --splitting_nvd 16
% 0.20/0.43 % --non_eq_to_eq false
% 0.20/0.43 % --prep_gs_sim true
% 0.20/0.43 % --prep_unflatten false
% 0.20/0.43 % --prep_res_sim true
% 0.20/0.43 % --prep_upred true
% 0.20/0.43 % --res_sim_input true
% 0.20/0.43 % --clause_weak_htbl true
% 0.20/0.43 % --gc_record_bc_elim false
% 0.20/0.43 % --symbol_type_check false
% 0.20/0.43 % --clausify_out false
% 0.20/0.43 % --large_theory_mode false
% 0.20/0.43 % --prep_sem_filter none
% 0.20/0.43 % --prep_sem_filter_out false
% 0.20/0.43 % --preprocessed_out false
% 0.20/0.43 % --sub_typing false
% 0.20/0.43 % --brand_transform false
% 0.20/0.43 % --pure_diseq_elim true
% 0.20/0.43 % --min_unsat_core false
% 0.20/0.43 % --pred_elim true
% 0.20/0.43 % --add_important_lit false
% 0.20/0.43 % --soft_assumptions false
% 0.20/0.43 % --reset_solvers false
% 0.20/0.43 % --bc_imp_inh []
% 0.20/0.43 % --conj_cone_tolerance 1.5
% 0.20/0.43 % --prolific_symb_bound 500
% 0.20/0.43 % --lt_threshold 2000
% 0.20/0.43
% 0.20/0.43 % ------ SAT Options
% 0.20/0.43
% 0.20/0.43 % --sat_mode false
% 0.20/0.43 % --sat_fm_restart_options ""
% 0.20/0.43 % --sat_gr_def false
% 0.20/0.43 % --sat_epr_types true
% 0.20/0.43 % --sat_non_cyclic_types false
% 0.20/0.43 % --sat_finite_models false
% 0.20/0.43 % --sat_fm_lemmas false
% 0.20/0.43 % --sat_fm_prep false
% 0.20/0.43 % --sat_fm_uc_incr true
% 0.20/0.43 % --sat_out_model small
% 0.20/0.43 % --sat_out_clauses false
% 0.20/0.43
% 0.20/0.43 % ------ QBF Options
% 0.20/0.43
% 0.20/0.43 % --qbf_mode false
% 0.20/0.43 % --qbf_elim_univ true
% 0.20/0.43 % --qbf_sk_in true
% 0.20/0.43 % --qbf_pred_elim true
% 0.20/0.43 % --qbf_split 32
% 0.20/0.43
% 0.20/0.43 % ------ BMC1 Options
% 0.20/0.43
% 0.20/0.43 % --bmc1_incremental false
% 0.20/0.43 % --bmc1_axioms reachable_all
% 0.20/0.43 % --bmc1_min_bound 0
% 0.20/0.43 % --bmc1_max_bound -1
% 0.20/0.43 % --bmc1_max_bound_default -1
% 0.20/0.43 % --bmc1_symbol_reachability true
% 0.20/0.43 % --bmc1_property_lemmas false
% 0.20/0.43 % --bmc1_k_induction false
% 0.20/0.43 % --bmc1_non_equiv_states false
% 0.20/0.43 % --bmc1_deadlock false
% 0.20/0.43 % --bmc1_ucm false
% 0.20/0.43 % --bmc1_add_unsat_core none
% 0.20/0.43 % --bmc1_unsat_core_children false
% 0.20/0.43 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.43 % --bmc1_out_stat full
% 0.20/0.43 % --bmc1_ground_init false
% 0.20/0.43 % --bmc1_pre_inst_next_state false
% 0.20/0.43 % --bmc1_pre_inst_state false
% 0.20/0.43 % --bmc1_pre_inst_reach_state false
% 0.20/0.43 % --bmc1_out_unsat_core false
% 0.20/0.43 % --bmc1_aig_witness_out false
% 0.20/0.43 % --bmc1_verbose false
% 0.20/0.43 % --bmc1_dump_clauses_tptp false
% 0.20/0.43 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.43 % --bmc1_dump_file -
% 0.20/0.43 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.43 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.43 % --bmc1_ucm_extend_mode 1
% 0.20/0.43 % --bmc1_ucm_init_mode 2
% 0.20/0.43 % --bmc1_ucm_cone_mode none
% 0.20/0.43 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.43 % --bmc1_ucm_relax_model 4
% 0.20/0.43 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.43 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.43 % --bmc1_ucm_layered_model none
% 0.20/0.43 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.43
% 0.20/0.43 % ------ AIG Options
% 0.20/0.43
% 0.20/0.43 % --aig_mode false
% 0.20/0.43
% 0.20/0.43 % ------ Instantiation Options
% 0.20/0.43
% 0.20/0.43 % --instantiation_flag true
% 0.20/0.43 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.43 % --inst_solver_per_active 750
% 0.20/0.43 % --inst_solver_calls_frac 0.5
% 0.20/0.43 % --inst_passive_queue_type priority_queues
% 0.20/0.43 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.43 % --inst_passive_queues_freq [25;2]
% 0.20/0.43 % --inst_dismatching true
% 0.20/0.43 % --inst_eager_unprocessed_to_passive true
% 0.20/0.43 % --inst_prop_sim_given true
% 0.20/0.43 % --inst_prop_sim_new false
% 0.20/0.43 % --inst_orphan_elimination true
% 0.20/0.43 % --inst_learning_loop_flag true
% 0.20/0.43 % --inst_learning_start 3000
% 0.20/0.43 % --inst_learning_factor 2
% 0.20/0.43 % --inst_start_prop_sim_after_learn 3
% 0.20/0.43 % --inst_sel_renew solver
% 0.20/0.43 % --inst_lit_activity_flag true
% 0.20/0.43 % --inst_out_proof true
% 0.20/0.43
% 0.20/0.43 % ------ Resolution Options
% 0.20/0.43
% 0.20/0.43 % --resolution_flag true
% 0.20/0.43 % --res_lit_sel kbo_max
% 0.20/0.43 % --res_to_prop_solver none
% 0.20/0.43 % --res_prop_simpl_new false
% 0.20/0.43 % --res_prop_simpl_given false
% 0.20/0.43 % --res_passive_queue_type priority_queues
% 0.20/0.43 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.43 % --res_passive_queues_freq [15;5]
% 0.20/0.43 % --res_forward_subs full
% 0.20/0.43 % --res_backward_subs full
% 0.20/0.43 % --res_forward_subs_resolution true
% 0.20/0.43 % --res_backward_subs_resolution true
% 0.20/0.43 % --res_orphan_elimination false
% 0.20/0.43 % --res_time_limit 1000.
% 0.20/0.43 % --res_out_proof true
% 0.20/0.43 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_a7d2df.s
% 0.20/0.43 % --modulo true
% 0.20/0.43
% 0.20/0.43 % ------ Combination Options
% 0.20/0.43
% 0.20/0.43 % --comb_res_mult 1000
% 0.20/0.43 % --comb_inst_mult 300
% 0.20/0.43 % ------
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 % ------ Proving...
% 0.20/0.43 % warning: shown sat in sat incomplete mode
% 0.20/0.43 %
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 cnf(c_3,plain,
% 0.20/0.43 ( ~ subpopulations(X0,X1,X2,X3)
% 0.20/0.43 | ~ environment(X2)
% 0.20/0.43 | outcompetes(X1,X0,X3)
% 0.20/0.43 | ~ greater(zero,growth_rate(X0,X3))
% 0.20/0.43 | ~ greater_or_equal(growth_rate(X1,X3),zero) ),
% 0.20/0.43 file('/export/starexec/sandbox2/tmp/iprover_modulo_fd3f76.p', c_0_32) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_15,plain,
% 0.20/0.43 ( ~ subpopulations(X0,X1,X2,X3)
% 0.20/0.43 | ~ environment(X2)
% 0.20/0.43 | outcompetes(X1,X0,X3)
% 0.20/0.43 | ~ greater(zero,growth_rate(X0,X3))
% 0.20/0.43 | ~ greater_or_equal(growth_rate(X1,X3),zero) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_3]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_33,plain,
% 0.20/0.43 ( ~ subpopulations(X0,X1,X2,X3)
% 0.20/0.43 | ~ environment(X2)
% 0.20/0.43 | outcompetes(X1,X0,X3)
% 0.20/0.43 | ~ greater(zero,growth_rate(X0,X3))
% 0.20/0.43 | ~ greater_or_equal(growth_rate(X1,X3),zero) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_15]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_48,plain,
% 0.20/0.43 ( ~ subpopulations(X0,X1,X2,X3)
% 0.20/0.43 | ~ environment(X2)
% 0.20/0.43 | outcompetes(X1,X0,X3)
% 0.20/0.43 | ~ greater(zero,growth_rate(X0,X3))
% 0.20/0.43 | ~ greater_or_equal(growth_rate(X1,X3),zero) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_33]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_147,plain,
% 0.20/0.43 ( ~ subpopulations(X0,X1,X2,X3)
% 0.20/0.43 | ~ environment(X2)
% 0.20/0.43 | outcompetes(X1,X0,X3)
% 0.20/0.43 | ~ greater(zero,growth_rate(X0,X3))
% 0.20/0.43 | ~ greater_or_equal(growth_rate(X1,X3),zero) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_48]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_172,plain,
% 0.20/0.43 ( ~ subpopulations(X0,X1,X2,X3)
% 0.20/0.43 | ~ environment(X2)
% 0.20/0.43 | outcompetes(X1,X0,X3)
% 0.20/0.43 | ~ greater(zero,growth_rate(X0,X3))
% 0.20/0.43 | ~ greater_or_equal(growth_rate(X1,X3),zero) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_147]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_5,plain,
% 0.20/0.43 ( ~ subpopulations(X0,X1,X2,X3)
% 0.20/0.43 | ~ environment(X2)
% 0.20/0.43 | ~ outcompetes(X1,X0,X3)
% 0.20/0.43 | greater_or_equal(growth_rate(X1,X3),zero) ),
% 0.20/0.43 file('/export/starexec/sandbox2/tmp/iprover_modulo_fd3f76.p', c_0_34) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_19,plain,
% 0.20/0.43 ( ~ subpopulations(X0,X1,X2,X3)
% 0.20/0.43 | ~ environment(X2)
% 0.20/0.43 | ~ outcompetes(X1,X0,X3)
% 0.20/0.43 | greater_or_equal(growth_rate(X1,X3),zero) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_5]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_35,plain,
% 0.20/0.43 ( ~ subpopulations(X0,X1,X2,X3)
% 0.20/0.43 | ~ environment(X2)
% 0.20/0.43 | ~ outcompetes(X1,X0,X3)
% 0.20/0.43 | greater_or_equal(growth_rate(X1,X3),zero) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_19]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_46,plain,
% 0.20/0.43 ( ~ subpopulations(X0,X1,X2,X3)
% 0.20/0.43 | ~ environment(X2)
% 0.20/0.43 | ~ outcompetes(X1,X0,X3)
% 0.20/0.43 | greater_or_equal(growth_rate(X1,X3),zero) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_35]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_149,plain,
% 0.20/0.43 ( ~ subpopulations(X0,X1,X2,X3)
% 0.20/0.43 | ~ environment(X2)
% 0.20/0.43 | ~ outcompetes(X1,X0,X3)
% 0.20/0.43 | greater_or_equal(growth_rate(X1,X3),zero) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_46]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_176,plain,
% 0.20/0.43 ( ~ subpopulations(X0,X1,X2,X3)
% 0.20/0.43 | ~ environment(X2)
% 0.20/0.43 | ~ outcompetes(X1,X0,X3)
% 0.20/0.43 | greater_or_equal(growth_rate(X1,X3),zero) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_149]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_7,plain,
% 0.20/0.43 ( subpopulations(first_movers,efficient_producers,sk1,sk2) ),
% 0.20/0.43 file('/export/starexec/sandbox2/tmp/iprover_modulo_fd3f76.p', c_0_36) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_21,plain,
% 0.20/0.43 ( subpopulations(first_movers,efficient_producers,sk1,sk2) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_7]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_37,plain,
% 0.20/0.43 ( subpopulations(first_movers,efficient_producers,sk1,sk2) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_21]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_44,plain,
% 0.20/0.43 ( subpopulations(first_movers,efficient_producers,sk1,sk2) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_37]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_151,plain,
% 0.20/0.43 ( subpopulations(first_movers,efficient_producers,sk1,sk2) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_44]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_180,plain,
% 0.20/0.43 ( subpopulations(first_movers,efficient_producers,sk1,sk2) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_151]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_242,plain,
% 0.20/0.43 ( ~ environment(sk1)
% 0.20/0.43 | ~ outcompetes(efficient_producers,first_movers,sk2)
% 0.20/0.43 | greater_or_equal(growth_rate(efficient_producers,sk2),zero) ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_176,c_180]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_243,plain,
% 0.20/0.43 ( ~ environment(sk1)
% 0.20/0.43 | ~ outcompetes(efficient_producers,first_movers,sk2)
% 0.20/0.43 | greater_or_equal(growth_rate(efficient_producers,sk2),zero) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_242]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_10,plain,
% 0.20/0.43 ( environment(sk1) ),
% 0.20/0.43 file('/export/starexec/sandbox2/tmp/iprover_modulo_fd3f76.p', c_0_39) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_27,plain,( environment(sk1) ),inference(copy,[status(esa)],[c_10]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_40,plain,( environment(sk1) ),inference(copy,[status(esa)],[c_27]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_41,plain,( environment(sk1) ),inference(copy,[status(esa)],[c_40]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_154,plain,( environment(sk1) ),inference(copy,[status(esa)],[c_41]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_186,plain,( environment(sk1) ),inference(copy,[status(esa)],[c_154]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_247,plain,
% 0.20/0.43 ( ~ outcompetes(efficient_producers,first_movers,sk2)
% 0.20/0.43 | greater_or_equal(growth_rate(efficient_producers,sk2),zero) ),
% 0.20/0.43 inference(forward_subsumption_resolution,[status(thm)],[c_243,c_186]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_248,plain,
% 0.20/0.43 ( ~ outcompetes(efficient_producers,first_movers,sk2)
% 0.20/0.43 | greater_or_equal(growth_rate(efficient_producers,sk2),zero) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_247]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_263,plain,
% 0.20/0.43 ( ~ subpopulations(X0,efficient_producers,X1,sk2)
% 0.20/0.43 | ~ environment(X1)
% 0.20/0.43 | ~ outcompetes(efficient_producers,first_movers,sk2)
% 0.20/0.43 | outcompetes(efficient_producers,X0,sk2)
% 0.20/0.43 | ~ greater(zero,growth_rate(X0,sk2)) ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_172,c_248]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_264,plain,
% 0.20/0.43 ( ~ subpopulations(X0,efficient_producers,X1,sk2)
% 0.20/0.43 | ~ environment(X1)
% 0.20/0.43 | ~ outcompetes(efficient_producers,first_movers,sk2)
% 0.20/0.43 | outcompetes(efficient_producers,X0,sk2)
% 0.20/0.43 | ~ greater(zero,growth_rate(X0,sk2)) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_263]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_8,plain,
% 0.20/0.43 ( greater(zero,growth_rate(efficient_producers,sk2)) ),
% 0.20/0.43 file('/export/starexec/sandbox2/tmp/iprover_modulo_fd3f76.p', c_0_37) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_23,plain,
% 0.20/0.43 ( greater(zero,growth_rate(efficient_producers,sk2)) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_8]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_38,plain,
% 0.20/0.43 ( greater(zero,growth_rate(efficient_producers,sk2)) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_23]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_43,plain,
% 0.20/0.43 ( greater(zero,growth_rate(efficient_producers,sk2)) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_38]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_152,plain,
% 0.20/0.43 ( greater(zero,growth_rate(efficient_producers,sk2)) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_43]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_182,plain,
% 0.20/0.43 ( greater(zero,growth_rate(efficient_producers,sk2)) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_152]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_306,plain,
% 0.20/0.43 ( ~ subpopulations(efficient_producers,efficient_producers,X0,sk2)
% 0.20/0.43 | ~ environment(X0)
% 0.20/0.43 | ~ outcompetes(efficient_producers,first_movers,sk2)
% 0.20/0.43 | outcompetes(efficient_producers,efficient_producers,sk2) ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_264,c_182]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_307,plain,
% 0.20/0.43 ( ~ subpopulations(efficient_producers,efficient_producers,X0,sk2)
% 0.20/0.43 | ~ environment(X0)
% 0.20/0.43 | ~ outcompetes(efficient_producers,first_movers,sk2)
% 0.20/0.43 | outcompetes(efficient_producers,efficient_producers,sk2) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_306]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_9,plain,
% 0.20/0.43 ( greater_or_equal(growth_rate(first_movers,sk2),zero) ),
% 0.20/0.43 file('/export/starexec/sandbox2/tmp/iprover_modulo_fd3f76.p', c_0_38) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_25,plain,
% 0.20/0.43 ( greater_or_equal(growth_rate(first_movers,sk2),zero) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_9]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_39,plain,
% 0.20/0.43 ( greater_or_equal(growth_rate(first_movers,sk2),zero) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_25]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_42,plain,
% 0.20/0.43 ( greater_or_equal(growth_rate(first_movers,sk2),zero) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_39]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_153,plain,
% 0.20/0.43 ( greater_or_equal(growth_rate(first_movers,sk2),zero) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_42]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_184,plain,
% 0.20/0.43 ( greater_or_equal(growth_rate(first_movers,sk2),zero) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_153]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_261,plain,
% 0.20/0.43 ( ~ subpopulations(X0,first_movers,X1,sk2)
% 0.20/0.43 | ~ environment(X1)
% 0.20/0.43 | outcompetes(first_movers,X0,sk2)
% 0.20/0.43 | ~ greater(zero,growth_rate(X0,sk2)) ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_172,c_184]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_262,plain,
% 0.20/0.43 ( ~ subpopulations(X0,first_movers,X1,sk2)
% 0.20/0.43 | ~ environment(X1)
% 0.20/0.43 | outcompetes(first_movers,X0,sk2)
% 0.20/0.43 | ~ greater(zero,growth_rate(X0,sk2)) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_261]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_273,plain,
% 0.20/0.43 ( ~ subpopulations(efficient_producers,first_movers,X0,sk2)
% 0.20/0.43 | ~ environment(X0)
% 0.20/0.43 | outcompetes(first_movers,efficient_producers,sk2) ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_262,c_182]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_274,plain,
% 0.20/0.43 ( ~ subpopulations(efficient_producers,first_movers,X0,sk2)
% 0.20/0.43 | ~ environment(X0)
% 0.20/0.43 | outcompetes(first_movers,efficient_producers,sk2) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_273]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_6,negated_conjecture,
% 0.20/0.43 ( ~ subpopulations(first_movers,efficient_producers,X0,X1)
% 0.20/0.43 | ~ environment(X0)
% 0.20/0.43 | ~ outcompetes(first_movers,efficient_producers,X1) ),
% 0.20/0.43 file('/export/starexec/sandbox2/tmp/iprover_modulo_fd3f76.p', c_0_35) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_29,negated_conjecture,
% 0.20/0.43 ( ~ subpopulations(first_movers,efficient_producers,X0,X1)
% 0.20/0.43 | ~ environment(X0)
% 0.20/0.43 | ~ outcompetes(first_movers,efficient_producers,X1) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_6]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_36,negated_conjecture,
% 0.20/0.43 ( ~ subpopulations(first_movers,efficient_producers,X0,X1)
% 0.20/0.43 | ~ environment(X0)
% 0.20/0.43 | ~ outcompetes(first_movers,efficient_producers,X1) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_29]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_45,negated_conjecture,
% 0.20/0.43 ( ~ subpopulations(first_movers,efficient_producers,X0,X1)
% 0.20/0.43 | ~ environment(X0)
% 0.20/0.43 | ~ outcompetes(first_movers,efficient_producers,X1) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_36]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_150,negated_conjecture,
% 0.20/0.43 ( ~ subpopulations(first_movers,efficient_producers,X0,X1)
% 0.20/0.43 | ~ environment(X0)
% 0.20/0.43 | ~ outcompetes(first_movers,efficient_producers,X1) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_45]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_178,negated_conjecture,
% 0.20/0.43 ( ~ subpopulations(first_movers,efficient_producers,X0,X1)
% 0.20/0.43 | ~ environment(X0)
% 0.20/0.43 | ~ outcompetes(first_movers,efficient_producers,X1) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_150]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_202,plain,
% 0.20/0.43 ( ~ environment(sk1)
% 0.20/0.43 | ~ outcompetes(first_movers,efficient_producers,sk2) ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_180,c_178]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_203,plain,
% 0.20/0.43 ( ~ environment(sk1)
% 0.20/0.43 | ~ outcompetes(first_movers,efficient_producers,sk2) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_202]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_206,plain,
% 0.20/0.43 ( ~ outcompetes(first_movers,efficient_producers,sk2) ),
% 0.20/0.43 inference(forward_subsumption_resolution,[status(thm)],[c_203,c_186]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_207,plain,
% 0.20/0.43 ( ~ outcompetes(first_movers,efficient_producers,sk2) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_206]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_280,plain,
% 0.20/0.43 ( ~ subpopulations(efficient_producers,first_movers,X0,sk2)
% 0.20/0.43 | ~ environment(X0) ),
% 0.20/0.43 inference(forward_subsumption_resolution,[status(thm)],[c_274,c_207]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_281,plain,
% 0.20/0.43 ( ~ subpopulations(efficient_producers,first_movers,X0,sk2)
% 0.20/0.43 | ~ environment(X0) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_280]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_4,plain,
% 0.20/0.43 ( ~ subpopulations(X0,X1,X2,X3)
% 0.20/0.43 | ~ environment(X2)
% 0.20/0.43 | ~ outcompetes(X1,X0,X3)
% 0.20/0.43 | greater(zero,growth_rate(X0,X3)) ),
% 0.20/0.43 file('/export/starexec/sandbox2/tmp/iprover_modulo_fd3f76.p', c_0_33) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_17,plain,
% 0.20/0.43 ( ~ subpopulations(X0,X1,X2,X3)
% 0.20/0.43 | ~ environment(X2)
% 0.20/0.43 | ~ outcompetes(X1,X0,X3)
% 0.20/0.43 | greater(zero,growth_rate(X0,X3)) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_4]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_34,plain,
% 0.20/0.43 ( ~ subpopulations(X0,X1,X2,X3)
% 0.20/0.43 | ~ environment(X2)
% 0.20/0.43 | ~ outcompetes(X1,X0,X3)
% 0.20/0.43 | greater(zero,growth_rate(X0,X3)) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_17]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_47,plain,
% 0.20/0.43 ( ~ subpopulations(X0,X1,X2,X3)
% 0.20/0.43 | ~ environment(X2)
% 0.20/0.43 | ~ outcompetes(X1,X0,X3)
% 0.20/0.43 | greater(zero,growth_rate(X0,X3)) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_34]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_148,plain,
% 0.20/0.43 ( ~ subpopulations(X0,X1,X2,X3)
% 0.20/0.43 | ~ environment(X2)
% 0.20/0.43 | ~ outcompetes(X1,X0,X3)
% 0.20/0.43 | greater(zero,growth_rate(X0,X3)) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_47]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_174,plain,
% 0.20/0.43 ( ~ subpopulations(X0,X1,X2,X3)
% 0.20/0.43 | ~ environment(X2)
% 0.20/0.43 | ~ outcompetes(X1,X0,X3)
% 0.20/0.43 | greater(zero,growth_rate(X0,X3)) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_148]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_223,plain,
% 0.20/0.43 ( ~ environment(sk1)
% 0.20/0.43 | ~ outcompetes(efficient_producers,first_movers,sk2)
% 0.20/0.43 | greater(zero,growth_rate(first_movers,sk2)) ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_174,c_180]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_224,plain,
% 0.20/0.43 ( ~ environment(sk1)
% 0.20/0.43 | ~ outcompetes(efficient_producers,first_movers,sk2)
% 0.20/0.43 | greater(zero,growth_rate(first_movers,sk2)) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_223]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_228,plain,
% 0.20/0.43 ( ~ outcompetes(efficient_producers,first_movers,sk2)
% 0.20/0.43 | greater(zero,growth_rate(first_movers,sk2)) ),
% 0.20/0.43 inference(forward_subsumption_resolution,[status(thm)],[c_224,c_186]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_229,plain,
% 0.20/0.43 ( ~ outcompetes(efficient_producers,first_movers,sk2)
% 0.20/0.43 | greater(zero,growth_rate(first_movers,sk2)) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_228]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_275,plain,
% 0.20/0.43 ( ~ subpopulations(first_movers,first_movers,X0,sk2)
% 0.20/0.43 | ~ environment(X0)
% 0.20/0.43 | outcompetes(first_movers,first_movers,sk2)
% 0.20/0.43 | ~ outcompetes(efficient_producers,first_movers,sk2) ),
% 0.20/0.43 inference(resolution,[status(thm)],[c_262,c_229]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_276,plain,
% 0.20/0.43 ( ~ subpopulations(first_movers,first_movers,X0,sk2)
% 0.20/0.43 | ~ environment(X0)
% 0.20/0.43 | outcompetes(first_movers,first_movers,sk2)
% 0.20/0.43 | ~ outcompetes(efficient_producers,first_movers,sk2) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_275]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_0,plain,
% 0.20/0.43 ( ~ environment(X0)
% 0.20/0.43 | ~ subpopulations(X1,X2,X0,X3)
% 0.20/0.43 | subpopulations(X2,X1,X0,X3) ),
% 0.20/0.43 file('/export/starexec/sandbox2/tmp/iprover_modulo_fd3f76.p', c_0_4_0) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_166,plain,
% 0.20/0.43 ( ~ environment(X0)
% 0.20/0.43 | ~ subpopulations(X1,X2,X0,X3)
% 0.20/0.43 | subpopulations(X2,X1,X0,X3) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_0]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_167,plain,
% 0.20/0.43 ( ~ subpopulations(X0,X1,X2,X3)
% 0.20/0.43 | subpopulations(X1,X0,X2,X3)
% 0.20/0.43 | ~ environment(X2) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_166]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_1,plain,
% 0.20/0.43 ( ~ environment(X0)
% 0.20/0.43 | subpopulations(X1,X2,X0,X3)
% 0.20/0.43 | ~ subpopulations(X2,X1,X0,X3) ),
% 0.20/0.43 file('/export/starexec/sandbox2/tmp/iprover_modulo_fd3f76.p', c_0_4_1) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_168,plain,
% 0.20/0.43 ( ~ environment(X0)
% 0.20/0.43 | subpopulations(X1,X2,X0,X3)
% 0.20/0.43 | ~ subpopulations(X2,X1,X0,X3) ),
% 0.20/0.43 inference(copy,[status(esa)],[c_1]) ).
% 0.20/0.43
% 0.20/0.43 cnf(c_169,plain,
% 0.20/0.43 ( subpopulations(X0,X1,X2,X3)
% 0.20/0.43 | ~ subpopulations(X1,X0,X2,X3)
% 0.20/0.43 | ~ environment(X2) ),
% 0.20/0.43 inference(rewriting,[status(thm)],[c_168]) ).
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 % ------ Statistics
% 0.20/0.43
% 0.20/0.43 % ------ General
% 0.20/0.43
% 0.20/0.43 % num_of_input_clauses: 11
% 0.20/0.43 % num_of_input_neg_conjectures: 1
% 0.20/0.43 % num_of_splits: 0
% 0.20/0.43 % num_of_split_atoms: 0
% 0.20/0.43 % num_of_sem_filtered_clauses: 0
% 0.20/0.43 % num_of_subtypes: 0
% 0.20/0.43 % monotx_restored_types: 0
% 0.20/0.43 % sat_num_of_epr_types: 0
% 0.20/0.43 % sat_num_of_non_cyclic_types: 0
% 0.20/0.43 % sat_guarded_non_collapsed_types: 0
% 0.20/0.44 % is_epr: 0
% 0.20/0.44 % is_horn: 1
% 0.20/0.44 % has_eq: 0
% 0.20/0.44 % num_pure_diseq_elim: 0
% 0.20/0.44 % simp_replaced_by: 0
% 0.20/0.44 % res_preprocessed: 9
% 0.20/0.44 % prep_upred: 0
% 0.20/0.44 % prep_unflattend: 0
% 0.20/0.44 % pred_elim_cands: 2
% 0.20/0.44 % pred_elim: 0
% 0.20/0.44 % pred_elim_cl: 0
% 0.20/0.44 % pred_elim_cycles: 2
% 0.20/0.44 % forced_gc_time: 0
% 0.20/0.44 % gc_basic_clause_elim: 0
% 0.20/0.44 % parsing_time: 0.
% 0.20/0.44 % sem_filter_time: 0.
% 0.20/0.44 % pred_elim_time: 0.002
% 0.20/0.44 % out_proof_time: 0.
% 0.20/0.44 % monotx_time: 0.
% 0.20/0.44 % subtype_inf_time: 0.
% 0.20/0.44 % unif_index_cands_time: 0.
% 0.20/0.44 % unif_index_add_time: 0.
% 0.20/0.44 % total_time: 0.029
% 0.20/0.44 % num_of_symbols: 36
% 0.20/0.44 % num_of_terms: 179
% 0.20/0.44
% 0.20/0.44 % ------ Propositional Solver
% 0.20/0.44
% 0.20/0.44 % prop_solver_calls: 1
% 0.20/0.44 % prop_fast_solver_calls: 65
% 0.20/0.44 % prop_num_of_clauses: 21
% 0.20/0.44 % prop_preprocess_simplified: 105
% 0.20/0.44 % prop_fo_subsumed: 0
% 0.20/0.44 % prop_solver_time: 0.
% 0.20/0.44 % prop_fast_solver_time: 0.
% 0.20/0.44 % prop_unsat_core_time: 0.
% 0.20/0.44
% 0.20/0.44 % ------ QBF
% 0.20/0.44
% 0.20/0.44 % qbf_q_res: 0
% 0.20/0.44 % qbf_num_tautologies: 0
% 0.20/0.44 % qbf_prep_cycles: 0
% 0.20/0.44
% 0.20/0.44 % ------ BMC1
% 0.20/0.44
% 0.20/0.44 % bmc1_current_bound: -1
% 0.20/0.44 % bmc1_last_solved_bound: -1
% 0.20/0.44 % bmc1_unsat_core_size: -1
% 0.20/0.44 % bmc1_unsat_core_parents_size: -1
% 0.20/0.44 % bmc1_merge_next_fun: 0
% 0.20/0.44 % bmc1_unsat_core_clauses_time: 0.
% 0.20/0.44
% 0.20/0.44 % ------ Instantiation
% 0.20/0.44
% 0.20/0.44 % inst_num_of_clauses: 11
% 0.20/0.44 % inst_num_in_passive: 0
% 0.20/0.44 % inst_num_in_active: 0
% 0.20/0.44 % inst_num_in_unprocessed: 11
% 0.20/0.44 % inst_num_of_loops: 0
% 0.20/0.44 % inst_num_of_learning_restarts: 0
% 0.20/0.44 % inst_num_moves_active_passive: 0
% 0.20/0.44 % inst_lit_activity: 0
% 0.20/0.44 % inst_lit_activity_moves: 0
% 0.20/0.44 % inst_num_tautologies: 0
% 0.20/0.44 % inst_num_prop_implied: 0
% 0.20/0.44 % inst_num_existing_simplified: 0
% 0.20/0.44 % inst_num_eq_res_simplified: 0
% 0.20/0.44 % inst_num_child_elim: 0
% 0.20/0.44 % inst_num_of_dismatching_blockings: 0
% 0.20/0.44 % inst_num_of_non_proper_insts: 0
% 0.20/0.44 % inst_num_of_duplicates: 0
% 0.20/0.44 % inst_inst_num_from_inst_to_res: 0
% 0.20/0.44 % inst_dismatching_checking_time: 0.
% 0.20/0.44
% 0.20/0.44 % ------ Resolution
% 0.20/0.44
% 0.20/0.44 % res_num_of_clauses: 20
% 0.20/0.44 % res_num_in_passive: 0
% 0.20/0.44 % res_num_in_active: 18
% 0.20/0.44 % res_num_of_loops: 24
% 0.20/0.44 % res_forward_subset_subsumed: 1
% 0.20/0.44 % res_backward_subset_subsumed: 0
% 0.20/0.44 % res_forward_subsumed: 7
% 0.20/0.44 % res_backward_subsumed: 0
% 0.20/0.44 % res_forward_subsumption_resolution: 4
% 0.20/0.44 % res_backward_subsumption_resolution: 0
% 0.20/0.44 % res_clause_to_clause_subsumption: 36
% 0.20/0.44 % res_orphan_elimination: 0
% 0.20/0.44 % res_tautology_del: 1
% 0.20/0.44 % res_num_eq_res_simplified: 0
% 0.20/0.44 % res_num_sel_changes: 0
% 0.20/0.44 % res_moves_from_active_to_pass: 0
% 0.20/0.44
% 0.20/0.44 % Status Unknown
% 0.20/0.47 % Orienting using strategy ClausalAll
% 0.20/0.47 % Orientation found
% 0.20/0.47 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_a7d2df.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_fd3f76.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_5ca31f | grep -v "SZS"
% 0.20/0.50
% 0.20/0.50 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.50
% 0.20/0.50 %
% 0.20/0.50 % ------ iProver source info
% 0.20/0.50
% 0.20/0.50 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.50 % git: non_committed_changes: true
% 0.20/0.50 % git: last_make_outside_of_git: true
% 0.20/0.50
% 0.20/0.50 %
% 0.20/0.50 % ------ Input Options
% 0.20/0.50
% 0.20/0.50 % --out_options all
% 0.20/0.50 % --tptp_safe_out true
% 0.20/0.50 % --problem_path ""
% 0.20/0.50 % --include_path ""
% 0.20/0.50 % --clausifier .//eprover
% 0.20/0.50 % --clausifier_options --tstp-format
% 0.20/0.50 % --stdin false
% 0.20/0.50 % --dbg_backtrace false
% 0.20/0.50 % --dbg_dump_prop_clauses false
% 0.20/0.50 % --dbg_dump_prop_clauses_file -
% 0.20/0.50 % --dbg_out_stat false
% 0.20/0.50
% 0.20/0.50 % ------ General Options
% 0.20/0.50
% 0.20/0.50 % --fof false
% 0.20/0.50 % --time_out_real 150.
% 0.20/0.50 % --time_out_prep_mult 0.2
% 0.20/0.50 % --time_out_virtual -1.
% 0.20/0.50 % --schedule none
% 0.20/0.50 % --ground_splitting input
% 0.20/0.50 % --splitting_nvd 16
% 0.20/0.50 % --non_eq_to_eq false
% 0.20/0.50 % --prep_gs_sim true
% 0.20/0.50 % --prep_unflatten false
% 0.20/0.50 % --prep_res_sim true
% 0.20/0.50 % --prep_upred true
% 0.20/0.50 % --res_sim_input true
% 0.20/0.50 % --clause_weak_htbl true
% 0.20/0.50 % --gc_record_bc_elim false
% 0.20/0.50 % --symbol_type_check false
% 0.20/0.50 % --clausify_out false
% 0.20/0.50 % --large_theory_mode false
% 0.20/0.50 % --prep_sem_filter none
% 0.20/0.50 % --prep_sem_filter_out false
% 0.20/0.50 % --preprocessed_out false
% 0.20/0.50 % --sub_typing false
% 0.20/0.50 % --brand_transform false
% 0.20/0.50 % --pure_diseq_elim true
% 0.20/0.50 % --min_unsat_core false
% 0.20/0.50 % --pred_elim true
% 0.20/0.50 % --add_important_lit false
% 0.20/0.50 % --soft_assumptions false
% 0.20/0.50 % --reset_solvers false
% 0.20/0.50 % --bc_imp_inh []
% 0.20/0.50 % --conj_cone_tolerance 1.5
% 0.20/0.50 % --prolific_symb_bound 500
% 0.20/0.50 % --lt_threshold 2000
% 0.20/0.50
% 0.20/0.50 % ------ SAT Options
% 0.20/0.50
% 0.20/0.50 % --sat_mode false
% 0.20/0.50 % --sat_fm_restart_options ""
% 0.20/0.50 % --sat_gr_def false
% 0.20/0.50 % --sat_epr_types true
% 0.20/0.50 % --sat_non_cyclic_types false
% 0.20/0.50 % --sat_finite_models false
% 0.20/0.50 % --sat_fm_lemmas false
% 0.20/0.50 % --sat_fm_prep false
% 0.20/0.50 % --sat_fm_uc_incr true
% 0.20/0.50 % --sat_out_model small
% 0.20/0.50 % --sat_out_clauses false
% 0.20/0.50
% 0.20/0.50 % ------ QBF Options
% 0.20/0.50
% 0.20/0.50 % --qbf_mode false
% 0.20/0.50 % --qbf_elim_univ true
% 0.20/0.50 % --qbf_sk_in true
% 0.20/0.50 % --qbf_pred_elim true
% 0.20/0.50 % --qbf_split 32
% 0.20/0.50
% 0.20/0.50 % ------ BMC1 Options
% 0.20/0.50
% 0.20/0.50 % --bmc1_incremental false
% 0.20/0.50 % --bmc1_axioms reachable_all
% 0.20/0.50 % --bmc1_min_bound 0
% 0.20/0.50 % --bmc1_max_bound -1
% 0.20/0.50 % --bmc1_max_bound_default -1
% 0.20/0.50 % --bmc1_symbol_reachability true
% 0.20/0.50 % --bmc1_property_lemmas false
% 0.20/0.50 % --bmc1_k_induction false
% 0.20/0.50 % --bmc1_non_equiv_states false
% 0.20/0.50 % --bmc1_deadlock false
% 0.20/0.50 % --bmc1_ucm false
% 0.20/0.50 % --bmc1_add_unsat_core none
% 0.20/0.50 % --bmc1_unsat_core_children false
% 0.20/0.50 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.50 % --bmc1_out_stat full
% 0.20/0.50 % --bmc1_ground_init false
% 0.20/0.50 % --bmc1_pre_inst_next_state false
% 0.20/0.50 % --bmc1_pre_inst_state false
% 0.20/0.50 % --bmc1_pre_inst_reach_state false
% 0.20/0.50 % --bmc1_out_unsat_core false
% 0.20/0.50 % --bmc1_aig_witness_out false
% 0.20/0.50 % --bmc1_verbose false
% 0.20/0.50 % --bmc1_dump_clauses_tptp false
% 0.20/0.50 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.50 % --bmc1_dump_file -
% 0.20/0.50 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.50 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.50 % --bmc1_ucm_extend_mode 1
% 0.20/0.50 % --bmc1_ucm_init_mode 2
% 0.20/0.50 % --bmc1_ucm_cone_mode none
% 0.20/0.50 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.50 % --bmc1_ucm_relax_model 4
% 0.20/0.50 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.50 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.50 % --bmc1_ucm_layered_model none
% 0.20/0.50 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.50
% 0.20/0.50 % ------ AIG Options
% 0.20/0.50
% 0.20/0.50 % --aig_mode false
% 0.20/0.50
% 0.20/0.50 % ------ Instantiation Options
% 0.20/0.50
% 0.20/0.50 % --instantiation_flag true
% 0.20/0.50 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.50 % --inst_solver_per_active 750
% 0.20/0.50 % --inst_solver_calls_frac 0.5
% 0.20/0.50 % --inst_passive_queue_type priority_queues
% 0.20/0.50 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.50 % --inst_passive_queues_freq [25;2]
% 0.20/0.50 % --inst_dismatching true
% 0.20/0.50 % --inst_eager_unprocessed_to_passive true
% 0.20/0.50 % --inst_prop_sim_given true
% 0.20/0.50 % --inst_prop_sim_new false
% 0.20/0.50 % --inst_orphan_elimination true
% 0.20/0.50 % --inst_learning_loop_flag true
% 0.20/0.50 % --inst_learning_start 3000
% 0.20/0.50 % --inst_learning_factor 2
% 0.20/0.50 % --inst_start_prop_sim_after_learn 3
% 0.20/0.50 % --inst_sel_renew solver
% 0.20/0.50 % --inst_lit_activity_flag true
% 0.20/0.50 % --inst_out_proof true
% 0.20/0.50
% 0.20/0.50 % ------ Resolution Options
% 0.20/0.50
% 0.20/0.50 % --resolution_flag true
% 0.20/0.50 % --res_lit_sel kbo_max
% 0.20/0.50 % --res_to_prop_solver none
% 0.20/0.50 % --res_prop_simpl_new false
% 0.20/0.50 % --res_prop_simpl_given false
% 0.20/0.50 % --res_passive_queue_type priority_queues
% 0.20/0.50 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.50 % --res_passive_queues_freq [15;5]
% 0.20/0.50 % --res_forward_subs full
% 0.20/0.50 % --res_backward_subs full
% 0.20/0.50 % --res_forward_subs_resolution true
% 0.20/0.50 % --res_backward_subs_resolution true
% 0.20/0.50 % --res_orphan_elimination false
% 0.20/0.50 % --res_time_limit 1000.
% 0.20/0.50 % --res_out_proof true
% 0.20/0.50 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_a7d2df.s
% 0.20/0.50 % --modulo true
% 0.20/0.50
% 0.20/0.50 % ------ Combination Options
% 0.20/0.50
% 0.20/0.50 % --comb_res_mult 1000
% 0.20/0.50 % --comb_inst_mult 300
% 0.20/0.50 % ------
% 0.20/0.50
% 0.20/0.50 % ------ Parsing...% successful
% 0.20/0.50
% 0.20/0.50 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 0.20/0.50
% 0.20/0.50 % ------ Proving...
% 0.20/0.50 % ------ Problem Properties
% 0.20/0.50
% 0.20/0.50 %
% 0.20/0.50 % EPR false
% 0.20/0.50 % Horn true
% 0.20/0.50 % Has equality false
% 0.20/0.50
% 0.20/0.50 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.50
% 0.20/0.50
% 0.20/0.50 % % ------ Current options:
% 0.20/0.50
% 0.20/0.50 % ------ Input Options
% 0.20/0.50
% 0.20/0.50 % --out_options all
% 0.20/0.50 % --tptp_safe_out true
% 0.20/0.50 % --problem_path ""
% 0.20/0.50 % --include_path ""
% 0.20/0.50 % --clausifier .//eprover
% 0.20/0.50 % --clausifier_options --tstp-format
% 0.20/0.50 % --stdin false
% 0.20/0.50 % --dbg_backtrace false
% 0.20/0.50 % --dbg_dump_prop_clauses false
% 0.20/0.50 % --dbg_dump_prop_clauses_file -
% 0.20/0.50 % --dbg_out_stat false
% 0.20/0.50
% 0.20/0.50 % ------ General Options
% 0.20/0.50
% 0.20/0.50 % --fof false
% 0.20/0.50 % --time_out_real 150.
% 0.20/0.50 % --time_out_prep_mult 0.2
% 0.20/0.50 % --time_out_virtual -1.
% 0.20/0.50 % --schedule none
% 0.20/0.50 % --ground_splitting input
% 0.20/0.50 % --splitting_nvd 16
% 0.20/0.50 % --non_eq_to_eq false
% 0.20/0.50 % --prep_gs_sim true
% 0.20/0.50 % --prep_unflatten false
% 0.20/0.50 % --prep_res_sim true
% 0.20/0.50 % --prep_upred true
% 0.20/0.50 % --res_sim_input true
% 0.20/0.50 % --clause_weak_htbl true
% 0.20/0.50 % --gc_record_bc_elim false
% 0.20/0.50 % --symbol_type_check false
% 0.20/0.50 % --clausify_out false
% 0.20/0.50 % --large_theory_mode false
% 0.20/0.50 % --prep_sem_filter none
% 0.20/0.50 % --prep_sem_filter_out false
% 0.20/0.50 % --preprocessed_out false
% 0.20/0.50 % --sub_typing false
% 0.20/0.50 % --brand_transform false
% 0.20/0.50 % --pure_diseq_elim true
% 0.20/0.50 % --min_unsat_core false
% 0.20/0.50 % --pred_elim true
% 0.20/0.50 % --add_important_lit false
% 0.20/0.50 % --soft_assumptions false
% 0.20/0.50 % --reset_solvers false
% 0.20/0.50 % --bc_imp_inh []
% 0.20/0.50 % --conj_cone_tolerance 1.5
% 0.20/0.50 % --prolific_symb_bound 500
% 0.20/0.50 % --lt_threshold 2000
% 0.20/0.50
% 0.20/0.50 % ------ SAT Options
% 0.20/0.50
% 0.20/0.50 % --sat_mode false
% 0.20/0.50 % --sat_fm_restart_options ""
% 0.20/0.50 % --sat_gr_def false
% 0.20/0.50 % --sat_epr_types true
% 0.20/0.50 % --sat_non_cyclic_types false
% 0.20/0.50 % --sat_finite_models false
% 0.20/0.50 % --sat_fm_lemmas false
% 0.20/0.50 % --sat_fm_prep false
% 0.20/0.50 % --sat_fm_uc_incr true
% 0.20/0.50 % --sat_out_model small
% 0.20/0.50 % --sat_out_clauses false
% 0.20/0.50
% 0.20/0.50 % ------ QBF Options
% 0.20/0.50
% 0.20/0.50 % --qbf_mode false
% 0.20/0.50 % --qbf_elim_univ true
% 0.20/0.50 % --qbf_sk_in true
% 0.20/0.50 % --qbf_pred_elim true
% 0.20/0.50 % --qbf_split 32
% 0.20/0.50
% 0.20/0.50 % ------ BMC1 Options
% 0.20/0.50
% 0.20/0.50 % --bmc1_incremental false
% 0.20/0.50 % --bmc1_axioms reachable_all
% 0.20/0.50 % --bmc1_min_bound 0
% 0.20/0.50 % --bmc1_max_bound -1
% 0.20/0.50 % --bmc1_max_bound_default -1
% 0.20/0.50 % --bmc1_symbol_reachability true
% 0.20/0.50 % --bmc1_property_lemmas false
% 0.20/0.50 % --bmc1_k_induction false
% 0.20/0.50 % --bmc1_non_equiv_states false
% 0.20/0.50 % --bmc1_deadlock false
% 0.20/0.50 % --bmc1_ucm false
% 0.20/0.50 % --bmc1_add_unsat_core none
% 0.20/0.50 % --bmc1_unsat_core_children false
% 0.20/0.50 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.50 % --bmc1_out_stat full
% 0.20/0.50 % --bmc1_ground_init false
% 0.20/0.50 % --bmc1_pre_inst_next_state false
% 0.20/0.50 % --bmc1_pre_inst_state false
% 0.20/0.50 % --bmc1_pre_inst_reach_state false
% 0.20/0.50 % --bmc1_out_unsat_core false
% 0.20/0.50 % --bmc1_aig_witness_out false
% 0.20/0.50 % --bmc1_verbose false
% 0.20/0.50 % --bmc1_dump_clauses_tptp false
% 0.20/0.50 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.50 % --bmc1_dump_file -
% 0.20/0.50 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.50 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.50 % --bmc1_ucm_extend_mode 1
% 0.20/0.50 % --bmc1_ucm_init_mode 2
% 0.20/0.50 % --bmc1_ucm_cone_mode none
% 0.20/0.50 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.50 % --bmc1_ucm_relax_model 4
% 0.20/0.50 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.50 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.50 % --bmc1_ucm_layered_model none
% 0.20/0.50 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.50
% 0.20/0.50 % ------ AIG Options
% 0.20/0.50
% 0.20/0.50 % --aig_mode false
% 0.20/0.50
% 0.20/0.50 % ------ Instantiation Options
% 0.20/0.50
% 0.20/0.50 % --instantiation_flag true
% 0.20/0.50 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.50 % --inst_solver_per_active 750
% 0.20/0.50 % --inst_solver_calls_frac 0.5
% 0.20/0.50 % --inst_passive_queue_type priority_queues
% 0.20/0.50 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.50 % --inst_passive_queues_freq [25;2]
% 0.20/0.50 % --inst_dismatching true
% 0.20/0.50 % --inst_eager_unprocessed_to_passive true
% 0.20/0.50 % --inst_prop_sim_given true
% 0.20/0.51 % --inst_prop_sim_new false
% 0.20/0.51 % --inst_orphan_elimination true
% 0.20/0.51 % --inst_learning_loop_flag true
% 0.20/0.51 % --inst_learning_start 3000
% 0.20/0.51 % --inst_learning_factor 2
% 0.20/0.51 % --inst_start_prop_sim_after_learn 3
% 0.20/0.51 % --inst_sel_renew solver
% 0.20/0.51 % --inst_lit_activity_flag true
% 0.20/0.51 % --inst_out_proof true
% 0.20/0.51
% 0.20/0.51 % ------ Resolution Options
% 0.20/0.51
% 0.20/0.51 % --resolution_flag true
% 0.20/0.51 % --res_lit_sel kbo_max
% 0.20/0.51 % --res_to_prop_solver none
% 0.20/0.51 % --res_prop_simpl_new false
% 0.20/0.51 % --res_prop_simpl_given false
% 0.20/0.51 % --res_passive_queue_type priority_queues
% 0.20/0.51 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.51 % --res_passive_queues_freq [15;5]
% 0.20/0.51 % --res_forward_subs full
% 0.20/0.51 % --res_backward_subs full
% 0.20/0.51 % --res_forward_subs_resolution true
% 0.20/0.51 % --res_backward_subs_resolution true
% 0.20/0.51 % --res_orphan_elimination false
% 0.20/0.51 % --res_time_limit 1000.
% 0.20/0.51 % --res_out_proof true
% 0.20/0.51 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_a7d2df.s
% 0.20/0.51 % --modulo true
% 0.20/0.51
% 0.20/0.51 % ------ Combination Options
% 0.20/0.51
% 0.20/0.51 % --comb_res_mult 1000
% 0.20/0.51 % --comb_inst_mult 300
% 0.20/0.51 % ------
% 0.20/0.51
% 0.20/0.51
% 0.20/0.51
% 0.20/0.51 % ------ Proving...
% 0.20/0.51 %
% 0.20/0.51
% 0.20/0.51
% 0.20/0.51 % Resolution empty clause
% 0.20/0.51
% 0.20/0.51 % ------ Statistics
% 0.20/0.51
% 0.20/0.51 % ------ General
% 0.20/0.51
% 0.20/0.51 % num_of_input_clauses: 11
% 0.20/0.51 % num_of_input_neg_conjectures: 1
% 0.20/0.51 % num_of_splits: 0
% 0.20/0.51 % num_of_split_atoms: 0
% 0.20/0.51 % num_of_sem_filtered_clauses: 0
% 0.20/0.51 % num_of_subtypes: 0
% 0.20/0.51 % monotx_restored_types: 0
% 0.20/0.51 % sat_num_of_epr_types: 0
% 0.20/0.51 % sat_num_of_non_cyclic_types: 0
% 0.20/0.51 % sat_guarded_non_collapsed_types: 0
% 0.20/0.51 % is_epr: 0
% 0.20/0.51 % is_horn: 1
% 0.20/0.51 % has_eq: 0
% 0.20/0.51 % num_pure_diseq_elim: 0
% 0.20/0.51 % simp_replaced_by: 0
% 0.20/0.51 % res_preprocessed: 9
% 0.20/0.51 % prep_upred: 0
% 0.20/0.51 % prep_unflattend: 0
% 0.20/0.51 % pred_elim_cands: 2
% 0.20/0.51 % pred_elim: 0
% 0.20/0.51 % pred_elim_cl: 0
% 0.20/0.51 % pred_elim_cycles: 2
% 0.20/0.51 % forced_gc_time: 0
% 0.20/0.51 % gc_basic_clause_elim: 0
% 0.20/0.51 % parsing_time: 0.
% 0.20/0.51 % sem_filter_time: 0.
% 0.20/0.51 % pred_elim_time: 0.001
% 0.20/0.51 % out_proof_time: 0.001
% 0.20/0.51 % monotx_time: 0.
% 0.20/0.51 % subtype_inf_time: 0.
% 0.20/0.51 % unif_index_cands_time: 0.
% 0.20/0.51 % unif_index_add_time: 0.
% 0.20/0.51 % total_time: 0.027
% 0.20/0.51 % num_of_symbols: 36
% 0.20/0.51 % num_of_terms: 167
% 0.20/0.51
% 0.20/0.51 % ------ Propositional Solver
% 0.20/0.51
% 0.20/0.51 % prop_solver_calls: 1
% 0.20/0.51 % prop_fast_solver_calls: 65
% 0.20/0.51 % prop_num_of_clauses: 21
% 0.20/0.51 % prop_preprocess_simplified: 105
% 0.20/0.51 % prop_fo_subsumed: 0
% 0.20/0.51 % prop_solver_time: 0.
% 0.20/0.51 % prop_fast_solver_time: 0.
% 0.20/0.51 % prop_unsat_core_time: 0.
% 0.20/0.51
% 0.20/0.51 % ------ QBF
% 0.20/0.51
% 0.20/0.51 % qbf_q_res: 0
% 0.20/0.51 % qbf_num_tautologies: 0
% 0.20/0.51 % qbf_prep_cycles: 0
% 0.20/0.51
% 0.20/0.51 % ------ BMC1
% 0.20/0.51
% 0.20/0.51 % bmc1_current_bound: -1
% 0.20/0.51 % bmc1_last_solved_bound: -1
% 0.20/0.51 % bmc1_unsat_core_size: -1
% 0.20/0.51 % bmc1_unsat_core_parents_size: -1
% 0.20/0.51 % bmc1_merge_next_fun: 0
% 0.20/0.51 % bmc1_unsat_core_clauses_time: 0.
% 0.20/0.51
% 0.20/0.51 % ------ Instantiation
% 0.20/0.51
% 0.20/0.51 % inst_num_of_clauses: 11
% 0.20/0.51 % inst_num_in_passive: 0
% 0.20/0.51 % inst_num_in_active: 0
% 0.20/0.51 % inst_num_in_unprocessed: 11
% 0.20/0.51 % inst_num_of_loops: 0
% 0.20/0.51 % inst_num_of_learning_restarts: 0
% 0.20/0.51 % inst_num_moves_active_passive: 0
% 0.20/0.51 % inst_lit_activity: 0
% 0.20/0.51 % inst_lit_activity_moves: 0
% 0.20/0.51 % inst_num_tautologies: 0
% 0.20/0.51 % inst_num_prop_implied: 0
% 0.20/0.51 % inst_num_existing_simplified: 0
% 0.20/0.51 % inst_num_eq_res_simplified: 0
% 0.20/0.51 % inst_num_child_elim: 0
% 0.20/0.51 % inst_num_of_dismatching_blockings: 0
% 0.20/0.51 % inst_num_of_non_proper_insts: 0
% 0.20/0.51 % inst_num_of_duplicates: 0
% 0.20/0.51 % inst_inst_num_from_inst_to_res: 0
% 0.20/0.51 % inst_dismatching_checking_time: 0.
% 0.20/0.51
% 0.20/0.51 % ------ Resolution
% 0.20/0.51
% 0.20/0.51 % res_num_of_clauses: 24
% 0.20/0.51 % res_num_in_passive: 1
% 0.20/0.51 % res_num_in_active: 21
% 0.20/0.51 % res_num_of_loops: 21
% 0.20/0.51 % res_forward_subset_subsumed: 8
% 0.20/0.51 % res_backward_subset_subsumed: 0
% 0.20/0.51 % res_forward_subsumed: 1
% 0.20/0.51 % res_backward_subsumed: 0
% 0.20/0.51 % res_forward_subsumption_resolution: 5
% 0.20/0.51 % res_backward_subsumption_resolution: 0
% 0.20/0.51 % res_clause_to_clause_subsumption: 36
% 0.20/0.51 % res_orphan_elimination: 0
% 0.20/0.51 % res_tautology_del: 1
% 0.20/0.51 % res_num_eq_res_simplified: 0
% 0.20/0.51 % res_num_sel_changes: 0
% 0.20/0.51 % res_moves_from_active_to_pass: 0
% 0.20/0.51
% 0.20/0.51 % Status Unsatisfiable
% 0.20/0.51 % SZS status Unsatisfiable
% 0.20/0.51 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------