%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SEU124+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 : n014.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:57 EDT 2022 % Result : Theorem 0.13s 0.39s % Output : CNFRefutation 0.13s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.13 % Problem : SEU124+2 : TPTP v8.1.0. Released v3.3.0. % 0.12/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 : n014.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 : Mon Jun 20 10:04:02 EDT 2022 % 0.13/0.35 % CPUTime : % 0.13/0.38 # No SInE strategy applied % 0.13/0.38 # Auto-Mode selected heuristic G_E___300_C01_F1_SE_CS_SP_S0Y % 0.13/0.38 # and selection function SelectMaxLComplexAvoidPosPred. % 0.13/0.38 # % 0.13/0.38 # Number of axioms: 47 Number of unprocessed: 47 % 0.13/0.38 # Tableaux proof search. % 0.13/0.38 # APR header successfully linked. % 0.13/0.38 # 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 # 47 beginning clauses after preprocessing and clausification % 0.13/0.39 # Creating start rules for all 1 conjectures. % 0.13/0.39 # There are 1 start rule candidates: % 0.13/0.39 # Found 11 unit axioms. % 0.13/0.39 # 1 start rule tableaux created. % 0.13/0.39 # 36 extension rule candidate clauses % 0.13/0.39 # 11 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 1 % 0.13/0.39 # There were 1 total branch saturation attempts. % 0.13/0.39 # There were 0 of these attempts blocked. % 0.13/0.39 # There were 0 deferred branch saturation attempts. % 0.13/0.39 # There were 0 free duplicated saturations. % 0.13/0.39 # There were 1 total successful branch saturations. % 0.13/0.39 # There were 0 successful branch saturations in interreduction. % 0.13/0.39 # There were 0 successful branch saturations on the branch. % 0.13/0.39 # There were 1 successful branch saturations after the branch. % 0.13/0.39 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.39 # Begin clausification derivation % 0.13/0.39 % 0.13/0.39 # End clausification derivation % 0.13/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.39 cnf(i_0_29, plain, (empty(empty_set))). % 0.13/0.39 cnf(i_0_34, plain, (empty(esk5_0))). % 0.13/0.39 cnf(i_0_35, plain, (~empty(esk6_0))). % 0.13/0.39 cnf(i_0_47, plain, (X1=empty_set|~empty(X1))). % 0.13/0.39 cnf(i_0_40, lemma, (subset(empty_set,X1))). % 0.13/0.39 cnf(i_0_38, plain, (set_union2(X1,empty_set)=X1)). % 0.13/0.39 cnf(i_0_36, plain, (subset(X1,X1))). % 0.13/0.39 cnf(i_0_32, plain, (set_union2(X1,X1)=X1)). % 0.13/0.39 cnf(i_0_33, plain, (set_intersection2(X1,X1)=X1)). % 0.13/0.39 cnf(i_0_50, plain, (X1=X2|~empty(X2)|~empty(X1))). % 0.13/0.39 cnf(i_0_5, plain, (subset(X1,X2)|X1!=X2)). % 0.13/0.39 cnf(i_0_6, plain, (subset(X1,X2)|X1!=X2)). % 0.13/0.39 cnf(i_0_44, lemma, (X1=empty_set|~subset(X1,empty_set))). % 0.13/0.39 cnf(i_0_7, plain, (X1=empty_set|in(esk1_1(X1),X1))). % 0.13/0.39 cnf(i_0_8, plain, (X1!=empty_set|~in(X2,X1))). % 0.13/0.39 cnf(i_0_2, plain, (set_union2(X1,X2)=set_union2(X2,X1))). % 0.13/0.39 cnf(i_0_3, plain, (set_intersection2(X1,X2)=set_intersection2(X2,X1))). % 0.13/0.39 cnf(i_0_48, plain, (~empty(X2)|~in(X1,X2))). % 0.13/0.39 cnf(i_0_25, plain, (set_intersection2(X1,X2)=empty_set|~disjoint(X1,X2))). % 0.13/0.39 cnf(i_0_24, plain, (disjoint(X1,X2)|set_intersection2(X1,X2)!=empty_set)). % 0.13/0.39 cnf(i_0_37, plain, (disjoint(X2,X1)|~disjoint(X1,X2))). % 0.13/0.39 cnf(i_0_1, plain, (~in(X2,X1)|~in(X1,X2))). % 0.13/0.39 cnf(i_0_4, plain, (X1=X2|~subset(X2,X1)|~subset(X1,X2))). % 0.13/0.39 cnf(i_0_49, negated_conjecture, (~subset(esk9_0,set_union2(esk9_0,esk10_0)))). % 0.13/0.39 cnf(i_0_31, plain, (empty(X1)|~empty(set_union2(X2,X1)))). % 0.13/0.39 cnf(i_0_30, plain, (empty(X1)|~empty(set_union2(X1,X2)))). % 0.13/0.39 cnf(i_0_16, plain, (subset(X1,X2)|in(esk3_2(X1,X2),X1))). % 0.13/0.39 cnf(i_0_42, lemma, (disjoint(X1,X2)|in(esk7_2(X1,X2),X2))). % 0.13/0.39 cnf(i_0_43, lemma, (disjoint(X1,X2)|in(esk7_2(X1,X2),X1))). % 0.13/0.39 cnf(i_0_17, plain, (in(X3,X2)|~in(X3,X1)|~subset(X1,X2))). % 0.13/0.39 cnf(i_0_39, lemma, (subset(X1,X3)|~subset(X2,X3)|~subset(X1,X2))). % 0.13/0.39 cnf(i_0_12, plain, (in(X1,X3)|X3!=set_union2(X4,X2)|~in(X1,X2))). % 0.13/0.39 cnf(i_0_13, plain, (in(X1,X3)|X3!=set_union2(X2,X4)|~in(X1,X2))). % 0.13/0.39 cnf(i_0_22, plain, (in(X1,X2)|X3!=set_intersection2(X4,X2)|~in(X1,X3))). % 0.13/0.39 cnf(i_0_23, plain, (in(X1,X2)|X3!=set_intersection2(X2,X4)|~in(X1,X3))). % 0.13/0.39 cnf(i_0_41, lemma, (~in(X1,X3)|~in(X1,X2)|~disjoint(X2,X3))). % 0.13/0.39 cnf(i_0_14, plain, (in(X1,X4)|in(X1,X3)|X2!=set_union2(X3,X4)|~in(X1,X2))). % 0.13/0.39 cnf(i_0_15, plain, (subset(X1,X2)|~in(esk3_2(X1,X2),X2))). % 0.13/0.39 cnf(i_0_46, lemma, (disjoint(X1,X2)|in(esk8_2(X1,X2),set_intersection2(X1,X2)))). % 0.13/0.39 cnf(i_0_21, plain, (in(X1,X4)|X4!=set_intersection2(X2,X3)|~in(X1,X3)|~in(X1,X2))). % 0.13/0.39 cnf(i_0_45, lemma, (~disjoint(X2,X3)|~in(X1,set_intersection2(X2,X3)))). % 0.13/0.39 cnf(i_0_18, plain, (X3=set_intersection2(X1,X2)|in(esk4_3(X1,X2,X3),X3)|in(esk4_3(X1,X2,X3),X2))). % 0.13/0.39 cnf(i_0_19, plain, (X3=set_intersection2(X1,X2)|in(esk4_3(X1,X2,X3),X3)|in(esk4_3(X1,X2,X3),X1))). % 0.13/0.39 cnf(i_0_9, plain, (X3=set_union2(X1,X2)|in(esk2_3(X1,X2,X3),X3)|in(esk2_3(X1,X2,X3),X2)|in(esk2_3(X1,X2,X3),X1))). % 0.13/0.39 cnf(i_0_10, plain, (X3=set_union2(X1,X2)|~in(esk2_3(X1,X2,X3),X3)|~in(esk2_3(X1,X2,X3),X2))). % 0.13/0.39 cnf(i_0_11, plain, (X3=set_union2(X1,X2)|~in(esk2_3(X1,X2,X3),X3)|~in(esk2_3(X1,X2,X3),X1))). % 0.13/0.39 cnf(i_0_20, plain, (X3=set_intersection2(X1,X2)|~in(esk4_3(X1,X2,X3),X3)|~in(esk4_3(X1,X2,X3),X2)|~in(esk4_3(X1,X2,X3),X1))). % 0.13/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.39 # Begin printing tableau % 0.13/0.39 # Found 5 steps % 0.13/0.39 cnf(i_0_49, negated_conjecture, (~subset(esk9_0,set_union2(esk9_0,esk10_0))), inference(start_rule)). % 0.13/0.39 cnf(i_0_51, plain, (~subset(esk9_0,set_union2(esk9_0,esk10_0))), inference(extension_rule, [i_0_15])). % 0.13/0.39 cnf(i_0_116, plain, (~in(esk3_2(esk9_0,set_union2(esk9_0,esk10_0)),set_union2(esk9_0,esk10_0))), inference(extension_rule, [i_0_17])). % 0.13/0.39 cnf(i_0_185, plain, (~subset(empty_set,set_union2(esk9_0,esk10_0))), inference(closure_rule, [i_0_40])). % 0.13/0.39 cnf(i_0_184, plain, (~in(esk3_2(esk9_0,set_union2(esk9_0,esk10_0)),empty_set)), inference(etableau_closure_rule, [i_0_184, ...])). % 0.13/0.39 # End printing tableau % 0.13/0.39 # SZS output end % 0.13/0.39 # Branches closed with saturation will be marked with an "s" % 0.13/0.39 # Returning from population with 5 new_tableaux and 0 remaining starting tableaux. % 0.13/0.39 # We now have 5 tableaux to operate on % 0.13/0.39 # Found closed tableau during pool population. % 0.13/0.39 # Proof search is over... % 0.13/0.39 # Freeing feature tree %------------------------------------------------------------------------------