%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GEO093+1 : TPTP v8.1.0. Released v2.4.0. % Transfm : none % Format : tptp:raw % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 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 : Sat Jul 16 04:07:46 EDT 2022 % Result : Theorem 3.47s 0.81s % Output : CNFRefutation 3.47s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.11 % Problem : GEO093+1 : TPTP v8.1.0. Released v2.4.0. % 0.11/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 : n028.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Sat Jun 18 03:54:28 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: 48 Number of unprocessed: 48 % 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 # 48 beginning clauses after preprocessing and clausification % 0.12/0.36 # Creating start rules for all 5 conjectures. % 0.12/0.36 # There are 5 start rule candidates: % 0.12/0.36 # Found 6 unit axioms. % 0.12/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.36 # 5 start rule tableaux created. % 0.12/0.36 # 42 extension rule candidate clauses % 0.12/0.36 # 6 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 5 % 0.12/0.36 # Returning from population with 11 new_tableaux and 0 remaining starting tableaux. % 0.12/0.36 # We now have 11 tableaux to operate on % 3.47/0.81 # There were 5 total branch saturation attempts. % 3.47/0.81 # There were 0 of these attempts blocked. % 3.47/0.81 # There were 0 deferred branch saturation attempts. % 3.47/0.81 # There were 0 free duplicated saturations. % 3.47/0.81 # There were 5 total successful branch saturations. % 3.47/0.81 # There were 1 successful branch saturations in interreduction. % 3.47/0.81 # There were 0 successful branch saturations on the branch. % 3.47/0.81 # There were 4 successful branch saturations after the branch. % 3.47/0.81 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 3.47/0.81 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 3.47/0.81 # Begin clausification derivation % 3.47/0.81 % 3.47/0.81 # End clausification derivation % 3.47/0.81 # Begin listing active clauses obtained from FOF to CNF conversion % 3.47/0.81 cnf(i_0_48, negated_conjecture, (open(esk14_0))). % 3.47/0.81 cnf(i_0_47, negated_conjecture, (part_of(esk15_0,esk14_0))). % 3.47/0.81 cnf(i_0_46, negated_conjecture, (part_of(esk16_0,esk14_0))). % 3.47/0.81 cnf(i_0_34, plain, (inner_point(esk8_1(X1),X1))). % 3.47/0.81 cnf(i_0_28, plain, (closed(X1)|end_point(esk6_1(X1),X1))). % 3.47/0.81 cnf(i_0_30, plain, (open(X2)|~end_point(X1,X2))). % 3.47/0.81 cnf(i_0_31, plain, (end_point(esk7_1(X1),X1)|~open(X1))). % 3.47/0.81 cnf(i_0_32, plain, (X1=X2|open(X1)|~part_of(X1,X2))). % 3.47/0.81 cnf(i_0_29, plain, (~closed(X1)|~end_point(X2,X1))). % 3.47/0.81 cnf(i_0_17, plain, (incident_c(X1,X2)|~end_point(X1,X2))). % 3.47/0.81 cnf(i_0_20, plain, (incident_c(X1,X2)|~inner_point(X1,X2))). % 3.47/0.81 cnf(i_0_44, negated_conjecture, (~open(sum(esk15_0,esk16_0)))). % 3.47/0.81 cnf(i_0_19, plain, (~end_point(X1,X2)|~inner_point(X1,X2))). % 3.47/0.81 cnf(i_0_38, plain, (esk11_2(X2,X1)!=X1|~end_point(X1,X2))). % 3.47/0.81 cnf(i_0_45, negated_conjecture, (meet(esk17_0,esk15_0,esk16_0))). % 3.47/0.81 cnf(i_0_18, plain, (end_point(X1,X2)|inner_point(X1,X2)|~incident_c(X1,X2))). % 3.47/0.81 cnf(i_0_2, plain, (part_of(X2,X1)|incident_c(esk1_2(X1,X2),X2))). % 3.47/0.81 cnf(i_0_3, plain, (incident_c(X3,X2)|~part_of(X1,X2)|~incident_c(X3,X1))). % 3.47/0.81 cnf(i_0_7, plain, (incident_c(X1,X3)|X3!=sum(X4,X2)|~incident_c(X1,X2))). % 3.47/0.81 cnf(i_0_8, plain, (incident_c(X1,X3)|X3!=sum(X2,X4)|~incident_c(X1,X2))). % 3.47/0.81 cnf(i_0_39, plain, (end_point(esk11_2(X1,X2),X1)|~end_point(X2,X1))). % 3.47/0.81 cnf(i_0_37, plain, (X3=X4|X1=X4|X1=X3|~end_point(X4,X2)|~end_point(X3,X2)|~end_point(X1,X2))). % 3.47/0.81 cnf(i_0_9, plain, (incident_c(X1,X4)|incident_c(X1,X3)|X2!=sum(X3,X4)|~incident_c(X1,X2))). % 3.47/0.81 cnf(i_0_13, plain, (end_point(X1,X2)|incident_c(X1,esk3_2(X1,X2))|~incident_c(X1,X2))). % 3.47/0.81 cnf(i_0_12, plain, (end_point(X1,X2)|incident_c(X1,esk4_2(X1,X2))|~incident_c(X1,X2))). % 3.47/0.81 cnf(i_0_15, plain, (end_point(X1,X2)|part_of(esk3_2(X1,X2),X2)|~incident_c(X1,X2))). % 3.47/0.81 cnf(i_0_14, plain, (end_point(X1,X2)|part_of(esk4_2(X1,X2),X2)|~incident_c(X1,X2))). % 3.47/0.81 cnf(i_0_1, plain, (part_of(X2,X1)|~incident_c(esk1_2(X1,X2),X1))). % 3.47/0.81 cnf(i_0_42, plain, (X1=X2|incident_c(esk13_2(X1,X2),X2)|incident_c(esk13_2(X1,X2),X1))). % 3.47/0.81 cnf(i_0_35, plain, (sum(esk9_2(X1,X2),esk10_2(X1,X2))=X1|~inner_point(X2,X1))). % 3.47/0.81 cnf(i_0_26, plain, (incident_c(X1,X2)|~meet(X1,X3,X2))). % 3.47/0.81 cnf(i_0_27, plain, (incident_c(X1,X2)|~meet(X1,X2,X3))). % 3.47/0.81 cnf(i_0_41, plain, (esk12_2(X2,X3)=sum(X2,X3)|~meet(X1,X2,X3))). % 3.47/0.81 cnf(i_0_43, plain, (X1=X2|~incident_c(esk13_2(X1,X2),X2)|~incident_c(esk13_2(X1,X2),X1))). % 3.47/0.81 cnf(i_0_36, plain, (meet(X1,esk9_2(X2,X1),esk10_2(X2,X1))|~inner_point(X1,X2))). % 3.47/0.81 cnf(i_0_11, plain, (end_point(X1,X2)|~incident_c(X1,X2)|~part_of(esk3_2(X1,X2),esk4_2(X1,X2)))). % 3.47/0.81 cnf(i_0_10, plain, (end_point(X1,X2)|~incident_c(X1,X2)|~part_of(esk4_2(X1,X2),esk3_2(X1,X2)))). % 3.47/0.81 cnf(i_0_16, plain, (part_of(X3,X1)|part_of(X1,X3)|~part_of(X3,X2)|~part_of(X1,X2)|~incident_c(X4,X3)|~incident_c(X4,X1)|~end_point(X4,X2))). % 3.47/0.81 cnf(i_0_24, plain, (end_point(X1,X2)|~incident_c(X1,X3)|~incident_c(X1,X2)|~meet(X4,X3,X2))). % 3.47/0.81 cnf(i_0_25, plain, (end_point(X1,X2)|~incident_c(X1,X3)|~incident_c(X1,X2)|~meet(X4,X2,X3))). % 3.47/0.81 cnf(i_0_40, plain, (meet(X5,X3,X4)|X1!=sum(X3,X4)|~closed(X1)|~end_point(X5,X3)|~meet(X2,X3,X4))). % 3.47/0.81 cnf(i_0_22, plain, (meet(X1,X2,X3)|incident_c(esk5_3(X1,X2,X3),X3)|~incident_c(X1,X3)|~incident_c(X1,X2))). % 3.47/0.81 cnf(i_0_23, plain, (meet(X1,X2,X3)|incident_c(esk5_3(X1,X2,X3),X2)|~incident_c(X1,X3)|~incident_c(X1,X2))). % 3.47/0.81 cnf(i_0_33, plain, (part_of(X4,X3)|part_of(X4,X1)|part_of(X3,X4)|part_of(X3,X1)|part_of(X1,X4)|part_of(X1,X3)|~part_of(X4,X2)|~part_of(X3,X2)|~part_of(X1,X2)|~end_point(X5,X4)|~end_point(X5,X3)|~end_point(X5,X1))). % 3.47/0.81 cnf(i_0_4, plain, (X1=sum(X2,X3)|incident_c(esk2_3(X1,X2,X3),X3)|incident_c(esk2_3(X1,X2,X3),X2)|incident_c(esk2_3(X1,X2,X3),X1))). % 3.47/0.81 cnf(i_0_5, plain, (X1=sum(X2,X3)|~incident_c(esk2_3(X1,X2,X3),X3)|~incident_c(esk2_3(X1,X2,X3),X1))). % 3.47/0.81 cnf(i_0_6, plain, (X1=sum(X2,X3)|~incident_c(esk2_3(X1,X2,X3),X2)|~incident_c(esk2_3(X1,X2,X3),X1))). % 3.47/0.81 cnf(i_0_21, plain, (meet(X1,X2,X3)|~incident_c(X1,X3)|~incident_c(X1,X2)|~end_point(esk5_3(X1,X2,X3),X3)|~end_point(esk5_3(X1,X2,X3),X2))). % 3.47/0.81 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 3.47/0.81 # Begin printing tableau % 3.47/0.81 # Found 12 steps % 3.47/0.81 cnf(i_0_45, negated_conjecture, (meet(esk17_0,esk15_0,esk16_0)), inference(start_rule)). % 3.47/0.81 cnf(i_0_49, plain, (meet(esk17_0,esk15_0,esk16_0)), inference(extension_rule, [i_0_40])). % 3.47/0.81 cnf(i_0_150, plain, (meet(esk6_1(esk15_0),esk15_0,esk16_0)), inference(extension_rule, [i_0_26])). % 3.47/0.81 cnf(i_0_390, plain, (incident_c(esk6_1(esk15_0),esk16_0)), inference(extension_rule, [i_0_18])). % 3.47/0.81 cnf(i_0_151, plain, ($false), inference(extension_rule, [i_0_32])). % 3.47/0.81 cnf(i_0_421, plain, (open(sum(esk15_0,esk16_0))), inference(closure_rule, [i_0_44])). % 3.47/0.81 cnf(i_0_152, plain, (~closed(sum(esk15_0,esk16_0))), inference(etableau_closure_rule, [i_0_152, ...])). % 3.47/0.81 cnf(i_0_422, plain, (~part_of(sum(esk15_0,esk16_0),sum(esk15_0,esk16_0))), inference(etableau_closure_rule, [i_0_422, ...])). % 3.47/0.81 cnf(i_0_153, plain, (~end_point(esk6_1(esk15_0),esk15_0)), inference(extension_rule, [i_0_28])). % 3.47/0.81 cnf(i_0_411, plain, (end_point(esk6_1(esk15_0),esk16_0)), inference(etableau_closure_rule, [i_0_411, ...])). % 3.47/0.81 cnf(i_0_412, plain, (inner_point(esk6_1(esk15_0),esk16_0)), inference(etableau_closure_rule, [i_0_412, ...])). % 3.47/0.81 cnf(i_0_532, plain, (closed(esk15_0)), inference(etableau_closure_rule, [i_0_532, ...])). % 3.47/0.81 # End printing tableau % 3.47/0.81 # SZS output end % 3.47/0.81 # Branches closed with saturation will be marked with an "s" % 3.47/0.81 # Child (2098) has found a proof. % 3.47/0.81 % 3.47/0.81 # Proof search is over... % 3.47/0.81 # Freeing feature tree %------------------------------------------------------------------------------