TSTP Solution File: SEU212+3 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SEU212+3 : 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 : n012.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:24:48 EDT 2022
% Result : Theorem 0.14s 0.42s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : SEU212+3 : TPTP v8.1.0. Released v3.2.0.
% 0.13/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.14/0.36 % Computer : n012.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Sun Jun 19 15:31:38 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.14/0.39 # No SInE strategy applied
% 0.14/0.39 # Auto-Mode selected heuristic G_E___301_C18_F1_URBAN_S5PRR_RG_S0Y
% 0.14/0.39 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.14/0.39 #
% 0.14/0.39 # Number of axioms: 55 Number of unprocessed: 55
% 0.14/0.39 # Tableaux proof search.
% 0.14/0.39 # APR header successfully linked.
% 0.14/0.39 # Hello from C++
% 0.14/0.40 # The folding up rule is enabled...
% 0.14/0.40 # Local unification is enabled...
% 0.14/0.40 # Any saturation attempts will use folding labels...
% 0.14/0.40 # 55 beginning clauses after preprocessing and clausification
% 0.14/0.40 # Creating start rules for all 5 conjectures.
% 0.14/0.40 # There are 5 start rule candidates:
% 0.14/0.40 # Found 27 unit axioms.
% 0.14/0.40 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.14/0.40 # 5 start rule tableaux created.
% 0.14/0.40 # 28 extension rule candidate clauses
% 0.14/0.40 # 27 unit axiom clauses
% 0.14/0.40
% 0.14/0.40 # Requested 8, 32 cores available to the main process.
% 0.14/0.40 # There are not enough tableaux to fork, creating more from the initial 5
% 0.14/0.40 # Returning from population with 19 new_tableaux and 0 remaining starting tableaux.
% 0.14/0.40 # We now have 19 tableaux to operate on
% 0.14/0.42 # There were 2 total branch saturation attempts.
% 0.14/0.42 # There were 0 of these attempts blocked.
% 0.14/0.42 # There were 0 deferred branch saturation attempts.
% 0.14/0.42 # There were 0 free duplicated saturations.
% 0.14/0.42 # There were 2 total successful branch saturations.
% 0.14/0.42 # There were 0 successful branch saturations in interreduction.
% 0.14/0.42 # There were 0 successful branch saturations on the branch.
% 0.14/0.42 # There were 2 successful branch saturations after the branch.
% 0.14/0.42 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.42 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.42 # Begin clausification derivation
% 0.14/0.42
% 0.14/0.42 # End clausification derivation
% 0.14/0.42 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.42 cnf(i_0_17, plain, (empty(empty_set))).
% 0.14/0.42 cnf(i_0_19, plain, (empty(empty_set))).
% 0.14/0.42 cnf(i_0_24, plain, (empty(empty_set))).
% 0.14/0.42 cnf(i_0_31, plain, (empty(esk6_0))).
% 0.14/0.42 cnf(i_0_34, plain, (empty(esk8_0))).
% 0.14/0.42 cnf(i_0_28, plain, (function(esk5_0))).
% 0.14/0.42 cnf(i_0_55, negated_conjecture, (function(esk15_0))).
% 0.14/0.42 cnf(i_0_16, plain, (relation(empty_set))).
% 0.14/0.42 cnf(i_0_23, plain, (relation(empty_set))).
% 0.14/0.42 cnf(i_0_29, plain, (relation(esk5_0))).
% 0.14/0.42 cnf(i_0_30, plain, (relation(esk6_0))).
% 0.14/0.42 cnf(i_0_35, plain, (relation(esk9_0))).
% 0.14/0.42 cnf(i_0_41, plain, (relation(esk12_0))).
% 0.14/0.42 cnf(i_0_56, negated_conjecture, (relation(esk15_0))).
% 0.14/0.42 cnf(i_0_15, plain, (relation_empty_yielding(empty_set))).
% 0.14/0.42 cnf(i_0_40, plain, (relation_empty_yielding(esk12_0))).
% 0.14/0.42 cnf(i_0_36, plain, (~empty(esk9_0))).
% 0.14/0.42 cnf(i_0_39, plain, (~empty(esk11_0))).
% 0.14/0.42 cnf(i_0_49, plain, (X1=empty_set|~empty(X1))).
% 0.14/0.42 cnf(i_0_37, plain, (empty(esk10_1(X1)))).
% 0.14/0.42 cnf(i_0_2, plain, (function(X1)|~empty(X1))).
% 0.14/0.42 cnf(i_0_3, plain, (relation(X1)|~empty(X1))).
% 0.14/0.42 cnf(i_0_42, plain, (subset(X1,X1))).
% 0.14/0.42 cnf(i_0_51, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 0.14/0.42 cnf(i_0_21, plain, (~empty(singleton(X1)))).
% 0.14/0.42 cnf(i_0_18, plain, (~empty(powerset(X1)))).
% 0.14/0.42 cnf(i_0_27, plain, (empty(relation_dom(X1))|~empty(X1))).
% 0.14/0.42 cnf(i_0_26, plain, (relation(relation_dom(X1))|~empty(X1))).
% 0.14/0.42 cnf(i_0_14, plain, (element(esk4_1(X1),X1))).
% 0.14/0.42 cnf(i_0_32, plain, (empty(X1)|~empty(esk7_1(X1)))).
% 0.14/0.42 cnf(i_0_38, plain, (element(esk10_1(X1),powerset(X1)))).
% 0.14/0.42 cnf(i_0_4, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))).
% 0.14/0.42 cnf(i_0_25, plain, (empty(X1)|~relation(X1)|~empty(relation_dom(X1)))).
% 0.14/0.42 cnf(i_0_50, plain, (~empty(X2)|~in(X1,X2))).
% 0.14/0.42 cnf(i_0_33, plain, (empty(X1)|element(esk7_1(X1),powerset(X1)))).
% 0.14/0.42 cnf(i_0_43, plain, (element(X1,X2)|~in(X1,X2))).
% 0.14/0.42 cnf(i_0_44, plain, (empty(X2)|in(X1,X2)|~element(X1,X2))).
% 0.14/0.42 cnf(i_0_45, plain, (element(X1,powerset(X2))|~subset(X1,X2))).
% 0.14/0.42 cnf(i_0_1, plain, (~in(X2,X1)|~in(X1,X2))).
% 0.14/0.42 cnf(i_0_46, plain, (subset(X1,X2)|~element(X1,powerset(X2)))).
% 0.14/0.42 cnf(i_0_22, plain, (~empty(unordered_pair(X1,X2)))).
% 0.14/0.42 cnf(i_0_5, plain, (X1=apply(X2,X3)|in(X3,relation_dom(X2))|X1!=empty_set|~function(X2)|~relation(X2))).
% 0.14/0.42 cnf(i_0_6, plain, (X1=empty_set|in(X3,relation_dom(X2))|X1!=apply(X2,X3)|~function(X2)|~relation(X2))).
% 0.14/0.42 cnf(i_0_48, plain, (~empty(X3)|~in(X1,X2)|~element(X2,powerset(X3)))).
% 0.14/0.42 cnf(i_0_47, plain, (element(X1,X3)|~in(X1,X2)|~element(X2,powerset(X3)))).
% 0.14/0.42 cnf(i_0_52, negated_conjecture, (apply(esk15_0,esk13_0)=esk14_0|in(unordered_pair(unordered_pair(esk13_0,esk14_0),singleton(esk13_0)),esk15_0))).
% 0.14/0.42 cnf(i_0_53, negated_conjecture, (in(esk13_0,relation_dom(esk15_0))|in(unordered_pair(unordered_pair(esk13_0,esk14_0),singleton(esk13_0)),esk15_0))).
% 0.14/0.42 cnf(i_0_20, plain, (~empty(unordered_pair(unordered_pair(X1,X2),singleton(X1))))).
% 0.14/0.42 cnf(i_0_8, plain, (in(unordered_pair(unordered_pair(X3,X1),singleton(X3)),X2)|X1!=apply(X2,X3)|~function(X2)|~relation(X2)|~in(X3,relation_dom(X2)))).
% 0.14/0.42 cnf(i_0_54, negated_conjecture, (apply(esk15_0,esk13_0)!=esk14_0|~in(esk13_0,relation_dom(esk15_0))|~in(unordered_pair(unordered_pair(esk13_0,esk14_0),singleton(esk13_0)),esk15_0))).
% 0.14/0.42 cnf(i_0_11, plain, (in(X1,X4)|X4!=relation_dom(X3)|~relation(X3)|~in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3))).
% 0.14/0.42 cnf(i_0_7, plain, (X2=apply(X3,X1)|~function(X3)|~relation(X3)|~in(X1,relation_dom(X3))|~in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3))).
% 0.14/0.42 cnf(i_0_9, plain, (X2=relation_dom(X1)|in(esk2_2(X1,X2),X2)|in(unordered_pair(unordered_pair(esk2_2(X1,X2),esk3_2(X1,X2)),singleton(esk2_2(X1,X2))),X1)|~relation(X1))).
% 0.14/0.42 cnf(i_0_10, plain, (X2=relation_dom(X1)|~relation(X1)|~in(esk2_2(X1,X2),X2)|~in(unordered_pair(unordered_pair(esk2_2(X1,X2),X3),singleton(esk2_2(X1,X2))),X1))).
% 0.14/0.42 cnf(i_0_12, plain, (in(unordered_pair(unordered_pair(X1,esk1_3(X3,X2,X1)),singleton(X1)),X3)|X2!=relation_dom(X3)|~relation(X3)|~in(X1,X2))).
% 0.14/0.42 # E# There were 3 total branch saturation attempts.
% 0.14/0.42 # There were 0 of these attempts blocked.
% 0.14/0.42 # There were 0 deferred branch saturation attempts.
% 0.14/0.42 # There were 0 free duplicated saturations.
% 0.14/0.42 # There were 3 total successful branch saturations.
% 0.14/0.42 # There were 0 successful branch saturations in interreduction.
% 0.14/0.42 # There were 0 successful branch saturations on the branch.
% 0.14/0.42 # There were 3 successful branch saturations after the branch.
% 0.14/0.42 nd listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.42 # Begin printing tableau
% 0.14/0.42 # Found 5 steps
% 0.14/0.42 cnf(i_0_56, negated_conjecture, (relation(esk15_0)), inference(start_rule)).
% 0.14/0.42 cnf(i_0_64, plain, (relation(esk15_0)), inference(extension_rule, [i_0_25])).
% 0.14/0.42 cnf(i_0_409, plain, (empty(esk15_0)), inference(extension_rule, [i_0_49])).
% 0.14/0.42 cnf(i_0_411, plain, (~empty(relation_dom(esk15_0))), inference(etableau_closure_rule, [i_0_411, ...])).
% 0.14/0.42 cnf(i_0_412, plain, (esk15_0=empty_set), inference(etableau_closure_rule, [i_0_412, ...])).
% 0.14/0.42 # End printing tableau
% 0.14/0.42 # SZS output end
% 0.14/0.42 # Branches closed with saturation will be marked with an "s"
% 0.14/0.42 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.42 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.42 # Begin clausification derivation
% 0.14/0.42
% 0.14/0.42 # End clausification derivation
% 0.14/0.42 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.42 cnf(i_0_17, plain, (empty(empty_set))).
% 0.14/0.42 cnf(i_0_19, plain, (empty(empty_set))).
% 0.14/0.42 cnf(i_0_24, plain, (empty(empty_set))).
% 0.14/0.42 cnf(i_0_31, plain, (empty(esk6_0))).
% 0.14/0.42 cnf(i_0_34, plain, (empty(esk8_0))).
% 0.14/0.42 cnf(i_0_28, plain, (function(esk5_0))).
% 0.14/0.42 cnf(i_0_55, negated_conjecture, (function(esk15_0))).
% 0.14/0.42 cnf(i_0_16, plain, (relation(empty_set))).
% 0.14/0.42 cnf(i_0_23, plain, (relation(empty_set))).
% 0.14/0.42 cnf(i_0_29, plain, (relation(esk5_0))).
% 0.14/0.42 cnf(i_0_30, plain, (relation(esk6_0))).
% 0.14/0.42 cnf(i_0_35, plain, (relation(esk9_0))).
% 0.14/0.42 cnf(i_0_41, plain, (relation(esk12_0))).
% 0.14/0.42 cnf(i_0_56, negated_conjecture, (relation(esk15_0))).
% 0.14/0.42 cnf(i_0_15, plain, (relation_empty_yielding(empty_set))).
% 0.14/0.42 cnf(i_0_40, plain, (relation_empty_yielding(esk12_0))).
% 0.14/0.42 cnf(i_0_36, plain, (~empty(esk9_0))).
% 0.14/0.42 cnf(i_0_39, plain, (~empty(esk11_0))).
% 0.14/0.42 cnf(i_0_49, plain, (X1=empty_set|~empty(X1))).
% 0.14/0.42 cnf(i_0_37, plain, (empty(esk10_1(X1)))).
% 0.14/0.42 cnf(i_0_2, plain, (function(X1)|~empty(X1))).
% 0.14/0.42 cnf(i_0_3, plain, (relation(X1)|~empty(X1))).
% 0.14/0.42 cnf(i_0_42, plain, (subset(X1,X1))).
% 0.14/0.42 cnf(i_0_51, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 0.14/0.42 cnf(i_0_21, plain, (~empty(singleton(X1)))).
% 0.14/0.42 cnf(i_0_18, plain, (~empty(powerset(X1)))).
% 0.14/0.42 cnf(i_0_27, plain, (empty(relation_dom(X1))|~empty(X1))).
% 0.14/0.42 cnf(i_0_26, plain, (relation(relation_dom(X1))|~empty(X1))).
% 0.14/0.42 cnf(i_0_14, plain, (element(esk4_1(X1),X1))).
% 0.14/0.42 cnf(i_0_32, plain, (empty(X1)|~empty(esk7_1(X1)))).
% 0.14/0.42 cnf(i_0_38, plain, (element(esk10_1(X1),powerset(X1)))).
% 0.14/0.42 cnf(i_0_4, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))).
% 0.14/0.42 cnf(i_0_25, plain, (empty(X1)|~relation(X1)|~empty(relation_dom(X1)))).
% 0.14/0.42 cnf(i_0_50, plain, (~empty(X2)|~in(X1,X2))).
% 0.14/0.42 cnf(i_0_33, plain, (empty(X1)|element(esk7_1(X1),powerset(X1)))).
% 0.14/0.42 cnf(i_0_43, plain, (element(X1,X2)|~in(X1,X2))).
% 0.14/0.42 cnf(i_0_44, plain, (empty(X2)|in(X1,X2)|~element(X1,X2))).
% 0.14/0.42 cnf(i_0_45, plain, (element(X1,powerset(X2))|~subset(X1,X2))).
% 0.14/0.42 cnf(i_0_1, plain, (~in(X2,X1)|~in(X1,X2))).
% 0.14/0.42 cnf(i_0_46, plain, (subset(X1,X2)|~element(X1,powerset(X2)))).
% 0.14/0.42 cnf(i_0_22, plain, (~empty(unordered_pair(X1,X2)))).
% 0.14/0.42 cnf(i_0_5, plain, (X1=apply(X2,X3)|in(X3,relation_dom(X2))|X1!=empty_set|~function(X2)|~relation(X2))).
% 0.14/0.42 cnf(i_0_6, plain, (X1=empty_set|in(X3,relation_dom(X2))|X1!=apply(X2,X3)|~function(X2)|~relation(X2))).
% 0.14/0.42 cnf(i_0_48, plain, (~empty(X3)|~in(X1,X2)|~element(X2,powerset(X3)))).
% 0.14/0.42 cnf(i_0_47, plain, (element(X1,X3)|~in(X1,X2)|~element(X2,powerset(X3)))).
% 0.14/0.42 cnf(i_0_52, negated_conjecture, (apply(esk15_0,esk13_0)=esk14_0|in(unordered_pair(unordered_pair(esk13_0,esk14_0),singleton(esk13_0)),esk15_0))).
% 0.14/0.42 cnf(i_0_53, negated_conjecture, (in(esk13_0,relation_dom(esk15_0))|in(unordered_pair(unordered_pair(esk13_0,esk14_0),singleton(esk13_0)),esk15_0))).
% 0.14/0.42 cnf(i_0_20, plain, (~empty(unordered_pair(unordered_pair(X1,X2),singleton(X1))))).
% 0.14/0.42 cnf(i_0_8, plain, (in(unordered_pair(unordered_pair(X3,X1),singleton(X3)),X2)|X1!=apply(X2,X3)|~function(X2)|~relation(X2)|~in(X3,relation_dom(X2)))).
% 0.14/0.42 cnf(i_0_54, negated_conjecture, (apply(esk15_0,esk13_0)!=esk14_0|~in(esk13_0,relation_dom(esk15_0))|~in(unordered_pair(unordered_pair(esk13_0,esk14_0),singleton(esk13_0)),esk15_0))).
% 0.14/0.42 cnf(i_0_11, plain, (in(X1,X4)|X4!=relation_dom(X3)|~relation(X3)|~in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3))).
% 0.14/0.42 cnf(i_0_7, plain, (X2=apply(X3,X1)|~function(X3)|~relation(X3)|~in(X1,relation_dom(X3))|~in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3))).
% 0.14/0.42 cnf(i_0_9, plain, (X2=relation_dom(X1)|in(esk2_2(X1,X2),X2)|in(unordered_pair(unordered_pair(esk2_2(X1,X2),esk3_2(X1,X2)),singleton(esk2_2(X1,X2))),X1)|~relation(X1))).
% 0.14/0.42 cnf(i_0_10, plain, (X2=relation_dom(X1)|~relation(X1)|~in(esk2_2(X1,X2),X2)|~in(unordered_pair(unordered_pair(esk2_2(X1,X2),X3),singleton(esk2_2(X1,X2))),X1))).
% 0.14/0.42 cnf(i_0_12, plain, (in(unordered_pair(unordered_pair(X1,esk1_3(X3,X2,X1)),singleton(X1)),X3)|X2!=relation_dom(X3)|~relation(X3)|~in(X1,X2))).
% 0.14/0.42 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.42 # Begin printing tableau
% 0.14/0.42 # Found 9 steps
% 0.14/0.42 cnf(i_0_53, negated_conjecture, (in(esk13_0,relation_dom(esk15_0))|in(unordered_pair(unordered_pair(esk13_0,esk14_0),singleton(esk13_0)),esk15_0)), inference(start_rule)).
% 0.14/0.42 cnf(i_0_60, plain, (in(esk13_0,relation_dom(esk15_0))), inference(extension_rule, [i_0_12])).
% 0.14/0.42 cnf(i_0_385, plain, (~relation(empty_set)), inference(closure_rule, [i_0_16])).
% 0.14/0.42 cnf(i_0_383, plain, (in(unordered_pair(unordered_pair(esk13_0,esk1_3(empty_set,relation_dom(esk15_0),esk13_0)),singleton(esk13_0)),empty_set)), inference(extension_rule, [i_0_50])).
% 0.14/0.42 cnf(i_0_412, plain, (~empty(empty_set)), inference(closure_rule, [i_0_17])).
% 0.14/0.42 cnf(i_0_384, plain, (relation_dom(esk15_0)!=relation_dom(empty_set)), inference(extension_rule, [i_0_51])).
% 0.14/0.42 cnf(i_0_61, plain, (in(unordered_pair(unordered_pair(esk13_0,esk14_0),singleton(esk13_0)),esk15_0)), inference(etableau_closure_rule, [i_0_61, ...])).
% 0.14/0.42 cnf(i_0_421, plain, (~empty(relation_dom(empty_set))), inference(etableau_closure_rule, [i_0_421, ...])).
% 0.14/0.42 cnf(i_0_422, plain, (~empty(relation_dom(esk15_0))), inference(etableau_closure_rule, [i_0_422, ...])).
% 0.14/0.42 # End printing tableau
% 0.14/0.42 # SZS output end
% 0.14/0.42 # Branches closed with saturation will be marked with an "s"
% 0.14/0.42 # Child (23749) has found a proof.
% 0.14/0.42
% 0.14/0.42 # Proof search is over...
% 0.14/0.42 # Freeing feature tree
%------------------------------------------------------------------------------