TSTP Solution File: SEU232+3 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SEU232+3 : 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 : n004.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:03 EDT 2022
% Result : Theorem 41.98s 5.69s
% Output : CNFRefutation 41.98s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU232+3 : TPTP v8.1.0. Released v3.2.0.
% 0.06/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 : n004.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 03:44:53 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: 79 Number of unprocessed: 79
% 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.37 # The folding up rule is enabled...
% 0.13/0.37 # Local unification is enabled...
% 0.13/0.37 # Any saturation attempts will use folding labels...
% 0.13/0.37 # 79 beginning clauses after preprocessing and clausification
% 0.13/0.37 # Creating start rules for all 3 conjectures.
% 0.13/0.37 # There are 3 start rule candidates:
% 0.13/0.37 # Found 38 unit axioms.
% 0.13/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.37 # 3 start rule tableaux created.
% 0.13/0.37 # 41 extension rule candidate clauses
% 0.13/0.37 # 38 unit axiom clauses
% 0.13/0.37
% 0.13/0.37 # Requested 8, 32 cores available to the main process.
% 0.13/0.37 # There are not enough tableaux to fork, creating more from the initial 3
% 0.13/0.37 # Returning from population with 22 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.37 # We now have 22 tableaux to operate on
% 41.98/5.69 # There were 1 total branch saturation attempts.
% 41.98/5.69 # There were 0 of these attempts blocked.
% 41.98/5.69 # There were 0 deferred branch saturation attempts.
% 41.98/5.69 # There were 0 free duplicated saturations.
% 41.98/5.69 # There were 1 total successful branch saturations.
% 41.98/5.69 # There were 0 successful branch saturations in interreduction.
% 41.98/5.69 # There were 0 successful branch saturations on the branch.
% 41.98/5.69 # There were 1 successful branch saturations after the branch.
% 41.98/5.69 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 41.98/5.69 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 41.98/5.69 # Begin clausification derivation
% 41.98/5.69
% 41.98/5.69 # End clausification derivation
% 41.98/5.69 # Begin listing active clauses obtained from FOF to CNF conversion
% 41.98/5.69 cnf(i_0_34, plain, (empty(empty_set))).
% 41.98/5.69 cnf(i_0_35, plain, (empty(empty_set))).
% 41.98/5.69 cnf(i_0_38, plain, (empty(empty_set))).
% 41.98/5.69 cnf(i_0_45, plain, (empty(esk9_0))).
% 41.98/5.69 cnf(i_0_46, plain, (empty(esk10_0))).
% 41.98/5.69 cnf(i_0_48, plain, (empty(esk11_0))).
% 41.98/5.69 cnf(i_0_39, plain, (function(esk7_0))).
% 41.98/5.69 cnf(i_0_47, plain, (function(esk11_0))).
% 41.98/5.69 cnf(i_0_54, plain, (function(esk14_0))).
% 41.98/5.69 cnf(i_0_58, plain, (function(esk16_0))).
% 41.98/5.69 cnf(i_0_61, plain, (function(esk17_0))).
% 41.98/5.69 cnf(i_0_41, plain, (ordinal(esk8_0))).
% 41.98/5.69 cnf(i_0_68, negated_conjecture, (ordinal(esk19_0))).
% 41.98/5.69 cnf(i_0_43, plain, (epsilon_transitive(esk8_0))).
% 41.98/5.69 cnf(i_0_42, plain, (epsilon_connected(esk8_0))).
% 41.98/5.69 cnf(i_0_33, plain, (relation(empty_set))).
% 41.98/5.69 cnf(i_0_37, plain, (relation(empty_set))).
% 41.98/5.69 cnf(i_0_40, plain, (relation(esk7_0))).
% 41.98/5.69 cnf(i_0_44, plain, (relation(esk9_0))).
% 41.98/5.69 cnf(i_0_49, plain, (relation(esk11_0))).
% 41.98/5.69 cnf(i_0_50, plain, (relation(esk12_0))).
% 41.98/5.69 cnf(i_0_55, plain, (relation(esk14_0))).
% 41.98/5.69 cnf(i_0_57, plain, (relation(esk15_0))).
% 41.98/5.69 cnf(i_0_60, plain, (relation(esk16_0))).
% 41.98/5.69 cnf(i_0_63, plain, (relation(esk17_0))).
% 41.98/5.69 cnf(i_0_53, plain, (one_to_one(esk14_0))).
% 41.98/5.69 cnf(i_0_32, plain, (relation_empty_yielding(empty_set))).
% 41.98/5.69 cnf(i_0_56, plain, (relation_empty_yielding(esk15_0))).
% 41.98/5.69 cnf(i_0_59, plain, (relation_empty_yielding(esk16_0))).
% 41.98/5.69 cnf(i_0_62, plain, (relation_non_empty(esk17_0))).
% 41.98/5.69 cnf(i_0_51, plain, (~empty(esk12_0))).
% 41.98/5.69 cnf(i_0_52, plain, (~empty(esk13_0))).
% 41.98/5.69 cnf(i_0_66, negated_conjecture, (~ordinal(esk18_0))).
% 41.98/5.69 cnf(i_0_77, plain, (X1=empty_set|~empty(X1))).
% 41.98/5.69 cnf(i_0_67, negated_conjecture, (in(esk18_0,esk19_0))).
% 41.98/5.69 cnf(i_0_2, plain, (function(X1)|~empty(X1))).
% 41.98/5.69 cnf(i_0_4, plain, (epsilon_transitive(X1)|~ordinal(X1))).
% 41.98/5.69 cnf(i_0_24, plain, (epsilon_transitive(X1)|~ordinal(X1))).
% 41.98/5.69 cnf(i_0_3, plain, (epsilon_connected(X1)|~ordinal(X1))).
% 41.98/5.69 cnf(i_0_23, plain, (epsilon_connected(X1)|~ordinal(X1))).
% 41.98/5.69 cnf(i_0_5, plain, (relation(X1)|~empty(X1))).
% 41.98/5.69 cnf(i_0_74, plain, (set_difference(empty_set,X1)=empty_set)).
% 41.98/5.69 cnf(i_0_70, plain, (set_difference(X1,empty_set)=X1)).
% 41.98/5.69 cnf(i_0_64, plain, (subset(X1,X1))).
% 41.98/5.69 cnf(i_0_81, plain, (X1=X2|~empty(X2)|~empty(X1))).
% 41.98/5.69 cnf(i_0_14, plain, (epsilon_connected(X1)|esk3_1(X1)!=esk2_1(X1))).
% 41.98/5.69 cnf(i_0_9, plain, (ordinal(X1)|~epsilon_transitive(X1)|~epsilon_connected(X1))).
% 41.98/5.69 cnf(i_0_22, plain, (ordinal(X1)|~epsilon_transitive(X1)|~epsilon_connected(X1))).
% 41.98/5.69 cnf(i_0_31, plain, (element(esk6_1(X1),X1))).
% 41.98/5.69 cnf(i_0_11, plain, (epsilon_transitive(X1)|in(esk1_1(X1),X1))).
% 41.98/5.69 cnf(i_0_17, plain, (epsilon_connected(X1)|in(esk2_1(X1),X1))).
% 41.98/5.69 cnf(i_0_16, plain, (epsilon_connected(X1)|in(esk3_1(X1),X1))).
% 41.98/5.69 cnf(i_0_6, plain, (one_to_one(X1)|~empty(X1)|~function(X1)|~relation(X1))).
% 41.98/5.69 cnf(i_0_78, plain, (~empty(X2)|~in(X1,X2))).
% 41.98/5.69 cnf(i_0_10, plain, (epsilon_transitive(X1)|~subset(esk1_1(X1),X1))).
% 41.98/5.69 cnf(i_0_65, plain, (element(X1,X2)|~in(X1,X2))).
% 41.98/5.69 cnf(i_0_69, plain, (empty(X2)|in(X1,X2)|~element(X1,X2))).
% 41.98/5.69 cnf(i_0_72, plain, (element(X1,powerset(X2))|~subset(X1,X2))).
% 41.98/5.69 cnf(i_0_12, plain, (subset(X2,X1)|~epsilon_transitive(X1)|~in(X2,X1))).
% 41.98/5.69 cnf(i_0_36, plain, (relation(set_difference(X1,X2))|~relation(X2)|~relation(X1))).
% 41.98/5.69 cnf(i_0_1, plain, (~in(X2,X1)|~in(X1,X2))).
% 41.98/5.69 cnf(i_0_15, plain, (epsilon_connected(X1)|~in(esk2_1(X1),esk3_1(X1)))).
% 41.98/5.69 cnf(i_0_13, plain, (epsilon_connected(X1)|~in(esk3_1(X1),esk2_1(X1)))).
% 41.98/5.69 cnf(i_0_73, plain, (subset(X1,X2)|~element(X1,powerset(X2)))).
% 41.98/5.69 cnf(i_0_20, plain, (subset(X1,X2)|in(esk4_2(X1,X2),X1))).
% 41.98/5.69 cnf(i_0_21, plain, (in(X3,X2)|~in(X3,X1)|~subset(X1,X2))).
% 41.98/5.69 cnf(i_0_30, plain, (in(X1,X2)|X3!=set_difference(X2,X4)|~in(X1,X3))).
% 41.98/5.69 cnf(i_0_76, plain, (~empty(X3)|~in(X1,X2)|~element(X2,powerset(X3)))).
% 41.98/5.69 cnf(i_0_80, plain, (in(esk20_2(X1,X2),X2)|~in(X1,X2))).
% 41.98/5.69 cnf(i_0_71, plain, (~in(X3,X1)|~in(X2,X3)|~in(X1,X2))).
% 41.98/5.69 cnf(i_0_29, plain, (X3!=set_difference(X4,X2)|~in(X1,X3)|~in(X1,X2))).
% 41.98/5.69 cnf(i_0_75, plain, (element(X1,X3)|~in(X1,X2)|~element(X2,powerset(X3)))).
% 41.98/5.69 cnf(i_0_28, plain, (in(X1,X4)|in(X1,X3)|X4!=set_difference(X2,X3)|~in(X1,X2))).
% 41.98/5.69 cnf(i_0_19, plain, (subset(X1,X2)|~in(esk4_2(X1,X2),X2))).
% 41.98/5.69 cnf(i_0_18, plain, (X2=X3|in(X3,X2)|in(X2,X3)|~epsilon_connected(X1)|~in(X3,X1)|~in(X2,X1))).
% 41.98/5.69 cnf(i_0_79, plain, (~in(X3,X2)|~in(X1,X2)|~in(X1,esk20_2(X3,X2)))).
% 41.98/5.69 cnf(i_0_26, plain, (X3=set_difference(X1,X2)|in(esk5_3(X1,X2,X3),X3)|in(esk5_3(X1,X2,X3),X1))).
% 41.98/5.69 cnf(i_0_25, plain, (X3=set_difference(X1,X2)|in(esk5_3(X1,X2,X3),X3)|~in(esk5_3(X1,X2,X3),X2))).
% 41.98/5.69 cnf(i_0_27, plain, (X3=set_difference(X1,X2)|in(esk5_3(X1,X2,X3),X2)|~in(esk5_3(X1,X2,X3),X3)|~in(esk5_3(X1,X2,X3),X1))).
% 41.98/5.69 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 41.98/5.69 # Begin printing tableau
% 41.98/5.69 # Found 5 steps
% 41.98/5.69 cnf(i_0_68, negated_conjecture, (ordinal(esk19_0)), inference(start_rule)).
% 41.98/5.69 cnf(i_0_84, plain, (ordinal(esk19_0)), inference(extension_rule, [i_0_4])).
% 41.98/5.69 cnf(i_0_196, plain, (epsilon_transitive(esk19_0)), inference(extension_rule, [i_0_12])).
% 41.98/5.69 cnf(i_0_244, plain, (~in(esk18_0,esk19_0)), inference(closure_rule, [i_0_67])).
% 41.98/5.69 cnf(i_0_242, plain, (subset(esk18_0,esk19_0)), inference(etableau_closure_rule, [i_0_242, ...])).
% 41.98/5.69 # End printing tableau
% 41.98/5.69 # SZS output end
% 41.98/5.69 # Branches closed with saturation will be marked with an "s"
% 41.98/5.70 # Child (15438) has found a proof.
% 41.98/5.70
% 41.98/5.70 # Proof search is over...
% 41.98/5.70 # Freeing feature tree
%------------------------------------------------------------------------------