TSTP Solution File: SEU361+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SEU361+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 : n019.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:11 EDT 2022
% Result : Theorem 0.13s 0.39s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SEU361+1 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.35 % Computer : n019.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sun Jun 19 22:47:24 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.39 # No SInE strategy applied
% 0.13/0.39 # Auto-Mode selected heuristic G_E___208_C18C___F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.39 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.13/0.39 #
% 0.13/0.39 # Presaturation interreduction done
% 0.13/0.39 # Number of axioms: 40 Number of unprocessed: 40
% 0.13/0.39 # Tableaux proof search.
% 0.13/0.39 # APR header successfully linked.
% 0.13/0.39 # Hello from C++
% 0.13/0.39 # The folding up rule is enabled...
% 0.13/0.39 # Local unification is enabled...
% 0.13/0.39 # Any saturation attempts will use folding labels...
% 0.13/0.39 # 40 beginning clauses after preprocessing and clausification
% 0.13/0.39 # Creating start rules for all 6 conjectures.
% 0.13/0.39 # There are 6 start rule candidates:
% 0.13/0.39 # Found 16 unit axioms.
% 0.13/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.39 # 6 start rule tableaux created.
% 0.13/0.39 # 24 extension rule candidate clauses
% 0.13/0.39 # 16 unit axiom clauses
% 0.13/0.39
% 0.13/0.39 # Requested 8, 32 cores available to the main process.
% 0.13/0.39 # There are not enough tableaux to fork, creating more from the initial 6
% 0.13/0.39 # Returning from population with 16 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.39 # We now have 16 tableaux to operate on
% 0.13/0.39 # There were 1 total branch saturation attempts.
% 0.13/0.39 # There were 0 of these attempts blocked.
% 0.13/0.39 # There were 0 deferred branch saturation attempts.
% 0.13/0.39 # There were 0 free duplicated saturations.
% 0.13/0.39 # There were 1 total successful branch saturations.
% 0.13/0.39 # There were 0 successful branch saturations in interreduction.
% 0.13/0.39 # There were 0 successful branch saturations on the branch.
% 0.13/0.39 # There were 1 successful branch saturations after the branch.
% 0.13/0.39 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.39 # Begin clausification derivation
% 0.13/0.39
% 0.13/0.39 # End clausification derivation
% 0.13/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.39 cnf(i_0_36, negated_conjecture, (rel_str(esk9_0))).
% 0.13/0.39 cnf(i_0_38, negated_conjecture, (antisymmetric_relstr(esk9_0))).
% 0.13/0.39 cnf(i_0_37, negated_conjecture, (lower_bounded_relstr(esk9_0))).
% 0.13/0.39 cnf(i_0_15, plain, (empty(empty_set))).
% 0.13/0.39 cnf(i_0_11, plain, (rel_str(esk1_0))).
% 0.13/0.39 cnf(i_0_18, plain, (empty(esk5_0))).
% 0.13/0.39 cnf(i_0_35, negated_conjecture, (element(esk10_0,the_carrier(esk9_0)))).
% 0.13/0.39 cnf(i_0_16, plain, (finite(esk4_0))).
% 0.13/0.39 cnf(i_0_12, plain, (one_sorted_str(esk2_0))).
% 0.13/0.39 cnf(i_0_21, plain, (one_sorted_str(esk7_0))).
% 0.13/0.39 cnf(i_0_13, plain, (element(esk3_1(X1),X1))).
% 0.13/0.39 cnf(i_0_39, negated_conjecture, (~empty_carrier(esk9_0))).
% 0.13/0.39 cnf(i_0_34, negated_conjecture, (~related(esk9_0,bottom_of_relstr(esk9_0),esk10_0))).
% 0.13/0.39 cnf(i_0_17, plain, (~empty(esk4_0))).
% 0.13/0.39 cnf(i_0_19, plain, (~empty(esk6_0))).
% 0.13/0.39 cnf(i_0_20, plain, (~empty_carrier(esk7_0))).
% 0.13/0.39 cnf(i_0_43, plain, (~empty(X1)|~in(X2,X1))).
% 0.13/0.39 cnf(i_0_40, plain, (X1=empty_set|~empty(X1))).
% 0.13/0.39 cnf(i_0_7, plain, (one_sorted_str(X1)|~rel_str(X1))).
% 0.13/0.39 cnf(i_0_2, plain, (finite(X1)|~empty(X1))).
% 0.13/0.39 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))).
% 0.13/0.39 cnf(i_0_22, plain, (element(X1,X2)|~in(X1,X2))).
% 0.13/0.39 cnf(i_0_14, plain, (empty_carrier(X1)|~one_sorted_str(X1)|~empty(the_carrier(X1)))).
% 0.13/0.39 cnf(i_0_6, plain, (element(bottom_of_relstr(X1),the_carrier(X1))|~rel_str(X1))).
% 0.13/0.39 cnf(i_0_3, plain, (bottom_of_relstr(X1)=join_on_relstr(X1,empty_set)|~rel_str(X1))).
% 0.13/0.39 cnf(i_0_33, plain, (ex_sup_of_relstr_set(X1,empty_set)|empty_carrier(X1)|~lower_bounded_relstr(X1)|~antisymmetric_relstr(X1)|~rel_str(X1))).
% 0.13/0.39 cnf(i_0_44, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 0.13/0.39 cnf(i_0_23, plain, (empty(X1)|in(X2,X1)|~element(X2,X1))).
% 0.13/0.39 cnf(i_0_5, plain, (element(join_on_relstr(X1,X2),the_carrier(X1))|~rel_str(X1))).
% 0.13/0.39 cnf(i_0_42, plain, (relstr_set_smaller(X1,empty_set,X2)|~element(X2,the_carrier(X1))|~rel_str(X1))).
% 0.13/0.39 cnf(i_0_41, plain, (relstr_element_smaller(X1,empty_set,X2)|~element(X2,the_carrier(X1))|~rel_str(X1))).
% 0.13/0.39 cnf(i_0_32, plain, (ex_inf_of_relstr_set(X1,the_carrier(X1))|empty_carrier(X1)|~lower_bounded_relstr(X1)|~antisymmetric_relstr(X1)|~rel_str(X1))).
% 0.13/0.39 cnf(i_0_24, plain, (ex_sup_of_relstr_set(X1,X2)|~related(X1,X3,esk8_3(X1,X3,X2))|~relstr_set_smaller(X1,X2,X3)|~antisymmetric_relstr(X1)|~element(X3,the_carrier(X1))|~rel_str(X1))).
% 0.13/0.39 cnf(i_0_28, plain, (ex_sup_of_relstr_set(X1,X2)|element(esk8_3(X1,X3,X2),the_carrier(X1))|~relstr_set_smaller(X1,X2,X3)|~antisymmetric_relstr(X1)|~element(X3,the_carrier(X1))|~rel_str(X1))).
% 0.13/0.39 cnf(i_0_25, plain, (X1=join_on_relstr(X2,X3)|~related(X2,X1,esk8_3(X2,X1,X3))|~relstr_set_smaller(X2,X3,X1)|~antisymmetric_relstr(X2)|~element(X1,the_carrier(X2))|~rel_str(X2))).
% 0.13/0.39 cnf(i_0_31, plain, (relstr_set_smaller(X1,X2,join_on_relstr(X1,X2))|~ex_sup_of_relstr_set(X1,X2)|~antisymmetric_relstr(X1)|~rel_str(X1))).
% 0.13/0.39 cnf(i_0_29, plain, (X1=join_on_relstr(X2,X3)|element(esk8_3(X2,X1,X3),the_carrier(X2))|~relstr_set_smaller(X2,X3,X1)|~antisymmetric_relstr(X2)|~element(X1,the_carrier(X2))|~rel_str(X2))).
% 0.13/0.39 cnf(i_0_26, plain, (relstr_set_smaller(X1,X2,esk8_3(X1,X3,X2))|ex_sup_of_relstr_set(X1,X2)|~relstr_set_smaller(X1,X2,X3)|~antisymmetric_relstr(X1)|~element(X3,the_carrier(X1))|~rel_str(X1))).
% 0.13/0.39 cnf(i_0_30, plain, (related(X1,join_on_relstr(X1,X2),X3)|~relstr_set_smaller(X1,X2,X3)|~ex_sup_of_relstr_set(X1,X2)|~antisymmetric_relstr(X1)|~element(X3,the_carrier(X1))|~rel_str(X1))).
% 0.13/0.39 cnf(i_0_27, plain, (X1=join_on_relstr(X2,X3)|relstr_set_smaller(X2,X3,esk8_3(X2,X1,X3))|~relstr_set_smaller(X2,X3,X1)|~antisymmetric_relstr(X2)|~element(X1,the_carrier(X2))|~rel_str(X2))).
% 0.13/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.13/0.39 # Begin printing tableau
% 0.13/0.39 # Found 5 steps
% 0.13/0.39 cnf(i_0_36, negated_conjecture, (rel_str(esk9_0)), inference(start_rule)).
% 0.13/0.39 cnf(i_0_52, plain, (rel_str(esk9_0)), inference(extension_rule, [i_0_7])).
% 0.13/0.39 cnf(i_0_324, plain, (one_sorted_str(esk9_0)), inference(extension_rule, [i_0_14])).
% 0.13/0.39 cnf(i_0_336, plain, (empty_carrier(esk9_0)), inference(closure_rule, [i_0_39])).
% 0.13/0.39 cnf(i_0_338, plain, (~empty(the_carrier(esk9_0))), inference(etableau_closure_rule, [i_0_338, ...])).
% 0.13/0.39 # End printing tableau
% 0.13/0.39 # SZS output end
% 0.13/0.39 # Branches closed with saturation will be marked with an "s"
% 0.13/0.40 # Child (7276) has found a proof.
% 0.13/0.40
% 0.13/0.40 # Proof search is over...
% 0.13/0.40 # Freeing feature tree
%------------------------------------------------------------------------------