%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SEU123+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 : n023.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.12s 0.37s % Output : CNFRefutation 0.12s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SEU123+2 : TPTP v8.1.0. Released v3.3.0. % 0.07/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.34 % Computer : n023.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Sun Jun 19 17:19:03 EDT 2022 % 0.12/0.34 % 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: 36 Number of unprocessed: 34 % 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 # 34 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 10 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 # 24 extension rule candidate clauses % 0.12/0.37 # 10 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/sandbox/benchmark/theBenchmark.p % 0.12/0.37 # SZS output start for /export/starexec/sandbox/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_33, negated_conjecture, (subset(esk7_0,empty_set))). % 0.12/0.37 cnf(i_0_21, plain, (empty(empty_set))). % 0.12/0.37 cnf(i_0_28, lemma, (subset(empty_set,X1))). % 0.12/0.37 cnf(i_0_23, plain, (empty(esk4_0))). % 0.12/0.37 cnf(i_0_25, plain, (subset(X1,X1))). % 0.12/0.37 cnf(i_0_22, plain, (set_intersection2(X1,X1)=X1)). % 0.12/0.37 cnf(i_0_2, plain, (set_intersection2(X1,X2)=set_intersection2(X2,X1))). % 0.12/0.37 cnf(i_0_32, negated_conjecture, (esk7_0!=empty_set)). % 0.12/0.37 cnf(i_0_24, plain, (~empty(esk5_0))). % 0.12/0.37 cnf(i_0_7, plain, (~in(X1,empty_set))). % 0.12/0.37 cnf(i_0_37, plain, (~empty(X1)|~in(X2,X1))). % 0.12/0.37 cnf(i_0_36, plain, (X1=empty_set|~empty(X1))). % 0.12/0.37 cnf(i_0_38, plain, (X1=X2|~empty(X2)|~empty(X1))). % 0.12/0.37 cnf(i_0_18, plain, (set_intersection2(X1,X2)=empty_set|~disjoint(X1,X2))). % 0.12/0.37 cnf(i_0_6, plain, (X1=empty_set|in(esk1_1(X1),X1))). % 0.12/0.37 cnf(i_0_17, plain, (disjoint(X1,X2)|set_intersection2(X1,X2)!=empty_set)). % 0.12/0.37 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))). % 0.12/0.37 cnf(i_0_34, lemma, (~disjoint(X1,X2)|~in(X3,set_intersection2(X1,X2)))). % 0.12/0.37 cnf(i_0_29, lemma, (~disjoint(X1,X2)|~in(X3,X2)|~in(X3,X1))). % 0.12/0.37 cnf(i_0_26, plain, (disjoint(X1,X2)|~disjoint(X2,X1))). % 0.12/0.37 cnf(i_0_3, plain, (X1=X2|~subset(X2,X1)|~subset(X1,X2))). % 0.12/0.37 cnf(i_0_8, plain, (subset(X1,X2)|~in(esk2_2(X1,X2),X2))). % 0.12/0.37 cnf(i_0_10, plain, (in(X1,X2)|~subset(X3,X2)|~in(X1,X3))). % 0.12/0.37 cnf(i_0_27, lemma, (subset(X1,X2)|~subset(X3,X2)|~subset(X1,X3))). % 0.12/0.37 cnf(i_0_9, plain, (subset(X1,X2)|in(esk2_2(X1,X2),X1))). % 0.12/0.37 cnf(i_0_30, lemma, (disjoint(X1,X2)|in(esk6_2(X1,X2),X2))). % 0.12/0.37 cnf(i_0_15, plain, (in(X1,X2)|~in(X1,set_intersection2(X3,X2)))). % 0.12/0.37 cnf(i_0_16, plain, (in(X1,X2)|~in(X1,set_intersection2(X2,X3)))). % 0.12/0.37 cnf(i_0_31, lemma, (disjoint(X1,X2)|in(esk6_2(X1,X2),X1))). % 0.12/0.37 cnf(i_0_35, lemma, (disjoint(X1,X2)|in(esk8_2(X1,X2),set_intersection2(X1,X2)))). % 0.12/0.37 cnf(i_0_14, plain, (in(X1,set_intersection2(X2,X3))|~in(X1,X3)|~in(X1,X2))). % 0.12/0.37 cnf(i_0_11, plain, (X1=set_intersection2(X2,X3)|in(esk3_3(X2,X3,X1),X3)|in(esk3_3(X2,X3,X1),X1))). % 0.12/0.37 cnf(i_0_12, plain, (X1=set_intersection2(X2,X3)|in(esk3_3(X2,X3,X1),X2)|in(esk3_3(X2,X3,X1),X1))). % 0.12/0.37 cnf(i_0_13, plain, (X1=set_intersection2(X2,X3)|~in(esk3_3(X2,X3,X1),X1)|~in(esk3_3(X2,X3,X1),X3)|~in(esk3_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_32, negated_conjecture, (esk7_0!=empty_set), inference(start_rule)). % 0.12/0.37 cnf(i_0_45, plain, (esk7_0!=empty_set), inference(extension_rule, [i_0_3])). % 0.12/0.37 cnf(i_0_70, plain, (~subset(empty_set,esk7_0)), inference(closure_rule, [i_0_28])). % 0.12/0.37 cnf(i_0_71, plain, (~subset(esk7_0,empty_set)), inference(closure_rule, [i_0_33])). % 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 5 new_tableaux and 0 remaining starting tableaux. % 0.12/0.37 # We now have 5 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 %------------------------------------------------------------------------------