TSTP Solution File: SEU324+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SEU324+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 : n008.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 : Tue Jul 19 09:25:52 EDT 2022
% Result : Theorem 0.12s 0.40s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU324+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/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.33 % Computer : n008.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.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jun 19 06:31:07 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.39 # No SInE strategy applied
% 0.12/0.39 # Auto-Mode selected heuristic G_E___301_C18_F1_URBAN_S5PRR_RG_S04BN
% 0.12/0.39 # and selection function PSelectComplexExceptUniqMaxHorn.
% 0.12/0.39 #
% 0.12/0.39 # Number of axioms: 36 Number of unprocessed: 36
% 0.12/0.39 # Tableaux proof search.
% 0.12/0.39 # APR header successfully linked.
% 0.12/0.39 # Hello from C++
% 0.12/0.39 # The folding up rule is enabled...
% 0.12/0.39 # Local unification is enabled...
% 0.12/0.39 # Any saturation attempts will use folding labels...
% 0.12/0.39 # 36 beginning clauses after preprocessing and clausification
% 0.12/0.39 # Creating start rules for all 9 conjectures.
% 0.12/0.39 # There are 9 start rule candidates:
% 0.12/0.39 # Found 9 unit axioms.
% 0.12/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.39 # 9 start rule tableaux created.
% 0.12/0.39 # 27 extension rule candidate clauses
% 0.12/0.39 # 9 unit axiom clauses
% 0.12/0.39
% 0.12/0.39 # Requested 8, 32 cores available to the main process.
% 0.12/0.40 # There were 1 total branch saturation attempts.
% 0.12/0.40 # There were 0 of these attempts blocked.
% 0.12/0.40 # There were 0 deferred branch saturation attempts.
% 0.12/0.40 # There were 0 free duplicated saturations.
% 0.12/0.40 # There were 1 total successful branch saturations.
% 0.12/0.40 # There were 0 successful branch saturations in interreduction.
% 0.12/0.40 # There were 0 successful branch saturations on the branch.
% 0.12/0.40 # There were 1 successful branch saturations after the branch.
% 0.12/0.40 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.40 # Begin clausification derivation
% 0.12/0.40
% 0.12/0.40 # End clausification derivation
% 0.12/0.40 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.40 cnf(i_0_10, plain, (top_str(esk1_0))).
% 0.12/0.40 cnf(i_0_39, negated_conjecture, (top_str(esk7_0))).
% 0.12/0.40 cnf(i_0_38, negated_conjecture, (top_str(esk8_0))).
% 0.12/0.40 cnf(i_0_11, plain, (one_sorted_str(esk2_0))).
% 0.12/0.40 cnf(i_0_40, negated_conjecture, (topological_space(esk7_0))).
% 0.12/0.40 cnf(i_0_6, plain, (one_sorted_str(X1)|~top_str(X1))).
% 0.12/0.40 cnf(i_0_25, plain, (subset(X1,X1))).
% 0.12/0.40 cnf(i_0_12, plain, (element(esk3_1(X1),X1))).
% 0.12/0.40 cnf(i_0_35, negated_conjecture, (interior(esk7_0,esk9_0)=esk9_0|open_subset(esk10_0,esk8_0))).
% 0.12/0.40 cnf(i_0_37, negated_conjecture, (element(esk9_0,powerset(the_carrier(esk7_0))))).
% 0.12/0.40 cnf(i_0_36, negated_conjecture, (element(esk10_0,powerset(the_carrier(esk8_0))))).
% 0.12/0.40 cnf(i_0_33, negated_conjecture, (interior(esk7_0,esk9_0)=esk9_0|interior(esk8_0,esk10_0)!=esk10_0)).
% 0.12/0.40 cnf(i_0_34, negated_conjecture, (open_subset(esk10_0,esk8_0)|~open_subset(esk9_0,esk7_0))).
% 0.12/0.40 cnf(i_0_20, plain, (closed_subset(esk5_1(X1),X1)|~top_str(X1)|~topological_space(X1))).
% 0.12/0.40 cnf(i_0_23, plain, (closed_subset(esk6_1(X1),X1)|~top_str(X1)|~topological_space(X1))).
% 0.12/0.40 cnf(i_0_18, plain, (open_subset(esk4_1(X1),X1)|~top_str(X1)|~topological_space(X1))).
% 0.12/0.40 cnf(i_0_21, plain, (open_subset(esk5_1(X1),X1)|~top_str(X1)|~topological_space(X1))).
% 0.12/0.40 cnf(i_0_32, negated_conjecture, (interior(esk8_0,esk10_0)!=esk10_0|~open_subset(esk9_0,esk7_0))).
% 0.12/0.40 cnf(i_0_28, plain, (element(X1,powerset(X2))|~subset(X1,X2))).
% 0.12/0.40 cnf(i_0_29, plain, (subset(X1,X2)|~element(X1,powerset(X2)))).
% 0.12/0.40 cnf(i_0_19, plain, (element(esk4_1(X1),powerset(the_carrier(X1)))|~top_str(X1)|~topological_space(X1))).
% 0.12/0.40 cnf(i_0_22, plain, (element(esk5_1(X1),powerset(the_carrier(X1)))|~top_str(X1)|~topological_space(X1))).
% 0.12/0.40 cnf(i_0_24, plain, (element(esk6_1(X1),powerset(the_carrier(X1)))|~top_str(X1)|~topological_space(X1))).
% 0.12/0.40 cnf(i_0_17, plain, (subset_complement(X2,subset_complement(X2,X1))=X1|~element(X1,powerset(X2)))).
% 0.12/0.40 cnf(i_0_4, plain, (element(subset_complement(X2,X1),powerset(X2))|~element(X1,powerset(X2)))).
% 0.12/0.40 cnf(i_0_31, plain, (topstr_closure(X2,X1)=X1|~top_str(X2)|~closed_subset(X1,X2)|~element(X1,powerset(the_carrier(X2))))).
% 0.12/0.40 cnf(i_0_30, plain, (closed_subset(X2,X1)|topstr_closure(X1,X2)!=X2|~top_str(X1)|~topological_space(X1)|~element(X2,powerset(the_carrier(X1))))).
% 0.12/0.40 cnf(i_0_13, plain, (closed_subset(topstr_closure(X1,X2),X1)|~top_str(X1)|~topological_space(X1)|~element(X2,powerset(the_carrier(X1))))).
% 0.12/0.40 cnf(i_0_16, plain, (open_subset(interior(X1,X2),X1)|~top_str(X1)|~topological_space(X1)|~element(X2,powerset(the_carrier(X1))))).
% 0.12/0.40 cnf(i_0_2, plain, (element(interior(X1,X2),powerset(the_carrier(X1)))|~top_str(X1)|~element(X2,powerset(the_carrier(X1))))).
% 0.12/0.40 cnf(i_0_5, plain, (element(topstr_closure(X1,X2),powerset(the_carrier(X1)))|~top_str(X1)|~element(X2,powerset(the_carrier(X1))))).
% 0.12/0.40 cnf(i_0_27, plain, (closed_subset(subset_complement(the_carrier(X2),X1),X2)|~top_str(X2)|~open_subset(X1,X2)|~element(X1,powerset(the_carrier(X2))))).
% 0.12/0.40 cnf(i_0_15, plain, (closed_subset(subset_complement(the_carrier(X1),X2),X1)|~top_str(X1)|~topological_space(X1)|~open_subset(X2,X1)|~element(X2,powerset(the_carrier(X1))))).
% 0.12/0.40 cnf(i_0_14, plain, (open_subset(subset_complement(the_carrier(X1),X2),X1)|~top_str(X1)|~topological_space(X1)|~closed_subset(X2,X1)|~element(X2,powerset(the_carrier(X1))))).
% 0.12/0.40 cnf(i_0_26, plain, (open_subset(X2,X1)|~top_str(X1)|~element(X2,powerset(the_carrier(X1)))|~closed_subset(subset_complement(the_carrier(X1),X2),X1))).
% 0.12/0.40 cnf(i_0_1, plain, (subset_complement(the_carrier(X1),topstr_closure(X1,subset_complement(the_carrier(X1),X2)))=interior(X1,X2)|~top_str(X1)|~element(X2,powerset(the_carrier(X1))))).
% 0.12/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.40 # Begin printing tableau
% 0.12/0.40 # Found 5 steps
% 0.12/0.40 cnf(i_0_39, negated_conjecture, (top_str(esk7_0)), inference(start_rule)).
% 0.12/0.40 cnf(i_0_53, plain, (top_str(esk7_0)), inference(extension_rule, [i_0_19])).
% 0.12/0.40 cnf(i_0_904, plain, (~topological_space(esk7_0)), inference(closure_rule, [i_0_40])).
% 0.12/0.40 cnf(i_0_902, plain, (element(esk4_1(esk7_0),powerset(the_carrier(esk7_0)))), inference(extension_rule, [i_0_29])).
% 0.12/0.40 cnf(i_0_907, plain, (subset(esk4_1(esk7_0),the_carrier(esk7_0))), inference(etableau_closure_rule, [i_0_907, ...])).
% 0.12/0.40 # End printing tableau
% 0.12/0.40 # SZS output end
% 0.12/0.40 # Branches closed with saturation will be marked with an "s"
% 0.12/0.40 # Child (15033) has found a proof.
% 0.12/0.40
% 0.12/0.40 # Proof search is over...
% 0.12/0.40 # Freeing feature tree
%------------------------------------------------------------------------------