TSTP Solution File: NUM390+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : NUM390+1 : TPTP v8.1.0. Released v3.2.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 : n013.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 : Mon Jul 18 09:40:39 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.07/0.12 % Problem : NUM390+1 : TPTP v8.1.0. Released v3.2.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.13/0.35 % Computer : n013.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 : Wed Jul 6 07:04:59 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.38 # No SInE strategy applied
% 0.13/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.38 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.13/0.38 #
% 0.13/0.38 # Presaturation interreduction done
% 0.13/0.38 # Number of axioms: 66 Number of unprocessed: 62
% 0.13/0.38 # Tableaux proof search.
% 0.13/0.38 # APR header successfully linked.
% 0.13/0.38 # Hello from C++
% 0.13/0.38 # The folding up rule is enabled...
% 0.13/0.38 # Local unification is enabled...
% 0.13/0.38 # Any saturation attempts will use folding labels...
% 0.13/0.38 # 62 beginning clauses after preprocessing and clausification
% 0.13/0.38 # Creating start rules for all 6 conjectures.
% 0.13/0.38 # There are 6 start rule candidates:
% 0.13/0.38 # Found 37 unit axioms.
% 0.13/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.38 # 6 start rule tableaux created.
% 0.13/0.38 # 25 extension rule candidate clauses
% 0.13/0.38 # 37 unit axiom clauses
% 0.13/0.38
% 0.13/0.38 # Requested 8, 32 cores available to the main process.
% 0.13/0.38 # There are not enough tableaux to fork, creating more from the initial 6
% 0.13/0.38 # Returning from population with 18 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.38 # We now have 18 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/sandbox/benchmark/theBenchmark.p
% 0.13/0.39 # SZS output start for /export/starexec/sandbox/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_58, negated_conjecture, (ordinal(esk15_0))).
% 0.13/0.39 cnf(i_0_57, negated_conjecture, (ordinal(esk16_0))).
% 0.13/0.39 cnf(i_0_59, negated_conjecture, (epsilon_transitive(esk14_0))).
% 0.13/0.39 cnf(i_0_55, negated_conjecture, (in(esk15_0,esk16_0))).
% 0.13/0.39 cnf(i_0_20, plain, (empty(empty_set))).
% 0.13/0.39 cnf(i_0_27, plain, (ordinal(esk4_0))).
% 0.13/0.39 cnf(i_0_29, plain, (epsilon_transitive(esk4_0))).
% 0.13/0.39 cnf(i_0_56, negated_conjecture, (subset(esk14_0,esk15_0))).
% 0.13/0.39 cnf(i_0_31, plain, (empty(esk5_0))).
% 0.13/0.39 cnf(i_0_32, plain, (empty(esk6_0))).
% 0.13/0.39 cnf(i_0_34, plain, (empty(esk7_0))).
% 0.13/0.39 cnf(i_0_25, plain, (function(esk3_0))).
% 0.13/0.39 cnf(i_0_33, plain, (function(esk7_0))).
% 0.13/0.39 cnf(i_0_40, plain, (function(esk10_0))).
% 0.13/0.39 cnf(i_0_44, plain, (function(esk12_0))).
% 0.13/0.39 cnf(i_0_47, plain, (function(esk13_0))).
% 0.13/0.39 cnf(i_0_28, plain, (epsilon_connected(esk4_0))).
% 0.13/0.39 cnf(i_0_19, plain, (relation(empty_set))).
% 0.13/0.39 cnf(i_0_26, plain, (relation(esk3_0))).
% 0.13/0.39 cnf(i_0_30, plain, (relation(esk5_0))).
% 0.13/0.39 cnf(i_0_35, plain, (relation(esk7_0))).
% 0.13/0.39 cnf(i_0_36, plain, (relation(esk8_0))).
% 0.13/0.39 cnf(i_0_41, plain, (relation(esk10_0))).
% 0.13/0.39 cnf(i_0_43, plain, (relation(esk11_0))).
% 0.13/0.39 cnf(i_0_46, plain, (relation(esk12_0))).
% 0.13/0.39 cnf(i_0_49, plain, (relation(esk13_0))).
% 0.13/0.39 cnf(i_0_39, plain, (one_to_one(esk10_0))).
% 0.13/0.39 cnf(i_0_18, plain, (relation_empty_yielding(empty_set))).
% 0.13/0.39 cnf(i_0_42, plain, (relation_empty_yielding(esk11_0))).
% 0.13/0.39 cnf(i_0_45, plain, (relation_empty_yielding(esk12_0))).
% 0.13/0.39 cnf(i_0_48, plain, (relation_non_empty(esk13_0))).
% 0.13/0.39 cnf(i_0_50, plain, (subset(X1,X1))).
% 0.13/0.39 cnf(i_0_17, plain, (element(esk2_1(X1),X1))).
% 0.13/0.39 cnf(i_0_54, negated_conjecture, (~in(esk14_0,esk16_0))).
% 0.13/0.39 cnf(i_0_37, plain, (~empty(esk8_0))).
% 0.13/0.39 cnf(i_0_38, plain, (~empty(esk9_0))).
% 0.13/0.39 cnf(i_0_24, plain, (~proper_subset(X1,X1))).
% 0.13/0.39 cnf(i_0_66, plain, (~empty(X1)|~in(X2,X1))).
% 0.13/0.39 cnf(i_0_5, plain, (epsilon_transitive(X1)|~ordinal(X1))).
% 0.13/0.39 cnf(i_0_67, plain, (~subset(X1,X2)|~in(X2,X1))).
% 0.13/0.39 cnf(i_0_3, plain, (function(X1)|~empty(X1))).
% 0.13/0.39 cnf(i_0_4, plain, (epsilon_connected(X1)|~ordinal(X1))).
% 0.13/0.39 cnf(i_0_10, plain, (ordinal(X1)|~epsilon_connected(X1)|~epsilon_transitive(X1))).
% 0.13/0.39 cnf(i_0_65, plain, (X1=empty_set|~empty(X1))).
% 0.13/0.39 cnf(i_0_11, plain, (epsilon_transitive(X1)|~subset(esk1_1(X1),X1))).
% 0.13/0.39 cnf(i_0_6, plain, (relation(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_2, plain, (~proper_subset(X1,X2)|~proper_subset(X2,X1))).
% 0.13/0.39 cnf(i_0_16, plain, (subset(X1,X2)|~proper_subset(X1,X2))).
% 0.13/0.39 cnf(i_0_51, plain, (element(X1,X2)|~in(X1,X2))).
% 0.13/0.39 cnf(i_0_12, plain, (epsilon_transitive(X1)|in(esk1_1(X1),X1))).
% 0.13/0.39 cnf(i_0_13, plain, (subset(X1,X2)|~epsilon_transitive(X2)|~in(X1,X2))).
% 0.13/0.39 cnf(i_0_62, plain, (subset(X1,X2)|~element(X1,powerset(X2)))).
% 0.13/0.39 cnf(i_0_53, plain, (in(X1,X2)|~epsilon_transitive(X1)|~ordinal(X2)|~proper_subset(X1,X2))).
% 0.13/0.39 cnf(i_0_68, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 0.13/0.39 cnf(i_0_7, plain, (one_to_one(X1)|~empty(X1))).
% 0.13/0.39 cnf(i_0_61, plain, (element(X1,powerset(X2))|~subset(X1,X2))).
% 0.13/0.39 cnf(i_0_64, plain, (~element(X1,powerset(X2))|~empty(X2)|~in(X3,X1))).
% 0.13/0.39 cnf(i_0_60, plain, (empty(X1)|in(X2,X1)|~element(X2,X1))).
% 0.13/0.39 cnf(i_0_14, plain, (X1=X2|proper_subset(X1,X2)|~subset(X1,X2))).
% 0.13/0.39 cnf(i_0_52, plain, (subset(X1,X2)|~subset(X3,X2)|~subset(X1,X3))).
% 0.13/0.39 cnf(i_0_63, plain, (element(X1,X2)|~element(X3,powerset(X2))|~in(X1,X3))).
% 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_55, negated_conjecture, (in(esk15_0,esk16_0)), inference(start_rule)).
% 0.13/0.39 cnf(i_0_72, plain, (in(esk15_0,esk16_0)), inference(extension_rule, [i_0_64])).
% 0.13/0.39 cnf(i_0_242, plain, (~empty(empty_set)), inference(closure_rule, [i_0_20])).
% 0.13/0.39 cnf(i_0_241, plain, (~element(esk16_0,powerset(empty_set))), inference(extension_rule, [i_0_51])).
% 0.13/0.39 cnf(i_0_282, plain, (~in(esk16_0,powerset(empty_set))), inference(etableau_closure_rule, [i_0_282, ...])).
% 0.13/0.39 # End printing tableau
% 0.13/0.39 # SZS output end
% 0.13/0.39 # Branches cl# 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 osed with saturation will be marked with an "s"
% 0.13/0.39 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.39 # SZS output start for /export/starexec/sandbox/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_58, negated_conjecture, (ordinal(esk15_0))).
% 0.13/0.39 cnf(i_0_57, negated_conjecture, (ordinal(esk16_0))).
% 0.13/0.39 cnf(i_0_59, negated_conjecture, (epsilon_transitive(esk14_0))).
% 0.13/0.39 cnf(i_0_55, negated_conjecture, (in(esk15_0,esk16_0))).
% 0.13/0.39 cnf(i_0_20, plain, (empty(empty_set))).
% 0.13/0.39 cnf(i_0_27, plain, (ordinal(esk4_0))).
% 0.13/0.39 cnf(i_0_29, plain, (epsilon_transitive(esk4_0))).
% 0.13/0.39 cnf(i_0_56, negated_conjecture, (subset(esk14_0,esk15_0))).
% 0.13/0.39 cnf(i_0_31, plain, (empty(esk5_0))).
% 0.13/0.39 cnf(i_0_32, plain, (empty(esk6_0))).
% 0.13/0.39 cnf(i_0_34, plain, (empty(esk7_0))).
% 0.13/0.39 cnf(i_0_25, plain, (function(esk3_0))).
% 0.13/0.39 cnf(i_0_33, plain, (function(esk7_0))).
% 0.13/0.39 cnf(i_0_40, plain, (function(esk10_0))).
% 0.13/0.39 cnf(i_0_44, plain, (function(esk12_0))).
% 0.13/0.39 cnf(i_0_47, plain, (function(esk13_0))).
% 0.13/0.39 cnf(i_0_28, plain, (epsilon_connected(esk4_0))).
% 0.13/0.39 cnf(i_0_19, plain, (relation(empty_set))).
% 0.13/0.39 cnf(i_0_26, plain, (relation(esk3_0))).
% 0.13/0.39 cnf(i_0_30, plain, (relation(esk5_0))).
% 0.13/0.39 cnf(i_0_35, plain, (relation(esk7_0))).
% 0.13/0.39 cnf(i_0_36, plain, (relation(esk8_0))).
% 0.13/0.39 cnf(i_0_41, plain, (relation(esk10_0))).
% 0.13/0.39 cnf(i_0_43, plain, (relation(esk11_0))).
% 0.13/0.39 cnf(i_0_46, plain, (relation(esk12_0))).
% 0.13/0.39 cnf(i_0_49, plain, (relation(esk13_0))).
% 0.13/0.39 cnf(i_0_39, plain, (one_to_one(esk10_0))).
% 0.13/0.39 cnf(i_0_18, plain, (relation_empty_yielding(empty_set))).
% 0.13/0.39 cnf(i_0_42, plain, (relation_empty_yielding(esk11_0))).
% 0.13/0.39 cnf(i_0_45, plain, (relation_empty_yielding(esk12_0))).
% 0.13/0.39 cnf(i_0_48, plain, (relation_non_empty(esk13_0))).
% 0.13/0.39 cnf(i_0_50, plain, (subset(X1,X1))).
% 0.13/0.39 cnf(i_0_17, plain, (element(esk2_1(X1),X1))).
% 0.13/0.39 cnf(i_0_54, negated_conjecture, (~in(esk14_0,esk16_0))).
% 0.13/0.39 cnf(i_0_37, plain, (~empty(esk8_0))).
% 0.13/0.39 cnf(i_0_38, plain, (~empty(esk9_0))).
% 0.13/0.39 cnf(i_0_24, plain, (~proper_subset(X1,X1))).
% 0.13/0.39 cnf(i_0_66, plain, (~empty(X1)|~in(X2,X1))).
% 0.13/0.39 cnf(i_0_5, plain, (epsilon_transitive(X1)|~ordinal(X1))).
% 0.13/0.39 cnf(i_0_67, plain, (~subset(X1,X2)|~in(X2,X1))).
% 0.13/0.39 cnf(i_0_3, plain, (function(X1)|~empty(X1))).
% 0.13/0.39 cnf(i_0_4, plain, (epsilon_connected(X1)|~ordinal(X1))).
% 0.13/0.39 cnf(i_0_10, plain, (ordinal(X1)|~epsilon_connected(X1)|~epsilon_transitive(X1))).
% 0.13/0.39 cnf(i_0_65, plain, (X1=empty_set|~empty(X1))).
% 0.13/0.39 cnf(i_0_11, plain, (epsilon_transitive(X1)|~subset(esk1_1(X1),X1))).
% 0.13/0.39 cnf(i_0_6, plain, (relation(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_2, plain, (~proper_subset(X1,X2)|~proper_subset(X2,X1))).
% 0.13/0.39 cnf(i_0_16, plain, (subset(X1,X2)|~proper_subset(X1,X2))).
% 0.13/0.39 cnf(i_0_51, plain, (element(X1,X2)|~in(X1,X2))).
% 0.13/0.39 cnf(i_0_12, plain, (epsilon_transitive(X1)|in(esk1_1(X1),X1))).
% 0.13/0.39 cnf(i_0_13, plain, (subset(X1,X2)|~epsilon_transitive(X2)|~in(X1,X2))).
% 0.13/0.39 cnf(i_0_62, plain, (subset(X1,X2)|~element(X1,powerset(X2)))).
% 0.13/0.39 cnf(i_0_53, plain, (in(X1,X2)|~epsilon_transitive(X1)|~ordinal(X2)|~proper_subset(X1,X2))).
% 0.13/0.39 cnf(i_0_68, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 0.13/0.39 cnf(i_0_7, plain, (one_to_one(X1)|~empty(X1))).
% 0.13/0.39 cnf(i_0_61, plain, (element(X1,powerset(X2))|~subset(X1,X2))).
% 0.13/0.39 cnf(i_0_64, plain, (~element(X1,powerset(X2))|~empty(X2)|~in(X3,X1))).
% 0.13/0.39 cnf(i_0_60, plain, (empty(X1)|in(X2,X1)|~element(X2,X1))).
% 0.13/0.39 cnf(i_0_14, plain, (X1=X2|proper_subset(X1,X2)|~subset(X1,X2))).
% 0.13/0.39 cnf(i_0_52, plain, (subset(X1,X2)|~subset(X3,X2)|~subset(X1,X3))).
% 0.13/0.39 cnf(i_0_63, plain, (element(X1,X2)|~element(X3,powerset(X2))|~in(X1,X3))).
% 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_57, negated_conjecture, (ordinal(esk16_0)), inference(start_rule)).
% 0.13/0.39 cnf(i_0_74, plain, (ordinal(esk16_0)), inference(extension_rule, [i_0_5])).
% 0.13/0.39 cnf(i_0_258, plain, (epsilon_transitive(esk16_0)), inference(extension_rule, [i_0_13])).
% 0.13/0.39 cnf(i_0_289, plain, (~in(esk15_0,esk16_0)), inference(closure_rule, [i_0_55])).
% 0.13/0.39 cnf(i_0_287, plain, (subset(esk15_0,esk16_0)), inference(etableau_closure_rule, [i_0_287, ...])).
% 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.39 # Child (14367) has found a proof.
% 0.13/0.39
% 0.13/0.39 # Proof search is over...
% 0.13/0.39 # Freeing feature tree
%------------------------------------------------------------------------------