TSTP Solution File: GEO196+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GEO196+1 : TPTP v8.1.0. Released v3.3.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 : n028.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:34 EDT 2022
% Result : Theorem 0.19s 0.41s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : GEO196+1 : TPTP v8.1.0. Released v3.3.0.
% 0.12/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 : n028.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 : Fri Jun 17 18:08:58 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.37 # No SInE strategy applied
% 0.12/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.12/0.37 #
% 0.12/0.37 # Presaturation interreduction done
% 0.12/0.37 # Number of axioms: 19 Number of unprocessed: 19
% 0.12/0.37 # Tableaux proof search.
% 0.12/0.37 # APR header successfully linked.
% 0.12/0.37 # Hello from C++
% 0.12/0.37 # The folding up rule is enabled...
% 0.12/0.37 # Local unification is enabled...
% 0.12/0.37 # Any saturation attempts will use folding labels...
% 0.12/0.37 # 19 beginning clauses after preprocessing and clausification
% 0.12/0.37 # Creating start rules for all 5 conjectures.
% 0.12/0.37 # There are 5 start rule candidates:
% 0.12/0.37 # Found 7 unit axioms.
% 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.37 # 5 start rule tableaux created.
% 0.12/0.37 # 12 extension rule candidate clauses
% 0.12/0.37 # 7 unit axiom clauses
% 0.12/0.37
% 0.12/0.37 # Requested 8, 32 cores available to the main process.
% 0.12/0.37 # There are not enough tableaux to fork, creating more from the initial 5
% 0.12/0.37 # Returning from population with 13 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.37 # We now have 13 tableaux to operate on
% 0.19/0.41 # There were 1 total branch saturation attempts.
% 0.19/0.41 # There were 0 of these attempts blocked.
% 0.19/0.41 # There were 0 deferred branch saturation attempts.
% 0.19/0.41 # There were 0 free duplicated saturations.
% 0.19/0.41 # There were 1 total successful branch saturations.
% 0.19/0.41 # There were 0 successful branch saturations in interreduction.
% 0.19/0.41 # There were 0 successful branch saturations on the branch.
% 0.19/0.41 # There were 1 successful branch saturations after the branch.
% 0.19/0.41 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.41 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.41 # Begin clausification derivation
% 0.19/0.41
% 0.19/0.41 # End clausification derivation
% 0.19/0.41 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.41 cnf(i_0_19, negated_conjecture, (convergent_lines(esk1_0,esk2_0))).
% 0.19/0.41 cnf(i_0_18, negated_conjecture, (convergent_lines(esk3_0,esk4_0))).
% 0.19/0.41 cnf(i_0_17, negated_conjecture, (~apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0))).
% 0.19/0.41 cnf(i_0_16, negated_conjecture, (~apart_point_and_line(intersection_point(esk1_0,esk2_0),esk4_0))).
% 0.19/0.41 cnf(i_0_1, plain, (~distinct_points(X1,X1))).
% 0.19/0.41 cnf(i_0_2, plain, (~distinct_lines(X1,X1))).
% 0.19/0.41 cnf(i_0_3, plain, (~convergent_lines(X1,X1))).
% 0.19/0.41 cnf(i_0_15, negated_conjecture, (apart_point_and_line(intersection_point(esk3_0,esk4_0),esk2_0)|apart_point_and_line(intersection_point(esk3_0,esk4_0),esk1_0))).
% 0.19/0.41 cnf(i_0_6, plain, (convergent_lines(X1,X2)|convergent_lines(X3,X2)|~convergent_lines(X1,X3))).
% 0.19/0.41 cnf(i_0_8, plain, (~apart_point_and_line(X1,line_connecting(X2,X1))|~distinct_points(X2,X1))).
% 0.19/0.41 cnf(i_0_7, plain, (~apart_point_and_line(X1,line_connecting(X1,X2))|~distinct_points(X1,X2))).
% 0.19/0.41 cnf(i_0_10, plain, (~apart_point_and_line(intersection_point(X1,X2),X2)|~convergent_lines(X1,X2))).
% 0.19/0.41 cnf(i_0_9, plain, (~apart_point_and_line(intersection_point(X1,X2),X1)|~convergent_lines(X1,X2))).
% 0.19/0.41 cnf(i_0_12, plain, (apart_point_and_line(X1,X2)|distinct_points(X3,X1)|~apart_point_and_line(X3,X2))).
% 0.19/0.41 cnf(i_0_14, plain, (convergent_lines(X1,X2)|distinct_lines(X3,X2)|~convergent_lines(X1,X3))).
% 0.19/0.41 cnf(i_0_13, plain, (apart_point_and_line(X1,X2)|distinct_lines(X3,X2)|~apart_point_and_line(X1,X3))).
% 0.19/0.41 cnf(i_0_4, plain, (distinct_points(X1,X2)|distinct_points(X3,X2)|~distinct_points(X1,X3))).
% 0.19/0.41 cnf(i_0_5, plain, (distinct_lines(X1,X2)|distinct_lines(X3,X2)|~distinct_lines(X1,X3))).
% 0.19/0.41 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.19/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.41 # Begin printing tableau
% 0.19/0.41 # Found 5 steps
% 0.19/0.41 cnf(i_0_18, negated_conjecture, (convergent_lines(esk3_0,esk4_0)), inference(start_rule)).
% 0.19/0.41 cnf(i_0_24, plain, (convergent_lines(esk3_0,esk4_0)), inference(extension_rule, [i_0_6])).
% 0.19/0.41 cnf(i_0_128, plain, (convergent_lines(esk3_0,esk3_0)), inference(closure_rule, [i_0_3])).
% 0.19/0.41 cnf(i_0_129, plain, (convergent_lines(esk4_0,esk3_0)), inference(extension_rule, [i_0_10])).
% 0.19/0.41 cnf(i_0_135, plain, (~apart_point_and_line(intersection_point(esk4_0,esk3_0),esk3_0)), inference(etableau_closure_rule, [i_0_135, ...])).
% 0.19/0.41 # End printing tableau
% 0.19/0.41 # SZS output end
% 0.19/0.41 # Branches closed with saturation will be marked with an "s"
% 0.19/0.41 # There were 1 total branch saturation attempts.
% 0.19/0.41 # There were 0 of these attempts blocked.
% 0.19/0.41 # There were 0 deferred branch saturation attempts.
% 0.19/0.41 # There were 0 free duplicated saturations.
% 0.19/0.41 # There were 1 total successful branch saturations.
% 0.19/0.41 # There were 0 successful branch saturations in interreduction.
% 0.19/0.41 # There were 0 successful branch saturations on the branch.
% 0.19/0.41 # There were 1 successful branch saturations after the branch.
% 0.19/0.41 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.41 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.41 # Begin clausification derivation
% 0.19/0.41
% 0.19/0.41 # End clausification derivation
% 0.19/0.41 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.41 cnf(i_0_19, negated_conjecture, (convergent_lines(esk1_0,esk2_0))).
% 0.19/0.41 cnf(i_0_18, negated_conjecture, (convergent_lines(esk3_0,esk4_0))).
% 0.19/0.41 cnf(i_0_17, negated_conjecture, (~apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0))).
% 0.19/0.41 cnf(i_0_16, negated_conjecture, (~apart_point_and_line(intersection_point(esk1_0,esk2_0),esk4_0))).
% 0.19/0.41 cnf(i_0_1, plain, (~distinct_points(X1,X1))).
% 0.19/0.41 cnf(i_0_2, plain, (~distinct_lines(X1,X1))).
% 0.19/0.41 cnf(i_0_3, plain, (~convergent_lines(X1,X1))).
% 0.19/0.41 cnf(i_0_15, negated_conjecture, (apart_point_and_line(intersection_point(esk3_0,esk4_0),esk2_0)|apart_point_and_line(intersection_point(esk3_0,esk4_0),esk1_0))).
% 0.19/0.41 cnf(i_0_6, plain, (convergent_lines(X1,X2)|convergent_lines(X3,X2)|~convergent_lines(X1,X3))).
% 0.19/0.41 cnf(i_0_8, plain, (~apart_point_and_line(X1,line_connecting(X2,X1))|~distinct_points(X2,X1))).
% 0.19/0.41 cnf(i_0_7, plain, (~apart_point_and_line(X1,line_connecting(X1,X2))|~distinct_points(X1,X2))).
% 0.19/0.41 cnf(i_0_10, plain, (~apart_point_and_line(intersection_point(X1,X2),X2)|~convergent_lines(X1,X2))).
% 0.19/0.41 cnf(i_0_9, plain, (~apart_point_and_line(intersection_point(X1,X2),X1)|~convergent_lines(X1,X2))).
% 0.19/0.41 cnf(i_0_12, plain, (apart_point_and_line(X1,X2)|distinct_points(X3,X1)|~apart_point_and_line(X3,X2))).
% 0.19/0.41 cnf(i_0_14, plain, (convergent_lines(X1,X2)|distinct_lines(X3,X2)|~convergent_lines(X1,X3))).
% 0.19/0.41 cnf(i_0_13, plain, (apart_point_and_line(X1,X2)|distinct_lines(X3,X2)|~apart_point_and_line(X1,X3))).
% 0.19/0.41 cnf(i_0_4, plain, (distinct_points(X1,X2)|distinct_points(X3,X2)|~distinct_points(X1,X3))).
% 0.19/0.41 cnf(i_0_5, plain, (distinct_lines(X1,X2)|distinct_lines(X3,X2)|~distinct_lines(X1,X3))).
% 0.19/0.41 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.19/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.41 # Begin printing tableau
% 0.19/0.41 # Found 5 steps
% 0.19/0.41 cnf(i_0_19, negated_conjecture, (convergent_lines(esk1_0,esk2_0)), inference(start_rule)).
% 0.19/0.41 cnf(i_0_25, plain, (convergent_lines(esk1_0,esk2_0)), inference(extension_rule, [i_0_6])).
% 0.19/0.41 cnf(i_0_128, plain, (convergent_lines(esk1_0,esk1_0)), inference(closure_rule, [i_0_3])).
% 0.19/0.41 cnf(i_0_129, plain, (convergent_lines(esk2_0,esk1_0)), inference(extension_rule, [i_0_10])).
% 0.19/0.41 cnf(i_0_135, plain, (~apart_point_and_line(intersection_point(esk2_0,esk1_0),esk1_0)), inference(etableau_closure_rule, [i_0_135, ...])).
% 0.19/0.41 # End printing tableau
% 0.19/0.41 # SZS output end
% 0.19/0.41 # Branches closed with saturation will be marked with an "s"
% 0.19/0.41 # Child (32199) has found a proof.
% 0.19/0.41
% 0.19/0.41 # Proof search is over...
% 0.19/0.41 # Freeing feature tree
%------------------------------------------------------------------------------