%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SEU134+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 : n008.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:03 EDT 2022 % Result : Theorem 0.20s 0.38s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SEU134+2 : TPTP v8.1.0. Released v3.3.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.13/0.34 % Computer : n008.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Sun Jun 19 07:42:37 EDT 2022 % 0.13/0.34 % CPUTime : % 0.20/0.37 # No SInE strategy applied % 0.20/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI % 0.20/0.37 # and selection function SelectCQArNTNpEqFirst. % 0.20/0.37 # % 0.20/0.37 # Presaturation interreduction done % 0.20/0.37 # Number of axioms: 70 Number of unprocessed: 68 % 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.37 # The folding up rule is enabled... % 0.20/0.37 # Local unification is enabled... % 0.20/0.37 # Any saturation attempts will use folding labels... % 0.20/0.37 # 68 beginning clauses after preprocessing and clausification % 0.20/0.37 # Creating start rules for all 2 conjectures. % 0.20/0.37 # There are 2 start rule candidates: % 0.20/0.37 # Found 17 unit axioms. % 0.20/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.20/0.37 # 2 start rule tableaux created. % 0.20/0.37 # 51 extension rule candidate clauses % 0.20/0.37 # 17 unit axiom clauses % 0.20/0.37 % 0.20/0.37 # Requested 8, 32 cores available to the main process. % 0.20/0.37 # There are not enough tableaux to fork, creating more from the initial 2 % 0.20/0.37 # Returning from population with 14 new_tableaux and 0 remaining starting tableaux. % 0.20/0.37 # We now have 14 tableaux to operate on % 0.20/0.38 # There were 2 total branch saturation attempts. % 0.20/0.38 # There were 0 of these attempts blocked. % 0.20/0.38 # There were 0 deferred branch saturation attempts. % 0.20/0.38 # There were 0 free duplicated saturations. % 0.20/0.38 # There were 2 total successful branch saturations. % 0.20/0.38 # There were 1 successful branch saturations in interreduction. % 0.20/0.38 # There were 0 successful branch saturations on the branch. % 0.20/0.38 # There were 1 successful branch saturations after the branch. % 0.20/0.38 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.38 # Begin clausification derivation % 0.20/0.38 % 0.20/0.38 # End clausification derivation % 0.20/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.38 cnf(i_0_36, plain, (empty(empty_set))). % 0.20/0.38 cnf(i_0_67, plain, (set_difference(empty_set,X1)=empty_set)). % 0.20/0.38 cnf(i_0_57, lemma, (subset(empty_set,X1))). % 0.20/0.38 cnf(i_0_43, plain, (empty(esk6_0))). % 0.20/0.38 cnf(i_0_62, plain, (set_difference(X1,empty_set)=X1)). % 0.20/0.38 cnf(i_0_54, plain, (set_intersection2(X1,empty_set)=empty_set)). % 0.20/0.38 cnf(i_0_45, plain, (subset(X1,X1))). % 0.20/0.38 cnf(i_0_50, plain, (set_union2(X1,empty_set)=X1)). % 0.20/0.38 cnf(i_0_39, plain, (set_union2(X1,X1)=X1)). % 0.20/0.38 cnf(i_0_40, plain, (set_intersection2(X1,X1)=X1)). % 0.20/0.38 cnf(i_0_59, lemma, (subset(set_difference(X1,X2),X1))). % 0.20/0.38 cnf(i_0_72, lemma, (subset(X1,set_union2(X1,X2)))). % 0.20/0.38 cnf(i_0_48, lemma, (subset(set_intersection2(X1,X2),X1))). % 0.20/0.38 cnf(i_0_2, plain, (set_union2(X1,X2)=set_union2(X2,X1))). % 0.20/0.38 cnf(i_0_3, plain, (set_intersection2(X1,X2)=set_intersection2(X2,X1))). % 0.20/0.38 cnf(i_0_44, plain, (~empty(esk7_0))). % 0.20/0.38 cnf(i_0_8, plain, (~in(X1,empty_set))). % 0.20/0.38 cnf(i_0_61, negated_conjecture, (set_difference(esk9_0,esk10_0)!=empty_set|~subset(esk9_0,esk10_0))). % 0.20/0.38 cnf(i_0_60, negated_conjecture, (set_difference(esk9_0,esk10_0)=empty_set|subset(esk9_0,esk10_0))). % 0.20/0.38 cnf(i_0_71, plain, (~empty(X1)|~in(X2,X1))). % 0.20/0.38 cnf(i_0_66, lemma, (X1=empty_set|~subset(X1,empty_set))). % 0.20/0.38 cnf(i_0_70, plain, (X1=empty_set|~empty(X1))). % 0.20/0.38 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))). % 0.20/0.38 cnf(i_0_68, lemma, (~disjoint(X1,X2)|~in(X3,set_intersection2(X1,X2)))). % 0.20/0.38 cnf(i_0_63, lemma, (~disjoint(X1,X2)|~in(X3,X2)|~in(X3,X1))). % 0.20/0.38 cnf(i_0_38, plain, (empty(X1)|~empty(set_union2(X2,X1)))). % 0.20/0.38 cnf(i_0_41, lemma, (set_difference(X1,X2)=empty_set|~subset(X1,X2))). % 0.20/0.38 cnf(i_0_42, lemma, (subset(X1,X2)|set_difference(X1,X2)!=empty_set)). % 0.20/0.38 cnf(i_0_73, plain, (X1=X2|~empty(X2)|~empty(X1))). % 0.20/0.38 cnf(i_0_37, plain, (empty(X1)|~empty(set_union2(X1,X2)))). % 0.20/0.38 cnf(i_0_47, lemma, (set_union2(X1,X2)=X2|~subset(X1,X2))). % 0.20/0.38 cnf(i_0_53, lemma, (set_intersection2(X1,X2)=X1|~subset(X1,X2))). % 0.20/0.38 cnf(i_0_31, plain, (set_intersection2(X1,X2)=empty_set|~disjoint(X1,X2))). % 0.20/0.38 cnf(i_0_4, plain, (X1=X2|~subset(X2,X1)|~subset(X1,X2))). % 0.20/0.38 cnf(i_0_15, plain, (subset(X1,X2)|~in(esk3_2(X1,X2),X2))). % 0.20/0.38 cnf(i_0_30, plain, (disjoint(X1,X2)|set_intersection2(X1,X2)!=empty_set)). % 0.20/0.38 cnf(i_0_7, plain, (X1=empty_set|in(esk1_1(X1),X1))). % 0.20/0.38 cnf(i_0_46, plain, (disjoint(X1,X2)|~disjoint(X2,X1))). % 0.20/0.38 cnf(i_0_17, plain, (in(X1,X2)|~subset(X3,X2)|~in(X1,X3))). % 0.20/0.38 cnf(i_0_28, plain, (~in(X1,set_difference(X2,X3))|~in(X1,X3))). % 0.20/0.38 cnf(i_0_16, plain, (subset(X1,X2)|in(esk3_2(X1,X2),X1))). % 0.20/0.38 cnf(i_0_51, lemma, (subset(X1,X2)|~subset(X3,X2)|~subset(X1,X3))). % 0.20/0.38 cnf(i_0_58, lemma, (subset(set_difference(X1,X2),set_difference(X3,X2))|~subset(X1,X3))). % 0.20/0.38 cnf(i_0_49, lemma, (subset(X1,set_intersection2(X2,X3))|~subset(X1,X3)|~subset(X1,X2))). % 0.20/0.38 cnf(i_0_74, lemma, (subset(set_union2(X1,X2),X3)|~subset(X2,X3)|~subset(X1,X3))). % 0.20/0.38 cnf(i_0_64, lemma, (disjoint(X1,X2)|in(esk11_2(X1,X2),X2))). % 0.20/0.38 cnf(i_0_65, lemma, (disjoint(X1,X2)|in(esk11_2(X1,X2),X1))). % 0.20/0.38 cnf(i_0_22, plain, (in(X1,X2)|~in(X1,set_intersection2(X3,X2)))). % 0.20/0.38 cnf(i_0_12, plain, (in(X1,set_union2(X2,X3))|~in(X1,X3))). % 0.20/0.38 cnf(i_0_13, plain, (in(X1,set_union2(X2,X3))|~in(X1,X2))). % 0.20/0.38 cnf(i_0_29, plain, (in(X1,X2)|~in(X1,set_difference(X2,X3)))). % 0.20/0.38 cnf(i_0_23, plain, (in(X1,X2)|~in(X1,set_intersection2(X2,X3)))). % 0.20/0.38 cnf(i_0_69, lemma, (disjoint(X1,X2)|in(esk12_2(X1,X2),set_intersection2(X1,X2)))). % 0.20/0.38 cnf(i_0_56, plain, (X1=X2|~in(esk8_2(X1,X2),X2)|~in(esk8_2(X1,X2),X1))). % 0.20/0.38 cnf(i_0_21, plain, (in(X1,set_intersection2(X2,X3))|~in(X1,X3)|~in(X1,X2))). % 0.20/0.38 cnf(i_0_52, lemma, (subset(set_intersection2(X1,X2),set_intersection2(X3,X2))|~subset(X1,X3))). % 0.20/0.38 cnf(i_0_55, plain, (X1=X2|in(esk8_2(X1,X2),X1)|in(esk8_2(X1,X2),X2))). % 0.20/0.38 cnf(i_0_27, plain, (in(X1,set_difference(X2,X3))|in(X1,X3)|~in(X1,X2))). % 0.20/0.38 cnf(i_0_14, plain, (in(X1,X2)|in(X1,X3)|~in(X1,set_union2(X3,X2)))). % 0.20/0.38 cnf(i_0_18, plain, (X1=set_intersection2(X2,X3)|in(esk4_3(X2,X3,X1),X3)|in(esk4_3(X2,X3,X1),X1))). % 0.20/0.38 cnf(i_0_25, plain, (X1=set_difference(X2,X3)|in(esk5_3(X2,X3,X1),X2)|in(esk5_3(X2,X3,X1),X1))). % 0.20/0.38 cnf(i_0_10, plain, (X1=set_union2(X2,X3)|~in(esk2_3(X2,X3,X1),X1)|~in(esk2_3(X2,X3,X1),X3))). % 0.20/0.38 cnf(i_0_11, plain, (X1=set_union2(X2,X3)|~in(esk2_3(X2,X3,X1),X1)|~in(esk2_3(X2,X3,X1),X2))). % 0.20/0.38 cnf(i_0_24, plain, (X1=set_difference(X2,X3)|in(esk5_3(X2,X3,X1),X1)|~in(esk5_3(X2,X3,X1),X3))). % 0.20/0.38 cnf(i_0_20, plain, (X1=set_intersection2(X2,X3)|~in(esk4_3(X2,X3,X1),X1)|~in(esk4_3(X2,X3,X1),X3)|~in(esk4_3(X2,X3,X1),X2))). % 0.20/0.38 cnf(i_0_19, plain, (X1=set_intersection2(X2,X3)|in(esk4_3(X2,X3,X1),X2)|in(esk4_3(X2,X3,X1),X1))). % 0.20/0.38 cnf(i_0_26, plain, (X1=set_difference(X2,X3)|in(esk5_3(X2,X3,X1),X3)|~in(esk5_3(X2,X3,X1),X1)|~in(esk5_3(X2,X3,X1),X2))). % 0.20/0.38 cnf(i_0_9, plain, (X1=set_union2(X2,X3)|in(esk2_3(X2,X3,X1),X2)|in(esk2_3(X2,X3,X1),X3)|in(esk2_3(X2,X3,X1),X1))). % 0.20/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.38 # Begin printing tableau % 0.20/0.38 # Found 6 steps % 0.20/0.38 cnf(i_0_60, negated_conjecture, (set_difference(esk9_0,esk10_0)=empty_set|subset(esk9_0,esk10_0)), inference(start_rule)). % 0.20/0.38 cnf(i_0_88, plain, (subset(esk9_0,esk10_0)), inference(extension_rule, [i_0_74])). % 0.20/0.38 cnf(i_0_274, plain, (~subset(empty_set,esk10_0)), inference(closure_rule, [i_0_57])). % 0.20/0.38 cnf(i_0_273, plain, (subset(set_union2(esk9_0,empty_set),esk10_0)), inference(extension_rule, [i_0_41])). % 0.20/0.38 cnf(i_0_87, plain, (set_difference(esk9_0,esk10_0)=empty_set), inference(etableau_closure_rule, [i_0_87, ...])). % 0.20/0.38 cnf(i_0_358, plain, (set_difference(set_union2(esk9_0,empty_set),esk10_0)=empty_set), inference(etableau_closure_rule, [i_0_358, ...])). % 0.20/0.38 # End printing tableau % 0.20/0.38 # SZS output end % 0.20/0.38 # Branches closed with saturation will be marked with an "s" % 0.20/0.38 # Child (25069) has found a proof. % 0.20/0.38 % 0.20/0.38 # Proof search is over... % 0.20/0.38 # Freeing feature tree %------------------------------------------------------------------------------