TSTP Solution File: SEU323+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SEU323+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 : n015.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:51 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.04/0.12 % Problem : SEU323+1 : TPTP v8.1.0. Released v3.3.0.
% 0.04/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 : n015.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 : Mon Jun 20 12:32:45 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.37 # No SInE strategy applied
% 0.20/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.20/0.37 #
% 0.20/0.37 # Presaturation interreduction done
% 0.20/0.37 # Number of axioms: 23 Number of unprocessed: 23
% 0.20/0.37 # Tableaux proof search.
% 0.20/0.37 # APR header successfully linked.
% 0.20/0.37 # 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 # 23 beginning clauses after preprocessing and clausification
% 0.20/0.38 # Creating start rules for all 4 conjectures.
% 0.20/0.38 # There are 4 start rule candidates:
% 0.20/0.38 # Found 8 unit axioms.
% 0.20/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.20/0.38 # 4 start rule tableaux created.
% 0.20/0.38 # 15 extension rule candidate clauses
% 0.20/0.38 # 8 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 4
% 0.20/0.38 # Returning from population with 11 new_tableaux and 0 remaining starting tableaux.
% 0.20/0.38 # We now have 11 tableaux to operate on
% 0.20/0.38 # There were 1 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 1 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 1 successful branch saturations after the branch.
% 0.20/0.38 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.38 # SZS output start for /export/starexec/sandbox/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_27, negated_conjecture, (topological_space(esk6_0))).
% 0.20/0.38 cnf(i_0_26, negated_conjecture, (top_str(esk6_0))).
% 0.20/0.38 cnf(i_0_25, negated_conjecture, (element(esk7_0,powerset(the_carrier(esk6_0))))).
% 0.20/0.38 cnf(i_0_12, plain, (top_str(esk3_0))).
% 0.20/0.38 cnf(i_0_6, plain, (one_sorted_str(esk2_0))).
% 0.20/0.38 cnf(i_0_5, plain, (subset(X1,X1))).
% 0.20/0.38 cnf(i_0_13, plain, (element(esk4_1(X1),X1))).
% 0.20/0.38 cnf(i_0_24, negated_conjecture, (~open_subset(interior(esk6_0,esk7_0),esk6_0))).
% 0.20/0.38 cnf(i_0_16, plain, (one_sorted_str(X1)|~top_str(X1))).
% 0.20/0.38 cnf(i_0_21, plain, (element(X1,powerset(X2))|~subset(X1,X2))).
% 0.20/0.38 cnf(i_0_22, plain, (subset(X1,X2)|~element(X1,powerset(X2)))).
% 0.20/0.38 cnf(i_0_19, plain, (open_subset(esk5_1(X1),X1)|~top_str(X1)|~topological_space(X1))).
% 0.20/0.38 cnf(i_0_3, plain, (element(esk1_1(X1),powerset(the_carrier(X1)))|~top_str(X1)|~topological_space(X1))).
% 0.20/0.38 cnf(i_0_20, plain, (element(esk5_1(X1),powerset(the_carrier(X1)))|~top_str(X1)|~topological_space(X1))).
% 0.20/0.38 cnf(i_0_14, plain, (element(interior(X1,X2),powerset(the_carrier(X1)))|~element(X2,powerset(the_carrier(X1)))|~top_str(X1))).
% 0.20/0.38 cnf(i_0_2, plain, (closed_subset(esk1_1(X1),X1)|~top_str(X1)|~topological_space(X1))).
% 0.20/0.38 cnf(i_0_4, plain, (subset_complement(X1,subset_complement(X1,X2))=X2|~element(X2,powerset(X1)))).
% 0.20/0.38 cnf(i_0_7, plain, (element(subset_complement(X1,X2),powerset(X1))|~element(X2,powerset(X1)))).
% 0.20/0.38 cnf(i_0_10, plain, (closed_subset(topstr_closure(X1,X2),X1)|~element(X2,powerset(the_carrier(X1)))|~top_str(X1)|~topological_space(X1))).
% 0.20/0.38 cnf(i_0_8, plain, (element(topstr_closure(X1,X2),powerset(the_carrier(X1)))|~element(X2,powerset(the_carrier(X1)))|~top_str(X1))).
% 0.20/0.38 cnf(i_0_11, plain, (closed_subset(subset_complement(the_carrier(X1),X2),X1)|~open_subset(X2,X1)|~element(X2,powerset(the_carrier(X1)))|~top_str(X1)|~topological_space(X1))).
% 0.20/0.38 cnf(i_0_1, plain, (open_subset(subset_complement(the_carrier(X1),X2),X1)|~element(X2,powerset(the_carrier(X1)))|~closed_subset(X2,X1)|~top_str(X1)|~topological_space(X1))).
% 0.20/0.38 cnf(i_0_23, plain, (subset_complement(the_carrier(X1),topstr_closure(X1,subset_complement(the_carrier(X1),X2)))=interior(X1,X2)|~element(X2,powerset(the_carrier(X1)))|~top_str(X1))).
% 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 5 steps
% 0.20/0.38 cnf(i_0_25, negated_conjecture, (element(esk7_0,powerset(the_carrier(esk6_0)))), inference(start_rule)).
% 0.20/0.38 cnf(i_0_29, plain, (element(esk7_0,powerset(the_carrier(esk6_0)))), inference(extension_rule, [i_0_8])).
% 0.20/0.38 cnf(i_0_108, plain, (~top_str(esk6_0)), inference(closure_rule, [i_0_26])).
% 0.20/0.38 cnf(i_0_106, plain, (element(topstr_closure(esk6_0,esk7_0),powerset(the_carrier(esk6_0)))), inference(extension_rule, [i_0_22])).
% 0.20/0.38 cnf(i_0_126, plain, (subset(topstr_closure(esk6_0,esk7_0),the_carrier(esk6_0))), inference(etableau_closure_rule, [i_0_126, ...])).
% 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 # Child (28310) has found a proof.
% 0.20/0.38
% 0.20/0.38 # Proof search is over...
% 0.20/0.38 # Freeing feature tree
%------------------------------------------------------------------------------