%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SEU206+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 : n013.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:45 EDT 2022 % Result : Theorem 4.39s 0.98s % Output : CNFRefutation 4.39s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.13 % Problem : SEU206+1 : TPTP v8.1.0. Released v3.3.0. % 0.08/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 : n013.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 : Sun Jun 19 06:07:14 EDT 2022 % 0.13/0.35 % CPUTime : % 0.13/0.39 # No SInE strategy applied % 0.13/0.39 # Auto-Mode selected heuristic G_E___301_C18_F1_URBAN_S5PRR_RG_S0Y % 0.13/0.39 # and selection function SelectMaxLComplexAvoidPosPred. % 0.13/0.39 # % 0.13/0.39 # Number of axioms: 60 Number of unprocessed: 60 % 0.13/0.39 # Tableaux proof search. % 0.13/0.39 # APR header successfully linked. % 0.13/0.39 # Hello from C++ % 0.13/0.39 # The folding up rule is enabled... % 0.13/0.39 # Local unification is enabled... % 0.13/0.39 # Any saturation attempts will use folding labels... % 0.13/0.39 # 60 beginning clauses after preprocessing and clausification % 0.13/0.39 # Creating start rules for all 2 conjectures. % 0.13/0.39 # There are 2 start rule candidates: % 0.13/0.39 # Found 20 unit axioms. % 0.13/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.39 # 2 start rule tableaux created. % 0.13/0.39 # 40 extension rule candidate clauses % 0.13/0.39 # 20 unit axiom clauses % 0.13/0.39 % 0.13/0.39 # Requested 8, 32 cores available to the main process. % 0.13/0.39 # There are not enough tableaux to fork, creating more from the initial 2 % 0.13/0.39 # Returning from population with 24 new_tableaux and 0 remaining starting tableaux. % 0.13/0.39 # We now have 24 tableaux to operate on % 4.39/0.98 # There were 2 total branch saturation attempts. % 4.39/0.98 # There were 0 of these attempts blocked. % 4.39/0.98 # There were 0 deferred branch saturation attempts. % 4.39/0.98 # There were 0 free duplicated saturations. % 4.39/0.98 # There were 2 total successful branch saturations. % 4.39/0.98 # There were 0 successful branch saturations in interreduction. % 4.39/0.98 # There were 0 successful branch saturations on the branch. % 4.39/0.98 # There were 2 successful branch saturations after the branch. % 4.39/0.98 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 4.39/0.98 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 4.39/0.98 # Begin clausification derivation % 4.39/0.98 % 4.39/0.98 # End clausification derivation % 4.39/0.98 # Begin listing active clauses obtained from FOF to CNF conversion % 4.39/0.98 cnf(i_0_36, plain, (empty(empty_set))). % 4.39/0.98 cnf(i_0_41, plain, (empty(empty_set))). % 4.39/0.98 cnf(i_0_49, plain, (empty(esk12_0))). % 4.39/0.98 cnf(i_0_52, plain, (empty(esk14_0))). % 4.39/0.98 cnf(i_0_40, plain, (relation(empty_set))). % 4.39/0.98 cnf(i_0_48, plain, (relation(esk12_0))). % 4.39/0.98 cnf(i_0_53, plain, (relation(esk15_0))). % 4.39/0.98 cnf(i_0_61, negated_conjecture, (relation(esk18_0))). % 4.39/0.98 cnf(i_0_54, plain, (~empty(esk15_0))). % 4.39/0.98 cnf(i_0_57, plain, (~empty(esk17_0))). % 4.39/0.98 cnf(i_0_68, plain, (X1=empty_set|~empty(X1))). % 4.39/0.98 cnf(i_0_55, plain, (empty(esk16_1(X1)))). % 4.39/0.98 cnf(i_0_2, plain, (relation(X1)|~empty(X1))). % 4.39/0.98 cnf(i_0_58, plain, (subset(X1,X1))). % 4.39/0.98 cnf(i_0_70, plain, (X1=X2|~empty(X2)|~empty(X1))). % 4.39/0.98 cnf(i_0_38, plain, (~empty(singleton(X1)))). % 4.39/0.98 cnf(i_0_35, plain, (~empty(powerset(X1)))). % 4.39/0.98 cnf(i_0_45, plain, (empty(relation_dom(X1))|~empty(X1))). % 4.39/0.98 cnf(i_0_47, plain, (empty(relation_rng(X1))|~empty(X1))). % 4.39/0.98 cnf(i_0_44, plain, (relation(relation_dom(X1))|~empty(X1))). % 4.39/0.98 cnf(i_0_46, plain, (relation(relation_rng(X1))|~empty(X1))). % 4.39/0.98 cnf(i_0_5, plain, (subset(X1,X2)|X1!=X2)). % 4.39/0.98 cnf(i_0_6, plain, (subset(X1,X2)|X1!=X2)). % 4.39/0.98 cnf(i_0_34, plain, (element(esk11_1(X1),X1))). % 4.39/0.98 cnf(i_0_50, plain, (empty(X1)|~empty(esk13_1(X1)))). % 4.39/0.98 cnf(i_0_56, plain, (element(esk16_1(X1),powerset(X1)))). % 4.39/0.98 cnf(i_0_3, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))). % 4.39/0.98 cnf(i_0_42, plain, (empty(X1)|~relation(X1)|~empty(relation_dom(X1)))). % 4.39/0.98 cnf(i_0_43, plain, (empty(X1)|~relation(X1)|~empty(relation_rng(X1)))). % 4.39/0.98 cnf(i_0_60, negated_conjecture, (relation_image(esk18_0,relation_dom(esk18_0))!=relation_rng(esk18_0))). % 4.39/0.98 cnf(i_0_69, plain, (~empty(X2)|~in(X1,X2))). % 4.39/0.98 cnf(i_0_51, plain, (empty(X1)|element(esk13_1(X1),powerset(X1)))). % 4.39/0.98 cnf(i_0_62, plain, (element(X1,X2)|~in(X1,X2))). % 4.39/0.98 cnf(i_0_63, plain, (empty(X2)|in(X1,X2)|~element(X1,X2))). % 4.39/0.98 cnf(i_0_64, plain, (element(X1,powerset(X2))|~subset(X1,X2))). % 4.39/0.98 cnf(i_0_1, plain, (~in(X2,X1)|~in(X1,X2))). % 4.39/0.98 cnf(i_0_65, plain, (subset(X1,X2)|~element(X1,powerset(X2)))). % 4.39/0.98 cnf(i_0_4, plain, (X1=X2|~subset(X2,X1)|~subset(X1,X2))). % 4.39/0.98 cnf(i_0_39, plain, (~empty(unordered_pair(X1,X2)))). % 4.39/0.98 cnf(i_0_59, plain, (subset(relation_image(X1,X2),relation_rng(X1))|~relation(X1))). % 4.39/0.98 cnf(i_0_14, plain, (subset(X1,X2)|in(esk4_2(X1,X2),X1))). % 4.39/0.98 cnf(i_0_15, plain, (in(X3,X2)|~in(X3,X1)|~subset(X1,X2))). % 4.39/0.98 cnf(i_0_67, plain, (~empty(X3)|~in(X1,X2)|~element(X2,powerset(X3)))). % 4.39/0.98 cnf(i_0_66, plain, (element(X1,X3)|~in(X1,X2)|~element(X2,powerset(X3)))). % 4.39/0.98 cnf(i_0_13, plain, (subset(X1,X2)|~in(esk4_2(X1,X2),X2))). % 4.39/0.98 cnf(i_0_37, plain, (~empty(unordered_pair(unordered_pair(X1,X2),singleton(X1))))). % 4.39/0.98 cnf(i_0_22, plain, (in(X2,X4)|X4!=relation_rng(X3)|~relation(X3)|~in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3))). % 4.39/0.98 cnf(i_0_18, plain, (in(X1,X4)|X4!=relation_dom(X3)|~relation(X3)|~in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3))). % 4.39/0.98 cnf(i_0_10, plain, (in(X2,X5)|X5!=relation_image(X3,X4)|~relation(X3)|~in(X1,X4)|~in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3))). % 4.39/0.98 cnf(i_0_7, plain, (X3=relation_image(X1,X2)|in(esk2_3(X1,X2,X3),X3)|in(esk3_3(X1,X2,X3),X2)|~relation(X1))). % 4.39/0.98 cnf(i_0_21, plain, (X2=relation_rng(X1)|~relation(X1)|~in(esk9_2(X1,X2),X2)|~in(unordered_pair(unordered_pair(X3,esk9_2(X1,X2)),singleton(X3)),X1))). % 4.39/0.98 cnf(i_0_16, plain, (X2=relation_dom(X1)|in(esk6_2(X1,X2),X2)|in(unordered_pair(unordered_pair(esk6_2(X1,X2),esk7_2(X1,X2)),singleton(esk6_2(X1,X2))),X1)|~relation(X1))). % 4.39/0.98 cnf(i_0_20, plain, (X2=relation_rng(X1)|in(esk9_2(X1,X2),X2)|in(unordered_pair(unordered_pair(esk10_2(X1,X2),esk9_2(X1,X2)),singleton(esk10_2(X1,X2))),X1)|~relation(X1))). % 4.39/0.98 cnf(i_0_11, plain, (in(esk1_4(X1,X2,X3,X4),X2)|X3!=relation_image(X1,X2)|~relation(X1)|~in(X4,X3))). % 4.39/0.98 cnf(i_0_17, plain, (X2=relation_dom(X1)|~relation(X1)|~in(esk6_2(X1,X2),X2)|~in(unordered_pair(unordered_pair(esk6_2(X1,X2),X3),singleton(esk6_2(X1,X2))),X1))). % 4.39/0.98 cnf(i_0_19, plain, (in(unordered_pair(unordered_pair(X1,esk5_3(X3,X2,X1)),singleton(X1)),X3)|X2!=relation_dom(X3)|~relation(X3)|~in(X1,X2))). % 4.39/0.98 cnf(i_0_23, plain, (in(unordered_pair(unordered_pair(esk8_3(X3,X2,X1),X1),singleton(esk8_3(X3,X2,X1))),X3)|X2!=relation_rng(X3)|~relation(X3)|~in(X1,X2))). % 4.39/0.98 cnf(i_0_9, 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))). % 4.39/0.98 cnf(i_0_8, 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))). % 4.39/0.98 cnf(i_0_12, 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))). % 4.39/0.98 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 4.39/0.98 # Begin printing tableau % 4.39/0.98 # Found 6 steps % 4.39/0.98 cnf(i_0_61, negated_conjecture, (relation(esk18_0)), inference(start_rule)). % 4.39/0.98 cnf(i_0_72, plain, (relation(esk18_0)), inference(extension_rule, [i_0_8])). % 4.39/0.98 cnf(i_0_301, plain, (relation_image(esk18_0,relation_dom(esk18_0))=relation_rng(esk18_0)), inference(closure_rule, [i_0_60])). % 4.39/0.98 cnf(i_0_302, plain, (in(esk2_3(esk18_0,relation_dom(esk18_0),relation_rng(esk18_0)),relation_rng(esk18_0))), inference(extension_rule, [i_0_69])). % 4.39/0.98 cnf(i_0_303, plain, (in(unordered_pair(unordered_pair(esk3_3(esk18_0,relation_dom(esk18_0),relation_rng(esk18_0)),esk2_3(esk18_0,relation_dom(esk18_0),relation_rng(esk18_0))),singleton(esk3_3(esk18_0,relation_dom(esk18_0),relation_rng(esk18_0)))),esk18_0)), inference(etableau_closure_rule, [i_0_303, ...])). % 4.39/0.98 cnf(i_0_336, plain, (~empty(relation_rng(esk18_0))), inference(etableau_closure_rule, [i_0_336, ...])). % 4.39/0.98 # End printing tableau % 4.39/0.98 # SZS output end % 4.39/0.98 # Branches closed with saturation will be marked with an "s" % 4.39/0.98 # Child (24929) has found a proof. % 4.39/0.98 % 4.39/0.98 # Proof search is over... % 4.39/0.98 # Freeing feature tree %------------------------------------------------------------------------------