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