%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SEU373+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 : n019.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:26:17 EDT 2022 % Result : Theorem 0.20s 0.40s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.13 % Problem : SEU373+1 : TPTP v8.1.0. Released v3.3.0. % 0.04/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.35 % Computer : n019.cluster.edu % 0.13/0.35 % Model : x86_64 x86_64 % 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.35 % Memory : 8042.1875MB % 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.35 % CPULimit : 300 % 0.13/0.35 % WCLimit : 600 % 0.13/0.35 % DateTime : Mon Jun 20 02:04:54 EDT 2022 % 0.13/0.36 % CPUTime : % 0.20/0.39 # No SInE strategy applied % 0.20/0.39 # Auto-Mode selected heuristic G_E___301_C18_F1_URBAN_S5PRR_RG_S0Y % 0.20/0.39 # and selection function SelectMaxLComplexAvoidPosPred. % 0.20/0.39 # % 0.20/0.39 # Number of axioms: 82 Number of unprocessed: 82 % 0.20/0.39 # Tableaux proof search. % 0.20/0.39 # APR header successfully linked. % 0.20/0.39 # Hello from C++ % 0.20/0.39 # The folding up rule is enabled... % 0.20/0.39 # Local unification is enabled... % 0.20/0.39 # Any saturation attempts will use folding labels... % 0.20/0.39 # 82 beginning clauses after preprocessing and clausification % 0.20/0.39 # Creating start rules for all 4 conjectures. % 0.20/0.39 # There are 4 start rule candidates: % 0.20/0.39 # Found 38 unit axioms. % 0.20/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.20/0.39 # 4 start rule tableaux created. % 0.20/0.39 # 44 extension rule candidate clauses % 0.20/0.39 # 38 unit axiom clauses % 0.20/0.39 % 0.20/0.39 # Requested 8, 32 cores available to the main process. % 0.20/0.39 # There are not enough tableaux to fork, creating more from the initial 4 % 0.20/0.39 # Returning from population with 18 new_tableaux and 0 remaining starting tableaux. % 0.20/0.39 # We now have 18 tableaux to operate on % 0.20/0.40 # There were 1 total branch saturation attempts. % 0.20/0.40 # There were 0 of these attempts blocked. % 0.20/0.40 # There were 0 deferred branch saturation attempts. % 0.20/0.40 # There were 0 free duplicated saturations. % 0.20/0.40 # There were 1 total successful branch saturations. % 0.20/0.40 # There were 0 successful branch saturations in interreduction. % 0.20/0.40 # There were 0 successful branch saturations on the branch. % 0.20/0.40 # There were 1 successful branch saturations after the branch. % 0.20/0.40 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.40 # Begin clausification derivation % 0.20/0.40 % 0.20/0.40 # End clausification derivation % 0.20/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.40 cnf(i_0_42, plain, (empty(empty_set))). % 0.20/0.40 cnf(i_0_49, plain, (empty(empty_set))). % 0.20/0.40 cnf(i_0_57, plain, (empty(esk11_0))). % 0.20/0.40 cnf(i_0_61, plain, (empty(esk13_0))). % 0.20/0.40 cnf(i_0_51, plain, (function(esk9_0))). % 0.20/0.40 cnf(i_0_53, plain, (function(esk10_0))). % 0.20/0.40 cnf(i_0_60, plain, (function(esk13_0))). % 0.20/0.40 cnf(i_0_68, plain, (function(esk16_0))). % 0.20/0.40 cnf(i_0_72, plain, (function(esk18_0))). % 0.20/0.40 cnf(i_0_41, plain, (relation(empty_set))). % 0.20/0.40 cnf(i_0_48, plain, (relation(empty_set))). % 0.20/0.40 cnf(i_0_52, plain, (relation(esk9_0))). % 0.20/0.40 cnf(i_0_55, plain, (relation(esk10_0))). % 0.20/0.40 cnf(i_0_56, plain, (relation(esk11_0))). % 0.20/0.40 cnf(i_0_62, plain, (relation(esk13_0))). % 0.20/0.40 cnf(i_0_63, plain, (relation(esk14_0))). % 0.20/0.40 cnf(i_0_69, plain, (relation(esk16_0))). % 0.20/0.40 cnf(i_0_71, plain, (relation(esk17_0))). % 0.20/0.40 cnf(i_0_74, plain, (relation(esk18_0))). % 0.20/0.40 cnf(i_0_67, plain, (one_to_one(esk16_0))). % 0.20/0.40 cnf(i_0_32, plain, (rel_str(esk1_0))). % 0.20/0.40 cnf(i_0_33, plain, (one_sorted_str(esk2_0))). % 0.20/0.40 cnf(i_0_82, negated_conjecture, (one_sorted_str(esk19_0))). % 0.20/0.40 cnf(i_0_40, plain, (relation_empty_yielding(empty_set))). % 0.20/0.40 cnf(i_0_54, plain, (relation_empty_yielding(esk10_0))). % 0.20/0.40 cnf(i_0_70, plain, (relation_empty_yielding(esk17_0))). % 0.20/0.40 cnf(i_0_73, plain, (relation_empty_yielding(esk18_0))). % 0.20/0.40 cnf(i_0_64, plain, (~empty(esk14_0))). % 0.20/0.40 cnf(i_0_89, plain, (X1=empty_set|~empty(X1))). % 0.20/0.40 cnf(i_0_65, plain, (empty(esk15_1(X1)))). % 0.20/0.40 cnf(i_0_81, negated_conjecture, (net_str(esk20_0,esk19_0))). % 0.20/0.40 cnf(i_0_2, plain, (function(X1)|~empty(X1))). % 0.20/0.40 cnf(i_0_3, plain, (relation(X1)|~empty(X1))). % 0.20/0.40 cnf(i_0_19, plain, (one_sorted_str(X1)|~rel_str(X1))). % 0.20/0.40 cnf(i_0_78, plain, (subset(X1,X1))). % 0.20/0.40 cnf(i_0_91, plain, (X1=X2|~empty(X2)|~empty(X1))). % 0.20/0.40 cnf(i_0_45, plain, (~empty(powerset(X1)))). % 0.20/0.40 cnf(i_0_36, plain, (element(esk5_1(X1),X1))). % 0.20/0.40 cnf(i_0_58, plain, (empty(X1)|~empty(esk12_1(X1)))). % 0.20/0.40 cnf(i_0_5, plain, (one_to_one(X1)|~empty(X1)|~function(X1)|~relation(X1))). % 0.20/0.40 cnf(i_0_66, plain, (element(esk15_1(X1),powerset(X1)))). % 0.20/0.40 cnf(i_0_37, plain, (subrelstr(esk6_1(X1),X1)|~rel_str(X1))). % 0.20/0.40 cnf(i_0_34, plain, (net_str(esk3_1(X1),X1)|~one_sorted_str(X1))). % 0.20/0.40 cnf(i_0_90, plain, (~empty(X2)|~in(X1,X2))). % 0.20/0.40 cnf(i_0_59, plain, (empty(X1)|element(esk12_1(X1),powerset(X1)))). % 0.20/0.40 cnf(i_0_79, negated_conjecture, (~subset(the_carrier(esk21_0),the_carrier(esk20_0)))). % 0.20/0.40 cnf(i_0_24, plain, (rel_str(X2)|~rel_str(X1)|~subrelstr(X2,X1))). % 0.20/0.40 cnf(i_0_21, plain, (rel_str(X2)|~one_sorted_str(X1)|~net_str(X2,X1))). % 0.20/0.40 cnf(i_0_83, plain, (element(X1,X2)|~in(X1,X2))). % 0.20/0.40 cnf(i_0_17, plain, (relation(relation_dom_restriction(X1,X2))|~relation(X1))). % 0.20/0.40 cnf(i_0_84, plain, (empty(X2)|in(X1,X2)|~element(X1,X2))). % 0.20/0.40 cnf(i_0_85, plain, (element(X1,powerset(X2))|~subset(X1,X2))). % 0.20/0.40 cnf(i_0_46, plain, (function(relation_dom_restriction(X1,X2))|~function(X1)|~relation(X1))). % 0.20/0.40 cnf(i_0_47, plain, (relation(relation_dom_restriction(X1,X2))|~function(X1)|~relation(X1))). % 0.20/0.40 cnf(i_0_44, plain, (relation(relation_dom_restriction(X1,X2))|~relation(X1)|~relation_empty_yielding(X1))). % 0.20/0.40 cnf(i_0_43, plain, (relation_empty_yielding(relation_dom_restriction(X1,X2))|~relation(X1)|~relation_empty_yielding(X1))). % 0.20/0.40 cnf(i_0_1, plain, (~in(X2,X1)|~in(X1,X2))). % 0.20/0.40 cnf(i_0_86, plain, (subset(X1,X2)|~element(X1,powerset(X2)))). % 0.20/0.40 cnf(i_0_80, negated_conjecture, (subnetstr(esk21_0,esk19_0,esk20_0))). % 0.20/0.40 cnf(i_0_50, plain, (empty(X2)|empty(X1)|~empty(cartesian_product2(X1,X2)))). % 0.20/0.40 cnf(i_0_31, plain, (function(the_mapping(X1,X2))|~one_sorted_str(X1)|~net_str(X2,X1))). % 0.20/0.40 cnf(i_0_88, plain, (~empty(X3)|~in(X1,X2)|~element(X2,powerset(X3)))). % 0.20/0.40 cnf(i_0_10, plain, (subset(the_carrier(X1),the_carrier(X2))|~rel_str(X2)|~rel_str(X1)|~subrelstr(X1,X2))). % 0.20/0.40 cnf(i_0_9, plain, (subset(the_InternalRel(X1),the_InternalRel(X2))|~rel_str(X2)|~rel_str(X1)|~subrelstr(X1,X2))). % 0.20/0.40 cnf(i_0_87, plain, (element(X1,X3)|~in(X1,X2)|~element(X2,powerset(X3)))). % 0.20/0.40 cnf(i_0_27, plain, (relation_of2_as_subset(the_InternalRel(X1),the_carrier(X1),the_carrier(X1))|~rel_str(X1))). % 0.20/0.40 cnf(i_0_35, plain, (relation_of2(esk4_2(X1,X2),X1,X2))). % 0.20/0.40 cnf(i_0_39, plain, (relation_of2_as_subset(esk8_2(X1,X2),X1,X2))). % 0.20/0.40 cnf(i_0_38, plain, (subnetstr(esk7_2(X1,X2),X1,X2)|~one_sorted_str(X1)|~net_str(X2,X1))). % 0.20/0.40 cnf(i_0_8, plain, (subrelstr(X1,X2)|~rel_str(X2)|~rel_str(X1)|~subset(the_carrier(X1),the_carrier(X2))|~subset(the_InternalRel(X1),the_InternalRel(X2)))). % 0.20/0.40 cnf(i_0_4, plain, (relation(X1)|~element(X1,powerset(cartesian_product2(X2,X3))))). % 0.20/0.40 cnf(i_0_29, plain, (relation_of2_as_subset(the_mapping(X1,X2),the_carrier(X2),the_carrier(X1))|~one_sorted_str(X1)|~net_str(X2,X1))). % 0.20/0.40 cnf(i_0_30, plain, (quasi_total(the_mapping(X1,X2),the_carrier(X2),the_carrier(X1))|~one_sorted_str(X1)|~net_str(X2,X1))). % 0.20/0.40 cnf(i_0_25, plain, (net_str(X3,X1)|~one_sorted_str(X1)|~net_str(X2,X1)|~subnetstr(X3,X1,X2))). % 0.20/0.40 cnf(i_0_77, plain, (relation_of2(X1,X2,X3)|~relation_of2_as_subset(X1,X2,X3))). % 0.20/0.40 cnf(i_0_76, plain, (relation_of2_as_subset(X1,X2,X3)|~relation_of2(X1,X2,X3))). % 0.20/0.40 cnf(i_0_13, plain, (subrelstr(X1,X2)|~one_sorted_str(X3)|~net_str(X2,X3)|~net_str(X1,X3)|~subnetstr(X1,X3,X2))). % 0.20/0.40 cnf(i_0_26, plain, (element(X1,powerset(cartesian_product2(X2,X3)))|~relation_of2_as_subset(X1,X2,X3))). % 0.20/0.40 cnf(i_0_75, plain, (relation_dom_restr_as_relation_of(X2,X3,X1,X4)=relation_dom_restriction(X1,X4)|~relation_of2(X1,X2,X3))). % 0.20/0.40 cnf(i_0_12, plain, (relation_dom_restr_as_relation_of(the_carrier(X3),the_carrier(X1),the_mapping(X1,X3),the_carrier(X2))=the_mapping(X1,X2)|~one_sorted_str(X1)|~net_str(X3,X1)|~net_str(X2,X1)|~subnetstr(X2,X1,X3))). % 0.20/0.40 cnf(i_0_11, plain, (subnetstr(X1,X3,X2)|relation_dom_restr_as_relation_of(the_carrier(X2),the_carrier(X3),the_mapping(X3,X2),the_carrier(X1))!=the_mapping(X3,X1)|~one_sorted_str(X3)|~subrelstr(X1,X2)|~net_str(X2,X3)|~net_str(X1,X3))). % 0.20/0.40 cnf(i_0_18, plain, (relation_of2_as_subset(relation_dom_restr_as_relation_of(X2,X3,X1,X4),X2,X3)|~relation_of2(X1,X2,X3))). % 0.20/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.40 # Begin printing tableau % 0.20/0.40 # Found 5 steps % 0.20/0.40 cnf(i_0_81, negated_conjecture, (net_str(esk20_0,esk19_0)), inference(start_rule)). % 0.20/0.40 cnf(i_0_94, plain, (net_str(esk20_0,esk19_0)), inference(extension_rule, [i_0_29])). % 0.20/0.40 cnf(i_0_433, plain, (~one_sorted_str(esk19_0)), inference(closure_rule, [i_0_82])). % 0.20/0.40 cnf(i_0_432, plain, (relation_of2_as_subset(the_mapping(esk19_0,esk20_0),the_carrier(esk20_0),the_carrier(esk19_0))), inference(extension_rule, [i_0_77])). % 0.20/0.40 cnf(i_0_690, plain, (relation_of2(the_mapping(esk19_0,esk20_0),the_carrier(esk20_0),the_carrier(esk19_0))), inference(etableau_closure_rule, [i_0_690, ...])). % 0.20/0.40 # End printing tableau % 0.20/0.40 # SZS output end % 0.20/0.40 # Branches closed with saturation will be marked with an "s" % 0.20/0.40 # Child (11182) has found a proof. % 0.20/0.40 % 0.20/0.40 # Proof search is over... % 0.20/0.40 # Freeing feature tree %------------------------------------------------------------------------------