TSTP Solution File: GEO190+2 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GEO190+2 : 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 : 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:30 EDT 2022
% Result : Theorem 0.08s 0.30s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.08 % Problem : GEO190+2 : TPTP v8.1.0. Released v3.3.0.
% 0.02/0.09 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.08/0.28 % Computer : n010.cluster.edu
% 0.08/0.28 % Model : x86_64 x86_64
% 0.08/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.28 % Memory : 8042.1875MB
% 0.08/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.28 % CPULimit : 300
% 0.08/0.28 % WCLimit : 600
% 0.08/0.28 % DateTime : Sat Jun 18 06:44:23 EDT 2022
% 0.08/0.28 % CPUTime :
% 0.08/0.29 # No SInE strategy applied
% 0.08/0.29 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.08/0.29 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.08/0.29 #
% 0.08/0.29 # Presaturation interreduction done
% 0.08/0.29 # Number of axioms: 19 Number of unprocessed: 19
% 0.08/0.29 # Tableaux proof search.
% 0.08/0.29 # APR header successfully linked.
% 0.08/0.29 # Hello from C++
% 0.08/0.29 # The folding up rule is enabled...
% 0.08/0.29 # Local unification is enabled...
% 0.08/0.29 # Any saturation attempts will use folding labels...
% 0.08/0.29 # 19 beginning clauses after preprocessing and clausification
% 0.08/0.29 # Creating start rules for all 5 conjectures.
% 0.08/0.29 # There are 5 start rule candidates:
% 0.08/0.29 # Found 8 unit axioms.
% 0.08/0.29 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.08/0.29 # 5 start rule tableaux created.
% 0.08/0.29 # 11 extension rule candidate clauses
% 0.08/0.29 # 8 unit axiom clauses
% 0.08/0.29
% 0.08/0.29 # Requested 8, 32 cores available to the main process.
% 0.08/0.29 # There are not enough tableaux to fork, creating more from the initial 5
% 0.08/0.29 # Returning from population with 15 new_tableaux and 0 remaining starting tableaux.
% 0.08/0.29 # We now have 15 tableaux to operate on
% 0.08/0.30 # There were 1 total branch saturation attempts.
% 0.08/0.30 # There were 0 of these attempts blocked.
% 0.08/0.30 # There were 0 deferred branch saturation attempts.
% 0.08/0.30 # There were 0 free duplicated saturations.
% 0.08/0.30 # There were 1 total successful branch saturations.
% 0.08/0.30 # There were 0 successful branch saturations in interreduction.
% 0.08/0.30 # There were 0 successful branch saturations on the branch.
% 0.08/0.30 # There were 1 successful branch saturations after the branch.
% 0.08/0.30 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.30 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.30 # Begin clausification derivation
% 0.08/0.30
% 0.08/0.30 # End clausification derivation
% 0.08/0.30 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.08/0.30 cnf(i_0_19, negated_conjecture, (distinct_points(esk1_0,esk2_0))).
% 0.08/0.30 cnf(i_0_18, negated_conjecture, (distinct_points(esk1_0,esk3_0))).
% 0.08/0.30 cnf(i_0_17, negated_conjecture, (distinct_points(esk2_0,esk3_0))).
% 0.08/0.30 cnf(i_0_15, negated_conjecture, (apart_point_and_line(esk3_0,line_connecting(esk2_0,esk1_0)))).
% 0.08/0.30 cnf(i_0_16, negated_conjecture, (~apart_point_and_line(esk3_0,line_connecting(esk1_0,esk2_0)))).
% 0.08/0.30 cnf(i_0_1, plain, (~distinct_points(X1,X1))).
% 0.08/0.30 cnf(i_0_2, plain, (~distinct_lines(X1,X1))).
% 0.08/0.30 cnf(i_0_3, plain, (~convergent_lines(X1,X1))).
% 0.08/0.30 cnf(i_0_14, plain, (distinct_lines(X1,X2)|~convergent_lines(X1,X2))).
% 0.08/0.30 cnf(i_0_7, plain, (distinct_points(X1,X2)|~apart_point_and_line(X1,line_connecting(X3,X2))|~distinct_points(X3,X2))).
% 0.08/0.30 cnf(i_0_8, plain, (distinct_points(X1,X2)|~apart_point_and_line(X1,line_connecting(X2,X3))|~distinct_points(X2,X3))).
% 0.08/0.30 cnf(i_0_4, plain, (distinct_points(X1,X2)|distinct_points(X3,X2)|~distinct_points(X1,X3))).
% 0.08/0.30 cnf(i_0_12, plain, (apart_point_and_line(X1,X2)|distinct_points(X3,X1)|~apart_point_and_line(X3,X2))).
% 0.08/0.30 cnf(i_0_9, plain, (distinct_points(X1,intersection_point(X2,X3))|~apart_point_and_line(X1,X3)|~convergent_lines(X2,X3))).
% 0.08/0.30 cnf(i_0_10, plain, (distinct_points(X1,intersection_point(X2,X3))|~apart_point_and_line(X1,X2)|~convergent_lines(X2,X3))).
% 0.08/0.30 cnf(i_0_13, plain, (apart_point_and_line(X1,X2)|distinct_lines(X3,X2)|~apart_point_and_line(X1,X3))).
% 0.08/0.30 cnf(i_0_5, plain, (distinct_lines(X1,X2)|distinct_lines(X3,X2)|~distinct_lines(X1,X3))).
% 0.08/0.30 cnf(i_0_6, plain, (convergent_lines(X1,X2)|convergent_lines(X3,X2)|~convergent_lines(X1,X3))).
% 0.08/0.30 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.08/0.30 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.08/0.30 # Begin printing tableau
% 0.08/0.30 # Found 6 steps
% 0.08/0.30 cnf(i_0_15, negated_conjecture, (apart_point_and_line(esk3_0,line_connecting(esk2_0,esk1_0))), inference(start_rule)).
% 0.08/0.30 cnf(i_0_21, plain, (apart_point_and_line(esk3_0,line_connecting(esk2_0,esk1_0))), inference(extension_rule, [i_0_13])).
% 0.08/0.30 cnf(i_0_80, plain, (apart_point_and_line(esk3_0,line_connecting(esk1_0,esk2_0))), inference(closure_rule, [i_0_16])).
% 0.08/0.30 cnf(i_0_81, plain, (distinct_lines(line_connecting(esk2_0,esk1_0),line_connecting(esk1_0,esk2_0))), inference(extension_rule, [i_0_5])).
% 0.08/0.30 cnf(i_0_118, plain, (distinct_lines(line_connecting(esk2_0,esk1_0),line_connecting(esk2_0,esk1_0))), inference(closure_rule, [i_0_2])).
% 0.08/0.30 cnf(i_0_119, plain, (distinct_lines(line_connecting(esk1_0,esk2_0),line_connecting(esk2_0,esk1_0))), inference(etableau_closure_rule, [i_0_119, ...])).
% 0.08/0.30 # End printing tableau
% 0.08/0.30 # SZS output end
% 0.08/0.30 # Branches closed with saturation will be marked with an "s"
% 0.08/0.30 # Child (30197) has found a proof.
% 0.08/0.30
% 0.08/0.30 # Proof search is over...
% 0.08/0.30 # Freeing feature tree
%------------------------------------------------------------------------------