TSTP Solution File: SEU357+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SEU357+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:09 EDT 2022
% Result : Theorem 3.39s 0.83s
% Output : CNFRefutation 3.39s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU357+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/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.34 % Computer : n019.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % 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 : Mon Jun 20 11:36:09 EDT 2022
% 0.12/0.35 % CPUTime :
% 0.12/0.38 # No SInE strategy applied
% 0.12/0.38 # Auto-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2SA
% 0.12/0.38 # and selection function SelectNewComplexAHP.
% 0.12/0.38 #
% 0.12/0.38 # Presaturation interreduction done
% 0.12/0.38 # Number of axioms: 31 Number of unprocessed: 31
% 0.12/0.38 # Tableaux proof search.
% 0.12/0.38 # APR header successfully linked.
% 0.12/0.38 # Hello from C++
% 0.12/0.38 # The folding up rule is enabled...
% 0.12/0.38 # Local unification is enabled...
% 0.12/0.38 # Any saturation attempts will use folding labels...
% 0.12/0.38 # 31 beginning clauses after preprocessing and clausification
% 0.12/0.38 # Creating start rules for all 8 conjectures.
% 0.12/0.38 # There are 8 start rule candidates:
% 0.12/0.38 # Found 5 unit axioms.
% 0.12/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.38 # 8 start rule tableaux created.
% 0.12/0.38 # 26 extension rule candidate clauses
% 0.12/0.38 # 5 unit axiom clauses
% 0.12/0.38
% 0.12/0.38 # Requested 8, 32 cores available to the main process.
% 3.39/0.82 # Creating equality axioms
% 3.39/0.82 # Ran out of tableaux, making start rules for all clauses
% 3.39/0.82 # Creating equality axioms
% 3.39/0.82 # Ran out of tableaux, making start rules for all clauses
% 3.39/0.82 # Creating equality axioms
% 3.39/0.82 # Ran out of tableaux, making start rules for all clauses
% 3.39/0.83 # There were 1 total branch saturation attempts.
% 3.39/0.83 # There were 0 of these attempts blocked.
% 3.39/0.83 # There were 0 deferred branch saturation attempts.
% 3.39/0.83 # There were 0 free duplicated saturations.
% 3.39/0.83 # There were 1 total successful branch saturations.
% 3.39/0.83 # There were 0 successful branch saturations in interreduction.
% 3.39/0.83 # There were 0 successful branch saturations on the branch.
% 3.39/0.83 # There were 1 successful branch saturations after the branch.
% 3.39/0.83 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.39/0.83 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.39/0.83 # Begin clausification derivation
% 3.39/0.83
% 3.39/0.83 # End clausification derivation
% 3.39/0.83 # Begin listing active clauses obtained from FOF to CNF conversion
% 3.39/0.83 cnf(i_0_32, negated_conjecture, (rel_str(esk8_0))).
% 3.39/0.83 cnf(i_0_33, negated_conjecture, (antisymmetric_relstr(esk8_0))).
% 3.39/0.83 cnf(i_0_23, plain, (rel_str(esk5_0))).
% 3.39/0.83 cnf(i_0_24, plain, (one_sorted_str(esk6_0))).
% 3.39/0.83 cnf(i_0_25, plain, (element(esk7_1(X1),X1))).
% 3.39/0.83 cnf(i_0_28, negated_conjecture, (element(esk11_0,the_carrier(esk8_0))|ex_inf_of_relstr_set(esk8_0,esk9_0))).
% 3.39/0.83 cnf(i_0_27, negated_conjecture, (relstr_element_smaller(esk8_0,esk9_0,esk11_0)|ex_inf_of_relstr_set(esk8_0,esk9_0))).
% 3.39/0.83 cnf(i_0_19, plain, (one_sorted_str(X1)|~rel_str(X1))).
% 3.39/0.83 cnf(i_0_18, plain, (element(esk1_2(X1,X2),the_carrier(X1))|~ex_inf_of_relstr_set(X1,X2)|~rel_str(X1))).
% 3.39/0.83 cnf(i_0_17, plain, (relstr_element_smaller(X1,X2,esk1_2(X1,X2))|~ex_inf_of_relstr_set(X1,X2)|~rel_str(X1))).
% 3.39/0.83 cnf(i_0_29, negated_conjecture, (~related(esk8_0,esk10_1(X1),X1)|~relstr_element_smaller(esk8_0,esk9_0,X1)|~element(X1,the_carrier(esk8_0))|~ex_inf_of_relstr_set(esk8_0,esk9_0))).
% 3.39/0.83 cnf(i_0_31, negated_conjecture, (element(esk10_1(X1),the_carrier(esk8_0))|~relstr_element_smaller(esk8_0,esk9_0,X1)|~element(X1,the_carrier(esk8_0))|~ex_inf_of_relstr_set(esk8_0,esk9_0))).
% 3.39/0.83 cnf(i_0_30, negated_conjecture, (relstr_element_smaller(esk8_0,esk9_0,esk10_1(X1))|~relstr_element_smaller(esk8_0,esk9_0,X1)|~element(X1,the_carrier(esk8_0))|~ex_inf_of_relstr_set(esk8_0,esk9_0))).
% 3.39/0.83 cnf(i_0_26, negated_conjecture, (related(esk8_0,X1,esk11_0)|ex_inf_of_relstr_set(esk8_0,esk9_0)|~relstr_element_smaller(esk8_0,esk9_0,X1)|~element(X1,the_carrier(esk8_0)))).
% 3.39/0.83 cnf(i_0_34, plain, (X1=X2|~antisymmetric_relstr(X3)|~related(X3,X2,X1)|~related(X3,X1,X2)|~element(X2,the_carrier(X3))|~element(X1,the_carrier(X3))|~rel_str(X3))).
% 3.39/0.83 cnf(i_0_16, plain, (related(X1,X2,esk1_2(X1,X3))|~relstr_element_smaller(X1,X3,X2)|~element(X2,the_carrier(X1))|~ex_inf_of_relstr_set(X1,X3)|~rel_str(X1))).
% 3.39/0.83 cnf(i_0_15, plain, (X1=esk1_2(X2,X3)|element(esk2_3(X2,X3,X1),the_carrier(X2))|~relstr_element_smaller(X2,X3,X1)|~element(X1,the_carrier(X2))|~ex_inf_of_relstr_set(X2,X3)|~rel_str(X2))).
% 3.39/0.83 cnf(i_0_14, plain, (X1=esk1_2(X2,X3)|relstr_element_smaller(X2,X3,esk2_3(X2,X3,X1))|~relstr_element_smaller(X2,X3,X1)|~element(X1,the_carrier(X2))|~ex_inf_of_relstr_set(X2,X3)|~rel_str(X2))).
% 3.39/0.83 cnf(i_0_1, plain, (ex_inf_of_relstr_set(X1,X2)|esk4_3(X1,X2,X3)!=X3|~related(X1,esk3_3(X1,X2,X3),X3)|~relstr_element_smaller(X1,X2,X3)|~element(X3,the_carrier(X1))|~rel_str(X1))).
% 3.39/0.83 cnf(i_0_13, plain, (X1=esk1_2(X2,X3)|~related(X2,esk2_3(X2,X3,X1),X1)|~relstr_element_smaller(X2,X3,X1)|~element(X1,the_carrier(X2))|~ex_inf_of_relstr_set(X2,X3)|~rel_str(X2))).
% 3.39/0.83 cnf(i_0_9, plain, (element(esk3_3(X1,X2,X3),the_carrier(X1))|ex_inf_of_relstr_set(X1,X2)|esk4_3(X1,X2,X3)!=X3|~relstr_element_smaller(X1,X2,X3)|~element(X3,the_carrier(X1))|~rel_str(X1))).
% 3.39/0.83 cnf(i_0_5, plain, (relstr_element_smaller(X1,X2,esk3_3(X1,X2,X3))|ex_inf_of_relstr_set(X1,X2)|esk4_3(X1,X2,X3)!=X3|~relstr_element_smaller(X1,X2,X3)|~element(X3,the_carrier(X1))|~rel_str(X1))).
% 3.39/0.83 cnf(i_0_12, plain, (element(esk4_3(X1,X2,X3),the_carrier(X1))|element(esk3_3(X1,X2,X3),the_carrier(X1))|ex_inf_of_relstr_set(X1,X2)|~relstr_element_smaller(X1,X2,X3)|~element(X3,the_carrier(X1))|~rel_str(X1))).
% 3.39/0.83 cnf(i_0_4, plain, (element(esk4_3(X1,X2,X3),the_carrier(X1))|ex_inf_of_relstr_set(X1,X2)|~related(X1,esk3_3(X1,X2,X3),X3)|~relstr_element_smaller(X1,X2,X3)|~element(X3,the_carrier(X1))|~rel_str(X1))).
% 3.39/0.83 cnf(i_0_8, plain, (relstr_element_smaller(X1,X2,esk3_3(X1,X2,X3))|element(esk4_3(X1,X2,X3),the_carrier(X1))|ex_inf_of_relstr_set(X1,X2)|~relstr_element_smaller(X1,X2,X3)|~element(X3,the_carrier(X1))|~rel_str(X1))).
% 3.39/0.83 cnf(i_0_11, plain, (relstr_element_smaller(X1,X2,esk4_3(X1,X2,X3))|element(esk3_3(X1,X2,X3),the_carrier(X1))|ex_inf_of_relstr_set(X1,X2)|~relstr_element_smaller(X1,X2,X3)|~element(X3,the_carrier(X1))|~rel_str(X1))).
% 3.39/0.83 cnf(i_0_3, plain, (relstr_element_smaller(X1,X2,esk4_3(X1,X2,X3))|ex_inf_of_relstr_set(X1,X2)|~related(X1,esk3_3(X1,X2,X3),X3)|~relstr_element_smaller(X1,X2,X3)|~element(X3,the_carrier(X1))|~rel_str(X1))).
% 3.39/0.83 cnf(i_0_7, plain, (relstr_element_smaller(X1,X2,esk4_3(X1,X2,X3))|relstr_element_smaller(X1,X2,esk3_3(X1,X2,X3))|ex_inf_of_relstr_set(X1,X2)|~relstr_element_smaller(X1,X2,X3)|~element(X3,the_carrier(X1))|~rel_str(X1))).
% 3.39/0.83 cnf(i_0_10, plain, (related(X1,X2,esk4_3(X1,X3,X4))|element(esk3_3(X1,X3,X4),the_carrier(X1))|ex_inf_of_relstr_set(X1,X3)|~relstr_element_smaller(X1,X3,X4)|~relstr_element_smaller(X1,X3,X2)|~element(X4,the_carrier(X1))|~element(X2,the_carrier(X1))|~rel_str(X1))).
% 3.39/0.83 cnf(i_0_2, plain, (related(X1,X2,esk4_3(X1,X3,X4))|ex_inf_of_relstr_set(X1,X3)|~related(X1,esk3_3(X1,X3,X4),X4)|~relstr_element_smaller(X1,X3,X4)|~relstr_element_smaller(X1,X3,X2)|~element(X4,the_carrier(X1))|~element(X2,the_carrier(X1))|~rel_str(X1))).
% 3.39/0.83 cnf(i_0_6, plain, (related(X1,X2,esk4_3(X1,X3,X4))|relstr_element_smaller(X1,X3,esk3_3(X1,X3,X4))|ex_inf_of_relstr_set(X1,X3)|~relstr_element_smaller(X1,X3,X4)|~relstr_element_smaller(X1,X3,X2)|~element(X4,the_carrier(X1))|~element(X2,the_carrier(X1))|~rel_str(X1))).
% 3.39/0.83 cnf(i_0_193, plain, (X31=X31)).
% 3.39/0.83 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 3.39/0.83 # Begin printing tableau
% 3.39/0.83 # Found 5 steps
% 3.39/0.83 cnf(i_0_193, plain, (esk8_0=esk8_0), inference(start_rule)).
% 3.39/0.83 cnf(i_0_346, plain, (esk8_0=esk8_0), inference(extension_rule, [i_0_197])).
% 3.39/0.83 cnf(i_0_492, plain, (~rel_str(esk8_0)), inference(closure_rule, [i_0_32])).
% 3.39/0.83 cnf(i_0_490, plain, (rel_str(esk8_0)), inference(extension_rule, [i_0_19])).
% 3.39/0.83 cnf(i_0_493, plain, (one_sorted_str(esk8_0)), inference(etableau_closure_rule, [i_0_493, ...])).
% 3.39/0.83 # End printing tableau
% 3.39/0.83 # SZS output end
% 3.39/0.83 # Branches closed with saturation will be marked with an "s"
% 3.39/0.83 # Child (17189) has found a proof.
% 3.39/0.83
% 3.39/0.83 # Proof search is over...
% 3.39/0.83 # Freeing feature tree
%------------------------------------------------------------------------------