%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SEU134+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 : n032.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.15s 0.33s % Output : CNFRefutation 0.15s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.10 % Problem : SEU134+1 : TPTP v8.1.0. Released v3.3.0. % 0.10/0.11 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.10/0.30 % Computer : n032.cluster.edu % 0.10/0.30 % Model : x86_64 x86_64 % 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.30 % Memory : 8042.1875MB % 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64 % 0.10/0.30 % CPULimit : 300 % 0.10/0.30 % WCLimit : 600 % 0.10/0.30 % DateTime : Mon Jun 20 12:06:04 EDT 2022 % 0.10/0.30 % CPUTime : % 0.15/0.33 # No SInE strategy applied % 0.15/0.33 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.15/0.33 # and selection function SelectComplexExceptUniqMaxHorn. % 0.15/0.33 # % 0.15/0.33 # Presaturation interreduction done % 0.15/0.33 # Number of axioms: 14 Number of unprocessed: 14 % 0.15/0.33 # Tableaux proof search. % 0.15/0.33 # APR header successfully linked. % 0.15/0.33 # Hello from C++ % 0.15/0.33 # The folding up rule is enabled... % 0.15/0.33 # Local unification is enabled... % 0.15/0.33 # Any saturation attempts will use folding labels... % 0.15/0.33 # 14 beginning clauses after preprocessing and clausification % 0.15/0.33 # Creating start rules for all 2 conjectures. % 0.15/0.33 # There are 2 start rule candidates: % 0.15/0.33 # Found 6 unit axioms. % 0.15/0.33 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.15/0.33 # 2 start rule tableaux created. % 0.15/0.33 # 8 extension rule candidate clauses % 0.15/0.33 # 6 unit axiom clauses % 0.15/0.33 % 0.15/0.33 # Requested 8, 32 cores available to the main process. % 0.15/0.33 # There are not enough tableaux to fork, creating more from the initial 2 % 0.15/0.33 # Creating equality axioms % 0.15/0.33 # Ran out of tableaux, making start rules for all clauses % 0.15/0.33 # Returning from population with 19 new_tableaux and 0 remaining starting tableaux. % 0.15/0.33 # We now have 19 tableaux to operate on % 0.15/0.33 # There were 1 total branch saturation attempts. % 0.15/0.33 # There were 0 of these attempts blocked. % 0.15/0.33 # There were 0 deferred branch saturation attempts. % 0.15/0.33 # There were 0 free duplicated saturations. % 0.15/0.33 # There were 1 total successful branch saturations. % 0.15/0.33 # There were 0 successful branch saturations in interreduction. % 0.15/0.33 # There were 0 successful branch saturations on the branch. % 0.15/0.33 # There were 1 successful branch saturations after the branch. % 0.15/0.33 # There were 1 total branch saturation attempts. % 0.15/0.33 # There were 0 of these attempts blocked. % 0.15/0.33 # There were 0 deferred branch saturation attempts. % 0.15/0.33 # There were 0 free duplicated saturations. % 0.15/0.33 # There were 1 total successful branch saturations. % 0.15/0.33 # There were 0 successful branch saturations in interreduction. % 0.15/0.33 # There were 0 successful branch saturations on the branch. % 0.15/0.33 # There were 1 successful branch saturations after the branch. % 0.15/0.33 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.15/0.33 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.15/0.33 # Begin clausification derivation % 0.15/0.33 % 0.15/0.33 # End clausification derivation % 0.15/0.33 # Begin listing active clauses obtained from FOF to CNF conversion % 0.15/0.33 cnf(i_0_9, plain, (empty(empty_set))). % 0.15/0.33 cnf(i_0_11, plain, (set_difference(empty_set,X1)=empty_set)). % 0.15/0.33 cnf(i_0_2, plain, (empty(esk1_0))). % 0.15/0.33 cnf(i_0_10, plain, (set_difference(X1,empty_set)=X1)). % 0.15/0.33 cnf(i_0_6, plain, (subset(X1,X1))). % 0.15/0.33 cnf(i_0_3, plain, (~empty(esk2_0))). % 0.15/0.33 cnf(i_0_14, negated_conjecture, (set_difference(esk3_0,esk4_0)!=empty_set|~subset(esk3_0,esk4_0))). % 0.15/0.33 cnf(i_0_13, negated_conjecture, (set_difference(esk3_0,esk4_0)=empty_set|subset(esk3_0,esk4_0))). % 0.15/0.33 cnf(i_0_4, plain, (~empty(X1)|~in(X2,X1))). % 0.15/0.33 cnf(i_0_12, plain, (X1=empty_set|~empty(X1))). % 0.15/0.33 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))). % 0.15/0.33 cnf(i_0_15, plain, (set_difference(X1,X2)=empty_set|~subset(X1,X2))). % 0.15/0.33 cnf(i_0_16, plain, (subset(X1,X2)|set_difference(X1,X2)!=empty_set)). % 0.15/0.33 cnf(i_0_5, plain, (X1=X2|~empty(X2)|~empty(X1))). % 0.15/0.33 cnf(i_0_157, plain, (X19=X19)). % 0.15/0.33 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.15/0.33 # Begin printing tableau % 0.15/0.33 # Found 6 steps % 0.15/0.33 cnf(i_0_9, plain, (empty(empty_set)), inference(start_rule)). % 0.15/0.33 cnf(i_0_165, plain, (empty(empty_set)), inference(extension_rule, [i_0_5])). % 0.15/0.33 cnf(i_0_201, plain, (~empty(empty_set)), inference(closure_rule, [i_0_9])). % 0.15/0.33 cnf(i_0_199, plain, (empty_set=empty_set), inference(extension_rule, [i_0_160])). % 0.15/0.33 cnf(i_0_250, plain, (empty_set!=set_difference(empty_set,X1)), inference(closure_rule, [i_0_11])). % 0.15/0.33 cnf(i_0_248, plain, (empty_set=set_difference(empty_set,X1)), inference(etableau_closure_rule, [i_0_248, ...])). % 0.15/0.33 # End printing tableau % 0.15/0.33 # SZS output end % 0.15/0.33 # Branches closed with saturation will be marked with an "s" % 0.15/0.33 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.15/0.33 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.15/0.33 # Begin clausification derivation % 0.15/0.33 % 0.15/0.33 # End clausification derivation % 0.15/0.33 # Begin listing active clauses obtained from FOF to CNF conversion % 0.15/0.33 cnf(i_0_9, plain, (empty(empty_set))). % 0.15/0.33 cnf(i_0_11, plain, (set_difference(empty_set,X1)=empty_set)). % 0.15/0.33 cnf(i_0_2, plain, (empty(esk1_0))). % 0.15/0.33 cnf(i_0_10, plain, (set_difference(X1,empty_set)=X1)). % 0.15/0.33 cnf(i_0_6, plain, (subset(X1,X1))). % 0.15/0.33 cnf(i_0_3, plain, (~empty(esk2_0))). % 0.15/0.33 cnf(i_0_14, negated_conjecture, (set_difference(esk3_0,esk4_0)!=empty_set|~subset(esk3_0,esk4_0))). % 0.15/0.33 cnf(i_0_13, negated_conjecture, (set_difference(esk3_0,esk4_0)=empty_set|subset(esk3_0,esk4_0))). % 0.15/0.33 cnf(i_0_4, plain, (~empty(X1)|~in(X2,X1))). % 0.15/0.33 cnf(i_0_12, plain, (X1=empty_set|~empty(X1))). % 0.15/0.33 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))). % 0.15/0.33 cnf(i_0_15, plain, (set_difference(X1,X2)=empty_set|~subset(X1,X2))). % 0.15/0.33 cnf(i_0_16, plain, (subset(X1,X2)|set_difference(X1,X2)!=empty_set)). % 0.15/0.33 cnf(i_0_5, plain, (X1=X2|~empty(X2)|~empty(X1))). % 0.15/0.33 cnf(i_0_157, plain, (X19=X19)). % 0.15/0.33 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.15/0.33 # Begin printing tableau % 0.15/0.33 # Found 6 steps % 0.15/0.33 cnf(i_0_9, plain, (empty(empty_set)), inference(start_rule)). % 0.15/0.33 cnf(i_0_165, plain, (empty(empty_set)), inference(extension_rule, [i_0_4])). % 0.15/0.33 cnf(i_0_190, plain, (~in(set_difference(empty_set,empty_set),empty_set)), inference(extension_rule, [i_0_161])). % 0.15/0.33 cnf(i_0_252, plain, (empty_set!=set_difference(empty_set,empty_set)), inference(closure_rule, [i_0_11])). % 0.15/0.33 cnf(i_0_253, plain, (set_difference(empty_set,X1)!=empty_set), inference(closure_rule, [i_0_11])). % 0.15/0.33 cnf(i_0_254, plain, (~in(empty_set,set_difference(empty_set,X1))), inference(etableau_closure_rule, [i_0_254, ...])). % 0.15/0.33 # End printing tableau % 0.15/0.33 # SZS output end % 0.15/0.33 # Branches closed with saturation will be marked with an "s" % 0.15/0.33 # There were 1 total branch saturation attempts. % 0.15/0.33 # There were 0 of these attempts blocked. % 0.15/0.33 # There were 0 deferred branch saturation attempts. % 0.15/0.33 # There were 0 free duplicated saturations. % 0.15/0.33 # There were 1 total successful branch saturations. % 0.15/0.33 # There were 0 successful branch saturations in interreduction. % 0.15/0.33 # There were 0 successful branch saturations on the branch. % 0.15/0.33 # There were 1 successful branch saturations after the branch. % 0.15/0.33 # There were 1 total branch saturation attempts. % 0.15/0.33 # There were 0 of these attempts blocked. % 0.15/0.33 # There were 0 deferred branch saturation attempts. % 0.15/0.33 # There were 0 free duplicated saturations. % 0.15/0.33 # There were 1 total successful branch saturations. % 0.15/0.33 # There were 0 successful branch saturations in interreduction. % 0.15/0.33 # There were 0 successful branch saturations on the branch. % 0.15/0.33 # There were 1 successful branch saturations after the branch. % 0.15/0.33 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.15/0.33 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.15/0.33 # Begin clausification derivation % 0.15/0.33 % 0.15/0.33 # End clausification derivation % 0.15/0.33 # Begin listing active clauses obtained from FOF to CNF conversion % 0.15/0.33 cnf(i_0_9, plain, (empty(empty_set))). % 0.15/0.33 cnf(i_0_11, plain, (set_difference(empty_set,X1)=empty_set)). % 0.15/0.33 cnf(i_0_2, plain, (empty(esk1_0))). % 0.15/0.33 cnf(i_0_10, plain, (set_difference(X1,empty_set)=X1)). % 0.15/0.33 cnf(i_0_6, plain, (subset(X1,X1))). % 0.15/0.33 cnf(i_0_3, plain, (~empty(esk2_0))). % 0.15/0.33 cnf(i_0_14, negated_conjecture, (set_difference(esk3_0,esk4_0)!=empty_set|~subset(esk3_0,esk4_0))). % 0.15/0.33 cnf(i_0_13, negated_conjecture, (set_difference(esk3_0,esk4_0)=empty_set|subset(esk3_0,esk4_0))). % 0.15/0.33 cnf(i_0_4, plain, (~empty(X1)|~in(X2,X1))). % 0.15/0.33 cnf(i_0_12, plain, (X1=empty_set|~empty(X1))). % 0.15/0.33 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))). % 0.15/0.33 cnf(i_0_15, plain, (set_difference(X1,X2)=empty_set|~subset(X1,X2))). % 0.15/0.33 cnf(i_0_16, plain, (subset(X1,X2)|set_difference(X1,X2)!=empty_set)). % 0.15/0.33 cnf(i_0_5, plain, (X1=X2|~empty(X2)|~empty(X1))). % 0.15/0.33 cnf(i_0_157, plain, (X19=X19)). % 0.15/0.33 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.15/0.33 # Begin printing tableau % 0.15/0.33 # Found 6 steps % 0.15/0.33 cnf(i_0_9, plain, (empty(empty_set)), inference(start_rule)). % 0.15/0.33 cnf(i_0_165, plain, (empty(empty_set)), inference(extension_rule, [i_0_162])). % 0.15/0.33 cnf(i_0_217, plain, (empty(esk2_0)), inference(closure_rule, [i_0_3])). % 0.15/0.33 cnf(i_0_218, plain, (empty_set!=esk2_0), inference(extension_rule, [i_0_160])). % 0.15/0.33 cnf(i_0_249, plain, (empty_set!=set_difference(empty_set,X1)), inference(closure_rule, [i_0_11])). % 0.15/0.33 cnf(i_0_250, plain, (set_difference(empty_set,X1)!=esk2_0), inference(etableau_closure_rule, [i_0_250, ...])). % 0.15/0.33 # End printing tableau % 0.15/0.33 # SZS output end % 0.15/0.33 # Branches closed with saturation will be marked with an "s" % 0.15/0.33 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.15/0.33 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.15/0.33 # Begin clausification derivation % 0.15/0.33 % 0.15/0.33 # End clausification derivation % 0.15/0.33 # Begin listing active clauses obtained from FOF to CNF conversion % 0.15/0.33 cnf(i_0_9, plain, (empty(empty_set))). % 0.15/0.33 cnf(i_0_11, plain, (set_difference(empty_set,X1)=empty_set)). % 0.15/0.33 cnf(i_0_2, plain, (empty(esk1_0))). % 0.15/0.33 cnf(i_0_10, plain, (set_difference(X1,empty_set)=X1)). % 0.15/0.33 cnf(i_0_6, plain, (subset(X1,X1))). % 0.15/0.33 cnf(i_0_3, plain, (~empty(esk2_0))). % 0.15/0.33 cnf(i_0_14, negated_conjecture, (set_difference(esk3_0,esk4_0)!=empty_set|~subset(esk3_0,esk4_0))). % 0.15/0.33 cnf(i_0_13, negated_conjecture, (set_difference(esk3_0,esk4_0)=empty_set|subset(esk3_0,esk4_0))). % 0.15/0.33 cnf(i_0_4, plain, (~empty(X1)|~in(X2,X1))). % 0.15/0.33 cnf(i_0_12, plain, (X1=empty_set|~empty(X1))). % 0.15/0.33 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))). % 0.15/0.33 cnf(i_0_15, plain, (set_difference(X1,X2)=empty_set|~subset(X1,X2))). % 0.15/0.33 cnf(i_0_16, plain, (subset(X1,X2)|set_difference(X1,X2)!=empty_set)). % 0.15/0.33 cnf(i_0_5, plain, (X1=X2|~empty(X2)|~empty(X1))). % 0.15/0.33 cnf(i_0_157, plain, (X19=X19)). % 0.15/0.33 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.15/0.33 # Begin printing tableau % 0.15/0.33 # Found 6 steps % 0.15/0.33 cnf(i_0_9, plain, (empty(empty_set)), inference(start_rule)). % 0.15/0.33 cnf(i_0_165, plain, (empty(empty_set)), inference(extension_rule, [i_0_5])). % 0.15/0.33 cnf(i_0_200, plain, (~empty(empty_set)), inference(closure_rule, [i_0_9])). % 0.15/0.33 cnf(i_0_199, plain, (empty_set=empty_set), inference(extension_rule, [i_0_160])). % 0.15/0.33 cnf(i_0_250, plain, (empty_set!=set_difference(empty_set,X1)), inference(closure_rule, [i_0_11])). % 0.15/0.33 cnf(i_0_248, plain, (empty_set=set_difference(empty_set,X1)), inference(etableau_closure_rule, [i_0_248, ...])). % 0.15/0.33 # End printing tableau % 0.15/0.33 # SZS output end % 0.15/0.33 # Branches closed with saturation will be marked with an "s" % 0.15/0.33 # There were 1 total branch saturation attempts. % 0.15/0.33 # There were 0 of these attempts blocked. % 0.15/0.33 # There were 0 deferred branch saturation attempts. % 0.15/0.33 # There were 0 free duplicated saturations. % 0.15/0.33 # There were 1 total successful branch saturations. % 0.15/0.33 # There were 0 successful branch saturations in interreduction. % 0.15/0.33 # There were 0 successful branch saturations on the branch. % 0.15/0.33 # There were 1 successful branch saturations after the branch. % 0.15/0.33 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.15/0.33 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.15/0.33 # Begin clausification derivation % 0.15/0.33 % 0.15/0.33 # End clausification derivation % 0.15/0.33 # Begin listing active clauses obtained from FOF to CNF conversion % 0.15/0.33 cnf(i_0_9, plain, (empty(empty_set))). % 0.15/0.33 cnf(i_0_11, plain, (set_difference(empty_set,X1)=empty_set)). % 0.15/0.33 cnf(i_0_2, plain, (empty(esk1_0))). % 0.15/0.33 cnf(i_0_10, plain, (set_difference(X1,empty_set)=X1)). % 0.15/0.33 cnf(i_0_6, plain, (subset(X1,X1))). % 0.15/0.33 cnf(i_0_3, plain, (~empty(esk2_0))). % 0.15/0.33 cnf(i_0_14, negated_conjecture, (set_difference(esk3_0,esk4_0)!=empty_set|~subset(esk3_0,esk4_0))). % 0.15/0.33 cnf(i_0_13, negated_conjecture, (set_difference(esk3_0,esk4_0)=empty_set|subset(esk3_0,esk4_0))). % 0.15/0.33 cnf(i_0_4, plain, (~empty(X1)|~in(X2,X1))). % 0.15/0.33 cnf(i_0_12, plain, (X1=empty_set|~empty(X1))). % 0.15/0.33 cnf(i_0_1, plain, (~in(X1,X2)|~in(X2,X1))). % 0.15/0.33 cnf(i_0_15, plain, (set_difference(X1,X2)=empty_set|~subset(X1,X2))). % 0.15/0.33 cnf(i_0_16, plain, (subset(X1,X2)|set_difference(X1,X2)!=empty_set)). % 0.15/0.33 cnf(i_0_5, plain, (X1=X2|~empty(X2)|~empty(X1))). % 0.15/0.33 cnf(i_0_157, plain, (X19=X19)). % 0.15/0.33 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.15/0.33 # Begin printing tableau % 0.15/0.33 # Found 5 steps % 0.15/0.33 cnf(i_0_9, plain, (empty(empty_set)), inference(start_rule)). % 0.15/0.33 cnf(i_0_165, plain, (empty(empty_set)), inference(extension_rule, [i_0_12])). % 0.15/0.33 cnf(i_0_191, plain, (empty_set=empty_set), inference(extension_rule, [i_0_160])). % 0.15/0.33 cnf(i_0_250, plain, (empty_set!=set_difference(empty_set,X1)), inference(closure_rule, [i_0_11])). % 0.15/0.33 cnf(i_0_248, plain, (empty_set=set_difference(empty_set,X1)), inference(etableau_closure_rule, [i_0_248, ...])). % 0.15/0.33 # End printing tableau % 0.15/0.33 # SZS output end % 0.15/0.33 # Branches closed with saturation will be marked with an "s" % 0.15/0.33 # Child (29084) has found a proof. % 0.15/0.33 % 0.15/0.33 # Proof search is over... % 0.15/0.33 # Freeing feature tree %------------------------------------------------------------------------------