TSTP Solution File: SEU306+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SEU306+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 : n014.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:42 EDT 2022
% Result : Theorem 0.13s 0.38s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEU306+1 : TPTP v8.1.0. Released v3.3.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 : n014.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 07:42:03 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.38 # No SInE strategy applied
% 0.13/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.38 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.13/0.38 #
% 0.13/0.38 # Presaturation interreduction done
% 0.13/0.38 # Number of axioms: 73 Number of unprocessed: 73
% 0.13/0.38 # Tableaux proof search.
% 0.13/0.38 # APR header successfully linked.
% 0.13/0.38 # 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 # 73 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 20 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 # 53 extension rule candidate clauses
% 0.13/0.38 # 20 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 # Closed tableau found in foldup close cycle with 0 folds and 1 closures done.
% 0.13/0.38 # There were 0 total branch saturation attempts.
% 0.13/0.38 # There were 0 of these attempts blocked.
% 0.13/0.38 # There were 0 deferred branch saturation attempts.
% 0.13/0.38 # There were 0 free duplicated saturations.
% 0.13/0.38 # There were 0 total successful branch saturations.
% 0.13/0.38 # There were 0 successful branch saturations in interreduction.
% 0.13/0.38 # There were 0 successful branch saturations on the branch.
% 0.13/0.38 # There were 0 successful branch saturations after the branch.
% 0.13/0.38 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.38 # Begin clausification derivation
% 0.13/0.38
% 0.13/0.38 # End clausification derivation
% 0.13/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.38 cnf(i_0_78, negated_conjecture, (one_sorted_str(esk6_0))).
% 0.13/0.38 cnf(i_0_72, plain, (one_sorted_str(esk5_0))).
% 0.13/0.38 cnf(i_0_28, plain, (v5_membered(empty_set))).
% 0.13/0.38 cnf(i_0_7, plain, (v5_membered(esk1_0))).
% 0.13/0.38 cnf(i_0_29, plain, (v4_membered(empty_set))).
% 0.13/0.38 cnf(i_0_8, plain, (v4_membered(esk1_0))).
% 0.13/0.38 cnf(i_0_30, plain, (v3_membered(empty_set))).
% 0.13/0.38 cnf(i_0_9, plain, (v3_membered(esk1_0))).
% 0.13/0.38 cnf(i_0_31, plain, (v2_membered(empty_set))).
% 0.13/0.38 cnf(i_0_10, plain, (v2_membered(esk1_0))).
% 0.13/0.38 cnf(i_0_32, plain, (v1_membered(empty_set))).
% 0.13/0.38 cnf(i_0_11, plain, (v1_membered(esk1_0))).
% 0.13/0.38 cnf(i_0_33, plain, (empty(empty_set))).
% 0.13/0.38 cnf(i_0_55, plain, (empty(esk3_1(X1)))).
% 0.13/0.38 cnf(i_0_52, plain, (subset(X1,X1))).
% 0.13/0.38 cnf(i_0_66, plain, (element(esk4_1(X1),X1))).
% 0.13/0.38 cnf(i_0_56, plain, (element(esk3_1(X1),powerset(X1)))).
% 0.13/0.38 cnf(i_0_77, negated_conjecture, (cast_as_carrier_subset(esk6_0)!=the_carrier(esk6_0))).
% 0.13/0.38 cnf(i_0_12, plain, (~empty(esk1_0))).
% 0.13/0.38 cnf(i_0_69, plain, (~empty(powerset(X1)))).
% 0.13/0.38 cnf(i_0_64, plain, (~empty(X1)|~in(X2,X1))).
% 0.13/0.38 cnf(i_0_57, plain, (v5_membered(X1)|~empty(X1))).
% 0.13/0.38 cnf(i_0_3, plain, (v4_membered(X1)|~v5_membered(X1))).
% 0.13/0.38 cnf(i_0_58, plain, (v4_membered(X1)|~empty(X1))).
% 0.13/0.38 cnf(i_0_4, plain, (v3_membered(X1)|~v4_membered(X1))).
% 0.13/0.38 cnf(i_0_76, plain, (cast_as_carrier_subset(X1)=the_carrier(X1)|~one_sorted_str(X1))).
% 0.13/0.38 cnf(i_0_63, plain, (X1=empty_set|~empty(X1))).
% 0.13/0.38 cnf(i_0_59, plain, (v3_membered(X1)|~empty(X1))).
% 0.13/0.38 cnf(i_0_5, plain, (v2_membered(X1)|~v3_membered(X1))).
% 0.13/0.38 cnf(i_0_60, plain, (v2_membered(X1)|~empty(X1))).
% 0.13/0.38 cnf(i_0_6, plain, (v1_membered(X1)|~v2_membered(X1))).
% 0.13/0.38 cnf(i_0_61, plain, (v1_membered(X1)|~empty(X1))).
% 0.13/0.38 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))).
% 0.13/0.38 cnf(i_0_53, plain, (empty(X1)|~empty(esk2_1(X1)))).
% 0.13/0.38 cnf(i_0_49, plain, (element(X1,X2)|~in(X1,X2))).
% 0.13/0.38 cnf(i_0_65, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 0.13/0.38 cnf(i_0_70, plain, (element(X1,powerset(X2))|~subset(X1,X2))).
% 0.13/0.38 cnf(i_0_73, plain, (element(cast_as_carrier_subset(X1),powerset(the_carrier(X1)))|~one_sorted_str(X1))).
% 0.13/0.38 cnf(i_0_71, plain, (subset(X1,X2)|~element(X1,powerset(X2)))).
% 0.13/0.38 cnf(i_0_54, plain, (element(esk2_1(X1),powerset(X1))|empty(X1))).
% 0.13/0.38 cnf(i_0_51, plain, (~element(X1,powerset(X2))|~empty(X2)|~in(X3,X1))).
% 0.13/0.38 cnf(i_0_13, plain, (v1_xcmplx_0(X1)|~element(X1,X2)|~v1_membered(X2))).
% 0.13/0.38 cnf(i_0_27, plain, (v1_xcmplx_0(X1)|~element(X1,X2)|~v5_membered(X2))).
% 0.13/0.38 cnf(i_0_22, plain, (v1_xcmplx_0(X1)|~element(X1,X2)|~v4_membered(X2))).
% 0.13/0.38 cnf(i_0_62, plain, (empty(X1)|in(X2,X1)|~element(X2,X1))).
% 0.13/0.38 cnf(i_0_18, plain, (v1_xcmplx_0(X1)|~element(X1,X2)|~v3_membered(X2))).
% 0.13/0.38 cnf(i_0_15, plain, (v1_xcmplx_0(X1)|~element(X1,X2)|~v2_membered(X2))).
% 0.13/0.38 cnf(i_0_25, plain, (v1_xreal_0(X1)|~element(X1,X2)|~v5_membered(X2))).
% 0.13/0.38 cnf(i_0_21, plain, (v1_xreal_0(X1)|~element(X1,X2)|~v4_membered(X2))).
% 0.13/0.38 cnf(i_0_17, plain, (v1_xreal_0(X1)|~element(X1,X2)|~v3_membered(X2))).
% 0.13/0.38 cnf(i_0_14, plain, (v1_xreal_0(X1)|~element(X1,X2)|~v2_membered(X2))).
% 0.13/0.38 cnf(i_0_23, plain, (v1_rat_1(X1)|~element(X1,X2)|~v5_membered(X2))).
% 0.13/0.38 cnf(i_0_19, plain, (v1_rat_1(X1)|~element(X1,X2)|~v4_membered(X2))).
% 0.13/0.38 cnf(i_0_16, plain, (v1_rat_1(X1)|~element(X1,X2)|~v3_membered(X2))).
% 0.13/0.38 cnf(i_0_24, plain, (v1_int_1(X1)|~element(X1,X2)|~v5_membered(X2))).
% 0.13/0.38 cnf(i_0_20, plain, (v1_int_1(X1)|~element(X1,X2)|~v4_membered(X2))).
% 0.13/0.38 cnf(i_0_26, plain, (natural(X1)|~element(X1,X2)|~v5_membered(X2))).
% 0.13/0.38 cnf(i_0_44, plain, (v5_membered(X1)|~element(X1,powerset(X2))|~v5_membered(X2))).
% 0.13/0.38 cnf(i_0_45, plain, (v4_membered(X1)|~element(X1,powerset(X2))|~v5_membered(X2))).
% 0.13/0.38 cnf(i_0_40, plain, (v4_membered(X1)|~element(X1,powerset(X2))|~v4_membered(X2))).
% 0.13/0.38 cnf(i_0_46, plain, (v3_membered(X1)|~element(X1,powerset(X2))|~v5_membered(X2))).
% 0.13/0.38 cnf(i_0_41, plain, (v3_membered(X1)|~element(X1,powerset(X2))|~v4_membered(X2))).
% 0.13/0.38 cnf(i_0_37, plain, (v3_membered(X1)|~element(X1,powerset(X2))|~v3_membered(X2))).
% 0.13/0.38 cnf(i_0_47, plain, (v2_membered(X1)|~element(X1,powerset(X2))|~v5_membered(X2))).
% 0.13/0.38 cnf(i_0_42, plain, (v2_membered(X1)|~element(X1,powerset(X2))|~v4_membered(X2))).
% 0.13/0.38 cnf(i_0_38, plain, (v2_membered(X1)|~element(X1,powerset(X2))|~v3_membered(X2))).
% 0.13/0.38 cnf(i_0_35, plain, (v2_membered(X1)|~element(X1,powerset(X2))|~v2_membered(X2))).
% 0.13/0.38 cnf(i_0_34, plain, (v1_membered(X1)|~element(X1,powerset(X2))|~v1_membered(X2))).
% 0.13/0.38 cnf(i_0_48, plain, (v1_membered(X1)|~element(X1,powerset(X2))|~v5_membered(X2))).
% 0.13/0.38 cnf(i_0_43, plain, (v1_membered(X1)|~element(X1,powerset(X2))|~v4_membered(X2))).
% 0.13/0.38 cnf(i_0_39, plain, (v1_membered(X1)|~element(X1,powerset(X2))|~v3_membered(X2))).
% 0.13/0.38 cnf(i_0_36, plain, (v1_membered(X1)|~element(X1,powerset(X2))|~v2_membered(X2))).
% 0.13/0.38 cnf(i_0_50, plain, (element(X1,X2)|~element(X3,powerset(X2))|~in(X1,X3))).
% 0.13/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.13/0.38 # Begin printing tableau
% 0.13/0.38 # Found 3 steps
% 0.13/0.38 cnf(i_0_77, negated_conjecture, (cast_as_carrier_subset(esk6_0)!=the_carrier(esk6_0)), inference(start_rule)).
% 0.13/0.38 cnf(i_0_79, plain, (cast_as_carrier_subset(esk6_0)!=the_carrier(esk6_0)), inference(extension_rule, [i_0_76])).
% 0.13/0.38 cnf(i_0_92, plain, (~one_sorted_str(esk6_0)), inference(closure_rule, [i_0_78])).
% 0.13/0.38 # End printing tableau
% 0.13/0.38 # SZS output end
% 0.13/0.38 # Branches closed with saturation will be marked with an "s"
% 0.13/0.38 # Returning from population with 2 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.38 # We now have 2 tableaux to operate on
% 0.13/0.38 # Found closed tableau during pool population.
% 0.13/0.38 # Proof search is over...
% 0.13/0.38 # Freeing feature tree
%------------------------------------------------------------------------------