%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GEO178+2 : TPTP v8.1.0. Released v3.3.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 : n010.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:08:22 EDT 2022 % Result : Theorem 0.13s 0.38s % Output : CNFRefutation 0.13s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.13 % Problem : GEO178+2 : TPTP v8.1.0. Released v3.3.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.35 % Computer : n010.cluster.edu % 0.13/0.35 % Model : x86_64 x86_64 % 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.35 % Memory : 8042.1875MB % 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.35 % CPULimit : 300 % 0.13/0.35 % WCLimit : 600 % 0.13/0.35 % DateTime : Sat Jun 18 10:23:38 EDT 2022 % 0.13/0.35 % CPUTime : % 0.13/0.38 # No SInE strategy applied % 0.13/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.38 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.38 # % 0.13/0.38 # Presaturation interreduction done % 0.13/0.38 # Number of axioms: 17 Number of unprocessed: 17 % 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 # 17 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 5 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 # 12 extension rule candidate clauses % 0.13/0.38 # 5 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 % 0.13/0.38 # Closed tableau found in foldup close cycle with 1 folds and 2 closures done. % 0.13/0.38 # There were 0 total branch saturation attempts. % 0.13/0.38 # There were 0 of these attempts blocked. % 0.13/0.38 # There were 0 deferred branch saturation attempts. % 0.13/0.38 # There were 0 free duplicated saturations. % 0.13/0.38 # There were 0 total successful branch saturations. % 0.13/0.38 # There were 0 successful branch saturations in interreduction. % 0.13/0.38 # There were 0 successful branch saturations on the branch. % 0.13/0.38 # There were 0 successful branch saturations after the branch. % 0.13/0.38 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.38 # Begin clausification derivation % 0.13/0.38 % 0.13/0.38 # End clausification derivation % 0.13/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.38 cnf(i_0_17, negated_conjecture, (distinct_points(esk1_0,esk2_0))). % 0.13/0.38 cnf(i_0_16, negated_conjecture, (apart_point_and_line(esk3_0,line_connecting(esk1_0,esk2_0)))). % 0.13/0.38 cnf(i_0_1, plain, (~distinct_points(X1,X1))). % 0.13/0.38 cnf(i_0_2, plain, (~distinct_lines(X1,X1))). % 0.13/0.38 cnf(i_0_3, plain, (~convergent_lines(X1,X1))). % 0.13/0.38 cnf(i_0_15, negated_conjecture, (~distinct_points(esk3_0,esk1_0)|~distinct_points(esk3_0,esk2_0))). % 0.13/0.38 cnf(i_0_14, plain, (distinct_lines(X1,X2)|~convergent_lines(X1,X2))). % 0.13/0.38 cnf(i_0_7, plain, (distinct_points(X1,X2)|~apart_point_and_line(X1,line_connecting(X3,X2))|~distinct_points(X3,X2))). % 0.13/0.38 cnf(i_0_8, plain, (distinct_points(X1,X2)|~apart_point_and_line(X1,line_connecting(X2,X3))|~distinct_points(X2,X3))). % 0.13/0.38 cnf(i_0_9, plain, (distinct_points(X1,intersection_point(X2,X3))|~apart_point_and_line(X1,X3)|~convergent_lines(X2,X3))). % 0.13/0.38 cnf(i_0_10, plain, (distinct_points(X1,intersection_point(X2,X3))|~apart_point_and_line(X1,X2)|~convergent_lines(X2,X3))). % 0.13/0.38 cnf(i_0_4, plain, (distinct_points(X1,X2)|distinct_points(X3,X2)|~distinct_points(X1,X3))). % 0.13/0.38 cnf(i_0_12, plain, (apart_point_and_line(X1,X2)|distinct_points(X3,X1)|~apart_point_and_line(X3,X2))). % 0.13/0.38 cnf(i_0_13, plain, (apart_point_and_line(X1,X2)|distinct_lines(X3,X2)|~apart_point_and_line(X1,X3))). % 0.13/0.38 cnf(i_0_5, plain, (distinct_lines(X1,X2)|distinct_lines(X3,X2)|~distinct_lines(X1,X3))). % 0.13/0.38 cnf(i_0_6, plain, (convergent_lines(X1,X2)|convergent_lines(X3,X2)|~convergent_lines(X1,X3))). % 0.13/0.38 cnf(i_0_11, plain, (apart_point_and_line(X1,X2)|apart_point_and_line(X1,X3)|apart_point_and_line(X4,X2)|apart_point_and_line(X4,X3)|~distinct_lines(X2,X3)|~distinct_points(X1,X4))). % 0.13/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.38 # Begin printing tableau % 0.13/0.38 # Found 9 steps % 0.13/0.38 cnf(i_0_15, negated_conjecture, (~distinct_points(esk3_0,esk1_0)|~distinct_points(esk3_0,esk2_0)), inference(start_rule)). % 0.13/0.38 cnf(i_0_19, plain, (~distinct_points(esk3_0,esk2_0)), inference(extension_rule, [i_0_12])). % 0.13/0.38 cnf(i_0_78, plain, (~apart_point_and_line(esk3_0,line_connecting(esk1_0,esk2_0))), inference(closure_rule, [i_0_16])). % 0.13/0.38 cnf(i_0_76, plain, (apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0))), inference(extension_rule, [i_0_7])). % 0.13/0.38 cnf(i_0_98, plain, (distinct_points(esk2_0,esk2_0)), inference(closure_rule, [i_0_1])). % 0.13/0.38 cnf(i_0_100, plain, (~distinct_points(esk1_0,esk2_0)), inference(closure_rule, [i_0_17])). % 0.13/0.38 cnf(i_0_18, plain, (~distinct_points(esk3_0,esk1_0)), inference(extension_rule, [i_0_8])). % 0.13/0.38 cnf(i_0_104, plain, (~apart_point_and_line(esk3_0,line_connecting(esk1_0,esk2_0))), inference(closure_rule, [i_0_16])). % 0.13/0.38 cnf(i_0_105, plain, (~distinct_points(esk1_0,esk2_0)), inference(closure_rule, [i_0_17])). % 0.13/0.38 # End printing tableau % 0.13/0.38 # SZS output end % 0.13/0.38 # Branches closed with saturation will be marked with an "s" % 0.13/0.38 # Closed tableau found in foldup close cycle with 1 folds and 2 closures done. % 0.13/0.38 # There were 0 total branch saturation attempts. % 0.13/0.38 # There were 0 of these attempts blocked. % 0.13/0.38 # There were 0 deferred branch saturation attempts. % 0.13/0.38 # There were 0 free duplicated saturations. % 0.13/0.38 # There were 0 total successful branch saturations. % 0.13/0.38 # There were 0 successful branch saturations in interreduction. % 0.13/0.38 # There were 0 successful branch saturations on the branch. % 0.13/0.38 # There were 0 successful branch saturations after the branch. % 0.13/0.38 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.38 # Begin clausification derivation % 0.13/0.38 % 0.13/0.38 # End clausification derivation % 0.13/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.38 cnf(i_0_17, negated_conjecture, (distinct_points(esk1_0,esk2_0))). % 0.13/0.38 cnf(i_0_16, negated_conjecture, (apart_point_and_line(esk3_0,line_connecting(esk1_0,esk2_0)))). % 0.13/0.38 cnf(i_0_1, plain, (~distinct_points(X1,X1))). % 0.13/0.38 cnf(i_0_2, plain, (~distinct_lines(X1,X1))). % 0.13/0.38 cnf(i_0_3, plain, (~convergent_lines(X1,X1))). % 0.13/0.38 cnf(i_0_15, negated_conjecture, (~distinct_points(esk3_0,esk1_0)|~distinct_points(esk3_0,esk2_0))). % 0.13/0.38 cnf(i_0_14, plain, (distinct_lines(X1,X2)|~convergent_lines(X1,X2))). % 0.13/0.38 cnf(i_0_7, plain, (distinct_points(X1,X2)|~apart_point_and_line(X1,line_connecting(X3,X2))|~distinct_points(X3,X2))). % 0.13/0.38 cnf(i_0_8, plain, (distinct_points(X1,X2)|~apart_point_and_line(X1,line_connecting(X2,X3))|~distinct_points(X2,X3))). % 0.13/0.38 cnf(i_0_9, plain, (distinct_points(X1,intersection_point(X2,X3))|~apart_point_and_line(X1,X3)|~convergent_lines(X2,X3))). % 0.13/0.38 cnf(i_0_10, plain, (distinct_points(X1,intersection_point(X2,X3))|~apart_point_and_line(X1,X2)|~convergent_lines(X2,X3))). % 0.13/0.38 cnf(i_0_4, plain, (distinct_points(X1,X2)|distinct_points(X3,X2)|~distinct_points(X1,X3))). % 0.13/0.38 cnf(i_0_12, plain, (apart_point_and_line(X1,X2)|distinct_points(X3,X1)|~apart_point_and_line(X3,X2))). % 0.13/0.38 cnf(i_0_13, plain, (apart_point_and_line(X1,X2)|distinct_lines(X3,X2)|~apart_point_and_line(X1,X3))). % 0.13/0.38 cnf(i_0_5, plain, (distinct_lines(X1,X2)|distinct_lines(X3,X2)|~distinct_lines(X1,X3))). % 0.13/0.38 cnf(i_0_6, plain, (convergent_lines(X1,X2)|convergent_lines(X3,X2)|~convergent_lines(X1,X3))). % 0.13/0.38 cnf(i_0_11, plain, (apart_point_and_line(X1,X2)|apart_point_and_line(X1,X3)|apart_point_and_line(X4,X2)|apart_point_and_line(X4,X3)|~distinct_lines(X2,X3)|~distinct_points(X1,X4))). % 0.13/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.38 # Begin printing tableau % 0.13/0.38 # Found 9 steps % 0.13/0.38 cnf(i_0_15, negated_conjecture, (~distinct_points(esk3_0,esk1_0)|~distinct_points(esk3_0,esk2_0)), inference(start_rule)). % 0.13/0.38 cnf(i_0_19, plain, (~distinct_points(esk3_0,esk2_0)), inference(extension_rule, [i_0_4])). % 0.13/0.38 cnf(i_0_75, plain, (~distinct_points(esk3_0,esk2_0)), inference(extension_rule, [i_0_7])). % 0.13/0.38 cnf(i_0_74, plain, (distinct_points(esk2_0,esk2_0)), inference(closure_rule, [i_0_1])). % 0.13/0.38 cnf(i_0_99, plain, (~apart_point_and_line(esk3_0,line_connecting(esk1_0,esk2_0))), inference(closure_rule, [i_0_16])). % 0.13/0.38 cnf(i_0_100, plain, (~distinct_points(esk1_0,esk2_0)), inference(closure_rule, [i_0_17])). % 0.13/0.38 cnf(i_0_18, plain, (~distinct_points(esk3_0,esk1_0)), inference(extension_rule, [i_0_8])). % 0.13/0.38 cnf(i_0_104, plain, (~apart_point_and_line(esk3_0,line_connecting(esk1_0,esk2_0))), inference(closure_rule, [i_0_16])). % 0.13/0.38 cnf(i_0_105, plain, (~distinct_points(esk1_0,esk2_0)), inference(closure_rule, [i_0_17])). % 0.13/0.38 # End printing tableau % 0.13/0.38 # SZS output end % 0.13/0.38 # Branches closed with saturation will be marked with an "s" % 0.13/0.38 # Child (5325) has found a proof. % 0.13/0.38 % 0.13/0.38 # Proof search is over... % 0.13/0.38 # Freeing feature tree %------------------------------------------------------------------------------