%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : PUZ054-1 : TPTP v8.1.0. Released v2.7.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 : n032.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 : Mon Jul 18 18:11:03 EDT 2022 % Result : Satisfiable 0.13s 0.31s % Output : CNFRefutation 0.13s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.09 % Problem : PUZ054-1 : TPTP v8.1.0. Released v2.7.0. % 0.08/0.10 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.08/0.28 % Computer : n032.cluster.edu % 0.08/0.28 % Model : x86_64 x86_64 % 0.08/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.08/0.28 % Memory : 8042.1875MB % 0.08/0.28 % OS : Linux 3.10.0-693.el7.x86_64 % 0.08/0.29 % CPULimit : 300 % 0.08/0.29 % WCLimit : 600 % 0.08/0.29 % DateTime : Sun May 29 02:28:56 EDT 2022 % 0.08/0.29 % CPUTime : % 0.13/0.31 # No SInE strategy applied % 0.13/0.31 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S4d % 0.13/0.31 # and selection function SelectCQIPrecWNTNp. % 0.13/0.31 # % 0.13/0.31 # Presaturation interreduction done % 0.13/0.31 # Number of axioms: 5 Number of unprocessed: 5 % 0.13/0.31 # Tableaux proof search. % 0.13/0.31 # APR header successfully linked. % 0.13/0.31 # Hello from C++ % 0.13/0.31 # The folding up rule is enabled... % 0.13/0.31 # Local unification is enabled... % 0.13/0.31 # Any saturation attempts will use folding labels... % 0.13/0.31 # 5 beginning clauses after preprocessing and clausification % 0.13/0.31 # Creating start rules for all 1 conjectures. % 0.13/0.31 # There are 1 start rule candidates: % 0.13/0.31 # Found 2 unit axioms. % 0.13/0.31 # 1 start rule tableaux created. % 0.13/0.31 # 3 extension rule candidate clauses % 0.13/0.31 # 2 unit axiom clauses % 0.13/0.31 % 0.13/0.31 # Requested 8, 32 cores available to the main process. % 0.13/0.31 # There are not enough tableaux to fork, creating more from the initial 1 % 0.13/0.31 # 11817 Satisfiable branch % 0.13/0.31 # Satisfiable branch found. % 0.13/0.31 # There were 1 total branch saturation attempts. % 0.13/0.31 # There were 0 of these attempts blocked. % 0.13/0.31 # There were 0 deferred branch saturation attempts. % 0.13/0.31 # There were 0 free duplicated saturations. % 0.13/0.31 # There were 0 total successful branch saturations. % 0.13/0.31 # There were 0 successful branch saturations in interreduction. % 0.13/0.31 # There were 0 successful branch saturations on the branch. % 0.13/0.31 # There were 0 successful branch saturations after the branch. % 0.13/0.31 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.31 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.31 # Begin clausification derivation % 0.13/0.31 % 0.13/0.31 # End clausification derivation % 0.13/0.31 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.31 cnf(i_0_6, plain, (p(s(s(s(s(s(s(s(s(s(s(n0)))))))))),s(s(s(s(s(s(s(s(s(n0)))))))))))). % 0.13/0.31 cnf(i_0_10, negated_conjecture, (~p(s(n0),n0))). % 0.13/0.31 cnf(i_0_9, plain, (p(s(X1),X2)|~p(s(X1),s(X2)))). % 0.13/0.31 cnf(i_0_8, plain, (p(X1,s(X2))|~p(X1,s(s(X2))))). % 0.13/0.31 cnf(i_0_7, plain, (p(X1,s(X2))|~p(s(s(X1)),X2))). % 0.13/0.31 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.31 # Begin printing tableau % 0.13/0.31 # Found 3 steps % 0.13/0.31 cnf(i_0_10, negated_conjecture, (~p(s(n0),n0)), inference(start_rule)). % 0.13/0.31 cnf(i_0_11, plain, (~p(s(n0),n0)), inference(extension_rule, [i_0_9])). % 0.13/0.31 cnf(i_0_13, plain, (~p(s(n0),s(n0))), inference(extension_rule, [i_0_9])). % 0.13/0.31 # End printing tableau % 0.13/0.31 # SZS output end % 0.13/0.31 # Branches closed with saturation will be marked with an "s" % 0.13/0.31 # Returning from population with 1 new_tableaux and 0 remaining starting tableaux. % 0.13/0.31 # We now have 1 tableaux to operate on % 0.13/0.31 # Found closed tableau during pool population. % 0.13/0.31 # Proof search is over... % 0.13/0.31 # Freeing feature tree %------------------------------------------------------------------------------