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