%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GEO201+3 : TPTP v8.1.0. Released v4.0.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 : n012.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 2.06s 0.63s % Output : CNFRefutation 2.06s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.12 % Problem : GEO201+3 : TPTP v8.1.0. Released v4.0.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.12/0.34 % Computer : n012.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Sat Jun 18 01:07:38 EDT 2022 % 0.12/0.34 % CPUTime : % 0.19/0.38 # No SInE strategy applied % 0.19/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.19/0.38 # and selection function SelectComplexExceptUniqMaxHorn. % 0.19/0.38 # % 0.19/0.38 # Presaturation interreduction done % 0.19/0.38 # Number of axioms: 48 Number of unprocessed: 44 % 0.19/0.38 # Tableaux proof search. % 0.19/0.38 # APR header successfully linked. % 0.19/0.38 # Hello from C++ % 0.19/0.38 # The folding up rule is enabled... % 0.19/0.38 # Local unification is enabled... % 0.19/0.38 # Any saturation attempts will use folding labels... % 0.19/0.38 # 44 beginning clauses after preprocessing and clausification % 0.19/0.38 # Creating start rules for all 2 conjectures. % 0.19/0.38 # There are 2 start rule candidates: % 0.19/0.38 # Found 9 unit axioms. % 0.19/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.19/0.38 # 2 start rule tableaux created. % 0.19/0.38 # 35 extension rule candidate clauses % 0.19/0.38 # 9 unit axiom clauses % 0.19/0.38 % 0.19/0.38 # Requested 8, 32 cores available to the main process. % 0.19/0.38 # There are not enough tableaux to fork, creating more from the initial 2 % 0.19/0.38 # Returning from population with 14 new_tableaux and 0 remaining starting tableaux. % 0.19/0.38 # We now have 14 tableaux to operate on % 2.06/0.63 # There were 1 total branch saturation attempts. % 2.06/0.63 # There were 0 of these attempts blocked. % 2.06/0.63 # There were 0 deferred branch saturation attempts. % 2.06/0.63 # There were 0 free duplicated saturations. % 2.06/0.63 # There were 1 total successful branch saturations. % 2.06/0.63 # There were 0 successful branch saturations in interreduction. % 2.06/0.63 # There were 0 successful branch saturations on the branch. % 2.06/0.63 # There were 1 successful branch saturations after the branch. % 2.06/0.63 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.06/0.63 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.06/0.63 # Begin clausification derivation % 2.06/0.63 % 2.06/0.63 # End clausification derivation % 2.06/0.63 # Begin listing active clauses obtained from FOF to CNF conversion % 2.06/0.63 cnf(i_0_48, negated_conjecture, (convergent_lines(esk1_0,esk2_0))). % 2.06/0.63 cnf(i_0_47, negated_conjecture, (~equal_points(intersection_point(esk1_0,esk2_0),intersection_point(esk2_0,esk1_0)))). % 2.06/0.63 cnf(i_0_3, plain, (~convergent_lines(X1,X1))). % 2.06/0.63 cnf(i_0_1, plain, (~distinct_points(X1,X1))). % 2.06/0.63 cnf(i_0_2, plain, (~distinct_lines(X1,X1))). % 2.06/0.63 cnf(i_0_16, plain, (~convergent_lines(parallel_through_point(X1,X2),X1))). % 2.06/0.63 cnf(i_0_17, plain, (~apart_point_and_line(X1,parallel_through_point(X2,X1)))). % 2.06/0.63 cnf(i_0_25, plain, (~apart_point_and_line(X1,orthogonal_through_point(X2,X1)))). % 2.06/0.63 cnf(i_0_24, plain, (~unorthogonal_lines(orthogonal_through_point(X1,X2),X1))). % 2.06/0.63 cnf(i_0_37, plain, (equal_points(X1,X2)|distinct_points(X1,X2))). % 2.06/0.63 cnf(i_0_19, plain, (unorthogonal_lines(X1,X2)|convergent_lines(X1,X2))). % 2.06/0.63 cnf(i_0_38, plain, (~equal_points(X1,X2)|~distinct_points(X1,X2))). % 2.06/0.63 cnf(i_0_40, plain, (~equal_lines(X1,X2)|~distinct_lines(X1,X2))). % 2.06/0.63 cnf(i_0_42, plain, (~parallel_lines(X1,X2)|~convergent_lines(X1,X2))). % 2.06/0.63 cnf(i_0_44, plain, (~incident_point_and_line(X1,X2)|~apart_point_and_line(X1,X2))). % 2.06/0.63 cnf(i_0_46, plain, (~orthogonal_lines(X1,X2)|~unorthogonal_lines(X1,X2))). % 2.06/0.63 cnf(i_0_39, plain, (equal_lines(X1,X2)|distinct_lines(X1,X2))). % 2.06/0.63 cnf(i_0_15, plain, (convergent_lines(X1,X2)|~distinct_lines(X1,X2))). % 2.06/0.63 cnf(i_0_8, plain, (~apart_point_and_line(X1,line_connecting(X2,X1))|~distinct_points(X2,X1))). % 2.06/0.63 cnf(i_0_7, plain, (~apart_point_and_line(X1,line_connecting(X1,X2))|~distinct_points(X1,X2))). % 2.06/0.63 cnf(i_0_10, plain, (~apart_point_and_line(intersection_point(X1,X2),X2)|~convergent_lines(X1,X2))). % 2.06/0.63 cnf(i_0_41, plain, (parallel_lines(X1,X2)|convergent_lines(X1,X2))). % 2.06/0.63 cnf(i_0_9, plain, (~apart_point_and_line(intersection_point(X1,X2),X1)|~convergent_lines(X1,X2))). % 2.06/0.63 cnf(i_0_43, plain, (incident_point_and_line(X1,X2)|apart_point_and_line(X1,X2))). % 2.06/0.63 cnf(i_0_45, plain, (orthogonal_lines(X1,X2)|unorthogonal_lines(X1,X2))). % 2.06/0.63 cnf(i_0_6, plain, (convergent_lines(X1,X2)|convergent_lines(X3,X2)|~convergent_lines(X1,X3))). % 2.06/0.63 cnf(i_0_35, plain, (line(parallel_through_point(X1,X2))|~line(X1)|~point(X2))). % 2.06/0.63 cnf(i_0_36, plain, (line(orthogonal_through_point(X1,X2))|~line(X1)|~point(X2))). % 2.06/0.63 cnf(i_0_34, plain, (point(intersection_point(X1,X2))|~line(X2)|~line(X1)|~convergent_lines(X1,X2))). % 2.06/0.63 cnf(i_0_33, plain, (line(line_connecting(X1,X2))|~point(X2)|~point(X1)|~distinct_points(X1,X2))). % 2.06/0.63 cnf(i_0_4, plain, (distinct_points(X1,X2)|distinct_points(X3,X2)|~distinct_points(X1,X3))). % 2.06/0.63 cnf(i_0_12, plain, (apart_point_and_line(X1,X2)|distinct_points(X3,X1)|~apart_point_and_line(X3,X2))). % 2.06/0.63 cnf(i_0_14, plain, (convergent_lines(X1,X2)|distinct_lines(X3,X2)|~convergent_lines(X1,X3))). % 2.06/0.63 cnf(i_0_31, plain, (convergent_lines(X1,X2)|convergent_lines(X1,X3)|~unorthogonal_lines(X3,X2)|~convergent_lines(X3,X2))). % 2.06/0.63 cnf(i_0_32, plain, (unorthogonal_lines(X1,X2)|unorthogonal_lines(X1,X3)|~convergent_lines(X2,X3))). % 2.06/0.63 cnf(i_0_5, plain, (distinct_lines(X1,X2)|distinct_lines(X3,X2)|~distinct_lines(X1,X3))). % 2.06/0.63 cnf(i_0_13, plain, (apart_point_and_line(X1,X2)|distinct_lines(X3,X2)|~apart_point_and_line(X1,X3))). % 2.06/0.63 cnf(i_0_22, plain, (unorthogonal_lines(X1,X2)|convergent_lines(X3,X2)|~unorthogonal_lines(X3,X1)|~convergent_lines(X3,X1))). % 2.06/0.63 cnf(i_0_30, plain, (unorthogonal_lines(X1,X2)|convergent_lines(X1,X3)|~unorthogonal_lines(X3,X2)|~convergent_lines(X3,X2))). % 2.06/0.63 cnf(i_0_21, plain, (unorthogonal_lines(X1,X2)|convergent_lines(X3,X2)|~unorthogonal_lines(X1,X3)|~convergent_lines(X1,X3))). % 2.06/0.63 cnf(i_0_29, plain, (unorthogonal_lines(X1,X2)|convergent_lines(X1,X3)|~unorthogonal_lines(X2,X3)|~convergent_lines(X2,X3))). % 2.06/0.63 cnf(i_0_20, plain, (unorthogonal_lines(X1,X2)|unorthogonal_lines(X3,X2)|~unorthogonal_lines(X3,X1)|~convergent_lines(X3,X1))). % 2.06/0.63 cnf(i_0_26, plain, (unorthogonal_lines(X1,X2)|unorthogonal_lines(X3,X2)|apart_point_and_line(X4,X1)|apart_point_and_line(X4,X3)|~distinct_lines(X1,X3))). % 2.06/0.63 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))). % 2.06/0.63 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 2.06/0.63 # Begin printing tableau % 2.06/0.63 # Found 5 steps % 2.06/0.63 cnf(i_0_48, negated_conjecture, (convergent_lines(esk1_0,esk2_0)), inference(start_rule)). % 2.06/0.63 cnf(i_0_50, plain, (convergent_lines(esk1_0,esk2_0)), inference(extension_rule, [i_0_14])). % 2.06/0.63 cnf(i_0_208, plain, (convergent_lines(esk1_0,esk1_0)), inference(closure_rule, [i_0_3])). % 2.06/0.63 cnf(i_0_209, plain, (distinct_lines(esk2_0,esk1_0)), inference(extension_rule, [i_0_40])). % 2.06/0.63 cnf(i_0_261, plain, (~equal_lines(esk2_0,esk1_0)), inference(etableau_closure_rule, [i_0_261, ...])). % 2.06/0.63 # End printing tableau % 2.06/0.63 # SZS output end % 2.06/0.63 # Branches closed with saturation will be marked with an "s" % 2.06/0.63 # Child (1659) has found a proof. % 2.06/0.63 % 2.06/0.63 # Proof search is over... % 2.06/0.63 # Freeing feature tree %------------------------------------------------------------------------------