TSTP Solution File: SEU355+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SEU355+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 : n026.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:26:08 EDT 2022
% Result : Theorem 0.12s 0.38s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SEU355+1 : 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 : n026.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 : Sun Jun 19 10:47:55 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.36 # No SInE strategy applied
% 0.12/0.36 # Auto-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2SA
% 0.12/0.36 # and selection function SelectNewComplexAHP.
% 0.12/0.36 #
% 0.12/0.36 # Presaturation interreduction done
% 0.12/0.36 # Number of axioms: 27 Number of unprocessed: 27
% 0.12/0.36 # Tableaux proof search.
% 0.12/0.36 # APR header successfully linked.
% 0.12/0.36 # Hello from C++
% 0.12/0.36 # The folding up rule is enabled...
% 0.12/0.36 # Local unification is enabled...
% 0.12/0.36 # Any saturation attempts will use folding labels...
% 0.12/0.36 # 27 beginning clauses after preprocessing and clausification
% 0.12/0.36 # Creating start rules for all 3 conjectures.
% 0.12/0.36 # There are 3 start rule candidates:
% 0.12/0.36 # Found 10 unit axioms.
% 0.12/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.36 # 3 start rule tableaux created.
% 0.12/0.36 # 17 extension rule candidate clauses
% 0.12/0.36 # 10 unit axiom clauses
% 0.12/0.36
% 0.12/0.36 # Requested 8, 32 cores available to the main process.
% 0.12/0.36 # There are not enough tableaux to fork, creating more from the initial 3
% 0.12/0.36 # Returning from population with 18 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.36 # We now have 18 tableaux to operate on
% 0.12/0.38 # There were 2 total branch saturation attempts.
% 0.12/0.38 # There were 0 of these attempts blocked.
% 0.12/0.38 # There were 0 deferred branch saturation attempts.
% 0.12/0.38 # There were 0 free duplicated saturations.
% 0.12/0.38 # There were 2 total successful branch saturations.
% 0.12/0.38 # There were 0 successful branch saturations in interreduction.
% 0.12/0.38 # There were 0 successful branch saturations on the branch.
% 0.12/0.38 # There were 2 successful branch saturations after the branch.
% 0.12/0.38 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.38 # Begin clausification derivation
% 0.12/0.38
% 0.12/0.38 # End clausification derivation
% 0.12/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.38 cnf(i_0_29, negated_conjecture, (rel_str(esk9_0))).
% 0.12/0.38 cnf(i_0_28, negated_conjecture, (element(esk10_0,the_carrier(esk9_0)))).
% 0.12/0.38 cnf(i_0_19, plain, (empty(empty_set))).
% 0.12/0.38 cnf(i_0_16, plain, (rel_str(esk3_0))).
% 0.12/0.38 cnf(i_0_22, plain, (empty(esk7_0))).
% 0.12/0.38 cnf(i_0_20, plain, (finite(esk6_0))).
% 0.12/0.38 cnf(i_0_17, plain, (one_sorted_str(esk4_0))).
% 0.12/0.38 cnf(i_0_18, plain, (element(esk5_1(X1),X1))).
% 0.12/0.38 cnf(i_0_21, plain, (~empty(esk6_0))).
% 0.12/0.38 cnf(i_0_23, plain, (~empty(esk8_0))).
% 0.12/0.38 cnf(i_0_27, negated_conjecture, (~relstr_set_smaller(esk9_0,empty_set,esk10_0)|~relstr_element_smaller(esk9_0,empty_set,esk10_0))).
% 0.12/0.38 cnf(i_0_30, plain, (~empty(X1)|~in(X2,X1))).
% 0.12/0.38 cnf(i_0_26, plain, (X1=empty_set|~empty(X1))).
% 0.12/0.38 cnf(i_0_12, plain, (one_sorted_str(X1)|~rel_str(X1))).
% 0.12/0.38 cnf(i_0_2, plain, (finite(X1)|~empty(X1))).
% 0.12/0.38 cnf(i_0_24, plain, (element(X1,X2)|~in(X1,X2))).
% 0.12/0.38 cnf(i_0_31, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 0.12/0.38 cnf(i_0_25, plain, (empty(X1)|in(X2,X1)|~element(X2,X1))).
% 0.12/0.38 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))).
% 0.12/0.38 cnf(i_0_3, plain, (relstr_element_smaller(X1,X2,X3)|~related(X1,X3,esk1_3(X1,X2,X3))|~element(X3,the_carrier(X1))|~rel_str(X1))).
% 0.12/0.38 cnf(i_0_7, plain, (relstr_set_smaller(X1,X2,X3)|~related(X1,esk2_3(X1,X2,X3),X3)|~element(X3,the_carrier(X1))|~rel_str(X1))).
% 0.12/0.38 cnf(i_0_10, plain, (related(X1,X2,X3)|~relstr_set_smaller(X1,X4,X3)|~element(X2,the_carrier(X1))|~element(X3,the_carrier(X1))|~rel_str(X1)|~in(X2,X4))).
% 0.12/0.38 cnf(i_0_4, plain, (relstr_element_smaller(X1,X2,X3)|in(esk1_3(X1,X2,X3),X2)|~element(X3,the_carrier(X1))|~rel_str(X1))).
% 0.12/0.38 cnf(i_0_5, plain, (relstr_element_smaller(X1,X2,X3)|element(esk1_3(X1,X2,X3),the_carrier(X1))|~element(X3,the_carrier(X1))|~rel_str(X1))).
% 0.12/0.38 cnf(i_0_9, plain, (relstr_set_smaller(X1,X2,X3)|element(esk2_3(X1,X2,X3),the_carrier(X1))|~element(X3,the_carrier(X1))|~rel_str(X1))).
% 0.12/0.38 cnf(i_0_8, plain, (relstr_set_smaller(X1,X2,X3)|in(esk2_3(X1,X2,X3),X2)|~element(X3,the_carrier(X1))|~rel_str(X1))).
% 0.12/0.38 cnf(i_0_6, plain, (related(X1,X2,X3)|~relstr_element_smaller(X1,X4,X2)|~element(X3,the_carrier(X1))|~element(X2,the_carrier(X1))|~rel_str(X1)|~in(X3,X4))).
% 0.12/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.38 # Begin printing tableau
% 0.12/0.38 # Found 6 steps
% 0.12/0.38 cnf(i_0_28, negated_conjecture, (element(esk10_0,the_carrier(esk9_0))), inference(start_rule)).
% 0.12/0.38 cnf(i_0_34, plain, (element(esk10_0,the_carrier(esk9_0))), inference(extension_rule, [i_0_8])).
% 0.12/0.38 cnf(i_0_195, plain, (~rel_str(esk9_0)), inference(closure_rule, [i_0_29])).
% 0.12/0.38 cnf(i_0_192, plain, (relstr_set_smaller(esk9_0,empty_set,esk10_0)), inference(extension_rule, [i_0_27])).
% 0.12/0.38 cnf(i_0_193, plain, (in(esk2_3(esk9_0,empty_set,esk10_0),empty_set)), inference(etableau_closure_rule, [i_0_193, ...])).
% 0.12/0.38 cnf(i_0_259, plain, (~relstr_element_smaller(esk9_0,empty_set,esk10_0)), inference(etableau_closure_rule, [i_0_259, ...])).
% 0.12/0.38 # End printing tableau
% 0.12/0.38 # SZS output end
% 0.12/0.38 # Branches closed with saturation will be marked with an "s"
% 0.12/0.38 # There were 1 total branch saturation attempts.
% 0.12/0.38 # There were 0 of these attempts blocked.
% 0.12/0.38 # There were 0 deferred branch saturation attempts.
% 0.12/0.38 # There were 0 free duplicated saturations.
% 0.12/0.38 # There were 1 total successful branch saturations.
% 0.12/0.38 # There were 0 successful branch saturations in interreduction.
% 0.12/0.38 # There were 0 successful branch saturations on the branch.
% 0.12/0.38 # There were 1 successful branch saturations after the branch.
% 0.12/0.38 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.38 # Begin clausification derivation
% 0.12/0.38
% 0.12/0.38 # End clausification derivation
% 0.12/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.38 cnf(i_0_29, negated_conjecture, (rel_str(esk9_0))).
% 0.12/0.38 cnf(i_0_28, negated_conjecture, (element(esk10_0,the_carrier(esk9_0)))).
% 0.12/0.38 cnf(i_0_19, plain, (empty(empty_set))).
% 0.12/0.38 cnf(i_0_16, plain, (rel_str(esk3_0))).
% 0.12/0.38 cnf(i_0_22, plain, (empty(esk7_0))).
% 0.12/0.38 cnf(i_0_20, plain, (finite(esk6_0))).
% 0.12/0.38 cnf(i_0_17, plain, (one_sorted_str(esk4_0))).
% 0.12/0.38 cnf(i_0_18, plain, (element(esk5_1(X1),X1))).
% 0.12/0.38 cnf(i_0_21, plain, (~empty(esk6_0))).
% 0.12/0.38 cnf(i_0_23, plain, (~empty(esk8_0))).
% 0.12/0.38 cnf(i_0_27, negated_conjecture, (~relstr_set_smaller(esk9_0,empty_set,esk10_0)|~relstr_element_smaller(esk9_0,empty_set,esk10_0))).
% 0.12/0.38 cnf(i_0_30, plain, (~empty(X1)|~in(X2,X1))).
% 0.12/0.38 cnf(i_0_26, plain, (X1=empty_set|~empty(X1))).
% 0.12/0.38 cnf(i_0_12, plain, (one_sorted_str(X1)|~rel_str(X1))).
% 0.12/0.38 cnf(i_0_2, plain, (finite(X1)|~empty(X1))).
% 0.12/0.38 cnf(i_0_24, plain, (element(X1,X2)|~in(X1,X2))).
% 0.12/0.38 cnf(i_0_31, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 0.12/0.38 cnf(i_0_25, plain, (empty(X1)|in(X2,X1)|~element(X2,X1))).
% 0.12/0.38 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))).
% 0.12/0.38 cnf(i_0_3, plain, (relstr_element_smaller(X1,X2,X3)|~related(X1,X3,esk1_3(X1,X2,X3))|~element(X3,the_carrier(X1))|~rel_str(X1))).
% 0.12/0.38 cnf(i_0_7, plain, (relstr_set_smaller(X1,X2,X3)|~related(X1,esk2_3(X1,X2,X3),X3)|~element(X3,the_carrier(X1))|~rel_str(X1))).
% 0.12/0.38 cnf(i_0_10, plain, (related(X1,X2,X3)|~relstr_set_smaller(X1,X4,X3)|~element(X2,the_carrier(X1))|~element(X3,the_carrier(X1))|~rel_str(X1)|~in(X2,X4))).
% 0.12/0.38 cnf(i_0_4, plain, (relstr_element_smaller(X1,X2,X3)|in(esk1_3(X1,X2,X3),X2)|~element(X3,the_carrier(X1))|~rel_str(X1))).
% 0.12/0.38 cnf(i_0_5, plain, (relstr_element_smaller(X1,X2,X3)|element(esk1_3(X1,X2,X3),the_carrier(X1))|~element(X3,the_carrier(X1))|~rel_str(X1))).
% 0.12/0.38 cnf(i_0_9, plain, (relstr_set_smaller(X1,X2,X3)|element(esk2_3(X1,X2,X3),the_carrier(X1))|~element(X3,the_carrier(X1))|~rel_str(X1))).
% 0.12/0.38 cnf(i_0_8, plain, (relstr_set_smaller(X1,X2,X3)|in(esk2_3(X1,X2,X3),X2)|~element(X3,the_carrier(X1))|~rel_str(X1))).
% 0.12/0.38 cnf(i_0_6, plain, (related(X1,X2,X3)|~relstr_element_smaller(X1,X4,X2)|~element(X3,the_carrier(X1))|~element(X2,the_carrier(X1))|~rel_str(X1)|~in(X3,X4))).
% 0.12/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.38 # Begin printing tableau
% 0.12/0.38 # Found 11 steps
% 0.12/0.38 cnf(i_0_27, negated_conjecture, (~relstr_set_smaller(esk9_0,empty_set,esk10_0)|~relstr_element_smaller(esk9_0,empty_set,esk10_0)), inference(start_rule)).
% 0.12/0.38 cnf(i_0_32, plain, (~relstr_set_smaller(esk9_0,empty_set,esk10_0)), inference(extension_rule, [i_0_8])).
% 0.12/0.38 cnf(i_0_82, plain, (~element(esk10_0,the_carrier(esk9_0))), inference(closure_rule, [i_0_28])).
% 0.12/0.38 cnf(i_0_83, plain, (~rel_str(esk9_0)), inference(closure_rule, [i_0_29])).
% 0.12/0.38 cnf(i_0_81, plain, (in(esk2_3(esk9_0,empty_set,esk10_0),empty_set)), inference(extension_rule, [i_0_30])).
% 0.12/0.38 cnf(i_0_260, plain, (~empty(empty_set)), inference(closure_rule, [i_0_19])).
% 0.12/0.38 cnf(i_0_33, plain, (~relstr_element_smaller(esk9_0,empty_set,esk10_0)), inference(extension_rule, [i_0_4])).
% 0.12/0.38 cnf(i_0_478, plain, (~element(esk10_0,the_carrier(esk9_0))), inference(closure_rule, [i_0_28])).
% 0.12/0.38 cnf(i_0_479, plain, (~rel_str(esk9_0)), inference(closure_rule, [i_0_29])).
% 0.12/0.38 cnf(i_0_477, plain, (in(esk1_3(esk9_0,empty_set,esk10_0),empty_set)), inference(extension_rule, [i_0_24])).
% 0.12/0.38 cnf(i_0_486, plain, (element(esk1_3(esk9_0,empty_set,esk10_0),empty_set)), inference(etableau_closure_rule, [i_0_486, ...])).
% 0.12/0.38 # End printing tableau
% 0.12/0.38 # SZS output end
% 0.12/0.38 # Branches closed with saturation will be marked with an "s"
% 0.12/0.38 # Child (12233) has found a proof.
% 0.12/0.38
% 0.12/0.38 # Proof search is over...
% 0.12/0.38 # Freeing feature tree
%------------------------------------------------------------------------------