%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : ALG299-1 : TPTP v8.1.0. Released v4.1.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 : n022.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 14 16:52:24 EDT 2022 % Result : Satisfiable 0.18s 0.36s % Output : CNFRefutation 0.18s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.11 % Problem : ALG299-1 : TPTP v8.1.0. Released v4.1.0. % 0.03/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.11/0.33 % Computer : n022.cluster.edu % 0.11/0.33 % Model : x86_64 x86_64 % 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.33 % Memory : 8042.1875MB % 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.11/0.33 % CPULimit : 300 % 0.11/0.33 % WCLimit : 600 % 0.11/0.33 % DateTime : Thu Jun 9 02:54:19 EDT 2022 % 0.11/0.33 % CPUTime : % 0.11/0.35 # No SInE strategy applied % 0.11/0.35 # Auto-Mode selected heuristic C12_02_nc_SAT001_MinMin_rr % 0.11/0.35 # and selection function SelectMaxLComplexAvoidPosPred. % 0.11/0.35 # % 0.11/0.35 # Presaturation interreduction done % 0.11/0.35 # Number of axioms: 3 Number of unprocessed: 3 % 0.11/0.35 # Tableaux proof search. % 0.11/0.35 # APR header successfully linked. % 0.11/0.35 # Hello from C++ % 0.18/0.35 # The folding up rule is enabled... % 0.18/0.35 # Local unification is enabled... % 0.18/0.35 # Any saturation attempts will use folding labels... % 0.18/0.35 # 3 beginning clauses after preprocessing and clausification % 0.18/0.35 # No conjectures after preprocessing. Attempting to resurrect them from ax_archive. % 0.18/0.35 # No conjectures. % 0.18/0.35 # There are 3 start rule candidates: % 0.18/0.35 # Found 3 unit axioms. % 0.18/0.35 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.18/0.35 # 3 start rule tableaux created. % 0.18/0.35 # 0 extension rule candidate clauses % 0.18/0.35 # 3 unit axiom clauses % 0.18/0.35 % 0.18/0.35 # Requested 8, 32 cores available to the main process. % 0.18/0.35 # There are not enough tableaux to fork, creating more from the initial 3 % 0.18/0.35 # Creating equality axioms % 0.18/0.35 # Ran out of tableaux, making start rules for all clauses % 0.18/0.35 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux. % 0.18/0.35 # We now have 8 tableaux to operate on % 0.18/0.36 # 25734 Satisfiable branch % 0.18/0.36 # 25735 Satisfiable branch % 0.18/0.36 # 25736 Satisfiable branch % 0.18/0.36 # Satisfiable branch found. % 0.18/0.36 # There were 1 total branch saturation attempts. % 0.18/0.36 # There were 0 of these attempts blocked. % 0.18/0.36 # There were 0 deferred branch saturation attempts. % 0.18/0.36 # There were 0 free duplicated saturations. % 0.18/0.36 # There were 0 total successful branch saturations. % 0.18/0.36 # There were 0 successful branch saturations in interreduction. % 0.18/0.36 # There were 0 successful branch saturations on the branch. % 0.18/0.36 # There were 0 successful branch saturations after the branch. % 0.18/0.36 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.18/0.36 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.18/0.36 # Begin clausification derivation % 0.18/0.36 % 0.18/0.36 # End clausification derivation % 0.18/0.36 # Begin listing active clauses obtained from FOF to CNF conversion % 0.18/0.36 cnf(i_0_4, plain, (f(product(X1,X2))=X1)). % 0.18/0.36 cnf(i_0_5, plain, (g(product(X1,X2))=X2)). % 0.18/0.36 cnf(i_0_6, plain, (tptp1!=tptp0)). % 0.18/0.36 cnf(i_0_10, plain, (X3=X3)). % 0.18/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.18/0.36 # Begin printing tableau % 0.18/0.36 # Found 4 steps % 0.18/0.36 cnf(i_0_4, plain, (f(product(X4,X5))=X4), inference(start_rule)). % 0.18/0.36 cnf(i_0_17, plain, (f(product(X4,X5))=X4), inference(extension_rule, [i_0_16])). % 0.18/0.36 cnf(i_0_33, plain, (g(f(product(X4,X5)))=g(X4)), inference(extension_rule, [i_0_13])). % 0.18/0.36 cnf(i_0_41, plain, (g(X4)!=f(product(g(X4),X2))), inference(closure_rule, [i_0_4])). % 0.18/0.36 # End printing tableau % 0.18/0.36 # SZS output end % 0.18/0.36 # Branches closed with saturation will be marked with an "s" % 0.18/0.36 # 25737 Satisfiable branch % 0.18/0.36 # 25738 Satisfiable branch % 0.18/0.36 # Satisfiable branch found. % 0.18/0.36 # There were 1 total branch saturation attempts. % 0.18/0.36 # There were 0 of these attempts blocked. % 0.18/0.36 # There were 0 deferred branch saturation attempts. % 0.18/0.36 # There were 0 free duplicated saturations. % 0.18/0.36 # There were 0 total successful branch saturations. % 0.18/0.36 # There were 0 successful branch saturations in interreduction. % 0.18/0.36 # There were 0 successful branch saturations on the branch. % 0.18/0.36 # There were 0 successful branch saturations after the branch. % 0.18/0.36 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.18/0.36 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.18/0.36 # Begin clausification derivation % 0.18/0.36 % 0.18/0.36 # End clausification derivation % 0.18/0.36 # Begin listing active clauses obtained from FOF to CNF conversion % 0.18/0.36 cnf(i_0_4, plain, (f(product(X1,X2))=X1)). % 0.18/0.36 cnf(i_0_5, plain, (g(product(X1,X2))=X2)). % 0.18/0.36 cnf(i_0_6, plain, (tptp1!=tptp0)). % 0.18/0.36 cnf(i_0_10, plain, (X3=X3)). % 0.18/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.18/0.36 # Begin printing tableau % 0.18/0.36 # Found 4 steps % 0.18/0.36 cnf(i_0_4, plain, (f(product(product(X6,X2),X5))=product(X6,X2)), inference(start_rule)). % 0.18/0.36 cnf(i_0_17, plain, (f(product(product(X6,X2),X5))=product(X6,X2)), inference(extension_rule, [i_0_15])). % 0.18/0.36 cnf(i_0_31, plain, (f(f(product(product(X6,X2),X5)))=f(product(X6,X2))), inference(extension_rule, [i_0_13])). % 0.18/0.36 cnf(i_0_41, plain, (f(product(X6,X2))!=X6), inference(closure_rule, [i_0_4])). % 0.18/0.36 # End printing tableau % 0.18/0.36 # SZS output end % 0.18/0.36 # Branches closed with saturation will be marked with an "s" % 0.18/0.36 # Child (25734) has found a proof. % 0.18/0.36 % 0.18/0.36 # Satisfiable branch found. % 0.18/0.36 # Satisfiable branch found. % 0.18/0.36 # There were 1 total branch saturation attempts. % 0.18/0.36 # There were 0 of these attempts blocked. % 0.18/0.36 # There were 0 deferred branch saturation attempts. % 0.18/0.36 # There were 0 free duplicated saturations. % 0.18/0.36 # There were 0 total successful branch saturations. % 0.18/0.36 # There were 0 successful branch saturations in interreduction. % 0.18/0.36 # There were 0 successful branch saturations on the branch. % 0.18/0.36 # There were 0 successful branch saturations after the branch. % 0.18/0.36 # There were 1 total branch saturation attempts. % 0.18/0.36 # There were 0 of these attempts blocked. % 0.18/0.36 # There were 0 deferred branch saturation attempts. % 0.18/0.36 # There were 0 free duplicated saturations. % 0.18/0.36 # There were 0 total successful branch saturations. % 0.18/0.36 # There were 0 successful branch saturations in interreduction. % 0.18/0.36 # There were 0 successful branch saturations on the branch. % 0.18/0.36 # There were 0 successful branch saturations after the branch. % 0.18/0.36 # Proof search is over... % 0.18/0.36 # Freeing feature tree %------------------------------------------------------------------------------