%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN728+1 : TPTP v8.1.0. Released v2.5.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 : n018.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:13:38 EDT 2022 % Result : Theorem 0.12s 0.35s % Output : CNFRefutation 0.12s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.12 % Problem : SYN728+1 : TPTP v8.1.0. Released v2.5.0. % 0.04/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.32 % Computer : n018.cluster.edu % 0.12/0.32 % Model : x86_64 x86_64 % 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.32 % Memory : 8042.1875MB % 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.32 % CPULimit : 300 % 0.12/0.32 % WCLimit : 600 % 0.12/0.32 % DateTime : Tue Jul 12 07:26:29 EDT 2022 % 0.12/0.32 % CPUTime : % 0.12/0.35 # No SInE strategy applied % 0.12/0.35 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S032N % 0.12/0.35 # and selection function SelectUnlessUniqMax. % 0.12/0.35 # % 0.12/0.35 # Presaturation interreduction done % 0.12/0.35 # Number of axioms: 5 Number of unprocessed: 5 % 0.12/0.35 # Tableaux proof search. % 0.12/0.35 # APR header successfully linked. % 0.12/0.35 # Hello from C++ % 0.12/0.35 # The folding up rule is enabled... % 0.12/0.35 # Local unification is enabled... % 0.12/0.35 # Any saturation attempts will use folding labels... % 0.12/0.35 # 5 beginning clauses after preprocessing and clausification % 0.12/0.35 # Creating start rules for all 5 conjectures. % 0.12/0.35 # There are 5 start rule candidates: % 0.12/0.35 # Found 0 unit axioms. % 0.12/0.35 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.35 # 5 start rule tableaux created. % 0.12/0.35 # 5 extension rule candidate clauses % 0.12/0.35 # 0 unit axiom clauses % 0.12/0.35 % 0.12/0.35 # Requested 8, 32 cores available to the main process. % 0.12/0.35 # There are not enough tableaux to fork, creating more from the initial 5 % 0.12/0.35 # Returning from population with 10 new_tableaux and 0 remaining starting tableaux. % 0.12/0.35 # We now have 10 tableaux to operate on % 0.12/0.35 # Closed tableau found in foldup close cycle with 2 folds and 2 closures done. % 0.12/0.35 # There were 0 total branch saturation attempts. % 0.12/0.35 # There were 0 of these attempts blocked. % 0.12/0.35 # There were 0 deferred branch saturation attempts. % 0.12/0.35 # There were 0 free duplicated saturations. % 0.12/0.35 # There were 0 total successful branch saturations. % 0.12/0.35 # There were 0 successful branch saturations in interreduction. % 0.12/0.35 # There were 0 successful branch saturations on the branch. % 0.12/0.35 # There were 0 successful branch saturations after the branch. % 0.12/0.35 # Closed tableau found in foldup close cycle with 2 folds and 2 closures done. % 0.12/0.35 # There were 0 total branch saturation attempts. % 0.12/0.35 # There were 0 of these attempts blocked. % 0.12/0.35 # There were 0 deferred branch saturation attempts. % 0.12/0.35 # There were 0 free duplicated saturations. % 0.12/0.35 # There were 0 total successful branch saturations. % 0.12/0.35 # There were 0 successful branch saturations in interreduction. % 0.12/0.35 # There were 0 successful branch saturations on the branch. % 0.12/0.35 # There were 0 successful branch saturations after the branch. % 0.12/0.35 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.35 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.35 # Begin clausification derivation % 0.12/0.35 % 0.12/0.35 # End clausification derivation % 0.12/0.35 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.35 cnf(i_0_2, negated_conjecture, (~q(X1)|~m(g(X1)))). % 0.12/0.35 cnf(i_0_1, negated_conjecture, (~p(g(esk3_0),X1)|~p(esk3_0,esk3_0))). % 0.12/0.35 cnf(i_0_4, negated_conjecture, (m(X1)|p(X1,esk1_1(X1)))). % 0.12/0.35 cnf(i_0_5, negated_conjecture, (p(X1,X1)|~p(X2,X3))). % 0.12/0.35 cnf(i_0_3, negated_conjecture, (q(f(X1,esk2_1(X1)))|p(X1,esk1_1(X1)))). % 0.12/0.35 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.35 # Begin printing tableau % 0.12/0.35 # Found 8 steps % 0.12/0.35 cnf(i_0_5, negated_conjecture, (p(g(esk3_0),g(esk3_0))|~p(g(f(g(f(X7,esk2_1(X7))),esk2_1(g(f(X7,esk2_1(X7)))))),esk1_1(g(f(g(f(X7,esk2_1(X7))),esk2_1(g(f(X7,esk2_1(X7))))))))), inference(start_rule)). % 0.12/0.35 cnf(i_0_9, plain, (~p(g(f(g(f(X7,esk2_1(X7))),esk2_1(g(f(X7,esk2_1(X7)))))),esk1_1(g(f(g(f(X7,esk2_1(X7))),esk2_1(g(f(X7,esk2_1(X7))))))))), inference(extension_rule, [i_0_4])). % 0.12/0.35 cnf(i_0_50, plain, (m(g(f(g(f(X7,esk2_1(X7))),esk2_1(g(f(X7,esk2_1(X7)))))))), inference(extension_rule, [i_0_2])). % 0.12/0.35 cnf(i_0_74, plain, (~q(f(g(f(X7,esk2_1(X7))),esk2_1(g(f(X7,esk2_1(X7))))))), inference(extension_rule, [i_0_3])). % 0.12/0.35 cnf(i_0_8, plain, (p(g(esk3_0),g(esk3_0))), inference(extension_rule, [i_0_1])). % 0.12/0.35 cnf(i_0_83, plain, (~p(esk3_0,esk3_0)), inference(extension_rule, [i_0_5])). % 0.12/0.35 cnf(i_0_85, plain, (~p(g(esk3_0),g(esk3_0))), inference(closure_rule, [i_0_8])). % 0.12/0.35 cnf(i_0_77, plain, (p(g(f(X7,esk2_1(X7))),esk1_1(g(f(X7,esk2_1(X7)))))), inference(closure_rule, [i_0_9])). % 0.12/0.35 # End printing tableau % 0.12/0.35 # SZS output end % 0.12/0.35 # Branches closed with saturation will be marked with an "s" % 0.12/0.35 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.35 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.35 # Begin clausification derivation % 0.12/0.35 % 0.12/0.35 # End clausification derivation % 0.12/0.35 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.35 cnf(i_0_2, negated_conjecture, (~q(X1)|~m(g(X1)))). % 0.12/0.35 cnf(i_0_1, negated_conjecture, (~p(g(esk3_0),X1)|~p(esk3_0,esk3_0))). % 0.12/0.35 cnf(i_0_4, negated_conjecture, (m(X1)|p(X1,esk1_1(X1)))). % 0.12/0.35 cnf(i_0_5, negated_conjecture, (p(X1,X1)|~p(X2,X3))). % 0.12/0.35 cnf(i_0_3, negated_conjecture, (q(f(X1,esk2_1(X1)))|p(X1,esk1_1(X1)))). % 0.12/0.35 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.35 # Begin printing tableau % 0.12/0.35 # Found 8 steps % 0.12/0.35 cnf(i_0_5, negated_conjecture, (p(g(esk3_0),g(esk3_0))|~p(X8,esk1_1(X8))), inference(start_rule)). % 0.12/0.35 cnf(i_0_9, plain, (~p(X8,esk1_1(X8))), inference(extension_rule, [i_0_3])). % 0.12/0.35 cnf(i_0_46, plain, (q(f(X8,esk2_1(X8)))), inference(extension_rule, [i_0_2])). % 0.12/0.35 cnf(i_0_75, plain, (~m(g(f(X8,esk2_1(X8))))), inference(extension_rule, [i_0_4])). % 0.12/0.35 cnf(i_0_8, plain, (p(g(esk3_0),g(esk3_0))), inference(extension_rule, [i_0_1])). % 0.12/0.35 cnf(i_0_87, plain, (~p(esk3_0,esk3_0)), inference(extension_rule, [i_0_5])). % 0.12/0.35 cnf(i_0_91, plain, (~p(g(esk3_0),g(esk3_0))), inference(closure_rule, [i_0_8])). % 0.12/0.35 cnf(i_0_81, plain, (p(g(f(X8,esk2_1(X8))),esk1_1(g(f(X8,esk2_1(X8)))))), inference(closure_rule, [i_0_9])). % 0.12/0.35 # End printing tableau % 0.12/0.35 # SZS output end % 0.12/0.35 # Branches closed with saturation will be marked with an "s" % 0.12/0.35 # Child (2655) has found a proof. % 0.12/0.35 % 0.12/0.35 # Proof search is over... % 0.12/0.35 # Freeing feature tree %------------------------------------------------------------------------------