TSTP Solution File: GEO228+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GEO228+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 : n020.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:57 EDT 2022
% Result : Theorem 0.20s 0.38s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GEO228+1 : TPTP v8.1.0. Bugfixed v6.4.0.
% 0.03/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.34 % Computer : n020.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sat Jun 18 08:38:34 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.38 # No SInE strategy applied
% 0.20/0.38 # Auto-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI
% 0.20/0.38 # and selection function SelectNewComplexAHP.
% 0.20/0.38 #
% 0.20/0.38 # Presaturation interreduction done
% 0.20/0.38 # Number of axioms: 61 Number of unprocessed: 35
% 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 # 35 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 11 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 # 24 extension rule candidate clauses
% 0.20/0.38 # 11 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 # There were 2 total branch saturation attempts.
% 0.20/0.38 # There were 0 of these attempts blocked.
% 0.20/0.38 # There were 0 deferred branch saturation attempts.
% 0.20/0.38 # There were 0 free duplicated saturations.
% 0.20/0.38 # There were 2 total successful branch saturations.
% 0.20/0.38 # There were 0 successful branch saturations in interreduction.
% 0.20/0.38 # There were 0 successful branch saturations on the branch.
% 0.20/0.38 # There were 2 successful branch saturations after the branch.
% 0.20/0.38 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.38 # Begin clausification derivation
% 0.20/0.38
% 0.20/0.38 # End clausification derivation
% 0.20/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.38 cnf(i_0_30, plain, (~unequally_directed_lines(X1,X1))).
% 0.20/0.38 cnf(i_0_39, plain, (~left_apart_point(X1,X2))).
% 0.20/0.38 cnf(i_0_26, plain, (~distinct_points(X1,X1))).
% 0.20/0.38 cnf(i_0_28, plain, (~distinct_lines(X1,X1))).
% 0.20/0.38 cnf(i_0_41, plain, (~left_convergent_lines(X1,X2))).
% 0.20/0.38 cnf(i_0_51, plain, (~distinct_lines(X1,reverse_line(X1)))).
% 0.20/0.38 cnf(i_0_53, plain, (~unequally_directed_lines(parallel_through_point(X1,X2),X1))).
% 0.20/0.38 cnf(i_0_50, plain, (~apart_point_and_line(X1,parallel_through_point(X2,X1)))).
% 0.20/0.38 cnf(i_0_52, plain, (~unequally_directed_lines(line_connecting(X1,X2),reverse_line(line_connecting(X2,X1))))).
% 0.20/0.38 cnf(i_0_3, plain, (~apart_point_and_line(X1,X2))).
% 0.20/0.38 cnf(i_0_11, plain, (~divides_points(X1,X2,X3))).
% 0.20/0.38 cnf(i_0_61, negated_conjecture, (unequally_directed_lines(esk1_0,esk2_0)|convergent_lines(esk1_0,esk2_0))).
% 0.20/0.38 cnf(i_0_60, negated_conjecture, (unequally_directed_lines(esk1_0,reverse_line(esk2_0))|convergent_lines(esk1_0,esk2_0))).
% 0.20/0.38 cnf(i_0_45, plain, (line(reverse_line(X1))|~line(X1))).
% 0.20/0.38 cnf(i_0_6, plain, (unequally_directed_lines(X1,X2)|~convergent_lines(X1,X2))).
% 0.20/0.38 cnf(i_0_5, plain, (unequally_directed_lines(X1,reverse_line(X2))|~convergent_lines(X1,X2))).
% 0.20/0.38 cnf(i_0_19, plain, (distinct_points(X1,X2)|~before_on_line(X3,X1,X2))).
% 0.20/0.38 cnf(i_0_14, plain, (~before_on_line(X1,X2,X3)|~unequally_directed_lines(X1,line_connecting(X2,X3)))).
% 0.20/0.38 cnf(i_0_46, plain, (~distinct_points(X1,X2)|~apart_point_and_line(X2,line_connecting(X1,X2)))).
% 0.20/0.38 cnf(i_0_44, plain, (line(parallel_through_point(X1,X2))|~point(X2)|~line(X1))).
% 0.20/0.38 cnf(i_0_47, plain, (~distinct_points(X1,X2)|~apart_point_and_line(X1,line_connecting(X1,X2)))).
% 0.20/0.38 cnf(i_0_42, plain, (line(line_connecting(X1,X2))|~point(X2)|~point(X1)|~distinct_points(X1,X2))).
% 0.20/0.38 cnf(i_0_36, plain, (unequally_directed_lines(X1,reverse_line(X2))|unequally_directed_lines(X1,X2)|~line(X2)|~line(X1))).
% 0.20/0.38 cnf(i_0_31, plain, (unequally_directed_lines(X1,X2)|unequally_directed_lines(X3,X2)|~unequally_directed_lines(X1,X3))).
% 0.20/0.38 cnf(i_0_27, plain, (distinct_points(X1,X2)|distinct_points(X3,X2)|~distinct_points(X1,X3))).
% 0.20/0.38 cnf(i_0_29, plain, (distinct_lines(X1,X2)|distinct_lines(X3,X2)|~distinct_lines(X1,X3))).
% 0.20/0.38 cnf(i_0_37, plain, (~unequally_directed_lines(X1,reverse_line(X2))|~unequally_directed_lines(X1,X2))).
% 0.20/0.38 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.20/0.38 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.20/0.38 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.20/0.38 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.20/0.38 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.20/0.38 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.20/0.38 cnf(i_0_13, plain, (before_on_line(X1,X2,X3)|unequally_directed_lines(X1,line_connecting(X2,X3))|~distinct_points(X2,X3))).
% 0.20/0.38 cnf(i_0_54, plain, (~distinct_lines(X1,X2)|~distinct_points(X3,X4))).
% 0.20/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.20/0.38 # Begin printing tableau
% 0.20/0.38 # Found 6 steps
% 0.20/0.38 cnf(i_0_61, negated_conjecture, (unequally_directed_lines(esk1_0,esk2_0)|convergent_lines(esk1_0,esk2_0)), inference(start_rule)).
% 0.20/0.38 cnf(i_0_65, plain, (convergent_lines(esk1_0,esk2_0)), inference(extension_rule, [i_0_5])).
% 0.20/0.38 cnf(i_0_259, plain, (unequally_directed_lines(esk1_0,reverse_line(esk2_0))), inference(extension_rule, [i_0_31])).
% 0.20/0.38 cnf(i_0_343, plain, (unequally_directed_lines(esk1_0,esk1_0)), inference(closure_rule, [i_0_30])).
% 0.20/0.38 cnf(i_0_64, plain, (unequally_directed_lines(esk1_0,esk2_0)), inference(etableau_closure_rule, [i_0_64, ...])).
% 0.20/0.38 cnf(i_0_344, plain, (unequally_directed_lines(reverse_line(esk2_0),esk1_0)), inference(etableau_closure_rule, [i_0_344, ...])).
% 0.20/0.38 # End printing tableau
% 0.20/0.38 # SZS output end
% 0.20/0.38 # Branches closed with saturation will be marked with an "s"
% 0.20/0.38 # Returning from population with 7 new_tableaux and 0 remaining starting tableaux.
% 0.20/0.38 # We now have 7 tableaux to operate on
% 0.20/0.38 # Found closed tableau during pool population.
% 0.20/0.38 # Proof search is over...
% 0.20/0.38 # Freeing feature tree
%------------------------------------------------------------------------------