%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SET822-2 : TPTP v8.1.0. 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 : n021.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 01:02:53 EDT 2022 % Result : Unsatisfiable 0.20s 0.37s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SET822-2 : TPTP v8.1.0. Released v3.2.0. % 0.12/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.33 % Computer : n021.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 600 % 0.13/0.33 % DateTime : Mon Jul 11 10:37:23 EDT 2022 % 0.13/0.34 % CPUTime : % 0.20/0.36 # No SInE strategy applied % 0.20/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S4d % 0.20/0.36 # and selection function SelectCQIPrecWNTNp. % 0.20/0.36 # % 0.20/0.36 # Presaturation interreduction done % 0.20/0.36 # Number of axioms: 6 Number of unprocessed: 6 % 0.20/0.36 # Tableaux proof search. % 0.20/0.36 # APR header successfully linked. % 0.20/0.36 # Hello from C++ % 0.20/0.36 # The folding up rule is enabled... % 0.20/0.36 # Local unification is enabled... % 0.20/0.36 # Any saturation attempts will use folding labels... % 0.20/0.36 # 6 beginning clauses after preprocessing and clausification % 0.20/0.36 # Creating start rules for all 3 conjectures. % 0.20/0.36 # There are 3 start rule candidates: % 0.20/0.36 # Found 3 unit axioms. % 0.20/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.20/0.36 # 3 start rule tableaux created. % 0.20/0.36 # 3 extension rule candidate clauses % 0.20/0.36 # 3 unit axiom clauses % 0.20/0.36 % 0.20/0.36 # Requested 8, 32 cores available to the main process. % 0.20/0.36 # There are not enough tableaux to fork, creating more from the initial 3 % 0.20/0.36 # Creating equality axioms % 0.20/0.36 # Ran out of tableaux, making start rules for all clauses % 0.20/0.36 # Returning from population with 11 new_tableaux and 0 remaining starting tableaux. % 0.20/0.36 # We now have 11 tableaux to operate on % 0.20/0.37 # There were 1 total branch saturation attempts. % 0.20/0.37 # There were 0 of these attempts blocked. % 0.20/0.37 # There were 0 deferred branch saturation attempts. % 0.20/0.37 # There were 0 free duplicated saturations. % 0.20/0.37 # There were 1 total successful branch saturations. % 0.20/0.37 # There were 0 successful branch saturations in interreduction. % 0.20/0.37 # There were 0 successful branch saturations on the branch. % 0.20/0.37 # There were 1 successful branch saturations after the branch. % 0.20/0.37 # There were 1 total branch saturation attempts. % 0.20/0.37 # There were 0 of these attempts blocked. % 0.20/0.37 # There were 0 deferred branch saturation attempts. % 0.20/0.37 # There were 0 free duplicated saturations. % 0.20/0.37 # There were 1 total successful branch saturations. % 0.20/0.37 # There were 0 successful branch saturations in interreduction. % 0.20/0.37 # There were 0 successful branch saturations on the branch. % 0.20/0.37 # There were 1 successful branch saturations after the branch. % 0.20/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.37 # Begin clausification derivation % 0.20/0.37 % 0.20/0.37 # End clausification derivation % 0.20/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.37 cnf(i_0_10, negated_conjecture, (v_P(v_f(v_b)))). % 0.20/0.37 cnf(i_0_8, plain, (c_in(X1,c_insert(X1,X2,X3),X3))). % 0.20/0.37 cnf(i_0_7, plain, (~c_in(X1,c_emptyset,X2))). % 0.20/0.37 cnf(i_0_12, negated_conjecture, (~v_P(v_x(X1,X2))|~c_in(v_f(X1),X2,tc_IntDef_Oint))). % 0.20/0.37 cnf(i_0_11, negated_conjecture, (c_in(v_x(X1,X2),X2,tc_IntDef_Oint)|~c_in(v_f(X1),X2,tc_IntDef_Oint))). % 0.20/0.37 cnf(i_0_9, plain, (X1=X2|c_in(X1,X3,X4)|~c_in(X1,c_insert(X2,X3,X4),X4))). % 0.20/0.37 cnf(i_0_46, plain, (X5=X5)). % 0.20/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.37 # Begin printing tableau % 0.20/0.37 # Found 8 steps % 0.20/0.37 cnf(i_0_10, negated_conjecture, (v_P(v_f(v_b))), inference(start_rule)). % 0.20/0.37 cnf(i_0_55, plain, (v_P(v_f(v_b))), inference(extension_rule, [i_0_53])). % 0.20/0.37 cnf(i_0_92, plain, (v_x(tc_IntDef_Oint,c_insert(v_f(tc_IntDef_Oint),X2,tc_IntDef_Oint))!=v_f(v_b)), inference(extension_rule, [i_0_48])). % 0.20/0.37 cnf(i_0_138, plain, (v_f(v_b)!=v_x(tc_IntDef_Oint,c_insert(v_f(tc_IntDef_Oint),X2,tc_IntDef_Oint))), inference(extension_rule, [i_0_9])). % 0.20/0.37 cnf(i_0_160, plain, (c_in(v_f(v_b),c_emptyset,X8)), inference(closure_rule, [i_0_7])). % 0.20/0.37 cnf(i_0_91, plain, (v_P(v_x(tc_IntDef_Oint,c_insert(v_f(tc_IntDef_Oint),X2,tc_IntDef_Oint)))), inference(extension_rule, [i_0_12])). % 0.20/0.37 cnf(i_0_165, plain, (~c_in(v_f(tc_IntDef_Oint),c_insert(v_f(tc_IntDef_Oint),X2,tc_IntDef_Oint),tc_IntDef_Oint)), inference(closure_rule, [i_0_8])). % 0.20/0.37 cnf(i_0_161, plain, (~c_in(v_f(v_b),c_insert(v_x(tc_IntDef_Oint,c_insert(v_f(tc_IntDef_Oint),X2,tc_IntDef_Oint)),c_emptyset,X8),X8)), inference(etableau_closure_rule, [i_0_161, ...])). % 0.20/0.37 # End printing tableau % 0.20/0.37 # SZS output end % 0.20/0.37 # Branches closed with saturation will be marked with an "s" % 0.20/0.37 # There were 1 total branch saturation attempts. % 0.20/0.37 # There were 0 of these attempts blocked. % 0.20/0.37 # There were 0 deferred branch saturation attempts. % 0.20/0.37 # There were 0 free duplicated saturations. % 0.20/0.37 # There were 1 total successful branch saturations. % 0.20/0.37 # There were 0 successful branch saturations in interreduction. % 0.20/0.37 # There were 0 successful branch saturations on the branch. % 0.20/0.37 # There were 1 successful branch saturations after the branch. % 0.20/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.37 # Begin clausification derivation % 0.20/0.37 % 0.20/0.37 # End clausification derivation % 0.20/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.37 cnf(i_0_10, negated_conjecture, (v_P(v_f(v_b)))). % 0.20/0.37 cnf(i_0_8, plain, (c_in(X1,c_insert(X1,X2,X3),X3))). % 0.20/0.37 cnf(i_0_7, plain, (~c_in(X1,c_emptyset,X2))). % 0.20/0.37 cnf(i_0_12, negated_conjecture, (~v_P(v_x(X1,X2))|~c_in(v_f(X1),X2,tc_IntDef_Oint))). % 0.20/0.37 cnf(i_0_11, negated_conjecture, (c_in(v_x(X1,X2),X2,tc_IntDef_Oint)|~c_in(v_f(X1),X2,tc_IntDef_Oint))). % 0.20/0.37 cnf(i_0_9, plain, (X1=X2|c_in(X1,X3,X4)|~c_in(X1,c_insert(X2,X3,X4),X4))). % 0.20/0.37 cnf(i_0_46, plain, (X5=X5)). % 0.20/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.37 # Begin printing tableau % 0.20/0.37 # Found 8 steps % 0.20/0.37 cnf(i_0_8, plain, (c_in(X3,c_insert(X3,c_emptyset,X8),X8)), inference(start_rule)). % 0.20/0.37 cnf(i_0_56, plain, (c_in(X3,c_insert(X3,c_emptyset,X8),X8)), inference(extension_rule, [i_0_9])). % 0.20/0.37 cnf(i_0_160, plain, (c_in(X3,c_emptyset,X8)), inference(closure_rule, [i_0_7])). % 0.20/0.37 cnf(i_0_159, plain, (X3=X3), inference(extension_rule, [i_0_50])). % 0.20/0.37 cnf(i_0_173, plain, (c_in(X3,c_emptyset,X3)), inference(closure_rule, [i_0_7])). % 0.20/0.37 cnf(i_0_175, plain, ($false), inference(closure_rule, [i_0_46])). % 0.20/0.37 cnf(i_0_176, plain, ($false), inference(closure_rule, [i_0_46])). % 0.20/0.37 cnf(i_0_177, plain, (~c_in(X3,c_emptyset,X3)), inference(etableau_closure_rule, [i_0_177, ...])). % 0.20/0.37 # End printing tableau % 0.20/0.37 # SZS output end % 0.20/0.37 # Branches closed with saturation will be marked with an "s" % 0.20/0.37 # There were 1 total branch saturation attempts. % 0.20/0.37 # There were 0 of these attempts blocked. % 0.20/0.37 # There were 0 deferred branch saturation attempts. % 0.20/0.37 # There were 0 free duplicated saturations. % 0.20/0.37 # There were 1 total successful branch saturations. % 0.20/0.37 # There were 0 successful branch saturations in interreduction. % 0.20/0.37 # There were 0 successful branch saturations on the branch. % 0.20/0.37 # There were 1 successful branch saturations after the branch. % 0.20/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.37 # Begin clausification derivation % 0.20/0.37 % 0.20/0.37 # End clausification derivation % 0.20/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.37 cnf(i_0_10, negated_conjecture, (v_P(v_f(v_b)))). % 0.20/0.37 cnf(i_0_8, plain, (c_in(X1,c_insert(X1,X2,X3),X3))). % 0.20/0.37 cnf(i_0_7, plain, (~c_in(X1,c_emptyset,X2))). % 0.20/0.37 cnf(i_0_12, negated_conjecture, (~v_P(v_x(X1,X2))|~c_in(v_f(X1),X2,tc_IntDef_Oint))). % 0.20/0.37 cnf(i_0_11, negated_conjecture, (c_in(v_x(X1,X2),X2,tc_IntDef_Oint)|~c_in(v_f(X1),X2,tc_IntDef_Oint))). % 0.20/0.37 cnf(i_0_9, plain, (X1=X2|c_in(X1,X3,X4)|~c_in(X1,c_insert(X2,X3,X4),X4))). % 0.20/0.37 cnf(i_0_46, plain, (X5=X5)). % 0.20/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.37 # Begin printing tableau % 0.20/0.37 # Found 8 steps % 0.20/0.37 cnf(i_0_10, negated_conjecture, (v_P(v_f(v_b))), inference(start_rule)). % 0.20/0.37 cnf(i_0_55, plain, (v_P(v_f(v_b))), inference(extension_rule, [i_0_53])). % 0.20/0.37 cnf(i_0_92, plain, (v_x(tc_IntDef_Oint,c_insert(v_f(tc_IntDef_Oint),X2,tc_IntDef_Oint))!=v_f(v_b)), inference(extension_rule, [i_0_47])). % 0.20/0.37 cnf(i_0_136, plain, (v_f(v_b)!=v_x(tc_IntDef_Oint,c_insert(v_f(tc_IntDef_Oint),X2,tc_IntDef_Oint))), inference(extension_rule, [i_0_9])). % 0.20/0.37 cnf(i_0_160, plain, (c_in(v_f(v_b),c_emptyset,X8)), inference(closure_rule, [i_0_7])). % 0.20/0.37 cnf(i_0_91, plain, (v_P(v_x(tc_IntDef_Oint,c_insert(v_f(tc_IntDef_Oint),X2,tc_IntDef_Oint)))), inference(extension_rule, [i_0_12])). % 0.20/0.37 cnf(i_0_165, plain, (~c_in(v_f(tc_IntDef_Oint),c_insert(v_f(tc_IntDef_Oint),X2,tc_IntDef_Oint),tc_IntDef_Oint)), inference(closure_rule, [i_0_8])). % 0.20/0.37 cnf(i_0_161, plain, (~c_in(v_f(v_b),c_insert(v_x(tc_IntDef_Oint,c_insert(v_f(tc_IntDef_Oint),X2,tc_IntDef_Oint)),c_emptyset,X8),X8)), inference(etableau_closure_rule, [i_0_161, ...])). % 0.20/0.37 # End printing tableau % 0.20/0.37 # SZS output end % 0.20/0.37 # Branches closed with saturation will be marked with an "s" % 0.20/0.37 # There were 1 total branch saturation attempts. % 0.20/0.37 # There were 0 of these attempts blocked. % 0.20/0.37 # There were 0 deferred branch saturation attempts. % 0.20/0.37 # There were 0 free duplicated saturations. % 0.20/0.37 # There were 1 total successful branch saturations. % 0.20/0.37 # There were 0 successful branch saturations in interreduction. % 0.20/0.37 # There were 0 successful branch saturations on the branch. % 0.20/0.37 # There were 1 successful branch saturations after the branch. % 0.20/0.37 # There were 1 total branch saturation attempts. % 0.20/0.37 # There were 0 of these attempts blocked. % 0.20/0.37 # There were 0 deferred branch saturation attempts. % 0.20/0.37 # There were 0 free duplicated saturations. % 0.20/0.37 # There were 1 total successful branch saturations. % 0.20/0.37 # There were 0 successful branch saturations in interreduction. % 0.20/0.37 # There were 0 successful branch saturations on the branch. % 0.20/0.37 # There were 1 successful branch saturations after the branch. % 0.20/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.37 # Begin clausification derivation % 0.20/0.37 % 0.20/0.37 # End clausification derivation % 0.20/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.37 cnf(i_0_10, negated_conjecture, (v_P(v_f(v_b)))). % 0.20/0.37 cnf(i_0_8, plain, (c_in(X1,c_insert(X1,X2,X3),X3))). % 0.20/0.37 cnf(i_0_7, plain, (~c_in(X1,c_emptyset,X2))). % 0.20/0.37 cnf(i_0_12, negated_conjecture, (~v_P(v_x(X1,X2))|~c_in(v_f(X1),X2,tc_IntDef_Oint))). % 0.20/0.37 cnf(i_0_11, negated_conjecture, (c_in(v_x(X1,X2),X2,tc_IntDef_Oint)|~c_in(v_f(X1),X2,tc_IntDef_Oint))). % 0.20/0.37 cnf(i_0_9, plain, (X1=X2|c_in(X1,X3,X4)|~c_in(X1,c_insert(X2,X3,X4),X4))). % 0.20/0.37 cnf(i_0_46, plain, (X5=X5)). % 0.20/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.37 # Begin printing tableau % 0.20/0.37 # Found 8 steps % 0.20/0.37 cnf(i_0_7, plain, (~c_in(X3,c_emptyset,X8)), inference(start_rule)). % 0.20/0.37 cnf(i_0_57, plain, (~c_in(X3,c_emptyset,X8)), inference(extension_rule, [i_0_9])). % 0.20/0.37 cnf(i_0_161, plain, (~c_in(X3,c_insert(X3,c_emptyset,X8),X8)), inference(closure_rule, [i_0_8])). % 0.20/0.37 cnf(i_0_159, plain, (X3=X3), inference(extension_rule, [i_0_50])). % 0.20/0.37 cnf(i_0_173, plain, (c_in(X3,c_emptyset,X3)), inference(closure_rule, [i_0_7])). % 0.20/0.37 cnf(i_0_176, plain, ($false), inference(closure_rule, [i_0_46])). % 0.20/0.37 cnf(i_0_177, plain, (~c_in(X3,c_insert(X3,X2,X3),X3)), inference(closure_rule, [i_0_8])). % 0.20/0.37 cnf(i_0_175, plain, (c_insert(X3,X2,X3)!=c_emptyset), inference(etableau_closure_rule, [i_0_175, ...])). % 0.20/0.37 # End printing tableau % 0.20/0.37 # SZS output end % 0.20/0.37 # Branches closed with saturation will be marked with an "s" % 0.20/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.37 # Begin clausification derivation % 0.20/0.37 % 0.20/0.37 # End clausification derivation % 0.20/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.37 cnf(i_0_10, negated_conjecture, (v_P(v_f(v_b)))). % 0.20/0.37 cnf(i_0_8, plain, (c_in(X1,c_insert(X1,X2,X3),X3))). % 0.20/0.37 cnf(i_0_7, plain, (~c_in(X1,c_emptyset,X2))). % 0.20/0.37 cnf(i_0_12, negated_conjecture, (~v_P(v_x(X1,X2))|~c_in(v_f(X1),X2,tc_IntDef_Oint))). % 0.20/0.37 cnf(i_0_11, negated_conjecture, (c_in(v_x(X1,X2),X2,tc_IntDef_Oint)|~c_in(v_f(X1),X2,tc_IntDef_Oint))). % 0.20/0.37 cnf(i_0_9, plain, (X1=X2|c_in(X1,X3,X4)|~c_in(X1,c_insert(X2,X3,X4),X4))). % 0.20/0.37 cnf(i_0_46, plain, (X5=X5)). % 0.20/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.37 # Begin printing tableau % 0.20/0.37 # Found 9 steps % 0.20/0.37 cnf(i_0_10, negated_conjecture, (v_P(v_f(v_b))), inference(start_rule)). % 0.20/0.37 cnf(i_0_55, plain, (v_P(v_f(v_b))), inference(extension_rule, [i_0_53])). % 0.20/0.37 cnf(i_0_92, plain, (v_x(tc_IntDef_Oint,c_insert(v_f(tc_IntDef_Oint),X2,tc_IntDef_Oint))!=v_f(v_b)), inference(extension_rule, [i_0_9])). % 0.20/0.37 cnf(i_0_129, plain, (c_in(v_x(tc_IntDef_Oint,c_insert(v_f(tc_IntDef_Oint),X2,tc_IntDef_Oint)),c_emptyset,X10)), inference(closure_rule, [i_0_7])). % 0.20/0.37 cnf(i_0_130, plain, (~c_in(v_x(tc_IntDef_Oint,c_insert(v_f(tc_IntDef_Oint),X2,tc_IntDef_Oint)),c_insert(v_f(v_b),c_emptyset,X10),X10)), inference(extension_rule, [i_0_9])). % 0.20/0.37 cnf(i_0_159, plain, (v_x(tc_IntDef_Oint,c_insert(v_f(tc_IntDef_Oint),X2,tc_IntDef_Oint))=v_f(v_b)), inference(closure_rule, [i_0_92])). % 0.20/0.37 cnf(i_0_91, plain, (v_P(v_x(tc_IntDef_Oint,c_insert(v_f(tc_IntDef_Oint),X2,tc_IntDef_Oint)))), inference(extension_rule, [i_0_12])). % 0.20/0.37 cnf(i_0_165, plain, (~c_in(v_f(tc_IntDef_Oint),c_insert(v_f(tc_IntDef_Oint),X2,tc_IntDef_Oint),tc_IntDef_Oint)), inference(closure_rule, [i_0_8])). % 0.20/0.37 cnf(i_0_161, plain, (~c_in(v_x(tc_IntDef_Oint,c_insert(v_f(tc_IntDef_Oint),X2,tc_IntDef_Oint)),c_insert(v_f(v_b),c_insert(v_f(v_b),c_emptyset,X10),X10),X10)), inference(etableau_closure_rule, [i_0_161, ...])). % 0.20/0.37 # End printing tableau % 0.20/0.37 # SZS output end % 0.20/0.37 # Branches closed with saturation will be marked with an "s" % 0.20/0.37 # Child (9511) has found a proof. % 0.20/0.37 % 0.20/0.37 # Proof search is over... % 0.20/0.37 # Freeing feature tree %------------------------------------------------------------------------------