%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : NUM283-1.005 : TPTP v8.1.0. Released v1.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 : n008.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 09:39:55 EDT 2022 % Result : Unsatisfiable 17.20s 2.82s % Output : CNFRefutation 17.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : NUM283-1.005 : TPTP v8.1.0. Released v1.0.0. % 0.11/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.33 % Computer : n008.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Thu Jul 7 01:13:08 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.36 # No SInE strategy applied % 0.12/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.12/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.12/0.36 # % 0.12/0.36 # Presaturation interreduction done % 0.12/0.36 # Number of axioms: 7 Number of unprocessed: 7 % 0.12/0.36 # Tableaux proof search. % 0.12/0.36 # APR header successfully linked. % 0.12/0.36 # Hello from C++ % 0.12/0.36 # The folding up rule is enabled... % 0.12/0.36 # Local unification is enabled... % 0.12/0.36 # Any saturation attempts will use folding labels... % 0.12/0.36 # 7 beginning clauses after preprocessing and clausification % 0.12/0.36 # Creating start rules for all 1 conjectures. % 0.12/0.36 # There are 1 start rule candidates: % 0.12/0.36 # Found 4 unit axioms. % 0.12/0.36 # 1 start rule tableaux created. % 0.12/0.36 # 3 extension rule candidate clauses % 0.12/0.36 # 4 unit axiom clauses % 0.12/0.36 % 0.12/0.36 # Requested 8, 32 cores available to the main process. % 0.12/0.36 # There are not enough tableaux to fork, creating more from the initial 1 % 0.12/0.36 # Ran out of tableaux, making start rules for all clauses % 0.12/0.36 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux. % 0.12/0.36 # We now have 8 tableaux to operate on % 17.20/2.82 # There were 1 total branch saturation attempts. % 17.20/2.82 # There were 0 of these attempts blocked. % 17.20/2.82 # There were 0 deferred branch saturation attempts. % 17.20/2.82 # There were 0 free duplicated saturations. % 17.20/2.82 # There were 1 total successful branch saturations. % 17.20/2.82 # There were 0 successful branch saturations in interreduction. % 17.20/2.82 # There were 0 successful branch saturations on the branch. % 17.20/2.82 # There were 1 successful branch saturations after the branch. % 17.20/2.82 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 17.20/2.82 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 17.20/2.82 # Begin clausification derivation % 17.20/2.82 % 17.20/2.82 # End clausification derivation % 17.20/2.82 # Begin listing active clauses obtained from FOF to CNF conversion % 17.20/2.82 cnf(i_0_12, plain, (factorial(n0,s(n0)))). % 17.20/2.82 cnf(i_0_8, plain, (sum(X1,n0,X1))). % 17.20/2.82 cnf(i_0_10, plain, (product(s(n0),X1,X1))). % 17.20/2.82 cnf(i_0_14, negated_conjecture, (~factorial(s(s(s(s(s(n0))))),X1))). % 17.20/2.82 cnf(i_0_13, plain, (factorial(s(X1),X2)|~factorial(X1,X3)|~product(s(X1),X3,X2))). % 17.20/2.82 cnf(i_0_9, plain, (sum(X1,s(X2),s(X3))|~sum(X1,X2,X3))). % 17.20/2.82 cnf(i_0_11, plain, (product(s(X1),X2,X3)|~product(X1,X2,X4)|~sum(X4,X2,X3))). % 17.20/2.82 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 17.20/2.82 # Begin printing tableau % 17.20/2.82 # Found 6 steps % 17.20/2.82 cnf(i_0_9, plain, (sum(s(s(n0)),s(n0),s(s(s(n0))))|~sum(s(s(n0)),n0,s(s(n0)))), inference(start_rule)). % 17.20/2.82 cnf(i_0_144, plain, (~sum(s(s(n0)),n0,s(s(n0)))), inference(closure_rule, [i_0_8])). % 17.20/2.82 cnf(i_0_143, plain, (sum(s(s(n0)),s(n0),s(s(s(n0))))), inference(extension_rule, [i_0_9])). % 17.20/2.82 cnf(i_0_183, plain, (sum(s(s(n0)),s(s(n0)),s(s(s(s(n0)))))), inference(extension_rule, [i_0_11])). % 17.20/2.82 cnf(i_0_189, plain, (~product(s(n0),s(s(n0)),s(s(n0)))), inference(closure_rule, [i_0_10])). % 17.20/2.82 cnf(i_0_188, plain, (product(s(s(n0)),s(s(n0)),s(s(s(s(n0)))))), inference(etableau_closure_rule, [i_0_188, ...])). % 17.20/2.82 # End printing tableau % 17.20/2.82 # SZS output end % 17.20/2.82 # Branches closed with saturation will be marked with an "s" % 17.20/2.83 # Child (27898) has found a proof. % 17.20/2.83 % 17.20/2.83 # Proof search is over... % 17.20/2.83 # Freeing feature tree %------------------------------------------------------------------------------