0.07/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.07/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s 0.12/0.33 Computer : n015.cluster.edu 0.12/0.33 Model : x86_64 x86_64 0.12/0.33 CPUModel : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.33 RAMPerCPU : 8042.1875MB 0.12/0.33 OS : Linux 3.10.0-693.el7.x86_64 0.12/0.33 % CPULimit : 960 0.12/0.33 % WCLimit : 120 0.12/0.33 % DateTime : Tue Aug 9 04:25:26 EDT 2022 0.12/0.33 % CPUTime : 0.12/0.36 # No SInE strategy applied 0.12/0.36 # Auto-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y 0.12/0.36 # and selection function SelectMaxLComplexAvoidPosPred. 0.12/0.36 # 0.12/0.36 # Number of axioms: 47 Number of unprocessed: 47 0.12/0.36 # Tableaux proof search. 0.12/0.36 # APR header successfully linked. 0.12/0.36 # Hello from C++ 0.12/0.36 # The folding up rule is enabled... 0.12/0.36 # Local unification is enabled... 0.12/0.36 # Any saturation attempts will use folding labels... 0.12/0.36 # 47 beginning clauses after preprocessing and clausification 0.12/0.36 # Creating start rules for all 4 conjectures. 0.12/0.36 # There are 4 start rule candidates: 0.12/0.36 # Found 5 unit axioms. 0.12/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. 0.12/0.36 # 4 start rule tableaux created. 0.12/0.36 # 42 extension rule candidate clauses 0.12/0.36 # 5 unit axiom clauses 0.12/0.36 0.12/0.36 # Requested 8, 32 cores available to the main process. 0.12/0.36 # There are not enough tableaux to fork, creating more from the initial 4 0.12/0.36 # Returning from population with 13 new_tableaux and 0 remaining starting tableaux. 0.12/0.36 # We now have 13 tableaux to operate on 2.59/0.69 # There were 2 total branch saturation attempts. 2.59/0.69 # There were 0 of these attempts blocked. 2.59/0.69 # There were 0 deferred branch saturation attempts. 2.59/0.69 # There were 0 free duplicated saturations. 2.59/0.69 # There were 2 total successful branch saturations. 2.59/0.69 # There were 0 successful branch saturations in interreduction. 2.59/0.69 # There were 0 successful branch saturations on the branch. 2.59/0.69 # There were 2 successful branch saturations after the branch. 2.59/0.69 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p 2.59/0.69 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p 2.59/0.69 # Begin clausification derivation 2.59/0.69 2.59/0.69 # End clausification derivation 2.59/0.69 # Begin listing active clauses obtained from FOF to CNF conversion 2.59/0.69 cnf(i_0_45, negated_conjecture, (part_of(esk15_0,esk16_0))). 2.59/0.69 cnf(i_0_32, plain, (inner_point(esk9_1(X1),X1))). 2.59/0.69 cnf(i_0_14, plain, (closed(X1)|end_point(esk5_1(X1),X1))). 2.59/0.69 cnf(i_0_11, plain, (open(X2)|~end_point(X1,X2))). 2.59/0.69 cnf(i_0_10, plain, (end_point(esk3_1(X1),X1)|~open(X1))). 2.59/0.69 cnf(i_0_33, plain, (X1=X2|open(X1)|~part_of(X1,X2))). 2.59/0.69 cnf(i_0_15, plain, (~closed(X1)|~end_point(X2,X1))). 2.59/0.69 cnf(i_0_6, plain, (incident_c(X1,X2)|~inner_point(X1,X2))). 2.59/0.69 cnf(i_0_37, plain, (incident_c(X1,X2)|~end_point(X1,X2))). 2.59/0.69 cnf(i_0_7, plain, (~inner_point(X1,X2)|~end_point(X1,X2))). 2.59/0.69 cnf(i_0_24, plain, (esk7_2(X2,X1)!=X1|~end_point(X1,X2))). 2.59/0.69 cnf(i_0_47, negated_conjecture, (meet(esk17_0,esk14_0,esk15_0))). 2.59/0.69 cnf(i_0_46, negated_conjecture, (meet(esk17_0,esk14_0,esk16_0))). 2.59/0.69 cnf(i_0_5, plain, (inner_point(X1,X2)|end_point(X1,X2)|~incident_c(X1,X2))). 2.59/0.69 cnf(i_0_3, plain, (part_of(X2,X1)|incident_c(esk1_2(X1,X2),X2))). 2.59/0.69 cnf(i_0_1, plain, (incident_c(X3,X2)|~incident_c(X3,X1)|~part_of(X1,X2))). 2.59/0.69 cnf(i_0_30, plain, (incident_c(X1,X3)|X3!=sum(X4,X2)|~incident_c(X1,X2))). 2.59/0.69 cnf(i_0_29, plain, (incident_c(X1,X3)|X3!=sum(X2,X4)|~incident_c(X1,X2))). 2.59/0.69 cnf(i_0_25, plain, (end_point(esk7_2(X1,X2),X1)|~end_point(X2,X1))). 2.59/0.69 cnf(i_0_8, plain, (X3=X4|X1=X4|X1=X3|~end_point(X4,X2)|~end_point(X3,X2)|~end_point(X1,X2))). 2.59/0.69 cnf(i_0_31, plain, (incident_c(X1,X4)|incident_c(X1,X3)|X2!=sum(X4,X3)|~incident_c(X1,X2))). 2.59/0.69 cnf(i_0_41, plain, (end_point(X1,X2)|incident_c(X1,esk12_2(X1,X2))|~incident_c(X1,X2))). 2.59/0.69 cnf(i_0_42, plain, (end_point(X1,X2)|incident_c(X1,esk13_2(X1,X2))|~incident_c(X1,X2))). 2.59/0.69 cnf(i_0_43, plain, (end_point(X1,X2)|part_of(esk12_2(X1,X2),X2)|~incident_c(X1,X2))). 2.59/0.69 cnf(i_0_40, plain, (end_point(X1,X2)|part_of(esk13_2(X1,X2),X2)|~incident_c(X1,X2))). 2.59/0.69 cnf(i_0_2, plain, (part_of(X2,X1)|~incident_c(esk1_2(X1,X2),X1))). 2.59/0.69 cnf(i_0_12, plain, (X1=X2|incident_c(esk4_2(X1,X2),X2)|incident_c(esk4_2(X1,X2),X1))). 2.59/0.69 cnf(i_0_44, negated_conjecture, (~part_of(sum(esk14_0,esk15_0),sum(esk14_0,esk16_0)))). 2.59/0.69 cnf(i_0_34, plain, (sum(esk10_2(X1,X2),esk11_2(X1,X2))=X1|~inner_point(X2,X1))). 2.59/0.69 cnf(i_0_21, plain, (incident_c(X1,X2)|~meet(X1,X3,X2))). 2.59/0.69 cnf(i_0_22, plain, (incident_c(X1,X2)|~meet(X1,X2,X3))). 2.59/0.69 cnf(i_0_4, plain, (esk2_2(X2,X3)=sum(X2,X3)|~meet(X1,X2,X3))). 2.59/0.69 cnf(i_0_13, plain, (X1=X2|~incident_c(esk4_2(X1,X2),X2)|~incident_c(esk4_2(X1,X2),X1))). 2.59/0.69 cnf(i_0_35, plain, (meet(X1,esk10_2(X2,X1),esk11_2(X2,X1))|~inner_point(X1,X2))). 2.59/0.69 cnf(i_0_38, plain, (end_point(X1,X2)|~incident_c(X1,X2)|~part_of(esk12_2(X1,X2),esk13_2(X1,X2)))). 2.59/0.69 cnf(i_0_39, plain, (end_point(X1,X2)|~incident_c(X1,X2)|~part_of(esk13_2(X1,X2),esk12_2(X1,X2)))). 2.59/0.69 cnf(i_0_36, plain, (part_of(X4,X1)|part_of(X1,X4)|~incident_c(X3,X4)|~incident_c(X3,X1)|~part_of(X4,X2)|~part_of(X1,X2)|~end_point(X3,X2))). 2.59/0.69 cnf(i_0_20, plain, (end_point(X1,X2)|~incident_c(X1,X3)|~incident_c(X1,X2)|~meet(X4,X3,X2))). 2.59/0.69 cnf(i_0_19, plain, (end_point(X1,X2)|~incident_c(X1,X3)|~incident_c(X1,X2)|~meet(X4,X2,X3))). 2.59/0.69 cnf(i_0_23, plain, (meet(X5,X2,X3)|sum(X2,X3)!=X4|~closed(X4)|~end_point(X5,X2)|~meet(X1,X2,X3))). 2.59/0.69 cnf(i_0_17, plain, (meet(X1,X2,X3)|incident_c(esk6_3(X1,X2,X3),X3)|~incident_c(X1,X3)|~incident_c(X1,X2))). 2.59/0.69 cnf(i_0_18, plain, (meet(X1,X2,X3)|incident_c(esk6_3(X1,X2,X3),X2)|~incident_c(X1,X3)|~incident_c(X1,X2))). 2.59/0.69 cnf(i_0_9, plain, (part_of(X5,X3)|part_of(X5,X1)|part_of(X3,X5)|part_of(X3,X1)|part_of(X1,X5)|part_of(X1,X3)|~part_of(X5,X2)|~part_of(X3,X2)|~part_of(X1,X2)|~end_point(X4,X5)|~end_point(X4,X3)|~end_point(X4,X1))). 2.59/0.69 cnf(i_0_26, plain, (X1=sum(X2,X3)|incident_c(esk8_3(X1,X2,X3),X3)|incident_c(esk8_3(X1,X2,X3),X2)|incident_c(esk8_3(X1,X2,X3),X1))). 2.59/0.69 cnf(i_0_28, plain, (X1=sum(X2,X3)|~incident_c(esk8_3(X1,X2,X3),X3)|~incident_c(esk8_3(X1,X2,X3),X1))). 2.59/0.69 cnf(i_0_27, plain, (X1=sum(X2,X3)|~incident_c(esk8_3(X1,X2,X3),X2)|~incident_c(esk8_3(X1,X2,X3),X1))). 2.59/0.69 cnf(i_0_16, plain, (meet(X1,X2,X3)|~incident_c(X1,X3)|~incident_c(X1,X2)|~end_point(esk6_3(X1,X2,X3),X3)|~end_point(esk6_3(X1,X2,X3),X2))). 2.59/0.69 # End listing active clauses. There is an equivalent clause to each of these in the clausification! 2.59/0.69 # Begin printing tableau 2.59/0.69 # Found 5 steps 2.59/0.69 cnf(i_0_47, negated_conjecture, (meet(esk17_0,esk14_0,esk15_0)), inference(start_rule)). 2.59/0.69 cnf(i_0_50, plain, (meet(esk17_0,esk14_0,esk15_0)), inference(extension_rule, [i_0_21])). 2.59/0.69 cnf(i_0_252, plain, (incident_c(esk17_0,esk15_0)), inference(extension_rule, [i_0_5])). 2.59/0.69 cnf(i_0_273, plain, (inner_point(esk17_0,esk15_0)), inference(etableau_closure_rule, [i_0_273, ...])). 2.59/0.69 cnf(i_0_274, plain, (end_point(esk17_0,esk15_0)), inference(etableau_closure_rule, [i_0_274, ...])). 2.59/0.69 # End printing tableau 2.59/0.69 # SZS output end 2.59/0.69 # Branches closed with saturation will be marked with an "s" 2.59/0.69 # Child (26939) has found a proof. 2.59/0.69 2.59/0.70 # Proof search is over... 2.59/0.70 # Freeing feature tree 2.59/0.70 EOF