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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : SEU317+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 : 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:25:48 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SEU317+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12  % 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 : Sat Jun 18 19:05:08 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.12/0.36  # No SInE strategy applied
% 0.12/0.36  # Auto-Mode selected heuristic G_E___301_C18_F1_URBAN_S5PRR_RG_S0Y
% 0.12/0.36  # and selection function SelectMaxLComplexAvoidPosPred.
% 0.12/0.36  #
% 0.12/0.36  # Number of axioms: 83 Number of unprocessed: 83
% 0.12/0.36  # Tableaux proof search.
% 0.12/0.36  # APR header successfully linked.
% 0.12/0.36  # 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  # 83 beginning clauses after preprocessing and clausification
% 0.12/0.37  # Creating start rules for all 3 conjectures.
% 0.12/0.37  # There are 3 start rule candidates:
% 0.12/0.37  # Found 22 unit axioms.
% 0.12/0.37  # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.37  # 3 start rule tableaux created.
% 0.12/0.37  # 61 extension rule candidate clauses
% 0.12/0.37  # 22 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 3
% 0.12/0.37  # Returning from population with 45 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.37  # We now have 45 tableaux to operate on
% 0.18/0.47  # There were 2 total branch saturation attempts.
% 0.18/0.47  # There were 0 of these attempts blocked.
% 0.18/0.47  # There were 0 deferred branch saturation attempts.
% 0.18/0.47  # There were 0 free duplicated saturations.
% 0.18/0.47  # There were 2 total successful branch saturations.
% 0.18/0.47  # There were 0 successful branch saturations in interreduction.
% 0.18/0.47  # There were 0 successful branch saturations on the branch.
% 0.18/0.47  # There were 2 successful branch saturations after the branch.
% 0.18/0.47  # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.47  # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.47  # Begin clausification derivation
% 0.18/0.47  
% 0.18/0.47  # End clausification derivation
% 0.18/0.47  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.18/0.47  cnf(i_0_59, plain, (v1_membered(empty_set))).
% 0.18/0.47  cnf(i_0_65, plain, (v1_membered(esk5_0))).
% 0.18/0.47  cnf(i_0_58, plain, (v2_membered(empty_set))).
% 0.18/0.47  cnf(i_0_64, plain, (v2_membered(esk5_0))).
% 0.18/0.47  cnf(i_0_57, plain, (v3_membered(empty_set))).
% 0.18/0.47  cnf(i_0_63, plain, (v3_membered(esk5_0))).
% 0.18/0.47  cnf(i_0_56, plain, (v4_membered(empty_set))).
% 0.18/0.47  cnf(i_0_62, plain, (v4_membered(esk5_0))).
% 0.18/0.47  cnf(i_0_55, plain, (v5_membered(empty_set))).
% 0.18/0.47  cnf(i_0_61, plain, (v5_membered(esk5_0))).
% 0.18/0.47  cnf(i_0_60, plain, (empty(empty_set))).
% 0.18/0.47  cnf(i_0_51, plain, (top_str(esk2_0))).
% 0.18/0.47  cnf(i_0_83, negated_conjecture, (top_str(esk9_0))).
% 0.18/0.47  cnf(i_0_52, plain, (one_sorted_str(esk3_0))).
% 0.18/0.47  cnf(i_0_66, plain, (~empty(esk5_0))).
% 0.18/0.47  cnf(i_0_86, plain, (X1=empty_set|~empty(X1))).
% 0.18/0.47  cnf(i_0_69, plain, (empty(esk7_1(X1)))).
% 0.18/0.47  cnf(i_0_40, plain, (v1_membered(X1)|~v2_membered(X1))).
% 0.18/0.47  cnf(i_0_21, plain, (v1_membered(X1)|~empty(X1))).
% 0.18/0.47  cnf(i_0_39, plain, (v2_membered(X1)|~v3_membered(X1))).
% 0.18/0.47  cnf(i_0_20, plain, (v2_membered(X1)|~empty(X1))).
% 0.18/0.47  cnf(i_0_38, plain, (v3_membered(X1)|~v4_membered(X1))).
% 0.18/0.47  cnf(i_0_19, plain, (v3_membered(X1)|~empty(X1))).
% 0.18/0.47  cnf(i_0_32, plain, (v4_membered(X1)|~v5_membered(X1))).
% 0.18/0.47  cnf(i_0_18, plain, (v4_membered(X1)|~empty(X1))).
% 0.18/0.47  cnf(i_0_17, plain, (v5_membered(X1)|~empty(X1))).
% 0.18/0.47  cnf(i_0_47, plain, (one_sorted_str(X1)|~top_str(X1))).
% 0.18/0.47  cnf(i_0_71, plain, (subset(X1,X1))).
% 0.18/0.47  cnf(i_0_88, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 0.18/0.47  cnf(i_0_54, plain, (~empty(powerset(X1)))).
% 0.18/0.47  cnf(i_0_53, plain, (element(esk4_1(X1),X1))).
% 0.18/0.47  cnf(i_0_67, plain, (empty(X1)|~empty(esk6_1(X1)))).
% 0.18/0.47  cnf(i_0_82, negated_conjecture, (element(esk10_0,powerset(the_carrier(esk9_0))))).
% 0.18/0.47  cnf(i_0_70, plain, (element(esk7_1(X1),powerset(X1)))).
% 0.18/0.47  cnf(i_0_87, plain, (~empty(X2)|~in(X1,X2))).
% 0.18/0.47  cnf(i_0_68, plain, (empty(X1)|element(esk6_1(X1),powerset(X1)))).
% 0.18/0.47  cnf(i_0_2, plain, (v1_xcmplx_0(X2)|~v1_membered(X1)|~element(X2,X1))).
% 0.18/0.47  cnf(i_0_4, plain, (v1_xcmplx_0(X1)|~v2_membered(X2)|~element(X1,X2))).
% 0.18/0.47  cnf(i_0_7, plain, (v1_xcmplx_0(X1)|~v3_membered(X2)|~element(X1,X2))).
% 0.18/0.47  cnf(i_0_11, plain, (v1_xcmplx_0(X1)|~v4_membered(X2)|~element(X1,X2))).
% 0.18/0.47  cnf(i_0_16, plain, (v1_xcmplx_0(X1)|~v5_membered(X2)|~element(X1,X2))).
% 0.18/0.47  cnf(i_0_3, plain, (v1_xreal_0(X1)|~v2_membered(X2)|~element(X1,X2))).
% 0.18/0.47  cnf(i_0_6, plain, (v1_xreal_0(X1)|~v3_membered(X2)|~element(X1,X2))).
% 0.18/0.47  cnf(i_0_10, plain, (v1_xreal_0(X1)|~v4_membered(X2)|~element(X1,X2))).
% 0.18/0.47  cnf(i_0_14, plain, (v1_xreal_0(X1)|~v5_membered(X2)|~element(X1,X2))).
% 0.18/0.47  cnf(i_0_5, plain, (v1_rat_1(X1)|~v3_membered(X2)|~element(X1,X2))).
% 0.18/0.47  cnf(i_0_8, plain, (v1_rat_1(X1)|~v4_membered(X2)|~element(X1,X2))).
% 0.18/0.47  cnf(i_0_12, plain, (v1_rat_1(X1)|~v5_membered(X2)|~element(X1,X2))).
% 0.18/0.47  cnf(i_0_9, plain, (v1_int_1(X1)|~v4_membered(X2)|~element(X1,X2))).
% 0.18/0.47  cnf(i_0_13, plain, (v1_int_1(X1)|~v5_membered(X2)|~element(X1,X2))).
% 0.18/0.47  cnf(i_0_15, plain, (natural(X1)|~v5_membered(X2)|~element(X1,X2))).
% 0.18/0.47  cnf(i_0_72, plain, (element(X1,X2)|~in(X1,X2))).
% 0.18/0.47  cnf(i_0_73, plain, (empty(X2)|in(X1,X2)|~element(X1,X2))).
% 0.18/0.47  cnf(i_0_74, plain, (element(X1,powerset(X2))|~subset(X1,X2))).
% 0.18/0.47  cnf(i_0_22, plain, (v1_membered(X2)|~v1_membered(X1)|~element(X2,powerset(X1)))).
% 0.18/0.47  cnf(i_0_24, plain, (v1_membered(X1)|~v2_membered(X2)|~element(X1,powerset(X2)))).
% 0.18/0.47  cnf(i_0_27, plain, (v1_membered(X1)|~v3_membered(X2)|~element(X1,powerset(X2)))).
% 0.18/0.47  cnf(i_0_31, plain, (v1_membered(X1)|~v4_membered(X2)|~element(X1,powerset(X2)))).
% 0.18/0.47  cnf(i_0_37, plain, (v1_membered(X1)|~v5_membered(X2)|~element(X1,powerset(X2)))).
% 0.18/0.47  cnf(i_0_23, plain, (v2_membered(X1)|~v2_membered(X2)|~element(X1,powerset(X2)))).
% 0.18/0.47  cnf(i_0_26, plain, (v2_membered(X1)|~v3_membered(X2)|~element(X1,powerset(X2)))).
% 0.18/0.47  cnf(i_0_30, plain, (v2_membered(X1)|~v4_membered(X2)|~element(X1,powerset(X2)))).
% 0.18/0.47  cnf(i_0_36, plain, (v2_membered(X1)|~v5_membered(X2)|~element(X1,powerset(X2)))).
% 0.18/0.47  cnf(i_0_25, plain, (v3_membered(X1)|~v3_membered(X2)|~element(X1,powerset(X2)))).
% 0.18/0.47  cnf(i_0_29, plain, (v3_membered(X1)|~v4_membered(X2)|~element(X1,powerset(X2)))).
% 0.18/0.47  cnf(i_0_35, plain, (v3_membered(X1)|~v5_membered(X2)|~element(X1,powerset(X2)))).
% 0.18/0.47  cnf(i_0_28, plain, (v4_membered(X1)|~v4_membered(X2)|~element(X1,powerset(X2)))).
% 0.18/0.47  cnf(i_0_34, plain, (v4_membered(X1)|~v5_membered(X2)|~element(X1,powerset(X2)))).
% 0.18/0.47  cnf(i_0_33, plain, (v5_membered(X1)|~v5_membered(X2)|~element(X1,powerset(X2)))).
% 0.18/0.47  cnf(i_0_1, plain, (~in(X2,X1)|~in(X1,X2))).
% 0.18/0.47  cnf(i_0_75, plain, (subset(X1,X2)|~element(X1,powerset(X2)))).
% 0.18/0.47  cnf(i_0_81, negated_conjecture, (~subset(esk10_0,topstr_closure(esk9_0,esk10_0)))).
% 0.18/0.47  cnf(i_0_42, plain, (subset(X1,X2)|in(esk1_2(X1,X2),X1))).
% 0.18/0.47  cnf(i_0_43, plain, (in(X3,X2)|~in(X3,X1)|~subset(X1,X2))).
% 0.18/0.47  cnf(i_0_85, plain, (~empty(X3)|~in(X1,X2)|~element(X2,powerset(X3)))).
% 0.18/0.47  cnf(i_0_84, plain, (element(X1,X3)|~in(X1,X2)|~element(X2,powerset(X3)))).
% 0.18/0.47  cnf(i_0_41, plain, (subset(X1,X2)|~in(esk1_2(X1,X2),X2))).
% 0.18/0.47  cnf(i_0_46, plain, (element(topstr_closure(X1,X2),powerset(the_carrier(X1)))|~top_str(X1)|~element(X2,powerset(the_carrier(X1))))).
% 0.18/0.47  cnf(i_0_77, plain, (in(X3,topstr_closure(X2,X1))|subset(X1,esk8_3(X2,X1,X3))|~top_str(X2)|~in(X3,the_carrier(X2))|~element(X1,powerset(the_carrier(X2))))).
% 0.18/0.47  cnf(i_0_78, plain, (in(X3,topstr_closure(X1,X2))|closed_subset(esk8_3(X1,X2,X3),X1)|~top_str(X1)|~in(X3,the_carrier(X1))|~element(X2,powerset(the_carrier(X1))))).
% 0.18/0.47  cnf(i_0_80, plain, (in(X1,X4)|~top_str(X2)|~subset(X3,X4)|~closed_subset(X4,X2)|~in(X1,the_carrier(X2))|~in(X1,topstr_closure(X2,X3))|~element(X4,powerset(the_carrier(X2)))|~element(X3,powerset(the_carrier(X2))))).
% 0.18/0.47  cnf(i_0_79, plain, (in(X3,topstr_closure(X1,X2))|element(esk8_3(X1,X2,X3),powerset(the_carrier(X1)))|~top_str(X1)|~in(X3,the_carrier(X1))|~element(X2,powerset(the_carrier(X1))))).
% 0.18/0.47  cnf(i_0_76, plain, (in(X1,topstr_closure(X2,X3))|~top_str(X2)|~in(X1,the_carrier(X2))|~element(X3,powerset(the_carrier(X2)))|~in(X1,esk8_3(X2,X3,X1)))).
% 0.18/0.47  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.18/0.47  # Begin printing tableau
% 0.18/0.47  # Found 5 steps
% 0.18/0.47  cnf(i_0_82, negated_conjecture, (element(esk10_0,powerset(the_carrier(esk9_0)))), inference(start_rule)).
% 0.18/0.47  cnf(i_0_90, plain, (element(esk10_0,powerset(the_carrier(esk9_0)))), inference(extension_rule, [i_0_28])).
% 0.18/0.47  cnf(i_0_387, plain, (v4_membered(esk10_0)), inference(extension_rule, [i_0_38])).
% 0.18/0.47  cnf(i_0_388, plain, (~v4_membered(the_carrier(esk9_0))), inference(etableau_closure_rule, [i_0_388, ...])).
% 0.18/0.47  cnf(i_0_1241, plain, (v3_membered(esk10_0)), inference(etableau_closure_rule, [i_0_1241, ...])).
% 0.18/0.47  # End printing tableau
% 0.18/0.47  # SZS output end
% 0.18/0.47  # Branches closed with saturation will be marked with an "s"
% 0.18/0.48  # Child (3918) has found a proof.
% 0.18/0.48  
% 0.18/0.48  # Proof search is over...
% 0.18/0.48  # Freeing feature tree
%------------------------------------------------------------------------------