%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SEU068+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 : n023.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:41 EDT 2022 % Result : Theorem 4.07s 0.83s % Output : CNFRefutation 4.07s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.09 % Problem : SEU068+1 : TPTP v8.1.0. Released v3.2.0. % 0.04/0.09 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.09/0.29 % Computer : n023.cluster.edu % 0.09/0.29 % Model : x86_64 x86_64 % 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.29 % Memory : 8042.1875MB % 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64 % 0.09/0.29 % CPULimit : 300 % 0.09/0.29 % WCLimit : 600 % 0.09/0.29 % DateTime : Sat Jun 18 19:49:04 EDT 2022 % 0.09/0.29 % CPUTime : % 0.13/0.32 # No SInE strategy applied % 0.13/0.32 # Auto-Mode selected heuristic G_E___300_C18_F1_URBAN_S0Y % 0.13/0.32 # and selection function SelectMaxLComplexAvoidPosPred. % 0.13/0.32 # % 0.13/0.32 # Number of axioms: 75 Number of unprocessed: 75 % 0.13/0.32 # Tableaux proof search. % 0.13/0.32 # APR header successfully linked. % 0.13/0.32 # Hello from C++ % 0.13/0.33 # The folding up rule is enabled... % 0.13/0.33 # Local unification is enabled... % 0.13/0.33 # Any saturation attempts will use folding labels... % 0.13/0.33 # 75 beginning clauses after preprocessing and clausification % 0.13/0.33 # Creating start rules for all 3 conjectures. % 0.13/0.33 # There are 3 start rule candidates: % 0.13/0.33 # Found 33 unit axioms. % 0.13/0.33 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.33 # 3 start rule tableaux created. % 0.13/0.33 # 42 extension rule candidate clauses % 0.13/0.33 # 33 unit axiom clauses % 0.13/0.33 % 0.13/0.33 # Requested 8, 32 cores available to the main process. % 0.13/0.33 # There are not enough tableaux to fork, creating more from the initial 3 % 0.13/0.33 # Returning from population with 22 new_tableaux and 0 remaining starting tableaux. % 0.13/0.33 # We now have 22 tableaux to operate on % 4.07/0.83 # There were 1 total branch saturation attempts. % 4.07/0.83 # There were 0 of these attempts blocked. % 4.07/0.83 # There were 0 deferred branch saturation attempts. % 4.07/0.83 # There were 0 free duplicated saturations. % 4.07/0.83 # There were 1 total successful branch saturations. % 4.07/0.83 # There were 0 successful branch saturations in interreduction. % 4.07/0.83 # There were 0 successful branch saturations on the branch. % 4.07/0.83 # There were 1 successful branch saturations after the branch. % 4.07/0.83 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 4.07/0.83 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 4.07/0.83 # Begin clausification derivation % 4.07/0.83 % 4.07/0.83 # End clausification derivation % 4.07/0.83 # Begin listing active clauses obtained from FOF to CNF conversion % 4.07/0.83 cnf(i_0_34, plain, (empty(empty_set))). % 4.07/0.83 cnf(i_0_37, plain, (empty(empty_set))). % 4.07/0.83 cnf(i_0_39, plain, (empty(empty_set))). % 4.07/0.83 cnf(i_0_47, plain, (empty(esk9_0))). % 4.07/0.83 cnf(i_0_50, plain, (empty(esk11_0))). % 4.07/0.83 cnf(i_0_52, plain, (empty(esk12_0))). % 4.07/0.83 cnf(i_0_44, plain, (function(esk8_0))). % 4.07/0.83 cnf(i_0_51, plain, (function(esk12_0))). % 4.07/0.83 cnf(i_0_60, plain, (function(esk16_0))). % 4.07/0.83 cnf(i_0_66, negated_conjecture, (function(esk20_0))). % 4.07/0.83 cnf(i_0_33, plain, (relation(empty_set))). % 4.07/0.83 cnf(i_0_38, plain, (relation(empty_set))). % 4.07/0.83 cnf(i_0_45, plain, (relation(esk8_0))). % 4.07/0.83 cnf(i_0_46, plain, (relation(esk9_0))). % 4.07/0.83 cnf(i_0_53, plain, (relation(esk12_0))). % 4.07/0.83 cnf(i_0_54, plain, (relation(esk13_0))). % 4.07/0.83 cnf(i_0_61, plain, (relation(esk16_0))). % 4.07/0.83 cnf(i_0_63, plain, (relation(esk17_0))). % 4.07/0.83 cnf(i_0_67, negated_conjecture, (relation(esk20_0))). % 4.07/0.83 cnf(i_0_59, plain, (one_to_one(esk16_0))). % 4.07/0.83 cnf(i_0_32, plain, (relation_empty_yielding(empty_set))). % 4.07/0.83 cnf(i_0_62, plain, (relation_empty_yielding(esk17_0))). % 4.07/0.83 cnf(i_0_55, plain, (~empty(esk13_0))). % 4.07/0.83 cnf(i_0_58, plain, (~empty(esk15_0))). % 4.07/0.83 cnf(i_0_75, plain, (X1=empty_set|~empty(X1))). % 4.07/0.83 cnf(i_0_56, plain, (empty(esk14_1(X1)))). % 4.07/0.83 cnf(i_0_2, plain, (function(X1)|~empty(X1))). % 4.07/0.83 cnf(i_0_3, plain, (relation(X1)|~empty(X1))). % 4.07/0.83 cnf(i_0_69, plain, (set_intersection2(X1,empty_set)=empty_set)). % 4.07/0.83 cnf(i_0_64, plain, (subset(X1,X1))). % 4.07/0.83 cnf(i_0_43, plain, (set_intersection2(X1,X1)=X1)). % 4.07/0.83 cnf(i_0_77, plain, (X1=X2|~empty(X2)|~empty(X1))). % 4.07/0.83 cnf(i_0_36, plain, (~empty(powerset(X1)))). % 4.07/0.83 cnf(i_0_42, plain, (empty(relation_dom(X1))|~empty(X1))). % 4.07/0.83 cnf(i_0_41, plain, (relation(relation_dom(X1))|~empty(X1))). % 4.07/0.83 cnf(i_0_31, plain, (element(esk7_1(X1),X1))). % 4.07/0.83 cnf(i_0_48, plain, (empty(X1)|~empty(esk10_1(X1)))). % 4.07/0.83 cnf(i_0_4, plain, (one_to_one(X1)|~empty(X1)|~function(X1)|~relation(X1))). % 4.07/0.83 cnf(i_0_57, plain, (element(esk14_1(X1),powerset(X1)))). % 4.07/0.83 cnf(i_0_7, plain, (set_intersection2(X1,X2)=set_intersection2(X2,X1))). % 4.07/0.83 cnf(i_0_40, plain, (empty(X1)|~relation(X1)|~empty(relation_dom(X1)))). % 4.07/0.83 cnf(i_0_76, plain, (~empty(X2)|~in(X1,X2))). % 4.07/0.83 cnf(i_0_49, plain, (empty(X1)|element(esk10_1(X1),powerset(X1)))). % 4.07/0.83 cnf(i_0_68, plain, (element(X1,X2)|~in(X1,X2))). % 4.07/0.83 cnf(i_0_70, plain, (empty(X2)|in(X1,X2)|~element(X1,X2))). % 4.07/0.83 cnf(i_0_71, plain, (element(X1,powerset(X2))|~subset(X1,X2))). % 4.07/0.83 cnf(i_0_35, plain, (relation(set_intersection2(X1,X2))|~relation(X2)|~relation(X1))). % 4.07/0.83 cnf(i_0_1, plain, (~in(X2,X1)|~in(X1,X2))). % 4.07/0.83 cnf(i_0_72, plain, (subset(X1,X2)|~element(X1,powerset(X2)))). % 4.07/0.83 cnf(i_0_23, plain, (subset(X1,X2)|in(esk5_2(X1,X2),X1))). % 4.07/0.83 cnf(i_0_24, plain, (in(X3,X2)|~in(X3,X1)|~subset(X1,X2))). % 4.07/0.83 cnf(i_0_29, plain, (in(X1,X2)|X3!=set_intersection2(X4,X2)|~in(X1,X3))). % 4.07/0.83 cnf(i_0_30, plain, (in(X1,X2)|X3!=set_intersection2(X2,X4)|~in(X1,X3))). % 4.07/0.83 cnf(i_0_74, plain, (~empty(X3)|~in(X1,X2)|~element(X2,powerset(X3)))). % 4.07/0.83 cnf(i_0_73, plain, (element(X1,X3)|~in(X1,X2)|~element(X2,powerset(X3)))). % 4.07/0.83 cnf(i_0_22, plain, (subset(X1,X2)|~in(esk5_2(X1,X2),X2))). % 4.07/0.83 cnf(i_0_21, plain, (in(X1,relation_dom(X2))|X3!=relation_inverse_image(X2,X4)|~function(X2)|~relation(X2)|~in(X1,X3))). % 4.07/0.83 cnf(i_0_28, plain, (in(X1,X4)|X4!=set_intersection2(X2,X3)|~in(X1,X3)|~in(X1,X2))). % 4.07/0.83 cnf(i_0_20, plain, (in(apply(X1,X2),X3)|X4!=relation_inverse_image(X1,X3)|~function(X1)|~relation(X1)|~in(X2,X4))). % 4.07/0.83 cnf(i_0_12, plain, (in(X4,X5)|X5!=relation_image(X2,X3)|X4!=apply(X2,X1)|~function(X2)|~relation(X2)|~in(X1,X3)|~in(X1,relation_dom(X2)))). % 4.07/0.83 cnf(i_0_19, plain, (in(X1,X4)|X4!=relation_inverse_image(X2,X3)|~function(X2)|~relation(X2)|~in(X1,relation_dom(X2))|~in(apply(X2,X1),X3))). % 4.07/0.83 cnf(i_0_25, plain, (X3=set_intersection2(X1,X2)|in(esk6_3(X1,X2,X3),X3)|in(esk6_3(X1,X2,X3),X2))). % 4.07/0.83 cnf(i_0_26, plain, (X3=set_intersection2(X1,X2)|in(esk6_3(X1,X2,X3),X3)|in(esk6_3(X1,X2,X3),X1))). % 4.07/0.83 cnf(i_0_9, plain, (X3=relation_image(X1,X2)|in(esk2_3(X1,X2,X3),X3)|in(esk3_3(X1,X2,X3),X2)|~function(X1)|~relation(X1))). % 4.07/0.83 cnf(i_0_10, plain, (X3=relation_image(X1,X2)|in(esk2_3(X1,X2,X3),X3)|in(esk3_3(X1,X2,X3),relation_dom(X1))|~function(X1)|~relation(X1))). % 4.07/0.83 cnf(i_0_17, plain, (X3=relation_inverse_image(X1,X2)|in(esk4_3(X1,X2,X3),X3)|in(esk4_3(X1,X2,X3),relation_dom(X1))|~function(X1)|~relation(X1))). % 4.07/0.83 cnf(i_0_8, plain, (X3=relation_image(X1,X2)|apply(X1,esk3_3(X1,X2,X3))=esk2_3(X1,X2,X3)|in(esk2_3(X1,X2,X3),X3)|~function(X1)|~relation(X1))). % 4.07/0.83 cnf(i_0_65, negated_conjecture, (~subset(relation_image(esk20_0,set_intersection2(esk18_0,relation_inverse_image(esk20_0,esk19_0))),set_intersection2(relation_image(esk20_0,esk18_0),esk19_0)))). % 4.07/0.83 cnf(i_0_11, plain, (X3=relation_image(X1,X2)|esk2_3(X1,X2,X3)!=apply(X1,X4)|~function(X1)|~relation(X1)|~in(X4,X2)|~in(X4,relation_dom(X1))|~in(esk2_3(X1,X2,X3),X3))). % 4.07/0.83 cnf(i_0_16, plain, (X3=relation_inverse_image(X1,X2)|in(esk4_3(X1,X2,X3),X3)|in(apply(X1,esk4_3(X1,X2,X3)),X2)|~function(X1)|~relation(X1))). % 4.07/0.83 cnf(i_0_14, plain, (in(esk1_4(X1,X2,X3,X4),X2)|X3!=relation_image(X1,X2)|~function(X1)|~relation(X1)|~in(X4,X3))). % 4.07/0.83 cnf(i_0_13, plain, (apply(X2,esk1_4(X2,X3,X4,X1))=X1|X4!=relation_image(X2,X3)|~function(X2)|~relation(X2)|~in(X1,X4))). % 4.07/0.83 cnf(i_0_15, plain, (in(esk1_4(X1,X2,X3,X4),relation_dom(X1))|X3!=relation_image(X1,X2)|~function(X1)|~relation(X1)|~in(X4,X3))). % 4.07/0.83 cnf(i_0_27, plain, (X3=set_intersection2(X1,X2)|~in(esk6_3(X1,X2,X3),X3)|~in(esk6_3(X1,X2,X3),X2)|~in(esk6_3(X1,X2,X3),X1))). % 4.07/0.83 cnf(i_0_18, plain, (X3=relation_inverse_image(X1,X2)|~function(X1)|~relation(X1)|~in(esk4_3(X1,X2,X3),X3)|~in(esk4_3(X1,X2,X3),relation_dom(X1))|~in(apply(X1,esk4_3(X1,X2,X3)),X2))). % 4.07/0.83 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 4.07/0.83 # Begin printing tableau % 4.07/0.83 # Found 9 steps % 4.07/0.83 cnf(i_0_67, negated_conjecture, (relation(esk20_0)), inference(start_rule)). % 4.07/0.83 cnf(i_0_79, plain, (relation(esk20_0)), inference(extension_rule, [i_0_14])). % 4.07/0.83 cnf(i_0_355, plain, (set_intersection2(relation_image(esk20_0,empty_set),relation_image(esk20_0,empty_set))!=relation_image(esk20_0,empty_set)), inference(closure_rule, [i_0_43])). % 4.07/0.83 cnf(i_0_356, plain, (~function(esk20_0)), inference(closure_rule, [i_0_66])). % 4.07/0.83 cnf(i_0_354, plain, (in(esk1_4(esk20_0,empty_set,set_intersection2(relation_image(esk20_0,empty_set),relation_image(esk20_0,empty_set)),esk7_1(set_intersection2(relation_image(esk20_0,empty_set),relation_image(esk20_0,empty_set)))),empty_set)), inference(extension_rule, [i_0_76])). % 4.07/0.83 cnf(i_0_401, plain, (~empty(empty_set)), inference(closure_rule, [i_0_34])). % 4.07/0.83 cnf(i_0_358, plain, (~in(esk7_1(set_intersection2(relation_image(esk20_0,empty_set),relation_image(esk20_0,empty_set))),set_intersection2(relation_image(esk20_0,empty_set),relation_image(esk20_0,empty_set)))), inference(extension_rule, [i_0_70])). % 4.07/0.83 cnf(i_0_431, plain, (~element(esk7_1(set_intersection2(relation_image(esk20_0,empty_set),relation_image(esk20_0,empty_set))),set_intersection2(relation_image(esk20_0,empty_set),relation_image(esk20_0,empty_set)))), inference(closure_rule, [i_0_31])). % 4.07/0.83 cnf(i_0_429, plain, (empty(set_intersection2(relation_image(esk20_0,empty_set),relation_image(esk20_0,empty_set)))), inference(etableau_closure_rule, [i_0_429, ...])). % 4.07/0.83 # End printing tableau % 4.07/0.83 # SZS output end % 4.07/0.83 # Branches closed with saturation will be marked with an "s" % 4.07/0.84 # Child (8147) has found a proof. % 4.07/0.84 % 4.07/0.84 # Proof search is over... % 4.07/0.84 # Freeing feature tree %------------------------------------------------------------------------------