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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : SEU081+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 : Tue Jul 19 09:23:44 EDT 2022

% Result   : Theorem 56.13s 7.49s
% Output   : CNFRefutation 56.13s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SEU081+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.34  % Computer : n013.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 : Sun Jun 19 06:14:59 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.13/0.37  # No SInE strategy applied
% 0.13/0.37  # Auto-Mode selected heuristic G_E___301_C18_F1_URBAN_S5PRR_RG_S0Y
% 0.13/0.37  # and selection function SelectMaxLComplexAvoidPosPred.
% 0.13/0.37  #
% 0.13/0.37  # Number of axioms: 62 Number of unprocessed: 62
% 0.13/0.37  # Tableaux proof search.
% 0.13/0.37  # APR header successfully linked.
% 0.13/0.37  # 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 2 conjectures.
% 0.13/0.38  # There are 2 start rule candidates:
% 0.13/0.38  # Found 32 unit axioms.
% 0.13/0.38  # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.38  # 2 start rule tableaux created.
% 0.13/0.38  # 30 extension rule candidate clauses
% 0.13/0.38  # 32 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 2
% 0.13/0.38  # Returning from population with 9 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.38  # We now have 9 tableaux to operate on
% 56.13/7.49  # There were 2 total branch saturation attempts.
% 56.13/7.49  # There were 0 of these attempts blocked.
% 56.13/7.49  # There were 0 deferred branch saturation attempts.
% 56.13/7.49  # There were 0 free duplicated saturations.
% 56.13/7.49  # There were 2 total successful branch saturations.
% 56.13/7.49  # There were 0 successful branch saturations in interreduction.
% 56.13/7.49  # There were 0 successful branch saturations on the branch.
% 56.13/7.49  # There were 2 successful branch saturations after the branch.
% 56.13/7.49  # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 56.13/7.49  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 56.13/7.49  # Begin clausification derivation
% 56.13/7.49  
% 56.13/7.49  # End clausification derivation
% 56.13/7.49  # Begin listing active clauses obtained from FOF to CNF conversion
% 56.13/7.49  cnf(i_0_19, plain, (empty(empty_set))).
% 56.13/7.49  cnf(i_0_21, plain, (empty(empty_set))).
% 56.13/7.49  cnf(i_0_25, plain, (empty(empty_set))).
% 56.13/7.49  cnf(i_0_32, plain, (empty(esk6_0))).
% 56.13/7.49  cnf(i_0_35, plain, (empty(esk8_0))).
% 56.13/7.49  cnf(i_0_37, plain, (empty(esk9_0))).
% 56.13/7.49  cnf(i_0_29, plain, (function(esk5_0))).
% 56.13/7.49  cnf(i_0_36, plain, (function(esk9_0))).
% 56.13/7.49  cnf(i_0_45, plain, (function(esk13_0))).
% 56.13/7.49  cnf(i_0_18, plain, (relation(empty_set))).
% 56.13/7.49  cnf(i_0_24, plain, (relation(empty_set))).
% 56.13/7.49  cnf(i_0_30, plain, (relation(esk5_0))).
% 56.13/7.49  cnf(i_0_31, plain, (relation(esk6_0))).
% 56.13/7.49  cnf(i_0_38, plain, (relation(esk9_0))).
% 56.13/7.49  cnf(i_0_39, plain, (relation(esk10_0))).
% 56.13/7.49  cnf(i_0_46, plain, (relation(esk13_0))).
% 56.13/7.49  cnf(i_0_48, plain, (relation(esk14_0))).
% 56.13/7.49  cnf(i_0_44, plain, (one_to_one(esk13_0))).
% 56.13/7.49  cnf(i_0_17, plain, (relation_empty_yielding(empty_set))).
% 56.13/7.49  cnf(i_0_47, plain, (relation_empty_yielding(esk14_0))).
% 56.13/7.49  cnf(i_0_40, plain, (~empty(esk10_0))).
% 56.13/7.49  cnf(i_0_43, plain, (~empty(esk12_0))).
% 56.13/7.49  cnf(i_0_62, plain, (X1=empty_set|~empty(X1))).
% 56.13/7.49  cnf(i_0_41, plain, (empty(esk11_1(X1)))).
% 56.13/7.49  cnf(i_0_22, plain, (function(identity_relation(X1)))).
% 56.13/7.49  cnf(i_0_15, plain, (relation(identity_relation(X1)))).
% 56.13/7.49  cnf(i_0_23, plain, (relation(identity_relation(X1)))).
% 56.13/7.49  cnf(i_0_2, plain, (function(X1)|~empty(X1))).
% 56.13/7.49  cnf(i_0_3, plain, (relation(X1)|~empty(X1))).
% 56.13/7.49  cnf(i_0_49, plain, (subset(X1,X1))).
% 56.13/7.49  cnf(i_0_51, negated_conjecture, (element(esk16_0,powerset(esk15_0)))).
% 56.13/7.49  cnf(i_0_64, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 56.13/7.49  cnf(i_0_20, plain, (~empty(powerset(X1)))).
% 56.13/7.49  cnf(i_0_28, plain, (empty(relation_dom(X1))|~empty(X1))).
% 56.13/7.49  cnf(i_0_27, plain, (relation(relation_dom(X1))|~empty(X1))).
% 56.13/7.49  cnf(i_0_16, plain, (element(esk4_1(X1),X1))).
% 56.13/7.49  cnf(i_0_33, plain, (empty(X1)|~empty(esk7_1(X1)))).
% 56.13/7.49  cnf(i_0_50, negated_conjecture, (relation_image(identity_relation(esk15_0),esk16_0)!=esk16_0)).
% 56.13/7.49  cnf(i_0_4, plain, (one_to_one(X1)|~empty(X1)|~function(X1)|~relation(X1))).
% 56.13/7.49  cnf(i_0_42, plain, (element(esk11_1(X1),powerset(X1)))).
% 56.13/7.49  cnf(i_0_57, plain, (relation_dom(X1)=X2|X1!=identity_relation(X2)|~function(X1)|~relation(X1))).
% 56.13/7.49  cnf(i_0_26, plain, (empty(X1)|~relation(X1)|~empty(relation_dom(X1)))).
% 56.13/7.49  cnf(i_0_63, plain, (~empty(X2)|~in(X1,X2))).
% 56.13/7.49  cnf(i_0_34, plain, (empty(X1)|element(esk7_1(X1),powerset(X1)))).
% 56.13/7.49  cnf(i_0_52, plain, (element(X1,X2)|~in(X1,X2))).
% 56.13/7.49  cnf(i_0_53, plain, (empty(X2)|in(X1,X2)|~element(X1,X2))).
% 56.13/7.49  cnf(i_0_58, plain, (element(X1,powerset(X2))|~subset(X1,X2))).
% 56.13/7.49  cnf(i_0_1, plain, (~in(X2,X1)|~in(X1,X2))).
% 56.13/7.49  cnf(i_0_59, plain, (subset(X1,X2)|~element(X1,powerset(X2)))).
% 56.13/7.49  cnf(i_0_56, plain, (apply(X3,X1)=X1|X3!=identity_relation(X2)|~function(X3)|~relation(X3)|~in(X1,X2))).
% 56.13/7.49  cnf(i_0_61, plain, (~empty(X3)|~in(X1,X2)|~element(X2,powerset(X3)))).
% 56.13/7.49  cnf(i_0_55, plain, (X2=identity_relation(X1)|in(esk17_2(X1,X2),X1)|relation_dom(X2)!=X1|~function(X2)|~relation(X2))).
% 56.13/7.49  cnf(i_0_60, plain, (element(X1,X3)|~in(X1,X2)|~element(X2,powerset(X3)))).
% 56.13/7.49  cnf(i_0_54, plain, (X1=identity_relation(X2)|relation_dom(X1)!=X2|apply(X1,esk17_2(X2,X1))!=esk17_2(X2,X1)|~function(X1)|~relation(X1))).
% 56.13/7.49  cnf(i_0_11, plain, (in(X4,X5)|X5!=relation_image(X2,X3)|X4!=apply(X2,X1)|~function(X2)|~relation(X2)|~in(X1,X3)|~in(X1,relation_dom(X2)))).
% 56.13/7.49  cnf(i_0_8, plain, (X3=relation_image(X1,X2)|in(esk2_3(X1,X2,X3),X3)|in(esk3_3(X1,X2,X3),X2)|~function(X1)|~relation(X1))).
% 56.13/7.49  cnf(i_0_9, plain, (X3=relation_image(X1,X2)|in(esk2_3(X1,X2,X3),X3)|in(esk3_3(X1,X2,X3),relation_dom(X1))|~function(X1)|~relation(X1))).
% 56.13/7.49  cnf(i_0_7, plain, (X3=relation_image(X1,X2)|apply(X1,esk3_3(X1,X2,X3))=esk2_3(X1,X2,X3)|in(esk2_3(X1,X2,X3),X3)|~function(X1)|~relation(X1))).
% 56.13/7.49  cnf(i_0_10, plain, (X3=relation_image(X1,X2)|esk2_3(X1,X2,X3)!=apply(X1,X4)|~function(X1)|~relation(X1)|~in(X4,X2)|~in(X4,relation_dom(X1))|~in(esk2_3(X1,X2,X3),X3))).
% 56.13/7.49  cnf(i_0_13, plain, (in(esk1_4(X1,X2,X3,X4),X2)|X3!=relation_image(X1,X2)|~function(X1)|~relation(X1)|~in(X4,X3))).
% 56.13/7.49  cnf(i_0_12, plain, (apply(X2,esk1_4(X2,X3,X4,X1))=X1|X4!=relation_image(X2,X3)|~function(X2)|~relation(X2)|~in(X1,X4))).
% 56.13/7.49  cnf(i_0_14, plain, (in(esk1_4(X1,X2,X3,X4),relation_dom(X1))|X3!=relation_image(X1,X2)|~function(X1)|~relation(X1)|~in(X4,X3))).
% 56.13/7.49  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 56.13/7.49  # Begin printing tableau
% 56.13/7.49  # Found 7 steps
% 56.13/7.49  cnf(i_0_50, negated_conjecture, (relation_image(identity_relation(esk15_0),esk16_0)!=esk16_0), inference(start_rule)).
% 56.13/7.49  cnf(i_0_65, plain, (relation_image(identity_relation(esk15_0),esk16_0)!=esk16_0), inference(extension_rule, [i_0_9])).
% 56.13/7.49  cnf(i_0_144, plain, (~function(identity_relation(esk15_0))), inference(closure_rule, [i_0_22])).
% 56.13/7.49  cnf(i_0_145, plain, (~relation(identity_relation(esk15_0))), inference(closure_rule, [i_0_15])).
% 56.13/7.49  cnf(i_0_142, plain, (in(esk2_3(identity_relation(esk15_0),esk16_0,esk16_0),esk16_0)), inference(extension_rule, [i_0_63])).
% 56.13/7.49  cnf(i_0_143, plain, (in(esk3_3(identity_relation(esk15_0),esk16_0,esk16_0),relation_dom(identity_relation(esk15_0)))), inference(etableau_closure_rule, [i_0_143, ...])).
% 56.13/7.49  cnf(i_0_305, plain, (~empty(esk16_0)), inference(etableau_closure_rule, [i_0_305, ...])).
% 56.13/7.49  # End printing tableau
% 56.13/7.49  # SZS output end
% 56.13/7.49  # Branches closed with saturation will be marked with an "s"
% 56.13/7.50  # Child (6523) has found a proof.
% 56.13/7.50  
% 56.13/7.50  # Proof search is over...
% 56.13/7.50  # Freeing feature tree
%------------------------------------------------------------------------------