0.00/0.08 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.08 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s 0.07/0.28 Computer : n009.cluster.edu 0.07/0.28 Model : x86_64 x86_64 0.07/0.28 CPUModel : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.07/0.28 RAMPerCPU : 8042.1875MB 0.07/0.28 OS : Linux 3.10.0-693.el7.x86_64 0.07/0.28 % CPULimit : 960 0.07/0.28 % WCLimit : 120 0.07/0.28 % DateTime : Tue Aug 9 02:00:35 EDT 2022 0.07/0.29 % CPUTime : 0.13/0.32 # No SInE strategy applied 0.13/0.32 # Auto-Mode selected heuristic G_E___107_C36_F1_PI_AE_Q4_CS_SP_PS_S0Y 0.13/0.32 # and selection function SelectMaxLComplexAvoidPosPred. 0.13/0.32 # 0.13/0.32 # Presaturation interreduction done 0.13/0.32 # Number of axioms: 30 Number of unprocessed: 30 0.13/0.32 # Tableaux proof search. 0.13/0.32 # APR header successfully linked. 0.13/0.32 # Hello from C++ 0.13/0.32 # The folding up rule is enabled... 0.13/0.32 # Local unification is enabled... 0.13/0.32 # Any saturation attempts will use folding labels... 0.13/0.32 # 30 beginning clauses after preprocessing and clausification 0.13/0.32 # Creating start rules for all 5 conjectures. 0.13/0.32 # There are 5 start rule candidates: 0.13/0.32 # Found 6 unit axioms. 0.13/0.32 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. 0.13/0.32 # 5 start rule tableaux created. 0.13/0.32 # 24 extension rule candidate clauses 0.13/0.32 # 6 unit axiom clauses 0.13/0.32 0.13/0.32 # Requested 8, 32 cores available to the main process. 0.13/0.32 # There are not enough tableaux to fork, creating more from the initial 5 0.13/0.32 # Returning from population with 11 new_tableaux and 0 remaining starting tableaux. 0.13/0.32 # We now have 11 tableaux to operate on 0.13/0.33 # Creating equality axioms 0.13/0.33 # Ran out of tableaux, making start rules for all clauses 0.13/0.33 # Creating equality axioms 0.13/0.33 # Ran out of tableaux, making start rules for all clauses 0.13/0.33 # Creating equality axioms 0.13/0.33 # Ran out of tableaux, making start rules for all clauses 0.13/0.33 # Creating equality axioms 0.13/0.33 # Ran out of tableaux, making start rules for all clauses 0.13/0.34 # There were 3 total branch saturation attempts. 0.13/0.34 # There were 0 of these attempts blocked. 0.13/0.34 # There were 0 deferred branch saturation attempts. 0.13/0.34 # There were 0 free duplicated saturations. 0.13/0.34 # There were 3 total successful branch saturations. 0.13/0.34 # There were 0 successful branch saturations in interreduction. 0.13/0.34 # There were 0 successful branch saturations on the branch. 0.13/0.34 # There were 3 successful branch saturations after the branch. 0.13/0.34 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p 0.13/0.34 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p 0.13/0.34 # Begin clausification derivation 0.13/0.34 0.13/0.34 # End clausification derivation 0.13/0.34 # Begin listing active clauses obtained from FOF to CNF conversion 0.13/0.34 cnf(i_0_15, negated_conjecture, (environment(esk1_0))). 0.13/0.34 cnf(i_0_16, negated_conjecture, (in_environment(esk1_0,critical_point(esk1_0)))). 0.13/0.34 cnf(i_0_18, negated_conjecture, (greater(critical_point(esk1_0),esk2_0))). 0.13/0.34 cnf(i_0_17, negated_conjecture, (greater_or_equal(esk2_0,appear(efficient_producers,esk1_0)))). 0.13/0.34 cnf(i_0_20, plain, (greater_or_equal(X1,X1))). 0.13/0.34 cnf(i_0_14, negated_conjecture, (~selection_favors(first_movers,efficient_producers,esk2_0))). 0.13/0.34 cnf(i_0_21, plain, (greater_or_equal(X1,X2)|~greater(X1,X2))). 0.13/0.34 cnf(i_0_2, plain, (in_environment(X1,start_time(X1))|~environment(X1))). 0.13/0.34 cnf(i_0_19, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))). 0.13/0.34 cnf(i_0_6, plain, (greater_or_equal(appear(first_movers,X1),start_time(X1))|~environment(X1))). 0.13/0.34 cnf(i_0_1, plain, (subpopulations(first_movers,efficient_producers,X1,critical_point(X1))|~environment(X1)|~in_environment(X1,critical_point(X1)))). 0.13/0.34 cnf(i_0_5, plain, (greater_or_equal(X1,appear(efficient_producers,X2))|~environment(X2)|~subpopulations(first_movers,efficient_producers,X2,X1))). 0.13/0.34 cnf(i_0_24, plain, (subpopulations(first_movers,efficient_producers,X1,appear(efficient_producers,X1))|~environment(X1)|~in_environment(X1,appear(efficient_producers,X1)))). 0.13/0.34 cnf(i_0_11, plain, (in_environment(X1,X2)|~greater_or_equal(X2,appear(efficient_producers,X1))|~greater(critical_point(X1),X2)|~environment(X1)|~in_environment(X1,critical_point(X1)))). 0.13/0.34 cnf(i_0_29, plain, (subpopulations(efficient_producers,first_movers,X1,X2)|~environment(X1)|~subpopulations(first_movers,efficient_producers,X1,X2))). 0.13/0.34 cnf(i_0_7, plain, (in_environment(X1,X2)|~greater_or_equal(X2,X3)|~greater_or_equal(X4,X2)|~environment(X1)|~in_environment(X1,X3)|~in_environment(X1,X4))). 0.13/0.34 cnf(i_0_13, hypothesis, (X1!=critical_point(X2)|~greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))|~environment(X2))). 0.13/0.34 cnf(i_0_9, plain, (greater(zero,difference(growth_rate(first_movers,X1),growth_rate(efficient_producers,X1)))|~greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1)))). 0.13/0.34 cnf(i_0_22, plain, (greater(difference(growth_rate(first_movers,X1),growth_rate(efficient_producers,X1)),zero)|~greater(growth_rate(first_movers,X1),growth_rate(efficient_producers,X1)))). 0.13/0.34 cnf(i_0_8, plain, (greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))|~greater(zero,difference(growth_rate(first_movers,X1),growth_rate(efficient_producers,X1))))). 0.13/0.34 cnf(i_0_23, plain, (greater(growth_rate(first_movers,X1),growth_rate(efficient_producers,X1))|~greater(difference(growth_rate(first_movers,X1),growth_rate(efficient_producers,X1)),zero))). 0.13/0.34 cnf(i_0_25, hypothesis, (decreases(difference(founding_rate(first_movers,X1),founding_rate(efficient_producers,X1)))|~environment(X2)|~subpopulations(first_movers,efficient_producers,X2,X1))). 0.13/0.34 cnf(i_0_30, plain, (subpopulations(first_movers,efficient_producers,X1,X2)|~greater(cardinality_at_time(first_movers,X2),zero)|~greater(cardinality_at_time(efficient_producers,X2),zero)|~environment(X1)|~in_environment(X1,X2))). 0.13/0.34 cnf(i_0_12, hypothesis, (greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))|X2!=critical_point(X3)|~greater(X1,X2)|~environment(X3)|~subpopulations(first_movers,efficient_producers,X3,X1))). 0.13/0.34 cnf(i_0_4, plain, (selection_favors(X1,X2,X3)|~greater(growth_rate(X1,X3),growth_rate(X2,X3))|~environment(X4)|~subpopulations(X2,X1,X4,X3))). 0.13/0.34 cnf(i_0_26, plain, (~decreases(difference(disbanding_rate(first_movers,X1),disbanding_rate(efficient_producers,X1)))|~environment(X2)|~subpopulations(first_movers,efficient_producers,X2,X1))). 0.13/0.34 cnf(i_0_27, plain, (decreases(difference(disbanding_rate(first_movers,X1),disbanding_rate(efficient_producers,X1)))|decreases(difference(growth_rate(first_movers,X1),growth_rate(efficient_producers,X1)))|~decreases(difference(founding_rate(first_movers,X1),founding_rate(efficient_producers,X1))))). 0.13/0.34 cnf(i_0_10, hypothesis, (subpopulations(first_movers,efficient_producers,X1,X2)|~greater_or_equal(X2,X3)|~greater_or_equal(X4,X2)|~environment(X1)|~subpopulations(first_movers,efficient_producers,X1,X4)|~subpopulations(first_movers,efficient_producers,X1,X3))). 0.13/0.34 cnf(i_0_28, plain, (greater_or_equal(difference(growth_rate(first_movers,X1),growth_rate(efficient_producers,X1)),zero)|greater(zero,difference(growth_rate(first_movers,X1),growth_rate(efficient_producers,X1)))|~environment(X2)|~subpopulations(first_movers,efficient_producers,X2,X1))). 0.13/0.34 cnf(i_0_3, plain, (greater(difference(growth_rate(first_movers,X1),growth_rate(efficient_producers,X1)),zero)|~greater_or_equal(difference(growth_rate(first_movers,X2),growth_rate(efficient_producers,X2)),zero)|~greater_or_equal(X1,appear(efficient_producers,X3))|~decreases(difference(growth_rate(first_movers,X1),growth_rate(efficient_producers,X1)))|~greater(X2,X1)|~environment(X3)|~in_environment(X3,X2))). 0.13/0.34 # End listing active clauses. There is an equivalent clause to each of these in the clausification! 0.13/0.34 # Begin printing tableau 0.13/0.34 # Found 9 steps 0.13/0.34 cnf(i_0_17, negated_conjecture, (greater_or_equal(esk2_0,appear(efficient_producers,esk1_0))), inference(start_rule)). 0.13/0.34 cnf(i_0_33, plain, (greater_or_equal(esk2_0,appear(efficient_producers,esk1_0))), inference(extension_rule, [i_0_3])). 0.13/0.34 cnf(i_0_200, plain, (~greater(critical_point(esk1_0),esk2_0)), inference(closure_rule, [i_0_18])). 0.13/0.34 cnf(i_0_201, plain, (~environment(esk1_0)), inference(closure_rule, [i_0_15])). 0.13/0.34 cnf(i_0_202, plain, (~in_environment(esk1_0,critical_point(esk1_0))), inference(closure_rule, [i_0_16])). 0.13/0.34 cnf(i_0_196, plain, (greater(difference(growth_rate(first_movers,esk2_0),growth_rate(efficient_producers,esk2_0)),zero)), inference(extension_rule, [i_0_21])). 0.13/0.34 cnf(i_0_197, plain, (~greater_or_equal(difference(growth_rate(first_movers,critical_point(esk1_0)),growth_rate(efficient_producers,critical_point(esk1_0))),zero)), inference(etableau_closure_rule, [i_0_197, ...])). 0.13/0.34 cnf(i_0_199, plain, (~decreases(difference(growth_rate(first_movers,esk2_0),growth_rate(efficient_producers,esk2_0)))), inference(etableau_closure_rule, [i_0_199, ...])). 0.13/0.34 cnf(i_0_203, plain, (greater_or_equal(difference(growth_rate(first_movers,esk2_0),growth_rate(efficient_producers,esk2_0)),zero)), inference(etableau_closure_rule, [i_0_203, ...])). 0.13/0.34 # End printing tableau 0.13/0.34 # SZS output end 0.13/0.34 # Branches closed with saturation will be marked with an "s" 0.13/0.34 # Child (8003) has found a proof. 0.13/0.34 0.13/0.34 # Proof search is over... 0.13/0.34 # Freeing feature tree 0.13/0.34 EOF