%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GEO201+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 : n006.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:38 EDT 2022 % Result : Theorem 0.20s 0.39s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.12 % Problem : GEO201+2 : TPTP v8.1.0. Released v3.3.0. % 0.04/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.14/0.34 % Computer : n006.cluster.edu % 0.14/0.34 % Model : x86_64 x86_64 % 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.34 % Memory : 8042.1875MB % 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.34 % CPULimit : 300 % 0.14/0.34 % WCLimit : 600 % 0.14/0.34 % DateTime : Fri Jun 17 17:02:56 EDT 2022 % 0.14/0.34 % CPUTime : % 0.20/0.38 # No SInE strategy applied % 0.20/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.20/0.38 # and selection function SelectComplexExceptUniqMaxHorn. % 0.20/0.38 # % 0.20/0.38 # Presaturation interreduction done % 0.20/0.38 # Number of axioms: 16 Number of unprocessed: 16 % 0.20/0.38 # Tableaux proof search. % 0.20/0.38 # APR header successfully linked. % 0.20/0.38 # Hello from C++ % 0.20/0.38 # The folding up rule is enabled... % 0.20/0.38 # Local unification is enabled... % 0.20/0.38 # Any saturation attempts will use folding labels... % 0.20/0.38 # 16 beginning clauses after preprocessing and clausification % 0.20/0.38 # Creating start rules for all 2 conjectures. % 0.20/0.38 # There are 2 start rule candidates: % 0.20/0.38 # Found 5 unit axioms. % 0.20/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.20/0.38 # 2 start rule tableaux created. % 0.20/0.38 # 11 extension rule candidate clauses % 0.20/0.38 # 5 unit axiom clauses % 0.20/0.38 % 0.20/0.38 # Requested 8, 32 cores available to the main process. % 0.20/0.38 # There are not enough tableaux to fork, creating more from the initial 2 % 0.20/0.38 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux. % 0.20/0.38 # We now have 8 tableaux to operate on % 0.20/0.39 # There were 1 total branch saturation attempts. % 0.20/0.39 # There were 0 of these attempts blocked. % 0.20/0.39 # There were 0 deferred branch saturation attempts. % 0.20/0.39 # There were 0 free duplicated saturations. % 0.20/0.39 # There were 1 total successful branch saturations. % 0.20/0.39 # There were 0 successful branch saturations in interreduction. % 0.20/0.39 # There were 0 successful branch saturations on the branch. % 0.20/0.39 # There were 1 successful branch saturations after the branch. % 0.20/0.39 # There were 1 total branch saturation attempts. % 0.20/0.39 # There were 0 of these attempts blocked. % 0.20/0.39 # There were 0 deferred branch saturation attempts. % 0.20/0.39 # There were 0 free duplicated saturations. % 0.20/0.39 # There were 1 total successful branch saturations. % 0.20/0.39 # There were 0 successful branch saturations in interreduction. % 0.20/0.39 # There were 0 successful branch saturations on the branch. % 0.20/0.39 # There were 1 successful branch saturations after the branch. % 0.20/0.39 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.39 # Begin clausification derivation % 0.20/0.39 % 0.20/0.39 # End clausification derivation % 0.20/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.39 cnf(i_0_16, negated_conjecture, (convergent_lines(esk1_0,esk2_0))). % 0.20/0.39 cnf(i_0_15, negated_conjecture, (distinct_points(intersection_point(esk1_0,esk2_0),intersection_point(esk2_0,esk1_0)))). % 0.20/0.39 cnf(i_0_1, plain, (~distinct_points(X1,X1))). % 0.20/0.39 cnf(i_0_3, plain, (~convergent_lines(X1,X1))). % 0.20/0.39 cnf(i_0_2, plain, (~distinct_lines(X1,X1))). % 0.20/0.39 cnf(i_0_14, plain, (distinct_lines(X1,X2)|~convergent_lines(X1,X2))). % 0.20/0.39 cnf(i_0_9, plain, (distinct_points(X1,intersection_point(X2,X3))|~apart_point_and_line(X1,X3)|~convergent_lines(X2,X3))). % 0.20/0.39 cnf(i_0_7, plain, (distinct_points(X1,X2)|~apart_point_and_line(X1,line_connecting(X3,X2))|~distinct_points(X3,X2))). % 0.20/0.39 cnf(i_0_8, plain, (distinct_points(X1,X2)|~apart_point_and_line(X1,line_connecting(X2,X3))|~distinct_points(X2,X3))). % 0.20/0.39 cnf(i_0_10, plain, (distinct_points(X1,intersection_point(X2,X3))|~apart_point_and_line(X1,X2)|~convergent_lines(X2,X3))). % 0.20/0.39 cnf(i_0_4, plain, (distinct_points(X1,X2)|distinct_points(X3,X2)|~distinct_points(X1,X3))). % 0.20/0.39 cnf(i_0_6, plain, (convergent_lines(X1,X2)|convergent_lines(X3,X2)|~convergent_lines(X1,X3))). % 0.20/0.39 cnf(i_0_12, plain, (apart_point_and_line(X1,X2)|distinct_points(X3,X1)|~apart_point_and_line(X3,X2))). % 0.20/0.39 cnf(i_0_5, plain, (distinct_lines(X1,X2)|distinct_lines(X3,X2)|~distinct_lines(X1,X3))). % 0.20/0.39 cnf(i_0_13, plain, (apart_point_and_line(X1,X2)|distinct_lines(X3,X2)|~apart_point_and_line(X1,X3))). % 0.20/0.39 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.20/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.39 # Begin printing tableau % 0.20/0.39 # Found 5 steps % 0.20/0.39 cnf(i_0_16, negated_conjecture, (convergent_lines(esk1_0,esk2_0)), inference(start_rule)). % 0.20/0.39 cnf(i_0_18, plain, (convergent_lines(esk1_0,esk2_0)), inference(extension_rule, [i_0_14])). % 0.20/0.39 cnf(i_0_54, plain, (distinct_lines(esk1_0,esk2_0)), inference(extension_rule, [i_0_5])). % 0.20/0.39 cnf(i_0_112, plain, (distinct_lines(esk1_0,esk1_0)), inference(closure_rule, [i_0_2])). % 0.20/0.39 cnf(i_0_113, plain, (distinct_lines(esk2_0,esk1_0)), inference(etableau_closure_rule, [i_0_113, ...])). % 0.20/0.39 # End printing tableau % 0.20/0.39 # SZS output end % 0.20/0.39 # Branches closed with saturation will be marked with an "s" % 0.20/0.39 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.39 # Begin clausification derivation % 0.20/0.39 % 0.20/0.39 # End clausification derivation % 0.20/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.39 cnf(i_0_16, negated_conjecture, (convergent_lines(esk1_0,esk2_0))). % 0.20/0.39 cnf(i_0_15, negated_conjecture, (distinct_points(intersection_point(esk1_0,esk2_0),intersection_point(esk2_0,esk1_0)))). % 0.20/0.39 cnf(i_0_1, plain, (~distinct_points(X1,X1))). % 0.20/0.39 cnf(i_0_3, plain, (~convergent_lines(X1,X1))). % 0.20/0.39 cnf(i_0_2, plain, (~distinct_lines(X1,X1))). % 0.20/0.39 cnf(i_0_14, plain, (distinct_lines(X1,X2)|~convergent_lines(X1,X2))). % 0.20/0.39 cnf(i_0_9, plain, (distinct_points(X1,intersection_point(X2,X3))|~apart_point_and_line(X1,X3)|~convergent_lines(X2,X3))). % 0.20/0.39 cnf(i_0_7, plain, (distinct_points(X1,X2)|~apart_point_and_line(X1,line_connecting(X3,X2))|~distinct_points(X3,X2))). % 0.20/0.39 cnf(i_0_8, plain, (distinct_points(X1,X2)|~apart_point_and_line(X1,line_connecting(X2,X3))|~distinct_points(X2,X3))). % 0.20/0.39 cnf(i_0_10, plain, (distinct_points(X1,intersection_point(X2,X3))|~apart_point_and_line(X1,X2)|~convergent_lines(X2,X3))). % 0.20/0.39 cnf(i_0_4, plain, (distinct_points(X1,X2)|distinct_points(X3,X2)|~distinct_points(X1,X3))). % 0.20/0.39 cnf(i_0_6, plain, (convergent_lines(X1,X2)|convergent_lines(X3,X2)|~convergent_lines(X1,X3))). % 0.20/0.39 cnf(i_0_12, plain, (apart_point_and_line(X1,X2)|distinct_points(X3,X1)|~apart_point_and_line(X3,X2))). % 0.20/0.39 cnf(i_0_5, plain, (distinct_lines(X1,X2)|distinct_lines(X3,X2)|~distinct_lines(X1,X3))). % 0.20/0.39 cnf(i_0_13, plain, (apart_point_and_line(X1,X2)|distinct_lines(X3,X2)|~apart_point_and_line(X1,X3))). % 0.20/0.39 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.20/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.39 # Begin printing tableau % 0.20/0.39 # Found 5 steps % 0.20/0.39 cnf(i_0_16, negated_conjecture, (convergent_lines(esk1_0,esk2_0)), inference(start_rule)). % 0.20/0.39 cnf(i_0_18, plain, (convergent_lines(esk1_0,esk2_0)), inference(extension_rule, [i_0_6])). % 0.20/0.39 cnf(i_0_71, plain, (convergent_lines(esk1_0,esk1_0)), inference(closure_rule, [i_0_3])). % 0.20/0.39 cnf(i_0_72, plain, (convergent_lines(esk2_0,esk1_0)), inference(extension_rule, [i_0_14])). % 0.20/0.39 cnf(i_0_89, plain, (distinct_lines(esk2_0,esk1_0)), inference(etableau_closure_rule, [i_0_89, ...])). % 0.20/0.39 # End printing tableau % 0.20/0.39 # SZS output end % 0.20/0.39 # Branches closed with saturation will be marked with an "s" % 0.20/0.39 # Child (7860) has found a proof. % 0.20/0.39 % 0.20/0.39 # Proof search is over... % 0.20/0.39 # Freeing feature tree %------------------------------------------------------------------------------