TSTP Solution File: SEU214+1 by Etableau---0.67

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : SEU214+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 : n003.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 108.93s 14.12s
% Output   : CNFRefutation 108.93s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : SEU214+1 : TPTP v8.1.0. Released v3.3.0.
% 0.04/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.34  % Computer : n003.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Mon Jun 20 02:02:29 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.38  # No SInE strategy applied
% 0.20/0.38  # Auto-Mode selected heuristic G_E___215_C46_F1_AE_CS_SP_PS_S2S
% 0.20/0.38  # and selection function SelectNewComplexAHP.
% 0.20/0.38  #
% 0.20/0.38  # Presaturation interreduction done
% 0.20/0.38  # Number of axioms: 59 Number of unprocessed: 54
% 0.20/0.38  # Tableaux proof search.
% 0.20/0.38  # APR header successfully linked.
% 0.20/0.38  # Hello from C++
% 0.20/0.38  # The folding up rule is enabled...
% 0.20/0.38  # Local unification is enabled...
% 0.20/0.38  # Any saturation attempts will use folding labels...
% 0.20/0.38  # 54 beginning clauses after preprocessing and clausification
% 0.20/0.38  # Creating start rules for all 6 conjectures.
% 0.20/0.38  # There are 6 start rule candidates:
% 0.20/0.38  # Found 23 unit axioms.
% 0.20/0.38  # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.20/0.38  # 6 start rule tableaux created.
% 0.20/0.38  # 31 extension rule candidate clauses
% 0.20/0.38  # 23 unit axiom clauses
% 0.20/0.38  
% 0.20/0.38  # Requested 8, 32 cores available to the main process.
% 0.20/0.38  # There are not enough tableaux to fork, creating more from the initial 6
% 0.20/0.38  # Returning from population with 14 new_tableaux and 0 remaining starting tableaux.
% 0.20/0.38  # We now have 14 tableaux to operate on
% 8.69/1.46  # Creating equality axioms
% 8.69/1.46  # Ran out of tableaux, making start rules for all clauses
% 108.93/14.12  # There were 14 total branch saturation attempts.
% 108.93/14.12  # There were 1 of these attempts blocked.
% 108.93/14.12  # There were 0 deferred branch saturation attempts.
% 108.93/14.12  # There were 0 free duplicated saturations.
% 108.93/14.12  # There were 4 total successful branch saturations.
% 108.93/14.12  # There were 0 successful branch saturations in interreduction.
% 108.93/14.12  # There were 0 successful branch saturations on the branch.
% 108.93/14.12  # There were 4 successful branch saturations after the branch.
% 108.93/14.12  # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 108.93/14.12  # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 108.93/14.12  # Begin clausification derivation
% 108.93/14.12  
% 108.93/14.12  # End clausification derivation
% 108.93/14.12  # Begin listing active clauses obtained from FOF to CNF conversion
% 108.93/14.12  cnf(i_0_62, negated_conjecture, (function(esk16_0))).
% 108.93/14.12  cnf(i_0_60, negated_conjecture, (function(esk17_0))).
% 108.93/14.12  cnf(i_0_63, negated_conjecture, (relation(esk16_0))).
% 108.93/14.12  cnf(i_0_61, negated_conjecture, (relation(esk17_0))).
% 108.93/14.12  cnf(i_0_59, negated_conjecture, (in(esk15_0,relation_dom(relation_composition(esk17_0,esk16_0))))).
% 108.93/14.12  cnf(i_0_47, plain, (function(esk9_0))).
% 108.93/14.12  cnf(i_0_32, plain, (relation(empty_set))).
% 108.93/14.12  cnf(i_0_48, plain, (relation(esk9_0))).
% 108.93/14.12  cnf(i_0_33, plain, (empty(empty_set))).
% 108.93/14.12  cnf(i_0_49, plain, (relation(esk10_0))).
% 108.93/14.12  cnf(i_0_52, plain, (relation(esk12_0))).
% 108.93/14.12  cnf(i_0_56, plain, (relation(esk14_0))).
% 108.93/14.12  cnf(i_0_50, plain, (empty(esk10_0))).
% 108.93/14.12  cnf(i_0_51, plain, (empty(esk11_0))).
% 108.93/14.12  cnf(i_0_31, plain, (relation_empty_yielding(empty_set))).
% 108.93/14.12  cnf(i_0_55, plain, (relation_empty_yielding(esk14_0))).
% 108.93/14.12  cnf(i_0_28, plain, (element(esk8_1(X1),X1))).
% 108.93/14.12  cnf(i_0_4, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))).
% 108.93/14.12  cnf(i_0_58, negated_conjecture, (apply(esk16_0,apply(esk17_0,esk15_0))!=apply(relation_composition(esk17_0,esk16_0),esk15_0))).
% 108.93/14.12  cnf(i_0_53, plain, (~empty(esk12_0))).
% 108.93/14.12  cnf(i_0_54, plain, (~empty(esk13_0))).
% 108.93/14.12  cnf(i_0_38, plain, (~empty(singleton(X1)))).
% 108.93/14.12  cnf(i_0_39, plain, (~empty(unordered_pair(X1,X2)))).
% 108.93/14.12  cnf(i_0_2, plain, (function(X1)|~empty(X1))).
% 108.93/14.12  cnf(i_0_3, plain, (relation(X1)|~empty(X1))).
% 108.93/14.12  cnf(i_0_43, plain, (relation(relation_dom(X1))|~empty(X1))).
% 108.93/14.12  cnf(i_0_66, plain, (~empty(X1)|~in(X2,X1))).
% 108.93/14.12  cnf(i_0_65, plain, (X1=empty_set|~empty(X1))).
% 108.93/14.12  cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))).
% 108.93/14.12  cnf(i_0_44, plain, (empty(relation_dom(X1))|~empty(X1))).
% 108.93/14.12  cnf(i_0_26, plain, (relation(relation_composition(X1,X2))|~relation(X2)|~relation(X1))).
% 108.93/14.12  cnf(i_0_67, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 108.93/14.12  cnf(i_0_42, plain, (empty(X1)|~relation(X1)|~empty(relation_dom(X1)))).
% 108.93/14.12  cnf(i_0_29, plain, (relation(relation_composition(X1,X2))|~relation(X1)|~empty(X2))).
% 108.93/14.12  cnf(i_0_45, plain, (relation(relation_composition(X1,X2))|~relation(X2)|~empty(X1))).
% 108.93/14.12  cnf(i_0_57, plain, (element(X1,X2)|~in(X1,X2))).
% 108.93/14.12  cnf(i_0_34, plain, (function(relation_composition(X1,X2))|~relation(X2)|~relation(X1)|~function(X2)|~function(X1))).
% 108.93/14.12  cnf(i_0_30, plain, (empty(relation_composition(X1,X2))|~relation(X1)|~empty(X2))).
% 108.93/14.12  cnf(i_0_46, plain, (empty(relation_composition(X1,X2))|~relation(X2)|~empty(X1))).
% 108.93/14.12  cnf(i_0_64, plain, (empty(X1)|in(X2,X1)|~element(X2,X1))).
% 108.93/14.12  cnf(i_0_6, plain, (X1=empty_set|in(X2,relation_dom(X3))|X1!=apply(X3,X2)|~relation(X3)|~function(X3))).
% 108.93/14.12  cnf(i_0_5, plain, (X1=apply(X2,X3)|in(X3,relation_dom(X2))|X1!=empty_set|~relation(X2)|~function(X2))).
% 108.93/14.12  cnf(i_0_11, plain, (in(X1,X2)|X2!=relation_dom(X3)|~relation(X3)|~in(unordered_pair(unordered_pair(X1,X4),singleton(X1)),X3))).
% 108.93/14.12  cnf(i_0_7, plain, (X1=apply(X2,X3)|~relation(X2)|~function(X2)|~in(unordered_pair(unordered_pair(X3,X1),singleton(X3)),X2)|~in(X3,relation_dom(X2)))).
% 108.93/14.12  cnf(i_0_8, plain, (in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3)|X2!=apply(X3,X1)|~relation(X3)|~function(X3)|~in(X1,relation_dom(X3)))).
% 108.93/14.12  cnf(i_0_10, plain, (X1=relation_dom(X2)|~relation(X2)|~in(unordered_pair(unordered_pair(esk2_2(X2,X1),X3),singleton(esk2_2(X2,X1))),X2)|~in(esk2_2(X2,X1),X1))).
% 108.93/14.12  cnf(i_0_12, plain, (in(unordered_pair(singleton(X1),unordered_pair(X1,esk1_3(X2,X3,X1))),X2)|X3!=relation_dom(X2)|~relation(X2)|~in(X1,X3))).
% 108.93/14.12  cnf(i_0_9, plain, (X1=relation_dom(X2)|in(unordered_pair(singleton(esk2_2(X2,X1)),unordered_pair(esk2_2(X2,X1),esk3_2(X2,X1))),X2)|in(esk2_2(X2,X1),X1)|~relation(X2))).
% 108.93/14.12  cnf(i_0_19, plain, (in(unordered_pair(singleton(X1),unordered_pair(X1,esk4_5(X2,X3,X4,X1,X5))),X2)|X4!=relation_composition(X2,X3)|~relation(X4)|~relation(X3)|~relation(X2)|~in(unordered_pair(unordered_pair(X1,X5),singleton(X1)),X4))).
% 108.93/14.12  cnf(i_0_17, plain, (in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3)|X3!=relation_composition(X4,X5)|~relation(X3)|~relation(X5)|~relation(X4)|~in(unordered_pair(unordered_pair(X6,X2),singleton(X6)),X5)|~in(unordered_pair(unordered_pair(X1,X6),singleton(X1)),X4))).
% 108.93/14.12  cnf(i_0_18, plain, (in(unordered_pair(unordered_pair(X1,esk4_5(X2,X3,X4,X5,X1)),singleton(esk4_5(X2,X3,X4,X5,X1))),X3)|X4!=relation_composition(X2,X3)|~relation(X4)|~relation(X3)|~relation(X2)|~in(unordered_pair(unordered_pair(X5,X1),singleton(X5)),X4))).
% 108.93/14.12  cnf(i_0_16, plain, (X1=relation_composition(X2,X3)|~relation(X1)|~relation(X3)|~relation(X2)|~in(unordered_pair(singleton(esk5_3(X2,X3,X1)),unordered_pair(esk5_3(X2,X3,X1),esk6_3(X2,X3,X1))),X1)|~in(unordered_pair(unordered_pair(esk5_3(X2,X3,X1),X4),singleton(esk5_3(X2,X3,X1))),X2)|~in(unordered_pair(singleton(X4),unordered_pair(X4,esk6_3(X2,X3,X1))),X3))).
% 108.93/14.12  cnf(i_0_15, plain, (X1=relation_composition(X2,X3)|in(unordered_pair(singleton(esk5_3(X2,X3,X1)),unordered_pair(esk5_3(X2,X3,X1),esk7_3(X2,X3,X1))),X2)|in(unordered_pair(singleton(esk5_3(X2,X3,X1)),unordered_pair(esk5_3(X2,X3,X1),esk6_3(X2,X3,X1))),X1)|~relation(X1)|~relation(X3)|~relation(X2))).
% 108.93/14.12  cnf(i_0_14, plain, (X1=relation_composition(X2,X3)|in(unordered_pair(singleton(esk7_3(X2,X3,X1)),unordered_pair(esk6_3(X2,X3,X1),esk7_3(X2,X3,X1))),X3)|in(unordered_pair(singleton(esk5_3(X2,X3,X1)),unordered_pair(esk5_3(X2,X3,X1),esk6_3(X2,X3,X1))),X1)|~relation(X1)|~relation(X3)|~relation(X2))).
% 108.93/14.12  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 108.93/14.12  # Begin printing tableau
% 108.93/14.12  # Found 15 steps
% 108.93/14.12  cnf(i_0_59, negated_conjecture, (in(esk15_0,relation_dom(relation_composition(esk17_0,esk16_0)))), inference(start_rule)).
% 108.93/14.12  cnf(i_0_69, plain, (in(esk15_0,relation_dom(relation_composition(esk17_0,esk16_0)))), inference(extension_rule, [i_0_12])).
% 108.93/14.12  cnf(i_0_268, plain, (~relation(empty_set)), inference(closure_rule, [i_0_32])).
% 108.93/14.12  cnf(i_0_266, plain, (in(unordered_pair(singleton(esk15_0),unordered_pair(esk15_0,esk1_3(empty_set,relation_dom(relation_composition(esk17_0,esk16_0)),esk15_0))),empty_set)), inference(extension_rule, [i_0_66])).
% 108.93/14.12  cnf(i_0_318, plain, (~empty(empty_set)), inference(closure_rule, [i_0_33])).
% 108.93/14.12  cnf(i_0_267, plain, (relation_dom(relation_composition(esk17_0,esk16_0))!=relation_dom(empty_set)), inference(extension_rule, [i_0_67])).
% 108.93/14.12  cnf(i_0_336, plain, (~empty(relation_dom(empty_set))), inference(etableau_closure_rule, [i_0_336, ...])).
% 108.93/14.12  cnf(i_0_337, plain, (~empty(relation_dom(relation_composition(esk17_0,esk16_0)))), inference(extension_rule, [i_0_44])).
% 108.93/14.12  cnf(i_0_92349, plain, (~empty(relation_composition(esk17_0,esk16_0))), inference(extension_rule, [i_0_30])).
% 108.93/14.12  cnf(i_0_363809, plain, (~relation(esk17_0)), inference(closure_rule, [i_0_61])).
% 108.93/14.12  cnf(i_0_363810, plain, (~empty(esk16_0)), inference(extension_rule, [i_0_42])).
% 108.93/14.12  cnf(i_0_363922, plain, (~relation(esk16_0)), inference(closure_rule, [i_0_63])).
% 108.93/14.12  cnf(i_0_363923, plain, (~empty(relation_dom(esk16_0))), inference(extension_rule, [i_0_42])).
% 108.93/14.12  cnf(i_0_622876, plain, (~relation(relation_dom(esk16_0))), inference(etableau_closure_rule, [i_0_622876, ...])).
% 108.93/14.12  cnf(i_0_622877, plain, (~empty(relation_dom(relation_dom(esk16_0)))), inference(etableau_closure_rule, [i_0_622877, ...])).
% 108.93/14.12  # End printing tableau
% 108.93/14.12  # SZS output end
% 108.93/14.12  # Branches closed with saturation will be marked with an "s"
% 109.41/14.12  # Child (7463) has found a proof.
% 109.41/14.12  
% 109.41/14.12  # Proof search is over...
% 109.41/14.12  # Freeing feature tree
%------------------------------------------------------------------------------