TSTP Solution File: SEU213+3 by Etableau---0.67

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : SEU213+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 : n007.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:49 EDT 2022

% Result   : Theorem 27.18s 3.87s
% Output   : CNFRefutation 27.18s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : SEU213+3 : TPTP v8.1.0. Released v3.2.0.
% 0.12/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 : n007.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 05:00:29 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___301_C18_F1_URBAN_S5PRR_RG_S0Y
% 0.12/0.38  # and selection function SelectMaxLComplexAvoidPosPred.
% 0.12/0.38  #
% 0.12/0.38  # Number of axioms: 70 Number of unprocessed: 70
% 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  # 70 beginning clauses after preprocessing and clausification
% 0.12/0.38  # Creating start rules for all 7 conjectures.
% 0.12/0.38  # There are 7 start rule candidates:
% 0.12/0.38  # Found 29 unit axioms.
% 0.12/0.38  # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.38  # 7 start rule tableaux created.
% 0.12/0.38  # 41 extension rule candidate clauses
% 0.12/0.38  # 29 unit axiom clauses
% 0.12/0.38  
% 0.12/0.38  # Requested 8, 32 cores available to the main process.
% 0.12/0.38  # There are not enough tableaux to fork, creating more from the initial 7
% 0.12/0.38  # Returning from population with 14 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.38  # We now have 14 tableaux to operate on
% 27.18/3.87  # There were 2 total branch saturation attempts.
% 27.18/3.87  # There were 0 of these attempts blocked.
% 27.18/3.87  # There were 0 deferred branch saturation attempts.
% 27.18/3.87  # There were 0 free duplicated saturations.
% 27.18/3.87  # There were 2 total successful branch saturations.
% 27.18/3.87  # There were 0 successful branch saturations in interreduction.
% 27.18/3.87  # There were 0 successful branch saturations on the branch.
% 27.18/3.87  # There were 2 successful branch saturations after the branch.
% 27.18/3.87  # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 27.18/3.87  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 27.18/3.87  # Begin clausification derivation
% 27.18/3.87  
% 27.18/3.87  # End clausification derivation
% 27.18/3.87  # Begin listing active clauses obtained from FOF to CNF conversion
% 27.18/3.87  cnf(i_0_26, plain, (empty(empty_set))).
% 27.18/3.87  cnf(i_0_30, plain, (empty(empty_set))).
% 27.18/3.87  cnf(i_0_35, plain, (empty(empty_set))).
% 27.18/3.87  cnf(i_0_44, plain, (empty(esk10_0))).
% 27.18/3.87  cnf(i_0_47, plain, (empty(esk12_0))).
% 27.18/3.87  cnf(i_0_41, plain, (function(esk9_0))).
% 27.18/3.87  cnf(i_0_62, negated_conjecture, (function(esk18_0))).
% 27.18/3.87  cnf(i_0_60, negated_conjecture, (function(esk19_0))).
% 27.18/3.87  cnf(i_0_25, plain, (relation(empty_set))).
% 27.18/3.87  cnf(i_0_34, plain, (relation(empty_set))).
% 27.18/3.87  cnf(i_0_42, plain, (relation(esk9_0))).
% 27.18/3.87  cnf(i_0_43, plain, (relation(esk10_0))).
% 27.18/3.87  cnf(i_0_48, plain, (relation(esk13_0))).
% 27.18/3.87  cnf(i_0_54, plain, (relation(esk16_0))).
% 27.18/3.87  cnf(i_0_63, negated_conjecture, (relation(esk18_0))).
% 27.18/3.87  cnf(i_0_61, negated_conjecture, (relation(esk19_0))).
% 27.18/3.87  cnf(i_0_24, plain, (relation_empty_yielding(empty_set))).
% 27.18/3.87  cnf(i_0_53, plain, (relation_empty_yielding(esk16_0))).
% 27.18/3.87  cnf(i_0_49, plain, (~empty(esk13_0))).
% 27.18/3.87  cnf(i_0_52, plain, (~empty(esk15_0))).
% 27.18/3.87  cnf(i_0_69, plain, (X1=empty_set|~empty(X1))).
% 27.18/3.87  cnf(i_0_50, plain, (empty(esk14_1(X1)))).
% 27.18/3.87  cnf(i_0_2, plain, (function(X1)|~empty(X1))).
% 27.18/3.87  cnf(i_0_3, plain, (relation(X1)|~empty(X1))).
% 27.18/3.87  cnf(i_0_55, plain, (subset(X1,X1))).
% 27.18/3.87  cnf(i_0_71, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 27.18/3.87  cnf(i_0_32, plain, (~empty(singleton(X1)))).
% 27.18/3.87  cnf(i_0_29, plain, (~empty(powerset(X1)))).
% 27.18/3.87  cnf(i_0_38, plain, (empty(relation_dom(X1))|~empty(X1))).
% 27.18/3.87  cnf(i_0_37, plain, (relation(relation_dom(X1))|~empty(X1))).
% 27.18/3.87  cnf(i_0_21, plain, (element(esk8_1(X1),X1))).
% 27.18/3.87  cnf(i_0_45, plain, (empty(X1)|~empty(esk11_1(X1)))).
% 27.18/3.87  cnf(i_0_51, plain, (element(esk14_1(X1),powerset(X1)))).
% 27.18/3.87  cnf(i_0_4, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))).
% 27.18/3.87  cnf(i_0_36, plain, (empty(X1)|~relation(X1)|~empty(relation_dom(X1)))).
% 27.18/3.87  cnf(i_0_70, plain, (~empty(X2)|~in(X1,X2))).
% 27.18/3.87  cnf(i_0_46, plain, (empty(X1)|element(esk11_1(X1),powerset(X1)))).
% 27.18/3.87  cnf(i_0_56, plain, (element(X1,X2)|~in(X1,X2))).
% 27.18/3.87  cnf(i_0_64, plain, (empty(X2)|in(X1,X2)|~element(X1,X2))).
% 27.18/3.87  cnf(i_0_65, plain, (element(X1,powerset(X2))|~subset(X1,X2))).
% 27.18/3.87  cnf(i_0_23, plain, (empty(relation_composition(X1,X2))|~empty(X2)|~relation(X1))).
% 27.18/3.87  cnf(i_0_40, plain, (empty(relation_composition(X1,X2))|~empty(X1)|~relation(X2))).
% 27.18/3.87  cnf(i_0_22, plain, (relation(relation_composition(X1,X2))|~empty(X2)|~relation(X1))).
% 27.18/3.87  cnf(i_0_39, plain, (relation(relation_composition(X1,X2))|~empty(X1)|~relation(X2))).
% 27.18/3.87  cnf(i_0_20, plain, (relation(relation_composition(X1,X2))|~relation(X2)|~relation(X1))).
% 27.18/3.87  cnf(i_0_1, plain, (~in(X2,X1)|~in(X1,X2))).
% 27.18/3.87  cnf(i_0_66, plain, (subset(X1,X2)|~element(X1,powerset(X2)))).
% 27.18/3.87  cnf(i_0_33, plain, (~empty(unordered_pair(X1,X2)))).
% 27.18/3.87  cnf(i_0_5, plain, (X1=apply(X2,X3)|in(X3,relation_dom(X2))|X1!=empty_set|~function(X2)|~relation(X2))).
% 27.18/3.87  cnf(i_0_27, plain, (function(relation_composition(X1,X2))|~function(X2)|~function(X1)|~relation(X2)|~relation(X1))).
% 27.18/3.87  cnf(i_0_28, plain, (relation(relation_composition(X1,X2))|~function(X2)|~function(X1)|~relation(X2)|~relation(X1))).
% 27.18/3.87  cnf(i_0_6, plain, (X1=empty_set|in(X3,relation_dom(X2))|X1!=apply(X2,X3)|~function(X2)|~relation(X2))).
% 27.18/3.87  cnf(i_0_68, plain, (~empty(X3)|~in(X1,X2)|~element(X2,powerset(X3)))).
% 27.18/3.87  cnf(i_0_67, plain, (element(X1,X3)|~in(X1,X2)|~element(X2,powerset(X3)))).
% 27.18/3.87  cnf(i_0_58, negated_conjecture, (in(esk17_0,relation_dom(esk19_0))|in(esk17_0,relation_dom(relation_composition(esk19_0,esk18_0))))).
% 27.18/3.87  cnf(i_0_57, negated_conjecture, (in(esk17_0,relation_dom(relation_composition(esk19_0,esk18_0)))|in(apply(esk19_0,esk17_0),relation_dom(esk18_0)))).
% 27.18/3.87  cnf(i_0_31, plain, (~empty(unordered_pair(unordered_pair(X1,X2),singleton(X1))))).
% 27.18/3.87  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)))).
% 27.18/3.87  cnf(i_0_59, negated_conjecture, (~in(esk17_0,relation_dom(esk19_0))|~in(esk17_0,relation_dom(relation_composition(esk19_0,esk18_0)))|~in(apply(esk19_0,esk17_0),relation_dom(esk18_0)))).
% 27.18/3.87  cnf(i_0_11, plain, (in(X1,X4)|X4!=relation_dom(X3)|~relation(X3)|~in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3))).
% 27.18/3.87  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))).
% 27.18/3.87  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))).
% 27.18/3.87  cnf(i_0_17, plain, (in(unordered_pair(unordered_pair(X1,X4),singleton(X1)),X6)|X6!=relation_composition(X3,X5)|~relation(X6)|~relation(X5)|~relation(X3)|~in(unordered_pair(unordered_pair(X2,X4),singleton(X2)),X5)|~in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3))).
% 27.18/3.87  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))).
% 27.18/3.87  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))).
% 27.18/3.87  cnf(i_0_15, plain, (X3=relation_composition(X1,X2)|in(unordered_pair(unordered_pair(esk5_3(X1,X2,X3),esk6_3(X1,X2,X3)),singleton(esk5_3(X1,X2,X3))),X3)|in(unordered_pair(unordered_pair(esk5_3(X1,X2,X3),esk7_3(X1,X2,X3)),singleton(esk5_3(X1,X2,X3))),X1)|~relation(X3)|~relation(X2)|~relation(X1))).
% 27.18/3.87  cnf(i_0_14, plain, (X3=relation_composition(X1,X2)|in(unordered_pair(unordered_pair(esk5_3(X1,X2,X3),esk6_3(X1,X2,X3)),singleton(esk5_3(X1,X2,X3))),X3)|in(unordered_pair(unordered_pair(esk7_3(X1,X2,X3),esk6_3(X1,X2,X3)),singleton(esk7_3(X1,X2,X3))),X2)|~relation(X3)|~relation(X2)|~relation(X1))).
% 27.18/3.87  cnf(i_0_16, plain, (X3=relation_composition(X1,X2)|~relation(X3)|~relation(X2)|~relation(X1)|~in(unordered_pair(unordered_pair(X4,esk6_3(X1,X2,X3)),singleton(X4)),X2)|~in(unordered_pair(unordered_pair(esk5_3(X1,X2,X3),X4),singleton(esk5_3(X1,X2,X3))),X1)|~in(unordered_pair(unordered_pair(esk5_3(X1,X2,X3),esk6_3(X1,X2,X3)),singleton(esk5_3(X1,X2,X3))),X3))).
% 27.18/3.87  cnf(i_0_19, plain, (in(unordered_pair(unordered_pair(X1,esk4_5(X2,X3,X4,X1,X5)),singleton(X1)),X2)|X4!=relation_composition(X2,X3)|~relation(X4)|~relation(X3)|~relation(X2)|~in(unordered_pair(unordered_pair(X1,X5),singleton(X1)),X4))).
% 27.18/3.87  cnf(i_0_18, plain, (in(unordered_pair(unordered_pair(esk4_5(X1,X2,X3,X4,X5),X5),singleton(esk4_5(X1,X2,X3,X4,X5))),X2)|X3!=relation_composition(X1,X2)|~relation(X3)|~relation(X2)|~relation(X1)|~in(unordered_pair(unordered_pair(X4,X5),singleton(X4)),X3))).
% 27.18/3.87  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 27.18/3.87  # Begin printing tableau
% 27.18/3.87  # Found 5 steps
% 27.18/3.87  cnf(i_0_61, negated_conjecture, (relation(esk19_0)), inference(start_rule)).
% 27.18/3.87  cnf(i_0_79, plain, (relation(esk19_0)), inference(extension_rule, [i_0_36])).
% 27.18/3.87  cnf(i_0_388, plain, (empty(esk19_0)), inference(extension_rule, [i_0_69])).
% 27.18/3.87  cnf(i_0_390, plain, (~empty(relation_dom(esk19_0))), inference(etableau_closure_rule, [i_0_390, ...])).
% 27.18/3.87  cnf(i_0_391, plain, (esk19_0=empty_set), inference(etableau_closure_rule, [i_0_391, ...])).
% 27.18/3.87  # End printing tableau
% 27.18/3.87  # SZS output end
% 27.18/3.87  # Branches closed with saturation will be marked with an "s"
% 27.18/3.88  # Child (7232) has found a proof.
% 27.18/3.88  
% 27.18/3.88  # Proof search is over...
% 27.18/3.88  # Freeing feature tree
%------------------------------------------------------------------------------