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