%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SEU227+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 : n012.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:24:59 EDT 2022 % Result : Theorem 6.98s 1.29s % Output : CNFRefutation 6.98s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SEU227+3 : TPTP v8.1.0. Released v3.2.0. % 0.03/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.14/0.34 % Computer : n012.cluster.edu % 0.14/0.34 % Model : x86_64 x86_64 % 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.34 % Memory : 8042.1875MB % 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.34 % CPULimit : 300 % 0.14/0.34 % WCLimit : 600 % 0.14/0.34 % DateTime : Mon Jun 20 01:15:52 EDT 2022 % 0.14/0.34 % CPUTime : % 0.20/0.37 # No SInE strategy applied % 0.20/0.37 # Auto-Mode selected heuristic G_E___301_C18_F1_URBAN_S5PRR_RG_S0Y % 0.20/0.37 # and selection function SelectMaxLComplexAvoidPosPred. % 0.20/0.37 # % 0.20/0.37 # Number of axioms: 71 Number of unprocessed: 71 % 0.20/0.37 # Tableaux proof search. % 0.20/0.37 # APR header successfully linked. % 0.20/0.37 # Hello from C++ % 0.20/0.38 # The folding up rule is enabled... % 0.20/0.38 # Local unification is enabled... % 0.20/0.38 # Any saturation attempts will use folding labels... % 0.20/0.38 # 71 beginning clauses after preprocessing and clausification % 0.20/0.38 # Creating start rules for all 3 conjectures. % 0.20/0.38 # There are 3 start rule candidates: % 0.20/0.38 # Found 34 unit axioms. % 0.20/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.20/0.38 # 3 start rule tableaux created. % 0.20/0.38 # 37 extension rule candidate clauses % 0.20/0.38 # 34 unit axiom clauses % 0.20/0.38 % 0.20/0.38 # Requested 8, 32 cores available to the main process. % 0.20/0.38 # There are not enough tableaux to fork, creating more from the initial 3 % 0.20/0.38 # Returning from population with 23 new_tableaux and 0 remaining starting tableaux. % 0.20/0.38 # We now have 23 tableaux to operate on % 6.98/1.29 # There were 8 total branch saturation attempts. % 6.98/1.29 # There were 0 of these attempts blocked. % 6.98/1.29 # There were 0 deferred branch saturation attempts. % 6.98/1.29 # There were 0 free duplicated saturations. % 6.98/1.29 # There were 8 total successful branch saturations. % 6.98/1.29 # There were 1 successful branch saturations in interreduction. % 6.98/1.29 # There were 0 successful branch saturations on the branch. % 6.98/1.29 # There were 7 successful branch saturations after the branch. % 6.98/1.29 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 6.98/1.29 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 6.98/1.29 # Begin clausification derivation % 6.98/1.29 % 6.98/1.29 # End clausification derivation % 6.98/1.29 # Begin listing active clauses obtained from FOF to CNF conversion % 6.98/1.29 cnf(i_0_31, plain, (empty(empty_set))). % 6.98/1.29 cnf(i_0_33, plain, (empty(empty_set))). % 6.98/1.29 cnf(i_0_38, plain, (empty(empty_set))). % 6.98/1.29 cnf(i_0_45, plain, (empty(esk13_0))). % 6.98/1.29 cnf(i_0_48, plain, (empty(esk15_0))). % 6.98/1.29 cnf(i_0_50, plain, (empty(esk16_0))). % 6.98/1.29 cnf(i_0_42, plain, (function(esk12_0))). % 6.98/1.29 cnf(i_0_49, plain, (function(esk16_0))). % 6.98/1.29 cnf(i_0_58, plain, (function(esk20_0))). % 6.98/1.29 cnf(i_0_30, plain, (relation(empty_set))). % 6.98/1.29 cnf(i_0_37, plain, (relation(empty_set))). % 6.98/1.29 cnf(i_0_43, plain, (relation(esk12_0))). % 6.98/1.29 cnf(i_0_44, plain, (relation(esk13_0))). % 6.98/1.29 cnf(i_0_51, plain, (relation(esk16_0))). % 6.98/1.29 cnf(i_0_52, plain, (relation(esk17_0))). % 6.98/1.29 cnf(i_0_59, plain, (relation(esk20_0))). % 6.98/1.29 cnf(i_0_61, plain, (relation(esk21_0))). % 6.98/1.29 cnf(i_0_65, negated_conjecture, (relation(esk23_0))). % 6.98/1.29 cnf(i_0_57, plain, (one_to_one(esk20_0))). % 6.98/1.29 cnf(i_0_29, plain, (relation_empty_yielding(empty_set))). % 6.98/1.29 cnf(i_0_60, plain, (relation_empty_yielding(esk21_0))). % 6.98/1.29 cnf(i_0_53, plain, (~empty(esk17_0))). % 6.98/1.29 cnf(i_0_56, plain, (~empty(esk19_0))). % 6.98/1.29 cnf(i_0_72, plain, (X1=empty_set|~empty(X1))). % 6.98/1.29 cnf(i_0_54, plain, (empty(esk18_1(X1)))). % 6.98/1.29 cnf(i_0_2, plain, (function(X1)|~empty(X1))). % 6.98/1.29 cnf(i_0_3, plain, (relation(X1)|~empty(X1))). % 6.98/1.29 cnf(i_0_62, plain, (subset(X1,X1))). % 6.98/1.29 cnf(i_0_64, negated_conjecture, (subset(esk22_0,relation_dom(esk23_0)))). % 6.98/1.29 cnf(i_0_74, plain, (X1=X2|~empty(X2)|~empty(X1))). % 6.98/1.29 cnf(i_0_35, plain, (~empty(singleton(X1)))). % 6.98/1.29 cnf(i_0_32, plain, (~empty(powerset(X1)))). % 6.98/1.29 cnf(i_0_41, plain, (empty(relation_dom(X1))|~empty(X1))). % 6.98/1.29 cnf(i_0_40, plain, (relation(relation_dom(X1))|~empty(X1))). % 6.98/1.29 cnf(i_0_28, plain, (element(esk11_1(X1),X1))). % 6.98/1.29 cnf(i_0_46, plain, (empty(X1)|~empty(esk14_1(X1)))). % 6.98/1.29 cnf(i_0_4, plain, (one_to_one(X1)|~empty(X1)|~function(X1)|~relation(X1))). % 6.98/1.29 cnf(i_0_55, plain, (element(esk18_1(X1),powerset(X1)))). % 6.98/1.29 cnf(i_0_7, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))). % 6.98/1.29 cnf(i_0_39, plain, (empty(X1)|~relation(X1)|~empty(relation_dom(X1)))). % 6.98/1.29 cnf(i_0_73, plain, (~empty(X2)|~in(X1,X2))). % 6.98/1.29 cnf(i_0_47, plain, (empty(X1)|element(esk14_1(X1),powerset(X1)))). % 6.98/1.29 cnf(i_0_66, plain, (element(X1,X2)|~in(X1,X2))). % 6.98/1.29 cnf(i_0_67, plain, (empty(X2)|in(X1,X2)|~element(X1,X2))). % 6.98/1.29 cnf(i_0_68, plain, (element(X1,powerset(X2))|~subset(X1,X2))). % 6.98/1.29 cnf(i_0_1, plain, (~in(X2,X1)|~in(X1,X2))). % 6.98/1.29 cnf(i_0_69, plain, (subset(X1,X2)|~element(X1,powerset(X2)))). % 6.98/1.29 cnf(i_0_36, plain, (~empty(unordered_pair(X1,X2)))). % 6.98/1.29 cnf(i_0_21, plain, (subset(X1,X2)|in(esk7_2(X1,X2),X1))). % 6.98/1.29 cnf(i_0_22, plain, (in(X3,X2)|~in(X3,X1)|~subset(X1,X2))). % 6.98/1.29 cnf(i_0_71, plain, (~empty(X3)|~in(X1,X2)|~element(X2,powerset(X3)))). % 6.98/1.29 cnf(i_0_70, plain, (element(X1,X3)|~in(X1,X2)|~element(X2,powerset(X3)))). % 6.98/1.29 cnf(i_0_20, plain, (subset(X1,X2)|~in(esk7_2(X1,X2),X2))). % 6.98/1.29 cnf(i_0_63, negated_conjecture, (~subset(esk22_0,relation_inverse_image(esk23_0,relation_image(esk23_0,esk22_0))))). % 6.98/1.29 cnf(i_0_34, plain, (~empty(unordered_pair(unordered_pair(X1,X2),singleton(X1))))). % 6.98/1.29 cnf(i_0_25, plain, (in(X1,X4)|X4!=relation_dom(X3)|~relation(X3)|~in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3))). % 6.98/1.29 cnf(i_0_11, plain, (in(X2,X5)|X5!=relation_image(X3,X4)|~relation(X3)|~in(X1,X4)|~in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3))). % 6.98/1.29 cnf(i_0_17, plain, (in(X1,X5)|X5!=relation_inverse_image(X3,X4)|~relation(X3)|~in(X2,X4)|~in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3))). % 6.98/1.29 cnf(i_0_8, plain, (X3=relation_image(X1,X2)|in(esk2_3(X1,X2,X3),X3)|in(esk3_3(X1,X2,X3),X2)|~relation(X1))). % 6.98/1.29 cnf(i_0_14, plain, (X3=relation_inverse_image(X1,X2)|in(esk5_3(X1,X2,X3),X3)|in(esk6_3(X1,X2,X3),X2)|~relation(X1))). % 6.98/1.29 cnf(i_0_23, plain, (X2=relation_dom(X1)|in(esk9_2(X1,X2),X2)|in(unordered_pair(unordered_pair(esk9_2(X1,X2),esk10_2(X1,X2)),singleton(esk9_2(X1,X2))),X1)|~relation(X1))). % 6.98/1.29 cnf(i_0_12, plain, (in(esk1_4(X1,X2,X3,X4),X2)|X3!=relation_image(X1,X2)|~relation(X1)|~in(X4,X3))). % 6.98/1.29 cnf(i_0_18, plain, (in(esk4_4(X1,X2,X3,X4),X2)|X3!=relation_inverse_image(X1,X2)|~relation(X1)|~in(X4,X3))). % 6.98/1.29 cnf(i_0_24, plain, (X2=relation_dom(X1)|~relation(X1)|~in(esk9_2(X1,X2),X2)|~in(unordered_pair(unordered_pair(esk9_2(X1,X2),X3),singleton(esk9_2(X1,X2))),X1))). % 6.98/1.29 cnf(i_0_26, plain, (in(unordered_pair(unordered_pair(X1,esk8_3(X3,X2,X1)),singleton(X1)),X3)|X2!=relation_dom(X3)|~relation(X3)|~in(X1,X2))). % 6.98/1.29 cnf(i_0_10, plain, (X3=relation_image(X1,X2)|~relation(X1)|~in(X4,X2)|~in(esk2_3(X1,X2,X3),X3)|~in(unordered_pair(unordered_pair(X4,esk2_3(X1,X2,X3)),singleton(X4)),X1))). % 6.98/1.29 cnf(i_0_9, plain, (X3=relation_image(X1,X2)|in(esk2_3(X1,X2,X3),X3)|in(unordered_pair(unordered_pair(esk3_3(X1,X2,X3),esk2_3(X1,X2,X3)),singleton(esk3_3(X1,X2,X3))),X1)|~relation(X1))). % 6.98/1.29 cnf(i_0_15, plain, (X3=relation_inverse_image(X1,X2)|in(esk5_3(X1,X2,X3),X3)|in(unordered_pair(unordered_pair(esk5_3(X1,X2,X3),esk6_3(X1,X2,X3)),singleton(esk5_3(X1,X2,X3))),X1)|~relation(X1))). % 6.98/1.29 cnf(i_0_16, plain, (X3=relation_inverse_image(X1,X2)|~relation(X1)|~in(X4,X2)|~in(esk5_3(X1,X2,X3),X3)|~in(unordered_pair(unordered_pair(esk5_3(X1,X2,X3),X4),singleton(esk5_3(X1,X2,X3))),X1))). % 6.98/1.29 cnf(i_0_19, plain, (in(unordered_pair(unordered_pair(X1,esk4_4(X2,X3,X4,X1)),singleton(X1)),X2)|X4!=relation_inverse_image(X2,X3)|~relation(X2)|~in(X1,X4))). % 6.98/1.29 cnf(i_0_13, plain, (in(unordered_pair(unordered_pair(esk1_4(X1,X2,X3,X4),X4),singleton(esk1_4(X1,X2,X3,X4))),X1)|X3!=relation_image(X1,X2)|~relation(X1)|~in(X4,X3))). % 6.98/1.29 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 6.98/1.29 # Begin printing tableau % 6.98/1.29 # Found 15 steps % 6.98/1.29 cnf(i_0_65, negated_conjecture, (relation(esk23_0)), inference(start_rule)). % 6.98/1.29 cnf(i_0_77, plain, (relation(esk23_0)), inference(extension_rule, [i_0_24])). % 6.98/1.29 cnf(i_0_401, plain, (~in(unordered_pair(unordered_pair(esk9_2(esk23_0,empty_set),esk10_2(esk23_0,empty_set)),singleton(esk9_2(esk23_0,empty_set))),esk23_0)), inference(extension_rule, [i_0_22])). % 6.98/1.29 cnf(i_0_21950, plain, (~in(unordered_pair(unordered_pair(esk9_2(esk23_0,empty_set),esk10_2(esk23_0,empty_set)),singleton(esk9_2(esk23_0,empty_set))),esk23_0)), inference(extension_rule, [i_0_23])). % 6.98/1.29 cnf(i_0_22005, plain, (~relation(esk23_0)), inference(closure_rule, [i_0_65])). % 6.98/1.29 cnf(i_0_21951, plain, (~subset(esk23_0,esk23_0)), inference(extension_rule, [i_0_69])). % 6.98/1.29 cnf(i_0_400, plain, (~in(esk9_2(esk23_0,empty_set),empty_set)), inference(extension_rule, [i_0_25])). % 6.98/1.29 cnf(i_0_22132, plain, (~relation(empty_set)), inference(closure_rule, [i_0_30])). % 6.98/1.29 cnf(i_0_22131, plain, (empty_set!=relation_dom(empty_set)), inference(extension_rule, [i_0_72])). % 6.98/1.29 cnf(i_0_398, plain, (empty_set=relation_dom(esk23_0)), inference(etableau_closure_rule, [i_0_398, ...])). % 6.98/1.29 cnf(i_0_22002, plain, (empty_set=relation_dom(esk23_0)), inference(etableau_closure_rule, [i_0_22002, ...])). % 6.98/1.29 cnf(i_0_22003, plain, (in(esk9_2(esk23_0,empty_set),empty_set)), inference(etableau_closure_rule, [i_0_22003, ...])). % 6.98/1.29 cnf(i_0_22037, plain, (~element(esk23_0,powerset(esk23_0))), inference(etableau_closure_rule, [i_0_22037, ...])). % 6.98/1.29 cnf(i_0_22133, plain, (~in(unordered_pair(unordered_pair(esk9_2(esk23_0,empty_set),X7),singleton(esk9_2(esk23_0,empty_set))),empty_set)), inference(etableau_closure_rule, [i_0_22133, ...])). % 6.98/1.29 cnf(i_0_22135, plain, (~empty(relation_dom(empty_set))), inference(etableau_closure_rule, [i_0_22135, ...])). % 6.98/1.29 # End printing tableau % 6.98/1.29 # SZS output end % 6.98/1.29 # Branches closed with saturation will be marked with an "s" % 6.98/1.29 # Child (10719) has found a proof. % 6.98/1.29 % 6.98/1.29 # Proof search is over... % 6.98/1.29 # Freeing feature tree %------------------------------------------------------------------------------