%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN393+1.003 : 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 : n009.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:38 EDT 2022 % Result : Theorem 0.13s 0.37s % Output : CNFRefutation 0.13s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.12 % Problem : SYN393+1.003 : TPTP v8.1.0. Released v2.0.0. % 0.12/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.34 % Computer : n009.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Mon Jul 11 21:33:37 EDT 2022 % 0.13/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: 8 Number of unprocessed: 6 % 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.37 # The folding up rule is enabled... % 0.13/0.37 # Local unification is enabled... % 0.13/0.37 # Any saturation attempts will use folding labels... % 0.13/0.37 # 6 beginning clauses after preprocessing and clausification % 0.13/0.37 # Creating start rules for all 6 conjectures. % 0.13/0.37 # There are 6 start rule candidates: % 0.13/0.37 # Found 0 unit axioms. % 0.13/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.37 # 6 start rule tableaux created. % 0.13/0.37 # 6 extension rule candidate clauses % 0.13/0.37 # 0 unit axiom clauses % 0.13/0.37 % 0.13/0.37 # Requested 8, 32 cores available to the main process. % 0.13/0.37 # There are not enough tableaux to fork, creating more from the initial 6 % 0.13/0.37 # Returning from population with 10 new_tableaux and 0 remaining starting tableaux. % 0.13/0.37 # We now have 10 tableaux to operate on % 0.13/0.37 # There were 2 total branch saturation attempts. % 0.13/0.37 # There were 0 of these attempts blocked. % 0.13/0.37 # There were 0 deferred branch saturation attempts. % 0.13/0.37 # There were 0 free duplicated saturations. % 0.13/0.37 # There were 2 total successful branch saturations. % 0.13/0.37 # There were 2 successful branch saturations in interreduction. % 0.13/0.37 # There were 0 successful branch saturations on the branch. % 0.13/0.37 # There were 0 successful branch saturations after the branch. % 0.13/0.37 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.37 # Begin clausification derivation % 0.13/0.37 % 0.13/0.37 # End clausification derivation % 0.13/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.37 cnf(i_0_7, negated_conjecture, (~p3|~p1)). % 0.13/0.37 cnf(i_0_16, negated_conjecture, (~p2|~p1)). % 0.13/0.37 cnf(i_0_2, negated_conjecture, (~p3|~p2)). % 0.13/0.37 cnf(i_0_25, negated_conjecture, (p2|p1)). % 0.13/0.37 cnf(i_0_18, negated_conjecture, (p3|p1)). % 0.13/0.37 cnf(i_0_23, negated_conjecture, (p3|p2)). % 0.13/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.37 # Begin printing tableau % 0.13/0.37 # Found 5 steps % 0.13/0.37 cnf(i_0_16, negated_conjecture, (~p2|~p1), inference(start_rule)). % 0.13/0.37 cnf(i_0_41, plain, (~p2), inference(extension_rule, [i_0_23])). % 0.13/0.37 cnf(i_0_141, plain, (p3), inference(extension_rule, [i_0_7])). % 0.13/0.37 cnf(i_0_42, plain, (~p1), inference(etableau_closure_rule, [i_0_42, ...])). % 0.13/0.37 cnf(i_0_152, plain, (~p1), inference(etableau_closure_rule, [i_0_152, ...])). % 0.13/0.37 # End printing tableau % 0.13/0.37 # SZS output end % 0.13/0.37 # Branches closed with saturation will be marked with an "s" % 0.13/0.37 # There were 2 total branch saturation attempts. % 0.13/0.37 # There were 0 of these attempts blocked. % 0.13/0.37 # There were 0 deferred branch saturation attempts. % 0.13/0.37 # There were 0 free duplicated saturations. % 0.13/0.37 # There were 2 total successful branch saturations. % 0.13/0.37 # There were 2 successful branch saturations in interreduction. % 0.13/0.37 # There were 0 successful branch saturations on the branch. % 0.13/0.37 # There were 0 successful branch saturations after the branch. % 0.13/0.37 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.37 # Begin clausification derivation % 0.13/0.37 % 0.13/0.37 # End clausification derivation % 0.13/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.37 cnf(i_0_7, negated_conjecture, (~p3|~p1)). % 0.13/0.37 cnf(i_0_16, negated_conjecture, (~p2|~p1)). % 0.13/0.37 cnf(i_0_2, negated_conjecture, (~p3|~p2)). % 0.13/0.37 cnf(i_0_25, negated_conjecture, (p2|p1)). % 0.13/0.37 cnf(i_0_18, negated_conjecture, (p3|p1)). % 0.13/0.37 cnf(i_0_23, negated_conjecture, (p3|p2)). % 0.13/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.37 # Begin printing tableau % 0.13/0.37 # Found 5 steps % 0.13/0.37 cnf(i_0_7, negated_conjecture, (~p3|~p1), inference(start_rule)). % 0.13/0.37 cnf(i_0_43, plain, (~p3), inference(extension_rule, [i_0_23])). % 0.13/0.37 cnf(i_0_142, plain, (p2), inference(extension_rule, [i_0_16])). % 0.13/0.37 cnf(i_0_44, plain, (~p1), inference(etableau_closure_rule, [i_0_44, ...])). % 0.13/0.37 cnf(i_0_150, plain, (~p1), inference(etableau_closure_rule, [i_0_150, ...])). % 0.13/0.37 # End printing tableau % 0.13/0.37 # SZS output end % 0.13/0.37 # Branches closed with saturation will be marked with an "s" % 0.13/0.37 # There were 2 total branch saturation attempts. % 0.13/0.37 # There were 0 of these attempts blocked. % 0.13/0.37 # There were 0 deferred branch saturation attempts. % 0.13/0.37 # There were 0 free duplicated saturations. % 0.13/0.37 # There were 2 total successful branch saturations. % 0.13/0.37 # There were 2 successful branch saturations in interreduction. % 0.13/0.37 # There were 0 successful branch saturations on the branch. % 0.13/0.37 # There were 0 successful branch saturations after the branch. % 0.13/0.37 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.37 # Begin clausification derivation % 0.13/0.37 % 0.13/0.37 # End clausification derivation % 0.13/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.37 cnf(i_0_7, negated_conjecture, (~p3|~p1)). % 0.13/0.37 cnf(i_0_16, negated_conjecture, (~p2|~p1)). % 0.13/0.37 cnf(i_0_2, negated_conjecture, (~p3|~p2)). % 0.13/0.37 cnf(i_0_25, negated_conjecture, (p2|p1)). % 0.13/0.37 cnf(i_0_18, negated_conjecture, (p3|p1)). % 0.13/0.37 cnf(i_0_23, negated_conjecture, (p3|p2)). % 0.13/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.37 # Begin printing tableau % 0.13/0.37 # Found 5 steps % 0.13/0.37 cnf(i_0_2, negated_conjecture, (~p3|~p2), inference(start_rule)). % 0.13/0.37 cnf(i_0_40, plain, (~p2), inference(extension_rule, [i_0_25])). % 0.13/0.37 cnf(i_0_134, plain, (p1), inference(extension_rule, [i_0_7])). % 0.13/0.37 cnf(i_0_39, plain, (~p3), inference(etableau_closure_rule, [i_0_39, ...])). % 0.13/0.37 cnf(i_0_151, plain, (~p3), inference(etableau_closure_rule, [i_0_151, ...])). % 0.13/0.37 # End printing tableau % 0.13/0.37 # SZS output end % 0.13/0.37 # Branches closed with saturation will be marked with an "s" % 0.13/0.37 # There were 2 total branch saturation attempts. % 0.13/0.37 # There were 0 of these attempts blocked. % 0.13/0.37 # There were 0 deferred branch saturation attempts. % 0.13/0.37 # There were 0 free duplicated saturations. % 0.13/0.37 # There were 2 total successful branch saturations. % 0.13/0.37 # There were 2 successful branch saturations in interreduction. % 0.13/0.37 # There were 0 successful branch saturations on the branch. % 0.13/0.37 # There were 0 successful branch saturations after the branch. % 0.13/0.37 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.37 # Begin clausification derivation % 0.13/0.37 % 0.13/0.37 # End clausification derivation % 0.13/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.37 cnf(i_0_7, negated_conjecture, (~p3|~p1)). % 0.13/0.37 cnf(i_0_16, negated_conjecture, (~p2|~p1)). % 0.13/0.37 cnf(i_0_2, negated_conjecture, (~p3|~p2)). % 0.13/0.37 cnf(i_0_25, negated_conjecture, (p2|p1)). % 0.13/0.37 cnf(i_0_18, negated_conjecture, (p3|p1)). % 0.13/0.37 cnf(i_0_23, negated_conjecture, (p3|p2)). % 0.13/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.37 # Begin printing tableau % 0.13/0.37 # Found 5 steps % 0.13/0.37 cnf(i_0_2, negated_conjecture, (~p3|~p2), inference(start_rule)). % 0.13/0.37 cnf(i_0_39, plain, (~p3), inference(extension_rule, [i_0_18])). % 0.13/0.37 cnf(i_0_120, plain, (p1), inference(extension_rule, [i_0_16])). % 0.13/0.37 cnf(i_0_40, plain, (~p2), inference(etableau_closure_rule, [i_0_40, ...])). % 0.13/0.37 cnf(i_0_149, plain, (~p2), inference(etableau_closure_rule, [i_0_149, ...])). % 0.13/0.37 # End printing tableau % 0.13/0.37 # SZS output end % 0.13/0.37 # Branches closed with saturation will be marked with an "s" % 0.13/0.37 # There were 2 total branch saturation attempts. % 0.13/0.37 # There were 0 of these attempts blocked. % 0.13/0.37 # There were 0 deferred branch saturation attempts. % 0.13/0.37 # There were 0 free duplicated saturations. % 0.13/0.37 # There were 2 total successful branch saturations. % 0.13/0.37 # There were 2 successful branch saturations in interreduction. % 0.13/0.37 # There were 0 successful branch saturations on the branch. % 0.13/0.37 # There were 0 successful branch saturations after the branch. % 0.13/0.37 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.37 # Begin clausification derivation % 0.13/0.37 % 0.13/0.37 # End clausification derivation % 0.13/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.37 cnf(i_0_7, negated_conjecture, (~p3|~p1)). % 0.13/0.37 cnf(i_0_16, negated_conjecture, (~p2|~p1)). % 0.13/0.37 cnf(i_0_2, negated_conjecture, (~p3|~p2)). % 0.13/0.37 cnf(i_0_25, negated_conjecture, (p2|p1)). % 0.13/0.37 cnf(i_0_18, negated_conjecture, (p3|p1)). % 0.13/0.37 cnf(i_0_23, negated_conjecture, (p3|p2)). % 0.13/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.37 # Begin printing tableau % 0.13/0.37 # Found 5 steps % 0.13/0.37 cnf(i_0_18, negated_conjecture, (p3|p1), inference(start_rule)). % 0.13/0.37 cnf(i_0_35, plain, (p3), inference(extension_rule, [i_0_2])). % 0.13/0.37 cnf(i_0_76, plain, (~p2), inference(extension_rule, [i_0_25])). % 0.13/0.37 cnf(i_0_36, plain, (p1), inference(etableau_closure_rule, [i_0_36, ...])). % 0.13/0.37 cnf(i_0_146, plain, (p1), inference(etableau_closure_rule, [i_0_146, ...])). % 0.13/0.37 # End printing tableau % 0.13/0.37 # SZS output end % 0.13/0.37 # Branches closed with saturation will be marked with an "s" % 0.13/0.37 # There were 2 total branch saturation attempts. % 0.13/0.37 # There were 0 of these attempts blocked. % 0.13/0.37 # There were 0 deferred branch saturation attempts. % 0.13/0.37 # There were 0 free duplicated saturations. % 0.13/0.37 # There were 2 total successful branch saturations. % 0.13/0.37 # There were 2 successful branch saturations in interreduction. % 0.13/0.37 # There were 0 successful branch saturations on the branch. % 0.13/0.37 # There were 0 successful branch saturations after the branch. % 0.13/0.37 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.37 # Begin clausification derivation % 0.13/0.37 % 0.13/0.37 # End clausification derivation % 0.13/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.37 cnf(i_0_7, negated_conjecture, (~p3|~p1)). % 0.13/0.37 cnf(i_0_16, negated_conjecture, (~p2|~p1)). % 0.13/0.37 cnf(i_0_2, negated_conjecture, (~p3|~p2)). % 0.13/0.37 cnf(i_0_25, negated_conjecture, (p2|p1)). % 0.13/0.37 cnf(i_0_18, negated_conjecture, (p3|p1)). % 0.13/0.37 cnf(i_0_23, negated_conjecture, (p3|p2)). % 0.13/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.37 # Begin printing tableau % 0.13/0.37 # Found 5 steps % 0.13/0.37 cnf(i_0_25, negated_conjecture, (p2|p1), inference(start_rule)). % 0.13/0.37 cnf(i_0_38, plain, (p1), inference(extension_rule, [i_0_7])). % 0.13/0.37 cnf(i_0_115, plain, (~p3), inference(extension_rule, [i_0_23])). % 0.13/0.37 cnf(i_0_37, plain, (p2), inference(etableau_closure_rule, [i_0_37, ...])). % 0.13/0.37 cnf(i_0_142, plain, (p2), inference(etableau_closure_rule, [i_0_142, ...])). % 0.13/0.37 # End printing tableau % 0.13/0.37 # SZS output end % 0.13/0.37 # Branches closed with saturation will be marked with an "s" % 0.13/0.37 # Child (16698) has found a proof. % 0.13/0.37 % 0.13/0.38 # Proof search is over... % 0.13/0.38 # Freeing feature tree %------------------------------------------------------------------------------