%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN365+1 : TPTP v8.1.0. Released v2.0.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 : n004.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 : Thu Jul 21 06:10:23 EDT 2022 % Result : Theorem 0.14s 0.38s % Output : CNFRefutation 0.14s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.13 % Problem : SYN365+1 : TPTP v8.1.0. Released v2.0.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.14/0.35 % Computer : n004.cluster.edu % 0.14/0.35 % Model : x86_64 x86_64 % 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.35 % Memory : 8042.1875MB % 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.35 % CPULimit : 300 % 0.14/0.35 % WCLimit : 600 % 0.14/0.35 % DateTime : Mon Jul 11 17:03:22 EDT 2022 % 0.14/0.35 % CPUTime : % 0.14/0.38 # No SInE strategy applied % 0.14/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.14/0.38 # and selection function SelectComplexExceptUniqMaxHorn. % 0.14/0.38 # % 0.14/0.38 # Presaturation interreduction done % 0.14/0.38 # Number of axioms: 6 Number of unprocessed: 6 % 0.14/0.38 # Tableaux proof search. % 0.14/0.38 # APR header successfully linked. % 0.14/0.38 # Hello from C++ % 0.14/0.38 # The folding up rule is enabled... % 0.14/0.38 # Local unification is enabled... % 0.14/0.38 # Any saturation attempts will use folding labels... % 0.14/0.38 # 6 beginning clauses after preprocessing and clausification % 0.14/0.38 # Creating start rules for all 6 conjectures. % 0.14/0.38 # There are 6 start rule candidates: % 0.14/0.38 # Found 1 unit axioms. % 0.14/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.14/0.38 # 6 start rule tableaux created. % 0.14/0.38 # 5 extension rule candidate clauses % 0.14/0.38 # 1 unit axiom clauses % 0.14/0.38 % 0.14/0.38 # Requested 8, 32 cores available to the main process. % 0.14/0.38 # There are not enough tableaux to fork, creating more from the initial 6 % 0.14/0.38 # Returning from population with 14 new_tableaux and 0 remaining starting tableaux. % 0.14/0.38 # We now have 14 tableaux to operate on % 0.14/0.38 # There were 1 total branch saturation attempts. % 0.14/0.38 # There were 0 of these attempts blocked. % 0.14/0.38 # There were 0 deferred branch saturation attempts. % 0.14/0.38 # There were 0 free duplicated saturations. % 0.14/0.38 # There were 1 total successful branch saturations. % 0.14/0.38 # There were 0 successful branch saturations in interreduction. % 0.14/0.38 # There were 0 successful branch saturations on the branch. % 0.14/0.38 # There were 1 successful branch saturations after the branch. % 0.14/0.38 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.14/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.14/0.38 # Begin clausification derivation % 0.14/0.38 % 0.14/0.38 # End clausification derivation % 0.14/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.14/0.38 cnf(i_0_2, negated_conjecture, (big_p(esk2_0))). % 0.14/0.38 cnf(i_0_1, negated_conjecture, (~big_r(esk2_0,X1)|~big_p(X1))). % 0.14/0.38 cnf(i_0_3, negated_conjecture, (big_p(h(X1))|~big_p(X1))). % 0.14/0.38 cnf(i_0_4, negated_conjecture, (big_p(g(X1))|~big_p(X1))). % 0.14/0.38 cnf(i_0_5, negated_conjecture, (big_p(esk1_1(X1))|~big_p(X1))). % 0.14/0.38 cnf(i_0_6, negated_conjecture, (big_r(X1,g(h(esk1_1(X1))))|~big_p(X1))). % 0.14/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.14/0.38 # Begin printing tableau % 0.14/0.38 # Found 5 steps % 0.14/0.38 cnf(i_0_3, negated_conjecture, (big_p(h(esk2_0))|~big_p(esk2_0)), inference(start_rule)). % 0.14/0.38 cnf(i_0_14, plain, (~big_p(esk2_0)), inference(closure_rule, [i_0_2])). % 0.14/0.38 cnf(i_0_13, plain, (big_p(h(esk2_0))), inference(extension_rule, [i_0_5])). % 0.14/0.39 cnf(i_0_60, plain, (big_p(esk1_1(h(esk2_0)))), inference(extension_rule, [i_0_4])). % 0.14/0.39 cnf(i_0_62, plain, (big_p(g(esk1_1(h(esk2_0))))), inference(etableau_closure_rule, [i_0_62, ...])). % 0.14/0.39 # End printing tableau % 0.14/0.39 # SZS output end % 0.14/0.39 # Branches closed with saturation will be marked with an "s" % 0.14/0.39 # There were 1 total branch saturation attempts. % 0.14/0.39 # There were 0 of these attempts blocked. % 0.14/0.39 # There were 0 deferred branch saturation attempts. % 0.14/0.39 # There were 0 free duplicated saturations. % 0.14/0.39 # There were 1 total successful branch saturations. % 0.14/0.39 # There were 0 successful branch saturations in interreduction. % 0.14/0.39 # There were 0 successful branch saturations on the branch. % 0.14/0.39 # There were 1 successful branch saturations after the branch. % 0.14/0.39 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.14/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.14/0.39 # Begin clausification derivation % 0.14/0.39 % 0.14/0.39 # End clausification derivation % 0.14/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.14/0.39 cnf(i_0_2, negated_conjecture, (big_p(esk2_0))). % 0.14/0.39 cnf(i_0_1, negated_conjecture, (~big_r(esk2_0,X1)|~big_p(X1))). % 0.14/0.39 cnf(i_0_3, negated_conjecture, (big_p(h(X1))|~big_p(X1))). % 0.14/0.39 cnf(i_0_4, negated_conjecture, (big_p(g(X1))|~big_p(X1))). % 0.14/0.39 cnf(i_0_5, negated_conjecture, (big_p(esk1_1(X1))|~big_p(X1))). % 0.14/0.39 cnf(i_0_6, negated_conjecture, (big_r(X1,g(h(esk1_1(X1))))|~big_p(X1))). % 0.14/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.14/0.39 # Begin printing tableau % 0.14/0.39 # Found 5 steps % 0.14/0.39 cnf(i_0_5, negated_conjecture, (big_p(esk1_1(esk2_0))|~big_p(esk2_0)), inference(start_rule)). % 0.14/0.39 cnf(i_0_10, plain, (~big_p(esk2_0)), inference(closure_rule, [i_0_2])). % 0.14/0.39 cnf(i_0_9, plain, (big_p(esk1_1(esk2_0))), inference(extension_rule, [i_0_3])). % 0.14/0.39 cnf(i_0_34, plain, (big_p(h(esk1_1(esk2_0)))), inference(extension_rule, [i_0_6])). % 0.14/0.39 cnf(i_0_58, plain, (big_r(h(esk1_1(esk2_0)),g(h(esk1_1(h(esk1_1(esk2_0))))))), inference(etableau_closure_rule, [i_0_58, ...])). % 0.14/0.39 # End printing tableau % 0.14/0.39 # SZS output end % 0.14/0.39 # Branches closed with saturation will be marked with an "s" % 0.14/0.39 # There were 1 total branch saturation attempts. % 0.14/0.39 # There were 0 of these attempts blocked. % 0.14/0.39 # There were 0 deferred branch saturation attempts. % 0.14/0.39 # There were 0 free duplicated saturations. % 0.14/0.39 # There were 1 total successful branch saturations. % 0.14/0.39 # There were 0 successful branch saturations in interreduction. % 0.14/0.39 # There were 0 successful branch saturations on the branch. % 0.14/0.39 # There were 1 successful branch saturations after the branch. % 0.14/0.39 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.14/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.14/0.39 # Begin clausification derivation % 0.14/0.39 % 0.14/0.39 # End clausification derivation % 0.14/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.14/0.39 cnf(i_0_2, negated_conjecture, (big_p(esk2_0))). % 0.14/0.39 cnf(i_0_1, negated_conjecture, (~big_r(esk2_0,X1)|~big_p(X1))). % 0.14/0.39 cnf(i_0_3, negated_conjecture, (big_p(h(X1))|~big_p(X1))). % 0.14/0.39 cnf(i_0_4, negated_conjecture, (big_p(g(X1))|~big_p(X1))). % 0.14/0.39 cnf(i_0_5, negated_conjecture, (big_p(esk1_1(X1))|~big_p(X1))). % 0.14/0.39 cnf(i_0_6, negated_conjecture, (big_r(X1,g(h(esk1_1(X1))))|~big_p(X1))). % 0.14/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.14/0.39 # Begin printing tableau % 0.14/0.39 # Found 4 steps % 0.14/0.39 cnf(i_0_2, negated_conjecture, (big_p(esk2_0)), inference(start_rule)). % 0.14/0.39 cnf(i_0_17, plain, (big_p(esk2_0)), inference(extension_rule, [i_0_6])). % 0.14/0.39 cnf(i_0_48, plain, (big_r(esk2_0,g(h(esk1_1(esk2_0))))), inference(extension_rule, [i_0_1])). % 0.14/0.39 cnf(i_0_57, plain, (~big_p(g(h(esk1_1(esk2_0))))), inference(etableau_closure_rule, [i_0_57, ...])). % 0.14/0.39 # End printing tableau % 0.14/0.39 # SZS output end % 0.14/0.39 # Branches closed with saturation will be marked with an "s" % 0.14/0.39 # There were 1 total branch saturation attempts. % 0.14/0.39 # There were 0 of these attempts blocked. % 0.14/0.39 # There were 0 deferred branch saturation attempts. % 0.14/0.39 # There were 0 free duplicated saturations. % 0.14/0.39 # There were 1 total successful branch saturations. % 0.14/0.39 # There were 0 successful branch saturations in interreduction. % 0.14/0.39 # There were 0 successful branch saturations on the branch. % 0.14/0.39 # There were 1 successful branch saturations after the branch. % 0.14/0.39 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.14/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.14/0.39 # Begin clausification derivation % 0.14/0.39 % 0.14/0.39 # End clausification derivation % 0.14/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.14/0.39 cnf(i_0_2, negated_conjecture, (big_p(esk2_0))). % 0.14/0.39 cnf(i_0_1, negated_conjecture, (~big_r(esk2_0,X1)|~big_p(X1))). % 0.14/0.39 cnf(i_0_3, negated_conjecture, (big_p(h(X1))|~big_p(X1))). % 0.14/0.39 cnf(i_0_4, negated_conjecture, (big_p(g(X1))|~big_p(X1))). % 0.14/0.39 cnf(i_0_5, negated_conjecture, (big_p(esk1_1(X1))|~big_p(X1))). % 0.14/0.39 cnf(i_0_6, negated_conjecture, (big_r(X1,g(h(esk1_1(X1))))|~big_p(X1))). % 0.14/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.14/0.39 # Begin printing tableau % 0.14/0.39 # Found 5 steps % 0.14/0.39 cnf(i_0_4, negated_conjecture, (big_p(g(esk2_0))|~big_p(esk2_0)), inference(start_rule)). % 0.14/0.39 cnf(i_0_12, plain, (~big_p(esk2_0)), inference(closure_rule, [i_0_2])). % 0.14/0.39 cnf(i_0_11, plain, (big_p(g(esk2_0))), inference(extension_rule, [i_0_3])). % 0.14/0.39 cnf(i_0_44, plain, (big_p(h(g(esk2_0)))), inference(extension_rule, [i_0_6])). % 0.14/0.39 cnf(i_0_48, plain, (big_r(h(g(esk2_0)),g(h(esk1_1(h(g(esk2_0))))))), inference(etableau_closure_rule, [i_0_48, ...])). % 0.14/0.39 # End printing tableau % 0.14/0.39 # SZS output end % 0.14/0.39 # Branches closed with saturation will be marked with an "s" % 0.14/0.39 # There were 1 total branch saturation attempts. % 0.14/0.39 # There were 0 of these attempts blocked. % 0.14/0.39 # There were 0 deferred branch saturation attempts. % 0.14/0.39 # There were 0 free duplicated saturations. % 0.14/0.39 # There were 1 total successful branch saturations. % 0.14/0.39 # There were 0 successful branch saturations in interreduction. % 0.14/0.39 # There were 0 successful branch saturations on the branch. % 0.14/0.39 # There were 1 successful branch saturations after the branch. % 0.14/0.39 # Child (10597) has found a proof. % 0.14/0.39 % 0.14/0.39 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.14/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.14/0.39 # Begin clausification derivation % 0.14/0.39 % 0.14/0.39 # End clausification derivation % 0.14/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.14/0.39 cnf(i_0_2, negated_conjecture, (big_p(esk2_0))). % 0.14/0.39 cnf(i_0_1, negated_conjecture, (~big_r(esk2_0,X1)|~big_p(X1))). % 0.14/0.39 cnf(i_0_3, negated_conjecture, (big_p(h(X1))|~big_p(X1))). % 0.14/0.39 cnf(i_0_4, negated_conjecture, (big_p(g(X1))|~big_p(X1))). % 0.14/0.39 cnf(i_0_5, negated_conjecture, (big_p(esk1_1(X1))|~big_p(X1))). % 0.14/0.39 cnf(i_0_6, negated_conjecture, (big_r(X1,g(h(esk1_1(X1))))|~big_p(X1))). % 0.14/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.14/0.39 # Begin printing tableau % 0.14/0.39 # Found 5 steps % 0.14/0.39 cnf(i_0_4, negated_conjecture, (big_p(g(esk2_0))|~big_p(esk2_0)), inference(start_rule)). % 0.14/0.39 cnf(i_0_12, plain, (~big_p(esk2_0)), inference(closure_rule, [i_0_2])). % 0.14/0.39 cnf(i_0_11, plain, (big_p(g(esk2_0))), inference(extension_rule, [i_0_4])). % 0.14/0.39 cnf(i_0_42, plain, (big_p(g(g(esk2_0)))), inference(extension_rule, [i_0_6])). % 0.14/0.39 cnf(i_0_48, plain, (big_r(g(g(esk2_0)),g(h(esk1_1(g(g(esk2_0))))))), inference(etableau_closure_rule, [i_0_48, ...])). % 0.14/0.39 # End printing tableau % 0.14/0.39 # SZS output end % 0.14/0.39 # Branches closed with saturation will be marked with an "s" % 0.14/0.39 # Proof search is over... % 0.14/0.39 # Freeing feature tree %------------------------------------------------------------------------------