%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GEO231+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 : n004.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:58 EDT 2022 % Result : Theorem 0.14s 0.39s % Output : CNFRefutation 0.14s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.13 % Problem : GEO231+3 : TPTP v8.1.0. Released v4.0.0. % 0.07/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.14/0.35 % Computer : n004.cluster.edu % 0.14/0.35 % Model : x86_64 x86_64 % 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.35 % Memory : 8042.1875MB % 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.35 % CPULimit : 300 % 0.14/0.35 % WCLimit : 600 % 0.14/0.35 % DateTime : Fri Jun 17 18:46:23 EDT 2022 % 0.14/0.35 % CPUTime : % 0.14/0.39 # No SInE strategy applied % 0.14/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.14/0.39 # and selection function SelectComplexExceptUniqMaxHorn. % 0.14/0.39 # % 0.14/0.39 # Presaturation interreduction done % 0.14/0.39 # Number of axioms: 69 Number of unprocessed: 48 % 0.14/0.39 # Tableaux proof search. % 0.14/0.39 # APR header successfully linked. % 0.14/0.39 # Hello from C++ % 0.14/0.39 # The folding up rule is enabled... % 0.14/0.39 # Local unification is enabled... % 0.14/0.39 # Any saturation attempts will use folding labels... % 0.14/0.39 # 48 beginning clauses after preprocessing and clausification % 0.14/0.39 # Creating start rules for all 3 conjectures. % 0.14/0.39 # There are 3 start rule candidates: % 0.14/0.39 # Found 15 unit axioms. % 0.14/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.14/0.39 # 3 start rule tableaux created. % 0.14/0.39 # 33 extension rule candidate clauses % 0.14/0.39 # 15 unit axiom clauses % 0.14/0.39 % 0.14/0.39 # Requested 8, 32 cores available to the main process. % 0.14/0.39 # There are not enough tableaux to fork, creating more from the initial 3 % 0.14/0.39 # There were 1 total branch saturation attempts. % 0.14/0.39 # There were 0 of these attempts blocked. % 0.14/0.39 # There were 0 deferred branch saturation attempts. % 0.14/0.39 # There were 0 free duplicated saturations. % 0.14/0.39 # There were 1 total successful branch saturations. % 0.14/0.39 # There were 0 successful branch saturations in interreduction. % 0.14/0.39 # There were 0 successful branch saturations on the branch. % 0.14/0.39 # There were 1 successful branch saturations after the branch. % 0.14/0.39 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.14/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.14/0.39 # Begin clausification derivation % 0.14/0.39 % 0.14/0.39 # End clausification derivation % 0.14/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.14/0.39 cnf(i_0_68, negated_conjecture, (equally_directed_lines(esk1_0,esk3_0))). % 0.14/0.39 cnf(i_0_69, negated_conjecture, (equally_directed_opposite_lines(esk1_0,esk2_0))). % 0.14/0.39 cnf(i_0_38, plain, (equally_directed_lines(X1,X1))). % 0.14/0.39 cnf(i_0_61, plain, (equally_directed_lines(parallel_through_point(X1,X2),X1))). % 0.14/0.39 cnf(i_0_67, negated_conjecture, (~equally_directed_opposite_lines(esk2_0,esk3_0))). % 0.14/0.39 cnf(i_0_47, plain, (~left_apart_point(X1,X2))). % 0.14/0.39 cnf(i_0_49, plain, (~left_convergent_lines(X1,X2))). % 0.14/0.39 cnf(i_0_34, plain, (~distinct_points(X1,X1))). % 0.14/0.39 cnf(i_0_36, plain, (~distinct_lines(X1,X1))). % 0.14/0.39 cnf(i_0_59, plain, (~distinct_lines(X1,reverse_line(X1)))). % 0.14/0.39 cnf(i_0_58, plain, (~apart_point_and_line(X1,parallel_through_point(X2,X1)))). % 0.14/0.39 cnf(i_0_4, plain, (~right_apart_point(X1,X2))). % 0.14/0.39 cnf(i_0_6, plain, (~right_convergent_lines(X1,X2))). % 0.14/0.39 cnf(i_0_13, plain, (~apart_point_and_line(X1,X2))). % 0.14/0.39 cnf(i_0_20, plain, (~divides_points(X1,X2,X3))). % 0.14/0.39 cnf(i_0_10, plain, (~equally_directed_opposite_lines(X1,X2)|~unequally_directed_opposite_lines(X1,X2))). % 0.14/0.39 cnf(i_0_8, plain, (~equally_directed_lines(X1,X2)|~unequally_directed_lines(X1,X2))). % 0.14/0.39 cnf(i_0_53, plain, (line(reverse_line(X1))|~line(X1))). % 0.14/0.39 cnf(i_0_9, plain, (equally_directed_opposite_lines(X1,X2)|unequally_directed_opposite_lines(X1,X2))). % 0.14/0.39 cnf(i_0_7, plain, (equally_directed_lines(X1,X2)|unequally_directed_lines(X1,X2))). % 0.14/0.39 cnf(i_0_15, plain, (unequally_directed_opposite_lines(X1,X2)|~convergent_lines(X1,X2))). % 0.14/0.39 cnf(i_0_16, plain, (unequally_directed_lines(X1,X2)|~convergent_lines(X1,X2))). % 0.14/0.39 cnf(i_0_54, plain, (~distinct_points(X1,X2)|~apart_point_and_line(X2,line_connecting(X1,X2)))). % 0.14/0.39 cnf(i_0_55, plain, (~distinct_points(X1,X2)|~apart_point_and_line(X1,line_connecting(X1,X2)))). % 0.14/0.39 cnf(i_0_11, plain, (apart_point_and_line(X1,X2)|~right_apart_point(X1,X2))). % 0.14/0.39 cnf(i_0_2, plain, (unequally_directed_lines(X1,reverse_line(X2))|~unequally_directed_opposite_lines(X1,X2))). % 0.14/0.39 cnf(i_0_44, plain, (unequally_directed_lines(X1,reverse_line(X2))|unequally_directed_lines(X1,X2))). % 0.14/0.39 cnf(i_0_1, plain, (unequally_directed_opposite_lines(X1,X2)|~unequally_directed_lines(X1,reverse_line(X2)))). % 0.14/0.39 cnf(i_0_27, plain, (distinct_points(X1,X2)|~before_on_line(X3,X1,X2))). % 0.14/0.39 cnf(i_0_25, plain, (incident_point_and_line(X1,X2)|~before_on_line(X2,X3,X1))). % 0.14/0.39 cnf(i_0_52, plain, (line(parallel_through_point(X1,X2))|~line(X1)|~point(X2))). % 0.14/0.39 cnf(i_0_26, plain, (incident_point_and_line(X1,X2)|~before_on_line(X2,X1,X3))). % 0.14/0.39 cnf(i_0_14, plain, (convergent_lines(X1,X2)|~unequally_directed_lines(X1,X2)|~unequally_directed_opposite_lines(X1,X2))). % 0.14/0.39 cnf(i_0_24, plain, (equally_directed_lines(X1,line_connecting(X2,X3))|~before_on_line(X1,X2,X3))). % 0.14/0.39 cnf(i_0_39, plain, (unequally_directed_lines(X1,X2)|unequally_directed_lines(X3,X2)|~unequally_directed_lines(X1,X3))). % 0.14/0.39 cnf(i_0_50, plain, (line(line_connecting(X1,X2))|~point(X2)|~point(X1)|~distinct_points(X1,X2))). % 0.14/0.39 cnf(i_0_35, plain, (distinct_points(X1,X2)|distinct_points(X3,X2)|~distinct_points(X1,X3))). % 0.14/0.39 cnf(i_0_28, plain, (between_on_line(X1,X2,X3,X4)|~before_on_line(X1,X3,X2)|~before_on_line(X1,X4,X3))). % 0.14/0.39 cnf(i_0_29, plain, (between_on_line(X1,X2,X3,X4)|~before_on_line(X1,X3,X4)|~before_on_line(X1,X2,X3))). % 0.14/0.39 cnf(i_0_37, plain, (distinct_lines(X1,X2)|distinct_lines(X3,X2)|~distinct_lines(X1,X3))). % 0.14/0.39 cnf(i_0_33, plain, (before_on_line(X1,X2,X3)|before_on_line(X1,X4,X3)|~between_on_line(X1,X4,X3,X2))). % 0.14/0.39 cnf(i_0_60, plain, (equally_directed_lines(line_connecting(X1,X2),reverse_line(line_connecting(X2,X1)))|~distinct_points(X1,X2))). % 0.14/0.39 cnf(i_0_31, plain, (before_on_line(X1,X2,X3)|before_on_line(X1,X3,X2)|~between_on_line(X1,X4,X3,X2))). % 0.14/0.39 cnf(i_0_32, plain, (before_on_line(X1,X2,X3)|before_on_line(X1,X3,X2)|~between_on_line(X1,X3,X2,X4))). % 0.14/0.39 cnf(i_0_30, plain, (before_on_line(X1,X2,X3)|before_on_line(X1,X2,X4)|~between_on_line(X1,X3,X2,X4))). % 0.14/0.39 cnf(i_0_45, plain, (~unequally_directed_lines(X1,reverse_line(X2))|~unequally_directed_lines(X1,X2))). % 0.14/0.39 cnf(i_0_23, plain, (before_on_line(X1,X2,X3)|~incident_point_and_line(X3,X1)|~incident_point_and_line(X2,X1)|~distinct_points(X2,X3)|~equally_directed_lines(X1,line_connecting(X2,X3)))). % 0.14/0.39 cnf(i_0_62, plain, (~distinct_lines(X1,X2)|~distinct_points(X3,X4))). % 0.14/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.14/0.39 # Begin printing tableau % 0.14/0.39 # Found 4 steps % 0.14/0.39 cnf(i_0_68, negated_conjecture, (equally_directed_lines(esk1_0,esk3_0)), inference(start_rule)). % 0.14/0.39 cnf(i_0_72, plain, (equally_directed_lines(esk1_0,esk3_0)), inference(extension_rule, [i_0_8])). % 0.14/0.39 cnf(i_0_240, plain, (~unequally_directed_lines(esk1_0,esk3_0)), inference(extension_rule, [i_0_16])). % 0.14/0.39 cnf(i_0_332, plain, (~convergent_lines(esk1_0,esk3_0)), inference(etableau_closure_rule, [i_0_332, ...])). % 0.14/0.39 # End printing tableau % 0.14/0.39 # SZS output end % 0.14/0.39 # Branches closed with saturation will be marked with an "s" % 0.14/0.39 # Returning from population with 3 new_tableaux and 0 remaining starting tableaux. % 0.14/0.39 # We now have 3 tableaux to operate on % 0.14/0.39 # Found closed tableau during pool population. % 0.14/0.39 # Proof search is over... % 0.14/0.39 # Freeing feature tree %------------------------------------------------------------------------------