%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LCL431-2 : TPTP v9.3.1. Released v3.2.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 : n011.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8046.5625MB % OS : Linux 6.8.0-71-generic % CPULimit : 300s % WCLimit : 300s % DateTime : Mon Sep 7 12:01:13 PM UTC 2026 % Result : Unsatisfiable 0.13s 0.38s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : LCL431-2 : TPTP v9.3.1. Released v3.2.0. % 0.00/0.03 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.09/0.34 % Computer : n011.cluster.edu % 0.09/0.34 % Model : x86_64 x86_64 % 0.09/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.34 % Memory : 8046.5625MB % 0.09/0.34 % OS : Linux 6.8.0-71-generic % 0.09/0.34 % CPULimit : 300 % 0.09/0.34 % WCLimit : 300 % 0.09/0.34 % DateTime : Fri Sep 4 17:22:28 UTC 2026 % 0.09/0.34 % CPUTime : % 0.13/0.37 # No SInE strategy applied % 0.13/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.37 # % 0.13/0.37 # Presaturation interreduction done % 0.13/0.37 # Number of axioms: 4 Number of unprocessed: 4 % 0.13/0.37 # Tableaux proof search. % 0.13/0.37 # APR header successfully linked. % 0.13/0.37 # Hello from C++ % 0.13/0.38 # The folding up rule is enabled... % 0.13/0.38 # Local unification is enabled... % 0.13/0.38 # Any saturation attempts will use folding labels... % 0.13/0.38 # 4 beginning clauses after preprocessing and clausification % 0.13/0.38 # Creating start rules for all 2 conjectures. % 0.13/0.38 # There are 2 start rule candidates: % 0.13/0.38 # Found 3 unit axioms. % 0.13/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.38 # 2 start rule tableaux created. % 0.13/0.38 # 1 extension rule candidate clauses % 0.13/0.38 # 3 unit axiom clauses % 0.13/0.38 % 0.13/0.38 # Requested 8, 32 cores available to the main process. % 0.13/0.38 # There are not enough tableaux to fork, creating more from the initial 2 % 0.13/0.38 # Creating equality axioms % 0.13/0.38 # Ran out of tableaux, making start rules for all clauses % 0.13/0.38 # Returning from population with 9 new_tableaux and 0 remaining starting tableaux. % 0.13/0.38 # We now have 9 tableaux to operate on % 0.13/0.38 # There were 1 total branch saturation attempts. % 0.13/0.38 # There were 0 of these attempts blocked. % 0.13/0.38 # There were 0 deferred branch saturation attempts. % 0.13/0.38 # There were 0 free duplicated saturations. % 0.13/0.38 # There were 1 total successful branch saturations. % 0.13/0.38 # There were 0 successful branch saturations in interreduction. % 0.13/0.38 # There were 0 successful branch saturations on the branch. % 0.13/0.38 # There were 1 successful branch saturations after the branch. % 0.13/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.38 # Begin clausification derivation % 0.13/0.38 % 0.13/0.38 # End clausification derivation % 0.13/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.38 cnf(i_0_5, negated_conjecture, (c_PropLog_Osat(c_emptyset,v_p,t_a))). % 0.13/0.38 cnf(i_0_8, plain, (c_minus(X1,X1,tc_set(X2))=c_emptyset)). % 0.13/0.38 cnf(i_0_6, negated_conjecture, (~c_in(v_p,c_PropLog_Othms(c_emptyset,t_a),tc_PropLog_Opl(t_a)))). % 0.13/0.38 cnf(i_0_7, plain, (c_in(X1,c_PropLog_Othms(c_minus(c_PropLog_Ohyps(X1,X2,X3),c_PropLog_Ohyps(X1,X4,X3),tc_set(tc_PropLog_Opl(X3))),X3),tc_PropLog_Opl(X3))|~c_PropLog_Osat(c_emptyset,X1,X3))). % 0.13/0.38 cnf(i_0_17, plain, (X5=X5)). % 0.13/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.38 # Begin printing tableau % 0.13/0.38 # Found 12 steps % 0.13/0.38 cnf(i_0_5, negated_conjecture, (c_PropLog_Osat(c_emptyset,v_p,t_a)), inference(start_rule)). % 0.13/0.38 cnf(i_0_28, plain, (c_PropLog_Osat(c_emptyset,v_p,t_a)), inference(extension_rule, [i_0_21])). % 0.13/0.38 cnf(i_0_44, plain, (c_minus(t_a,t_a,tc_set(X17))!=c_emptyset), inference(closure_rule, [i_0_8])). % 0.13/0.38 cnf(i_0_45, plain, ($false), inference(closure_rule, [i_0_17])). % 0.13/0.38 cnf(i_0_46, plain, ($false), inference(closure_rule, [i_0_17])). % 0.13/0.38 cnf(i_0_43, plain, (c_PropLog_Osat(c_minus(t_a,t_a,tc_set(X17)),v_p,t_a)), inference(extension_rule, [i_0_21])). % 0.13/0.38 cnf(i_0_78, plain, (c_minus(t_a,t_a,tc_set(X17))!=c_emptyset), inference(closure_rule, [i_0_8])). % 0.13/0.38 cnf(i_0_80, plain, ($false), inference(closure_rule, [i_0_17])). % 0.13/0.38 cnf(i_0_77, plain, (c_PropLog_Osat(c_emptyset,v_p,t_a)), inference(extension_rule, [i_0_7])). % 0.13/0.38 cnf(i_0_79, plain, ($false), inference(extension_rule, [i_0_18])). % 0.13/0.38 cnf(i_0_173, plain, ($false), inference(closure_rule, [i_0_17])). % 0.13/0.38 cnf(i_0_102, plain, (c_in(v_p,c_PropLog_Othms(c_minus(c_PropLog_Ohyps(v_p,X6,t_a),c_PropLog_Ohyps(v_p,X9,t_a),tc_set(tc_PropLog_Opl(t_a))),t_a),tc_PropLog_Opl(t_a))), inference(etableau_closure_rule, [i_0_102, ...])). % 0.13/0.38 # End printing tableau % 0.13/0.38 # SZS output end % 0.13/0.38 # Branches closed with saturation will be marked with an "s" % 0.13/0.38 # There were 1 total branch saturation attempts. % 0.13/0.38 # There were 0 of these attempts blocked. % 0.13/0.38 # There were 0 deferred branch saturation attempts. % 0.13/0.38 # There were 0 free duplicated saturations. % 0.13/0.38 # There were 1 total successful branch saturations. % 0.13/0.38 # There were 0 successful branch saturations in interreduction. % 0.13/0.38 # There were 0 successful branch saturations on the branch. % 0.13/0.38 # There were 1 successful branch saturations after the branch. % 0.13/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.38 # Begin clausification derivation % 0.13/0.38 % 0.13/0.38 # End clausification derivation % 0.13/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.38 cnf(i_0_5, negated_conjecture, (c_PropLog_Osat(c_emptyset,v_p,t_a))). % 0.13/0.38 cnf(i_0_8, plain, (c_minus(X1,X1,tc_set(X2))=c_emptyset)). % 0.13/0.38 cnf(i_0_6, negated_conjecture, (~c_in(v_p,c_PropLog_Othms(c_emptyset,t_a),tc_PropLog_Opl(t_a)))). % 0.13/0.38 cnf(i_0_7, plain, (c_in(X1,c_PropLog_Othms(c_minus(c_PropLog_Ohyps(X1,X2,X3),c_PropLog_Ohyps(X1,X4,X3),tc_set(tc_PropLog_Opl(X3))),X3),tc_PropLog_Opl(X3))|~c_PropLog_Osat(c_emptyset,X1,X3))). % 0.13/0.38 cnf(i_0_17, plain, (X5=X5)). % 0.13/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.38 # Begin printing tableau % 0.13/0.38 # Found 12 steps % 0.13/0.38 cnf(i_0_5, negated_conjecture, (c_PropLog_Osat(c_emptyset,v_p,t_a)), inference(start_rule)). % 0.13/0.38 cnf(i_0_28, plain, (c_PropLog_Osat(c_emptyset,v_p,t_a)), inference(extension_rule, [i_0_21])). % 0.13/0.38 cnf(i_0_44, plain, (c_minus(t_a,t_a,tc_set(X17))!=c_emptyset), inference(closure_rule, [i_0_8])). % 0.13/0.38 cnf(i_0_45, plain, ($false), inference(closure_rule, [i_0_17])). % 0.13/0.38 cnf(i_0_46, plain, ($false), inference(closure_rule, [i_0_17])). % 0.13/0.38 cnf(i_0_43, plain, (c_PropLog_Osat(c_minus(t_a,t_a,tc_set(X17)),v_p,t_a)), inference(extension_rule, [i_0_21])). % 0.13/0.38 cnf(i_0_78, plain, (c_minus(t_a,t_a,tc_set(X17))!=c_emptyset), inference(closure_rule, [i_0_8])). % 0.13/0.38 cnf(i_0_80, plain, ($false), inference(closure_rule, [i_0_17])). % 0.13/0.38 cnf(i_0_79, plain, ($false), inference(extension_rule, [i_0_19])). % 0.13/0.38 cnf(i_0_77, plain, (c_PropLog_Osat(c_emptyset,v_p,t_a)), inference(extension_rule, [i_0_7])). % 0.13/0.38 cnf(i_0_141, plain, ($false), inference(closure_rule, [i_0_17])). % 0.13/0.38 cnf(i_0_170, plain, (c_in(v_p,c_PropLog_Othms(c_minus(c_PropLog_Ohyps(v_p,X6,t_a),c_PropLog_Ohyps(v_p,X8,t_a),tc_set(tc_PropLog_Opl(t_a))),t_a),tc_PropLog_Opl(t_a))), inference(etableau_closure_rule, [i_0_170, ...])). % 0.13/0.38 # End printing tableau % 0.13/0.38 # SZS output end % 0.13/0.38 # Branches closed with saturation will be marked with an "s" % 0.13/0.38 # There were 1 total branch saturation attempts. % 0.13/0.38 # There were 0 of these attempts blocked. % 0.13/0.38 # There were 0 deferred branch saturation attempts. % 0.13/0.38 # There were 0 free duplicated saturations. % 0.13/0.38 # There were 1 total successful branch saturations. % 0.13/0.38 # There were 0 successful branch saturations in interreduction. % 0.13/0.38 # There were 0 successful branch saturations on the branch. % 0.13/0.38 # There were 1 successful branch saturations after the branch. % 0.13/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.38 # Begin clausification derivation % 0.13/0.38 % 0.13/0.38 # End clausification derivation % 0.13/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.38 cnf(i_0_5, negated_conjecture, (c_PropLog_Osat(c_emptyset,v_p,t_a))). % 0.13/0.38 cnf(i_0_8, plain, (c_minus(X1,X1,tc_set(X2))=c_emptyset)). % 0.13/0.38 cnf(i_0_6, negated_conjecture, (~c_in(v_p,c_PropLog_Othms(c_emptyset,t_a),tc_PropLog_Opl(t_a)))). % 0.13/0.38 cnf(i_0_7, plain, (c_in(X1,c_PropLog_Othms(c_minus(c_PropLog_Ohyps(X1,X2,X3),c_PropLog_Ohyps(X1,X4,X3),tc_set(tc_PropLog_Opl(X3))),X3),tc_PropLog_Opl(X3))|~c_PropLog_Osat(c_emptyset,X1,X3))). % 0.13/0.38 cnf(i_0_17, plain, (X5=X5)). % 0.13/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.38 # Begin printing tableau % 0.13/0.38 # Found 12 steps % 0.13/0.38 cnf(i_0_5, negated_conjecture, (c_PropLog_Osat(c_emptyset,v_p,t_a)), inference(start_rule)). % 0.13/0.38 cnf(i_0_28, plain, (c_PropLog_Osat(c_emptyset,v_p,t_a)), inference(extension_rule, [i_0_21])). % 0.13/0.38 cnf(i_0_44, plain, (c_minus(t_a,t_a,tc_set(X17))!=c_emptyset), inference(closure_rule, [i_0_8])). % 0.13/0.38 cnf(i_0_45, plain, ($false), inference(closure_rule, [i_0_17])). % 0.13/0.38 cnf(i_0_46, plain, ($false), inference(closure_rule, [i_0_17])). % 0.13/0.38 cnf(i_0_43, plain, (c_PropLog_Osat(c_minus(t_a,t_a,tc_set(X17)),v_p,t_a)), inference(extension_rule, [i_0_21])). % 0.13/0.38 cnf(i_0_78, plain, (c_minus(t_a,t_a,tc_set(X17))!=c_emptyset), inference(closure_rule, [i_0_8])). % 0.13/0.38 cnf(i_0_80, plain, ($false), inference(closure_rule, [i_0_17])). % 0.13/0.38 cnf(i_0_79, plain, ($false), inference(extension_rule, [i_0_18])). % 0.13/0.38 cnf(i_0_77, plain, (c_PropLog_Osat(c_emptyset,v_p,t_a)), inference(extension_rule, [i_0_7])). % 0.13/0.38 cnf(i_0_139, plain, ($false), inference(closure_rule, [i_0_17])). % 0.13/0.38 cnf(i_0_170, plain, (c_in(v_p,c_PropLog_Othms(c_minus(c_PropLog_Ohyps(v_p,X6,t_a),c_PropLog_Ohyps(v_p,X8,t_a),tc_set(tc_PropLog_Opl(t_a))),t_a),tc_PropLog_Opl(t_a))), inference(etableau_closure_rule, [i_0_170, ...])). % 0.13/0.38 # End printing tableau % 0.13/0.38 # SZS output end % 0.13/0.38 # Branches closed with saturation will be marked with an "s" % 0.13/0.38 # Closed tableau found in foldup close cycle with 0 folds and 2 closures done. % 0.13/0.38 # There were 0 total branch saturation attempts. % 0.13/0.38 # There were 0 of these attempts blocked. % 0.13/0.38 # There were 0 deferred branch saturation attempts. % 0.13/0.38 # There were 0 free duplicated saturations. % 0.13/0.38 # There were 0 total successful branch saturations. % 0.13/0.38 # There were 0 successful branch saturations in interreduction. % 0.13/0.38 # There were 0 successful branch saturations on the branch. % 0.13/0.38 # There were 0 successful branch saturations after the branch. % 0.13/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.38 # Begin clausification derivation % 0.13/0.38 % 0.13/0.38 # End clausification derivation % 0.13/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.38 cnf(i_0_5, negated_conjecture, (c_PropLog_Osat(c_emptyset,v_p,t_a))). % 0.13/0.38 cnf(i_0_8, plain, (c_minus(X1,X1,tc_set(X2))=c_emptyset)). % 0.13/0.38 cnf(i_0_6, negated_conjecture, (~c_in(v_p,c_PropLog_Othms(c_emptyset,t_a),tc_PropLog_Opl(t_a)))). % 0.13/0.38 cnf(i_0_7, plain, (c_in(X1,c_PropLog_Othms(c_minus(c_PropLog_Ohyps(X1,X2,X3),c_PropLog_Ohyps(X1,X4,X3),tc_set(tc_PropLog_Opl(X3))),X3),tc_PropLog_Opl(X3))|~c_PropLog_Osat(c_emptyset,X1,X3))). % 0.13/0.38 cnf(i_0_17, plain, (X5=X5)). % 0.13/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.38 # Begin printing tableau % 0.13/0.38 # Found 9 steps % 0.13/0.38 cnf(i_0_7, plain, (c_in(v_p,c_PropLog_Othms(c_minus(c_PropLog_Ohyps(v_p,X10,t_a),c_PropLog_Ohyps(v_p,X10,t_a),tc_set(tc_PropLog_Opl(t_a))),t_a),tc_PropLog_Opl(t_a))|~c_PropLog_Osat(c_emptyset,v_p,t_a)), inference(start_rule)). % 0.13/0.38 cnf(i_0_32, plain, (~c_PropLog_Osat(c_emptyset,v_p,t_a)), inference(closure_rule, [i_0_5])). % 0.13/0.38 cnf(i_0_31, plain, (c_in(v_p,c_PropLog_Othms(c_minus(c_PropLog_Ohyps(v_p,X10,t_a),c_PropLog_Ohyps(v_p,X10,t_a),tc_set(tc_PropLog_Opl(t_a))),t_a),tc_PropLog_Opl(t_a))), inference(extension_rule, [i_0_24])). % 0.13/0.38 cnf(i_0_189, plain, (c_in(v_p,c_PropLog_Othms(c_emptyset,t_a),tc_PropLog_Opl(t_a))), inference(closure_rule, [i_0_6])). % 0.13/0.38 cnf(i_0_190, plain, ($false), inference(closure_rule, [i_0_17])). % 0.13/0.38 cnf(i_0_192, plain, ($false), inference(closure_rule, [i_0_17])). % 0.13/0.38 cnf(i_0_191, plain, (c_PropLog_Othms(c_minus(c_PropLog_Ohyps(v_p,X10,t_a),c_PropLog_Ohyps(v_p,X10,t_a),tc_set(tc_PropLog_Opl(t_a))),t_a)!=c_PropLog_Othms(c_emptyset,t_a)), inference(extension_rule, [i_0_22])). % 0.13/0.38 cnf(i_0_348, plain, (c_minus(c_PropLog_Ohyps(v_p,X10,t_a),c_PropLog_Ohyps(v_p,X10,t_a),tc_set(tc_PropLog_Opl(t_a)))!=c_emptyset), inference(closure_rule, [i_0_8])). % 0.13/0.38 cnf(i_0_349, plain, ($false), inference(closure_rule, [i_0_17])). % 0.13/0.38 # End printing tableau % 0.13/0.38 # SZS output end % 0.13/0.38 # Branches closed with saturation will be marked with an "s" % 0.13/0.38 # There were 1 total branch saturation attempts. % 0.13/0.38 # There were 0 of these attempts blocked. % 0.13/0.38 # There were 0 deferred branch saturation attempts. % 0.13/0.38 # There were 0 free duplicated saturations. % 0.13/0.38 # There were 1 total successful branch saturations. % 0.13/0.38 # There were 0 successful branch saturations in interreduction. % 0.13/0.38 # There were 0 successful branch saturations on the branch. % 0.13/0.38 # There were 1 successful branch saturations after the branch. % 0.13/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.38 # Begin clausification derivation % 0.13/0.38 % 0.13/0.38 # End clausification derivation % 0.13/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.38 cnf(i_0_5, negated_conjecture, (c_PropLog_Osat(c_emptyset,v_p,t_a))). % 0.13/0.38 cnf(i_0_8, plain, (c_minus(X1,X1,tc_set(X2))=c_emptyset)). % 0.13/0.38 cnf(i_0_6, negated_conjecture, (~c_in(v_p,c_PropLog_Othms(c_emptyset,t_a),tc_PropLog_Opl(t_a)))). % 0.13/0.38 cnf(i_0_7, plain, (c_in(X1,c_PropLog_Othms(c_minus(c_PropLog_Ohyps(X1,X2,X3),c_PropLog_Ohyps(X1,X4,X3),tc_set(tc_PropLog_Opl(X3))),X3),tc_PropLog_Opl(X3))|~c_PropLog_Osat(c_emptyset,X1,X3))). % 0.13/0.38 cnf(i_0_17, plain, (X5=X5)). % 0.13/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.38 # Begin printing tableau % 0.13/0.38 # Found 7 steps % 0.13/0.38 cnf(i_0_5, negated_conjecture, (c_PropLog_Osat(c_emptyset,v_p,t_a)), inference(start_rule)). % 0.13/0.38 cnf(i_0_28, plain, (c_PropLog_Osat(c_emptyset,v_p,t_a)), inference(extension_rule, [i_0_7])). % 0.13/0.38 cnf(i_0_34, plain, (c_in(v_p,c_PropLog_Othms(c_minus(c_PropLog_Ohyps(v_p,X22,t_a),c_PropLog_Ohyps(v_p,X21,t_a),tc_set(tc_PropLog_Opl(t_a))),t_a),tc_PropLog_Opl(t_a))), inference(extension_rule, [i_0_24])). % 0.13/0.38 cnf(i_0_189, plain, (c_in(v_p,c_PropLog_Othms(c_emptyset,t_a),tc_PropLog_Opl(t_a))), inference(closure_rule, [i_0_6])). % 0.13/0.38 cnf(i_0_190, plain, ($false), inference(closure_rule, [i_0_17])). % 0.13/0.38 cnf(i_0_192, plain, ($false), inference(closure_rule, [i_0_17])). % 0.13/0.38 cnf(i_0_191, plain, (c_PropLog_Othms(c_minus(c_PropLog_Ohyps(v_p,X22,t_a),c_PropLog_Ohyps(v_p,X21,t_a),tc_set(tc_PropLog_Opl(t_a))),t_a)!=c_PropLog_Othms(c_emptyset,t_a)), inference(etableau_closure_rule, [i_0_191, ...])). % 0.13/0.38 # End printing tableau % 0.13/0.38 # SZS output end % 0.13/0.38 # Branches closed with saturation will be marked with an "s" % 0.13/0.38 # Child (4107903) has found a proof. % 0.13/0.38 % 0.13/0.38 # Proof search is over... % 0.13/0.38 # Freeing feature tree %------------------------------------------------------------------------------