%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SEU153+2 : 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 : n027.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:15 EDT 2022 % Result : Theorem 0.12s 0.37s % Output : CNFRefutation 0.12s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.11 % Problem : SEU153+2 : TPTP v8.1.0. Released v3.3.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 : n027.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 15:42:09 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_C18_F1_SE_CS_SP_PS_S5PRR_S2mI % 0.12/0.37 # and selection function SelectCQArNTNpEqFirst. % 0.12/0.37 # % 0.12/0.37 # Presaturation interreduction done % 0.12/0.37 # Number of axioms: 112 Number of unprocessed: 100 % 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 # 100 beginning clauses after preprocessing and clausification % 0.12/0.37 # Creating start rules for all 2 conjectures. % 0.12/0.37 # There are 2 start rule candidates: % 0.12/0.37 # Found 25 unit axioms. % 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.37 # 2 start rule tableaux created. % 0.12/0.37 # 75 extension rule candidate clauses % 0.12/0.37 # 25 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 2 % 0.12/0.37 # Closed tableau found in foldup close cycle with 0 folds and 2 closures done. % 0.12/0.37 # There were 0 total branch saturation attempts. % 0.12/0.37 # There were 0 of these attempts blocked. % 0.12/0.37 # There were 0 deferred branch saturation attempts. % 0.12/0.37 # There were 0 free duplicated saturations. % 0.12/0.37 # There were 0 total successful branch saturations. % 0.12/0.37 # There were 0 successful branch saturations in interreduction. % 0.12/0.37 # There were 0 successful branch saturations on the branch. % 0.12/0.37 # There were 0 successful branch saturations after the branch. % 0.12/0.37 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.37 # Begin clausification derivation % 0.12/0.37 % 0.12/0.37 # End clausification derivation % 0.12/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.37 cnf(i_0_66, negated_conjecture, (in(esk9_0,esk10_0))). % 0.12/0.37 cnf(i_0_67, negated_conjecture, (disjoint(unordered_pair(esk9_0,esk9_0),esk10_0))). % 0.12/0.37 cnf(i_0_58, plain, (empty(empty_set))). % 0.12/0.37 cnf(i_0_76, plain, (empty(esk11_0))). % 0.12/0.37 cnf(i_0_92, lemma, (subset(empty_set,X1))). % 0.12/0.37 cnf(i_0_78, plain, (subset(X1,X1))). % 0.12/0.37 cnf(i_0_106, plain, (set_difference(empty_set,X1)=empty_set)). % 0.12/0.37 cnf(i_0_84, plain, (set_union2(X1,empty_set)=X1)). % 0.12/0.37 cnf(i_0_98, plain, (set_difference(X1,empty_set)=X1)). % 0.12/0.37 cnf(i_0_86, lemma, (powerset(empty_set)=unordered_pair(empty_set,empty_set))). % 0.12/0.37 cnf(i_0_61, plain, (set_union2(X1,X1)=X1)). % 0.12/0.37 cnf(i_0_115, lemma, (subset(X1,set_union2(X1,X2)))). % 0.12/0.37 cnf(i_0_94, lemma, (subset(set_difference(X1,X2),X1))). % 0.12/0.37 cnf(i_0_22, plain, (in(X1,unordered_pair(X2,X1)))). % 0.12/0.37 cnf(i_0_89, plain, (set_difference(X1,X1)=empty_set)). % 0.12/0.37 cnf(i_0_23, plain, (in(X1,unordered_pair(X1,X2)))). % 0.12/0.37 cnf(i_0_97, lemma, (set_union2(X1,set_difference(X2,X1))=set_union2(X1,X2))). % 0.12/0.37 cnf(i_0_103, lemma, (set_difference(set_union2(X1,X2),X2)=set_difference(X1,X2))). % 0.12/0.37 cnf(i_0_3, plain, (unordered_pair(X1,X2)=unordered_pair(X2,X1))). % 0.12/0.37 cnf(i_0_4, plain, (set_union2(X1,X2)=set_union2(X2,X1))). % 0.12/0.37 cnf(i_0_5, plain, (set_difference(X1,set_difference(X1,X2))=set_difference(X2,set_difference(X2,X1)))). % 0.12/0.37 cnf(i_0_77, plain, (~empty(esk12_0))). % 0.12/0.37 cnf(i_0_64, lemma, (unordered_pair(X1,X1)!=empty_set)). % 0.12/0.37 cnf(i_0_63, plain, (~proper_subset(X1,X1))). % 0.12/0.37 cnf(i_0_14, plain, (~in(X1,empty_set))). % 0.12/0.37 cnf(i_0_114, plain, (~empty(X1)|~in(X2,X1))). % 0.12/0.37 cnf(i_0_112, plain, (X1=empty_set|~empty(X1))). % 0.12/0.37 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))). % 0.12/0.37 cnf(i_0_109, lemma, (~subset(X1,X2)|~proper_subset(X2,X1))). % 0.12/0.37 cnf(i_0_2, plain, (~proper_subset(X1,X2)|~proper_subset(X2,X1))). % 0.12/0.37 cnf(i_0_50, plain, (subset(X1,X2)|~proper_subset(X1,X2))). % 0.12/0.37 cnf(i_0_99, lemma, (~disjoint(X1,X2)|~in(X3,X2)|~in(X3,X1))). % 0.12/0.37 cnf(i_0_102, lemma, (X1=empty_set|~subset(X1,empty_set))). % 0.12/0.37 cnf(i_0_79, plain, (disjoint(X1,X2)|~disjoint(X2,X1))). % 0.12/0.37 cnf(i_0_118, plain, (X1=X2|~empty(X2)|~empty(X1))). % 0.12/0.37 cnf(i_0_60, plain, (empty(X1)|~empty(set_union2(X2,X1)))). % 0.12/0.37 cnf(i_0_59, plain, (empty(X1)|~empty(set_union2(X1,X2)))). % 0.12/0.37 cnf(i_0_107, lemma, (~disjoint(X1,X2)|~in(X3,set_difference(X1,set_difference(X1,X2))))). % 0.12/0.37 cnf(i_0_116, lemma, (disjoint(X1,X2)|set_difference(X1,X2)!=X1)). % 0.12/0.37 cnf(i_0_117, lemma, (set_difference(X1,X2)=X1|~disjoint(X1,X2))). % 0.12/0.37 cnf(i_0_121, lemma, (X1=X2|unordered_pair(X3,X3)!=unordered_pair(X1,X2))). % 0.12/0.37 cnf(i_0_120, lemma, (X1=X2|unordered_pair(X1,X1)!=unordered_pair(X2,X3))). % 0.12/0.37 cnf(i_0_13, plain, (X1=empty_set|in(esk2_1(X1),X1))). % 0.12/0.37 cnf(i_0_81, lemma, (set_union2(X1,X2)=X2|~subset(X1,X2))). % 0.12/0.37 cnf(i_0_70, lemma, (set_difference(X1,X2)=empty_set|~subset(X1,X2))). % 0.12/0.37 cnf(i_0_71, lemma, (subset(X1,X2)|set_difference(X1,X2)!=empty_set)). % 0.12/0.37 cnf(i_0_12, plain, (X1=X2|~in(X1,unordered_pair(X2,X2)))). % 0.12/0.37 cnf(i_0_69, lemma, (in(X1,X2)|~subset(unordered_pair(X1,X1),X2))). % 0.12/0.37 cnf(i_0_33, plain, (in(X1,X2)|~subset(X3,X2)|~in(X1,X3))). % 0.12/0.37 cnf(i_0_44, plain, (~in(X1,set_difference(X2,X3))|~in(X1,X3))). % 0.12/0.37 cnf(i_0_65, lemma, (set_union2(unordered_pair(X1,X1),X2)=X2|~in(X1,X2))). % 0.12/0.37 cnf(i_0_100, lemma, (disjoint(X1,X2)|in(esk14_2(X1,X2),X2))). % 0.12/0.37 cnf(i_0_6, plain, (X1=X2|~subset(X2,X1)|~subset(X1,X2))). % 0.12/0.37 cnf(i_0_17, plain, (in(X1,powerset(X2))|~subset(X1,X2))). % 0.12/0.37 cnf(i_0_31, plain, (subset(X1,X2)|~in(esk6_2(X1,X2),X2))). % 0.12/0.37 cnf(i_0_101, lemma, (disjoint(X1,X2)|in(esk14_2(X1,X2),X1))). % 0.12/0.37 cnf(i_0_46, plain, (disjoint(X1,X2)|set_difference(X1,set_difference(X1,X2))!=empty_set)). % 0.12/0.37 cnf(i_0_113, lemma, (X1=X2|~subset(unordered_pair(X1,X1),unordered_pair(X2,X2)))). % 0.12/0.37 cnf(i_0_110, lemma, (disjoint(X1,X2)|~disjoint(X3,X2)|~subset(X1,X3))). % 0.12/0.37 cnf(i_0_48, plain, (X1=X2|proper_subset(X1,X2)|~subset(X1,X2))). % 0.12/0.37 cnf(i_0_32, plain, (subset(X1,X2)|in(esk6_2(X1,X2),X1))). % 0.12/0.37 cnf(i_0_18, plain, (subset(X1,X2)|~in(X1,powerset(X2)))). % 0.12/0.37 cnf(i_0_88, lemma, (set_difference(X1,set_difference(X1,X2))=X1|~subset(X1,X2))). % 0.12/0.37 cnf(i_0_47, plain, (set_difference(X1,set_difference(X1,X2))=empty_set|~disjoint(X1,X2))). % 0.12/0.37 cnf(i_0_68, lemma, (subset(unordered_pair(X1,X1),X2)|~in(X1,X2))). % 0.12/0.37 cnf(i_0_28, plain, (in(X1,set_union2(X2,X3))|~in(X1,X3))). % 0.12/0.37 cnf(i_0_29, plain, (in(X1,set_union2(X2,X3))|~in(X1,X2))). % 0.12/0.37 cnf(i_0_85, lemma, (subset(X1,X2)|~subset(X3,X2)|~subset(X1,X3))). % 0.12/0.37 cnf(i_0_45, plain, (in(X1,X2)|~in(X1,set_difference(X2,X3)))). % 0.12/0.37 cnf(i_0_24, plain, (X1=X2|X1=X3|~in(X1,unordered_pair(X3,X2)))). % 0.12/0.37 cnf(i_0_80, lemma, (X1=X2|X1=X3|unordered_pair(X1,X4)!=unordered_pair(X2,X3))). % 0.12/0.37 cnf(i_0_9, plain, (esk1_2(X1,X2)=X1|X2=unordered_pair(X1,X1)|in(esk1_2(X1,X2),X2))). % 0.12/0.37 cnf(i_0_38, plain, (in(X1,X2)|~in(X1,set_difference(X3,set_difference(X3,X2))))). % 0.12/0.37 cnf(i_0_75, lemma, (X1=unordered_pair(X2,X2)|X1=empty_set|~subset(X1,unordered_pair(X2,X2)))). % 0.12/0.37 cnf(i_0_10, plain, (X1=unordered_pair(X2,X2)|esk1_2(X2,X1)!=X2|~in(esk1_2(X2,X1),X1))). % 0.12/0.37 cnf(i_0_91, plain, (X1=X2|~in(esk13_2(X1,X2),X2)|~in(esk13_2(X1,X2),X1))). % 0.12/0.37 cnf(i_0_16, plain, (X1=powerset(X2)|~subset(esk3_2(X2,X1),X2)|~in(esk3_2(X2,X1),X1))). % 0.12/0.37 cnf(i_0_43, plain, (in(X1,set_difference(X2,X3))|in(X1,X3)|~in(X1,X2))). % 0.12/0.37 cnf(i_0_108, lemma, (disjoint(X1,X2)|in(esk15_2(X1,X2),set_difference(X1,set_difference(X1,X2))))). % 0.12/0.37 cnf(i_0_119, lemma, (subset(set_union2(X1,X2),X3)|~subset(X2,X3)|~subset(X1,X3))). % 0.12/0.37 cnf(i_0_20, plain, (X1=unordered_pair(X2,X3)|esk4_3(X2,X3,X1)!=X3|~in(esk4_3(X2,X3,X1),X1))). % 0.12/0.37 cnf(i_0_21, plain, (X1=unordered_pair(X2,X3)|esk4_3(X2,X3,X1)!=X2|~in(esk4_3(X2,X3,X1),X1))). % 0.12/0.37 cnf(i_0_93, lemma, (subset(set_difference(X1,X2),set_difference(X3,X2))|~subset(X1,X3))). % 0.12/0.37 cnf(i_0_30, plain, (in(X1,X2)|in(X1,X3)|~in(X1,set_union2(X3,X2)))). % 0.12/0.37 cnf(i_0_37, plain, (in(X1,set_difference(X2,set_difference(X2,X3)))|~in(X1,X3)|~in(X1,X2))). % 0.12/0.37 cnf(i_0_72, lemma, (subset(X1,set_difference(X2,unordered_pair(X3,X3)))|in(X3,X1)|~subset(X1,X2))). % 0.12/0.37 cnf(i_0_15, plain, (X1=powerset(X2)|subset(esk3_2(X2,X1),X2)|in(esk3_2(X2,X1),X1))). % 0.12/0.37 cnf(i_0_26, plain, (X1=set_union2(X2,X3)|~in(esk5_3(X2,X3,X1),X1)|~in(esk5_3(X2,X3,X1),X3))). % 0.12/0.37 cnf(i_0_27, plain, (X1=set_union2(X2,X3)|~in(esk5_3(X2,X3,X1),X1)|~in(esk5_3(X2,X3,X1),X2))). % 0.12/0.37 cnf(i_0_83, lemma, (subset(X1,set_difference(X2,set_difference(X2,X3)))|~subset(X1,X3)|~subset(X1,X2))). % 0.12/0.37 cnf(i_0_90, plain, (X1=X2|in(esk13_2(X1,X2),X1)|in(esk13_2(X1,X2),X2))). % 0.12/0.37 cnf(i_0_87, lemma, (subset(set_difference(X1,set_difference(X1,X2)),set_difference(X3,set_difference(X3,X2)))|~subset(X1,X3))). % 0.12/0.37 cnf(i_0_40, plain, (X1=set_difference(X2,X3)|in(esk8_3(X2,X3,X1),X1)|~in(esk8_3(X2,X3,X1),X3))). % 0.12/0.37 cnf(i_0_41, plain, (X1=set_difference(X2,X3)|in(esk8_3(X2,X3,X1),X2)|in(esk8_3(X2,X3,X1),X1))). % 0.12/0.37 cnf(i_0_19, plain, (esk4_3(X1,X2,X3)=X1|esk4_3(X1,X2,X3)=X2|X3=unordered_pair(X1,X2)|in(esk4_3(X1,X2,X3),X3))). % 0.12/0.37 cnf(i_0_34, plain, (X1=set_difference(X2,set_difference(X2,X3))|in(esk7_3(X2,X3,X1),X3)|in(esk7_3(X2,X3,X1),X1))). % 0.12/0.37 cnf(i_0_35, plain, (X1=set_difference(X2,set_difference(X2,X3))|in(esk7_3(X2,X3,X1),X2)|in(esk7_3(X2,X3,X1),X1))). % 0.12/0.37 cnf(i_0_25, plain, (X1=set_union2(X2,X3)|in(esk5_3(X2,X3,X1),X2)|in(esk5_3(X2,X3,X1),X3)|in(esk5_3(X2,X3,X1),X1))). % 0.12/0.37 cnf(i_0_36, plain, (X1=set_difference(X2,set_difference(X2,X3))|~in(esk7_3(X2,X3,X1),X1)|~in(esk7_3(X2,X3,X1),X3)|~in(esk7_3(X2,X3,X1),X2))). % 0.12/0.37 cnf(i_0_42, plain, (X1=set_difference(X2,X3)|in(esk8_3(X2,X3,X1),X3)|~in(esk8_3(X2,X3,X1),X1)|~in(esk8_3(X2,X3,X1),X2))). % 0.12/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.37 # Begin printing tableau % 0.12/0.37 # Found 4 steps % 0.12/0.37 cnf(i_0_67, negated_conjecture, (disjoint(unordered_pair(esk9_0,esk9_0),esk10_0)), inference(start_rule)). % 0.12/0.37 cnf(i_0_147, plain, (disjoint(unordered_pair(esk9_0,esk9_0),esk10_0)), inference(extension_rule, [i_0_99])). % 0.12/0.37 cnf(i_0_162, plain, (~in(esk9_0,esk10_0)), inference(closure_rule, [i_0_66])). % 0.12/0.37 cnf(i_0_163, plain, (~in(esk9_0,unordered_pair(esk9_0,esk9_0))), inference(closure_rule, [i_0_22])). % 0.12/0.37 # End printing tableau % 0.12/0.37 # SZS output end % 0.12/0.37 # Branches closed with saturation will be marked with an "s" % 0.12/0.37 # Returning from population with 2 new_tableaux and 0 remaining starting tableaux. % 0.12/0.37 # We now have 2 tableaux to operate on % 0.12/0.37 # Found closed tableau during pool population. % 0.12/0.37 # Proof search is over... % 0.12/0.37 # Freeing feature tree %------------------------------------------------------------------------------