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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : SEU072+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 : n010.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:23:42 EDT 2022

% Result   : Theorem 0.18s 0.41s
% Output   : CNFRefutation 0.18s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SEU072+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.12/0.33  % Computer : n010.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Mon Jun 20 02:41:07 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.12/0.37  # No SInE strategy applied
% 0.12/0.37  # Auto-Mode selected heuristic G_E___301_C18_F1_URBAN_S5PRR_RG_S0Y
% 0.12/0.37  # and selection function SelectMaxLComplexAvoidPosPred.
% 0.12/0.37  #
% 0.12/0.37  # Number of axioms: 71 Number of unprocessed: 71
% 0.12/0.37  # Tableaux proof search.
% 0.12/0.37  # APR header successfully linked.
% 0.12/0.37  # Hello from C++
% 0.12/0.37  # The folding up rule is enabled...
% 0.12/0.37  # Local unification is enabled...
% 0.12/0.37  # Any saturation attempts will use folding labels...
% 0.12/0.37  # 71 beginning clauses after preprocessing and clausification
% 0.12/0.37  # Creating start rules for all 4 conjectures.
% 0.12/0.37  # There are 4 start rule candidates:
% 0.12/0.37  # Found 32 unit axioms.
% 0.12/0.37  # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.37  # 4 start rule tableaux created.
% 0.12/0.37  # 39 extension rule candidate clauses
% 0.12/0.37  # 32 unit axiom clauses
% 0.12/0.37  
% 0.12/0.37  # Requested 8, 32 cores available to the main process.
% 0.12/0.37  # There are not enough tableaux to fork, creating more from the initial 4
% 0.12/0.37  # Returning from population with 25 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.37  # We now have 25 tableaux to operate on
% 0.18/0.41  # There were 1 total branch saturation attempts.
% 0.18/0.41  # There were 0 of these attempts blocked.
% 0.18/0.41  # There were 0 deferred branch saturation attempts.
% 0.18/0.41  # There were 0 free duplicated saturations.
% 0.18/0.41  # There were 1 total successful branch saturations.
% 0.18/0.41  # There were 0 successful branch saturations in interreduction.
% 0.18/0.41  # There were 0 successful branch saturations on the branch.
% 0.18/0.41  # There were 1 successful branch saturations after the branch.
% 0.18/0.41  # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.41  # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.41  # Begin clausification derivation
% 0.18/0.41  
% 0.18/0.41  # End clausification derivation
% 0.18/0.41  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.18/0.41  cnf(i_0_21, plain, (empty(empty_set))).
% 0.18/0.41  cnf(i_0_23, plain, (empty(empty_set))).
% 0.18/0.41  cnf(i_0_26, plain, (empty(empty_set))).
% 0.18/0.41  cnf(i_0_36, plain, (empty(esk8_0))).
% 0.18/0.41  cnf(i_0_39, plain, (empty(esk10_0))).
% 0.18/0.41  cnf(i_0_41, plain, (empty(esk11_0))).
% 0.18/0.41  cnf(i_0_33, plain, (function(esk7_0))).
% 0.18/0.41  cnf(i_0_40, plain, (function(esk11_0))).
% 0.18/0.41  cnf(i_0_49, plain, (function(esk15_0))).
% 0.18/0.41  cnf(i_0_59, negated_conjecture, (function(esk17_0))).
% 0.18/0.41  cnf(i_0_20, plain, (relation(empty_set))).
% 0.18/0.41  cnf(i_0_25, plain, (relation(empty_set))).
% 0.18/0.41  cnf(i_0_34, plain, (relation(esk7_0))).
% 0.18/0.41  cnf(i_0_35, plain, (relation(esk8_0))).
% 0.18/0.41  cnf(i_0_42, plain, (relation(esk11_0))).
% 0.18/0.41  cnf(i_0_43, plain, (relation(esk12_0))).
% 0.18/0.41  cnf(i_0_50, plain, (relation(esk15_0))).
% 0.18/0.41  cnf(i_0_52, plain, (relation(esk16_0))).
% 0.18/0.41  cnf(i_0_60, negated_conjecture, (relation(esk17_0))).
% 0.18/0.41  cnf(i_0_48, plain, (one_to_one(esk15_0))).
% 0.18/0.41  cnf(i_0_19, plain, (relation_empty_yielding(empty_set))).
% 0.18/0.41  cnf(i_0_51, plain, (relation_empty_yielding(esk16_0))).
% 0.18/0.41  cnf(i_0_44, plain, (~empty(esk12_0))).
% 0.18/0.41  cnf(i_0_47, plain, (~empty(esk14_0))).
% 0.18/0.41  cnf(i_0_57, negated_conjecture, (~one_to_one(esk17_0))).
% 0.18/0.41  cnf(i_0_70, plain, (X1=empty_set|~empty(X1))).
% 0.18/0.41  cnf(i_0_45, plain, (empty(esk13_1(X1)))).
% 0.18/0.41  cnf(i_0_2, plain, (function(X1)|~empty(X1))).
% 0.18/0.41  cnf(i_0_3, plain, (relation(X1)|~empty(X1))).
% 0.18/0.41  cnf(i_0_53, plain, (subset(X1,X1))).
% 0.18/0.41  cnf(i_0_73, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 0.18/0.41  cnf(i_0_22, plain, (~empty(powerset(X1)))).
% 0.18/0.41  cnf(i_0_24, plain, (~empty(singleton(X1)))).
% 0.18/0.41  cnf(i_0_32, plain, (empty(relation_rng(X1))|~empty(X1))).
% 0.18/0.41  cnf(i_0_30, plain, (empty(relation_dom(X1))|~empty(X1))).
% 0.18/0.41  cnf(i_0_31, plain, (relation(relation_rng(X1))|~empty(X1))).
% 0.18/0.41  cnf(i_0_29, plain, (relation(relation_dom(X1))|~empty(X1))).
% 0.18/0.41  cnf(i_0_18, plain, (element(esk6_1(X1),X1))).
% 0.18/0.41  cnf(i_0_37, plain, (empty(X1)|~empty(esk9_1(X1)))).
% 0.18/0.41  cnf(i_0_64, plain, (subset(X1,singleton(X2))|X1!=empty_set)).
% 0.18/0.41  cnf(i_0_4, plain, (one_to_one(X1)|~empty(X1)|~function(X1)|~relation(X1))).
% 0.18/0.41  cnf(i_0_46, plain, (element(esk13_1(X1),powerset(X1)))).
% 0.18/0.41  cnf(i_0_28, plain, (empty(X1)|~relation(X1)|~empty(relation_rng(X1)))).
% 0.18/0.41  cnf(i_0_27, plain, (empty(X1)|~relation(X1)|~empty(relation_dom(X1)))).
% 0.18/0.41  cnf(i_0_63, plain, (subset(X1,singleton(X2))|X1!=singleton(X2))).
% 0.18/0.41  cnf(i_0_72, plain, (~empty(X2)|~in(X1,X2))).
% 0.18/0.41  cnf(i_0_38, plain, (empty(X1)|element(esk9_1(X1),powerset(X1)))).
% 0.18/0.41  cnf(i_0_13, plain, (one_to_one(X1)|esk5_1(X1)!=esk4_1(X1)|~function(X1)|~relation(X1))).
% 0.18/0.41  cnf(i_0_61, plain, (element(X1,X2)|~in(X1,X2))).
% 0.18/0.41  cnf(i_0_65, plain, (X1=empty_set|X1=singleton(X2)|~subset(X1,singleton(X2)))).
% 0.18/0.41  cnf(i_0_62, plain, (empty(X2)|in(X1,X2)|~element(X1,X2))).
% 0.18/0.41  cnf(i_0_66, plain, (element(X1,powerset(X2))|~subset(X1,X2))).
% 0.18/0.41  cnf(i_0_71, plain, (X1=X2|~subset(singleton(X1),singleton(X2)))).
% 0.18/0.41  cnf(i_0_1, plain, (~in(X2,X1)|~in(X1,X2))).
% 0.18/0.41  cnf(i_0_16, plain, (one_to_one(X1)|in(esk4_1(X1),relation_dom(X1))|~function(X1)|~relation(X1))).
% 0.18/0.41  cnf(i_0_15, plain, (one_to_one(X1)|in(esk5_1(X1),relation_dom(X1))|~function(X1)|~relation(X1))).
% 0.18/0.41  cnf(i_0_67, plain, (subset(X1,X2)|~element(X1,powerset(X2)))).
% 0.18/0.41  cnf(i_0_55, plain, (relation_inverse_image(X1,singleton(X2))=empty_set|in(X2,relation_rng(X1))|~relation(X1))).
% 0.18/0.41  cnf(i_0_14, plain, (apply(X1,esk5_1(X1))=apply(X1,esk4_1(X1))|one_to_one(X1)|~function(X1)|~relation(X1))).
% 0.18/0.41  cnf(i_0_69, plain, (~empty(X3)|~in(X1,X2)|~element(X2,powerset(X3)))).
% 0.18/0.41  cnf(i_0_68, plain, (element(X1,X3)|~in(X1,X2)|~element(X2,powerset(X3)))).
% 0.18/0.41  cnf(i_0_56, plain, (relation_inverse_image(X2,singleton(X1))!=empty_set|~relation(X2)|~in(X1,relation_rng(X2)))).
% 0.18/0.41  cnf(i_0_58, negated_conjecture, (subset(relation_inverse_image(esk17_0,relation_image(esk17_0,X1)),X1))).
% 0.18/0.41  cnf(i_0_10, plain, (in(X3,X4)|X4!=relation_rng(X2)|X3!=apply(X2,X1)|~function(X2)|~relation(X2)|~in(X1,relation_dom(X2)))).
% 0.18/0.41  cnf(i_0_54, plain, (relation_image(X1,singleton(X2))=singleton(apply(X1,X2))|~function(X1)|~relation(X1)|~in(X2,relation_dom(X1)))).
% 0.18/0.41  cnf(i_0_8, plain, (X2=relation_rng(X1)|in(esk2_2(X1,X2),X2)|in(esk3_2(X1,X2),relation_dom(X1))|~function(X1)|~relation(X1))).
% 0.18/0.41  cnf(i_0_7, plain, (X2=relation_rng(X1)|apply(X1,esk3_2(X1,X2))=esk2_2(X1,X2)|in(esk2_2(X1,X2),X2)|~function(X1)|~relation(X1))).
% 0.18/0.41  cnf(i_0_17, plain, (X2=X3|apply(X1,X2)!=apply(X1,X3)|~function(X1)|~relation(X1)|~one_to_one(X1)|~in(X3,relation_dom(X1))|~in(X2,relation_dom(X1)))).
% 0.18/0.41  cnf(i_0_9, plain, (X2=relation_rng(X1)|esk2_2(X1,X2)!=apply(X1,X3)|~function(X1)|~relation(X1)|~in(X3,relation_dom(X1))|~in(esk2_2(X1,X2),X2))).
% 0.18/0.41  cnf(i_0_11, plain, (apply(X2,esk1_3(X2,X3,X1))=X1|X3!=relation_rng(X2)|~function(X2)|~relation(X2)|~in(X1,X3))).
% 0.18/0.41  cnf(i_0_12, plain, (in(esk1_3(X1,X2,X3),relation_dom(X1))|X2!=relation_rng(X1)|~function(X1)|~relation(X1)|~in(X3,X2))).
% 0.18/0.41  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.18/0.41  # Begin printing tableau
% 0.18/0.41  # Found 6 steps
% 0.18/0.41  cnf(i_0_59, negated_conjecture, (function(esk17_0)), inference(start_rule)).
% 0.18/0.41  cnf(i_0_77, plain, (function(esk17_0)), inference(extension_rule, [i_0_4])).
% 0.18/0.41  cnf(i_0_471, plain, (one_to_one(esk17_0)), inference(closure_rule, [i_0_57])).
% 0.18/0.41  cnf(i_0_474, plain, (~relation(esk17_0)), inference(closure_rule, [i_0_60])).
% 0.18/0.41  cnf(i_0_472, plain, (~empty(esk17_0)), inference(extension_rule, [i_0_37])).
% 0.18/0.41  cnf(i_0_493, plain, (~empty(esk9_1(esk17_0))), inference(etableau_closure_rule, [i_0_493, ...])).
% 0.18/0.41  # End printing tableau
% 0.18/0.41  # SZS output end
% 0.18/0.41  # Branches closed with saturation will be marked with an "s"
% 0.18/0.41  # Child (17903) has found a proof.
% 0.18/0.41  
% 0.18/0.41  # Proof search is over...
% 0.18/0.41  # Freeing feature tree
%------------------------------------------------------------------------------