%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SEU101+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 : n028.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:49 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.11/0.12 % Problem : SEU101+1 : TPTP v8.1.0. Released v3.2.0. % 0.11/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 : n028.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 : Sun Jun 19 22:53:16 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.37 # No SInE strategy applied % 0.12/0.37 # Auto-Mode selected heuristic G_E___208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.12/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.12/0.37 # % 0.12/0.37 # Presaturation interreduction done % 0.12/0.37 # Number of axioms: 73 Number of unprocessed: 70 % 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 # 70 beginning clauses after preprocessing and clausification % 0.12/0.37 # Creating start rules for all 5 conjectures. % 0.12/0.37 # There are 5 start rule candidates: % 0.12/0.37 # Found 30 unit axioms. % 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.37 # 5 start rule tableaux created. % 0.12/0.37 # 40 extension rule candidate clauses % 0.12/0.37 # 30 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 5 % 0.12/0.37 # Returning from population with 20 new_tableaux and 0 remaining starting tableaux. % 0.12/0.37 # We now have 20 tableaux to operate on % 0.18/0.41 # There were 4 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 4 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 4 successful branch saturations after the branch. % 0.18/0.41 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.18/0.41 # SZS output start for /export/starexec/sandbox2/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_29, plain, (preboolean(esk7_0))). % 0.18/0.41 cnf(i_0_22, plain, (empty(empty_set))). % 0.18/0.41 cnf(i_0_36, plain, (empty(esk9_0))). % 0.18/0.41 cnf(i_0_27, plain, (finite(esk6_0))). % 0.18/0.41 cnf(i_0_32, plain, (cup_closed(esk7_0))). % 0.18/0.41 cnf(i_0_30, plain, (diff_closed(esk7_0))). % 0.18/0.41 cnf(i_0_31, plain, (cap_closed(esk7_0))). % 0.18/0.41 cnf(i_0_68, plain, (set_difference(empty_set,X1)=empty_set)). % 0.18/0.41 cnf(i_0_62, plain, (set_union2(X1,empty_set)=X1)). % 0.18/0.41 cnf(i_0_65, plain, (set_difference(X1,empty_set)=X1)). % 0.18/0.41 cnf(i_0_26, plain, (set_union2(X1,X1)=X1)). % 0.18/0.41 cnf(i_0_45, plain, (empty(esk10_1(X1)))). % 0.18/0.41 cnf(i_0_47, plain, (empty(esk11_1(X1)))). % 0.18/0.41 cnf(i_0_56, plain, (subset(X1,X1))). % 0.18/0.41 cnf(i_0_37, plain, (finite(esk10_1(X1)))). % 0.18/0.41 cnf(i_0_44, plain, (relation(esk10_1(X1)))). % 0.18/0.41 cnf(i_0_43, plain, (function(esk10_1(X1)))). % 0.18/0.41 cnf(i_0_42, plain, (one_to_one(esk10_1(X1)))). % 0.18/0.41 cnf(i_0_41, plain, (epsilon_transitive(esk10_1(X1)))). % 0.18/0.41 cnf(i_0_40, plain, (epsilon_connected(esk10_1(X1)))). % 0.18/0.41 cnf(i_0_39, plain, (ordinal(esk10_1(X1)))). % 0.18/0.41 cnf(i_0_38, plain, (natural(esk10_1(X1)))). % 0.18/0.41 cnf(i_0_19, plain, (element(esk5_1(X1),X1))). % 0.18/0.41 cnf(i_0_46, plain, (element(esk10_1(X1),powerset(X1)))). % 0.18/0.41 cnf(i_0_48, plain, (element(esk11_1(X1),powerset(X1)))). % 0.18/0.41 cnf(i_0_7, plain, (set_union2(X1,X2)=set_union2(X2,X1))). % 0.18/0.41 cnf(i_0_28, plain, (~empty(esk6_0))). % 0.18/0.41 cnf(i_0_33, plain, (~empty(esk7_0))). % 0.18/0.41 cnf(i_0_49, plain, (~empty(esk12_0))). % 0.18/0.41 cnf(i_0_21, plain, (~empty(powerset(X1)))). % 0.18/0.41 cnf(i_0_61, negated_conjecture, (in(esk16_0,esk15_0)|~preboolean(esk15_0))). % 0.18/0.41 cnf(i_0_60, negated_conjecture, (in(esk17_0,esk15_0)|~preboolean(esk15_0))). % 0.18/0.41 cnf(i_0_59, negated_conjecture, (~preboolean(esk15_0)|~in(set_union2(esk16_0,esk17_0),esk15_0)|~in(set_difference(esk16_0,esk17_0),esk15_0))). % 0.18/0.41 cnf(i_0_72, plain, (~empty(X1)|~in(X2,X1))). % 0.18/0.41 cnf(i_0_4, plain, (cup_closed(X1)|~preboolean(X1))). % 0.18/0.41 cnf(i_0_71, plain, (X1=empty_set|~empty(X1))). % 0.18/0.41 cnf(i_0_3, plain, (diff_closed(X1)|~preboolean(X1))). % 0.18/0.41 cnf(i_0_2, plain, (finite(X1)|~empty(X1))). % 0.18/0.41 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))). % 0.18/0.41 cnf(i_0_6, plain, (preboolean(X1)|~diff_closed(X1)|~cup_closed(X1))). % 0.18/0.41 cnf(i_0_34, plain, (empty(X1)|~empty(esk8_1(X1)))). % 0.18/0.41 cnf(i_0_51, plain, (empty(X1)|~empty(esk13_1(X1)))). % 0.18/0.41 cnf(i_0_54, plain, (empty(X1)|~empty(esk14_1(X1)))). % 0.18/0.41 cnf(i_0_63, plain, (element(X1,X2)|~in(X1,X2))). % 0.18/0.41 cnf(i_0_24, plain, (empty(X1)|~empty(set_union2(X2,X1)))). % 0.18/0.41 cnf(i_0_23, plain, (empty(X1)|~empty(set_union2(X1,X2)))). % 0.18/0.41 cnf(i_0_58, negated_conjecture, (preboolean(esk15_0)|in(set_union2(X1,X2),esk15_0)|~in(X2,esk15_0)|~in(X1,esk15_0))). % 0.18/0.41 cnf(i_0_57, negated_conjecture, (preboolean(esk15_0)|in(set_difference(X1,X2),esk15_0)|~in(X2,esk15_0)|~in(X1,esk15_0))). % 0.18/0.41 cnf(i_0_20, plain, (finite(set_difference(X1,X2))|~finite(X1))). % 0.18/0.41 cnf(i_0_50, plain, (finite(esk13_1(X1))|empty(X1))). % 0.18/0.41 cnf(i_0_53, plain, (finite(esk14_1(X1))|empty(X1))). % 0.18/0.41 cnf(i_0_67, plain, (subset(X1,X2)|~element(X1,powerset(X2)))). % 0.18/0.41 cnf(i_0_5, plain, (finite(X1)|~element(X1,powerset(X2))|~finite(X2))). % 0.18/0.41 cnf(i_0_70, plain, (~element(X1,powerset(X2))|~empty(X2)|~in(X3,X1))). % 0.18/0.41 cnf(i_0_73, plain, (X1=X2|~empty(X2)|~empty(X1))). % 0.18/0.41 cnf(i_0_10, plain, (cup_closed(X1)|in(esk1_1(X1),X1))). % 0.18/0.41 cnf(i_0_9, plain, (cup_closed(X1)|in(esk2_1(X1),X1))). % 0.18/0.41 cnf(i_0_14, plain, (diff_closed(X1)|in(esk3_1(X1),X1))). % 0.18/0.41 cnf(i_0_13, plain, (diff_closed(X1)|in(esk4_1(X1),X1))). % 0.18/0.41 cnf(i_0_66, plain, (element(X1,powerset(X2))|~subset(X1,X2))). % 0.18/0.41 cnf(i_0_8, plain, (cup_closed(X1)|~in(set_union2(esk1_1(X1),esk2_1(X1)),X1))). % 0.18/0.41 cnf(i_0_12, plain, (diff_closed(X1)|~in(set_difference(esk3_1(X1),esk4_1(X1)),X1))). % 0.18/0.41 cnf(i_0_64, plain, (empty(X1)|in(X2,X1)|~element(X2,X1))). % 0.18/0.41 cnf(i_0_35, plain, (element(esk8_1(X1),powerset(X1))|empty(X1))). % 0.18/0.41 cnf(i_0_25, plain, (finite(set_union2(X1,X2))|~finite(X2)|~finite(X1))). % 0.18/0.41 cnf(i_0_11, plain, (in(set_union2(X1,X2),X3)|~cup_closed(X3)|~in(X2,X3)|~in(X1,X3))). % 0.18/0.41 cnf(i_0_15, plain, (in(set_difference(X1,X2),X3)|~diff_closed(X3)|~in(X2,X3)|~in(X1,X3))). % 0.18/0.41 cnf(i_0_52, plain, (element(esk13_1(X1),powerset(X1))|empty(X1))). % 0.18/0.41 cnf(i_0_55, plain, (element(esk14_1(X1),powerset(X1))|empty(X1))). % 0.18/0.41 cnf(i_0_69, plain, (element(X1,X2)|~element(X3,powerset(X2))|~in(X1,X3))). % 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 7 steps % 0.18/0.41 cnf(i_0_59, negated_conjecture, (~preboolean(esk15_0)|~in(set_union2(esk16_0,esk17_0),esk15_0)|~in(set_difference(esk16_0,esk17_0),esk15_0)), inference(start_rule)). % 0.18/0.41 cnf(i_0_82, plain, (~preboolean(esk15_0)), inference(extension_rule, [i_0_6])). % 0.18/0.41 cnf(i_0_294, plain, (~diff_closed(esk15_0)), inference(extension_rule, [i_0_14])). % 0.18/0.41 cnf(i_0_83, plain, (~in(set_union2(esk16_0,esk17_0),esk15_0)), inference(etableau_closure_rule, [i_0_83, ...])). % 0.18/0.41 cnf(i_0_84, plain, (~in(set_difference(esk16_0,esk17_0),esk15_0)), inference(etableau_closure_rule, [i_0_84, ...])). % 0.18/0.41 cnf(i_0_295, plain, (~cup_closed(esk15_0)), inference(etableau_closure_rule, [i_0_295, ...])). % 0.18/0.41 cnf(i_0_342, plain, (in(esk3_1(esk15_0),esk15_0)), inference(etableau_closure_rule, [i_0_342, ...])). % 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 (1147) has found a proof. % 0.18/0.41 % 0.18/0.41 # Proof search is over... % 0.18/0.41 # Freeing feature tree %------------------------------------------------------------------------------