%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GEO232+1 : TPTP v8.1.0. Bugfixed v6.4.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 : n007.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.13s 0.39s % Output : CNFRefutation 0.13s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.13 % Problem : GEO232+1 : TPTP v8.1.0. Bugfixed v6.4.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.13/0.35 % Computer : n007.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 12:36:58 EDT 2022 % 0.13/0.35 % CPUTime : % 0.13/0.39 # No SInE strategy applied % 0.13/0.39 # Auto-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI % 0.13/0.39 # and selection function SelectNewComplexAHP. % 0.13/0.39 # % 0.13/0.39 # Presaturation interreduction done % 0.13/0.39 # Number of axioms: 60 Number of unprocessed: 35 % 0.13/0.39 # Tableaux proof search. % 0.13/0.39 # APR header successfully linked. % 0.13/0.39 # Hello from C++ % 0.13/0.39 # The folding up rule is enabled... % 0.13/0.39 # Local unification is enabled... % 0.13/0.39 # Any saturation attempts will use folding labels... % 0.13/0.39 # 35 beginning clauses after preprocessing and clausification % 0.13/0.39 # Creating start rules for all 2 conjectures. % 0.13/0.39 # There are 2 start rule candidates: % 0.13/0.39 # Found 13 unit axioms. % 0.13/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.39 # 2 start rule tableaux created. % 0.13/0.39 # 22 extension rule candidate clauses % 0.13/0.39 # 13 unit axiom clauses % 0.13/0.39 % 0.13/0.39 # Requested 8, 32 cores available to the main process. % 0.13/0.39 # There are not enough tableaux to fork, creating more from the initial 2 % 0.13/0.39 # Closed tableau found in foldup close cycle with 0 folds and 3 closures done. % 0.13/0.39 # There were 0 total branch saturation attempts. % 0.13/0.39 # There were 0 of these attempts blocked. % 0.13/0.39 # There were 0 deferred branch saturation attempts. % 0.13/0.39 # There were 0 free duplicated saturations. % 0.13/0.39 # There were 0 total successful branch saturations. % 0.13/0.39 # There were 0 successful branch saturations in interreduction. % 0.13/0.39 # There were 0 successful branch saturations on the branch. % 0.13/0.39 # There were 0 successful branch saturations after the branch. % 0.13/0.39 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.39 # Begin clausification derivation % 0.13/0.39 % 0.13/0.39 # End clausification derivation % 0.13/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.39 cnf(i_0_60, negated_conjecture, (line(esk1_0))). % 0.13/0.39 cnf(i_0_59, negated_conjecture, (~unequally_directed_lines(esk1_0,reverse_line(esk1_0)))). % 0.13/0.39 cnf(i_0_30, plain, (~unequally_directed_lines(X1,X1))). % 0.13/0.39 cnf(i_0_39, plain, (~left_apart_point(X1,X2))). % 0.13/0.39 cnf(i_0_26, plain, (~distinct_points(X1,X1))). % 0.13/0.39 cnf(i_0_28, plain, (~distinct_lines(X1,X1))). % 0.13/0.39 cnf(i_0_41, plain, (~left_convergent_lines(X1,X2))). % 0.13/0.39 cnf(i_0_51, plain, (~distinct_lines(X1,reverse_line(X1)))). % 0.13/0.39 cnf(i_0_53, plain, (~unequally_directed_lines(parallel_through_point(X1,X2),X1))). % 0.13/0.39 cnf(i_0_50, plain, (~apart_point_and_line(X1,parallel_through_point(X2,X1)))). % 0.13/0.39 cnf(i_0_52, plain, (~unequally_directed_lines(line_connecting(X1,X2),reverse_line(line_connecting(X2,X1))))). % 0.13/0.39 cnf(i_0_3, plain, (~apart_point_and_line(X1,X2))). % 0.13/0.39 cnf(i_0_11, plain, (~divides_points(X1,X2,X3))). % 0.13/0.39 cnf(i_0_45, plain, (line(reverse_line(X1))|~line(X1))). % 0.13/0.39 cnf(i_0_6, plain, (unequally_directed_lines(X1,X2)|~convergent_lines(X1,X2))). % 0.13/0.39 cnf(i_0_5, plain, (unequally_directed_lines(X1,reverse_line(X2))|~convergent_lines(X1,X2))). % 0.13/0.39 cnf(i_0_44, plain, (line(parallel_through_point(X1,X2))|~point(X2)|~line(X1))). % 0.13/0.39 cnf(i_0_19, plain, (distinct_points(X1,X2)|~before_on_line(X3,X1,X2))). % 0.13/0.39 cnf(i_0_36, plain, (unequally_directed_lines(X1,reverse_line(X2))|unequally_directed_lines(X1,X2)|~line(X2)|~line(X1))). % 0.13/0.39 cnf(i_0_14, plain, (~before_on_line(X1,X2,X3)|~unequally_directed_lines(X1,line_connecting(X2,X3)))). % 0.13/0.39 cnf(i_0_46, plain, (~distinct_points(X1,X2)|~apart_point_and_line(X2,line_connecting(X1,X2)))). % 0.13/0.39 cnf(i_0_47, plain, (~distinct_points(X1,X2)|~apart_point_and_line(X1,line_connecting(X1,X2)))). % 0.13/0.39 cnf(i_0_42, plain, (line(line_connecting(X1,X2))|~point(X2)|~point(X1)|~distinct_points(X1,X2))). % 0.13/0.39 cnf(i_0_31, plain, (unequally_directed_lines(X1,X2)|unequally_directed_lines(X3,X2)|~unequally_directed_lines(X1,X3))). % 0.13/0.39 cnf(i_0_27, plain, (distinct_points(X1,X2)|distinct_points(X3,X2)|~distinct_points(X1,X3))). % 0.13/0.39 cnf(i_0_29, plain, (distinct_lines(X1,X2)|distinct_lines(X3,X2)|~distinct_lines(X1,X3))). % 0.13/0.39 cnf(i_0_37, plain, (~unequally_directed_lines(X1,reverse_line(X2))|~unequally_directed_lines(X1,X2))). % 0.13/0.39 cnf(i_0_20, plain, (between_on_line(X1,X2,X3,X4)|~before_on_line(X1,X3,X2)|~before_on_line(X1,X4,X3))). % 0.13/0.39 cnf(i_0_21, plain, (between_on_line(X1,X2,X3,X4)|~before_on_line(X1,X3,X4)|~before_on_line(X1,X2,X3))). % 0.13/0.39 cnf(i_0_25, plain, (before_on_line(X1,X2,X3)|before_on_line(X1,X4,X3)|~between_on_line(X1,X4,X3,X2))). % 0.13/0.39 cnf(i_0_23, plain, (before_on_line(X1,X2,X3)|before_on_line(X1,X3,X2)|~between_on_line(X1,X4,X3,X2))). % 0.13/0.39 cnf(i_0_24, plain, (before_on_line(X1,X2,X3)|before_on_line(X1,X3,X2)|~between_on_line(X1,X3,X2,X4))). % 0.13/0.39 cnf(i_0_22, plain, (before_on_line(X1,X2,X3)|before_on_line(X1,X2,X4)|~between_on_line(X1,X3,X2,X4))). % 0.13/0.39 cnf(i_0_13, plain, (before_on_line(X1,X2,X3)|unequally_directed_lines(X1,line_connecting(X2,X3))|~distinct_points(X2,X3))). % 0.13/0.39 cnf(i_0_54, plain, (~distinct_lines(X1,X2)|~distinct_points(X3,X4))). % 0.13/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.39 # Begin printing tableau % 0.13/0.39 # Found 5 steps % 0.13/0.39 cnf(i_0_59, negated_conjecture, (~unequally_directed_lines(esk1_0,reverse_line(esk1_0))), inference(start_rule)). % 0.13/0.39 cnf(i_0_61, plain, (~unequally_directed_lines(esk1_0,reverse_line(esk1_0))), inference(extension_rule, [i_0_36])). % 0.13/0.39 cnf(i_0_75, plain, (unequally_directed_lines(esk1_0,esk1_0)), inference(closure_rule, [i_0_30])). % 0.13/0.39 cnf(i_0_76, plain, (~line(esk1_0)), inference(closure_rule, [i_0_60])). % 0.13/0.39 cnf(i_0_77, plain, (~line(esk1_0)), inference(closure_rule, [i_0_60])). % 0.13/0.39 # End printing tableau % 0.13/0.39 # SZS output end % 0.13/0.39 # Branches closed with saturation will be marked with an "s" % 0.13/0.39 # Returning from population with 5 new_tableaux and 0 remaining starting tableaux. % 0.13/0.39 # We now have 5 tableaux to operate on % 0.13/0.39 # Found closed tableau during pool population. % 0.13/0.39 # Proof search is over... % 0.13/0.39 # Freeing feature tree %------------------------------------------------------------------------------