%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : NUM016-1 : 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 : 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 : Mon Jul 18 09:38:21 EDT 2022 % Result : Unsatisfiable 0.13s 0.36s % Output : CNFRefutation 0.13s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : NUM016-1 : 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.13/0.33 % Computer : n018.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 600 % 0.13/0.33 % DateTime : Tue Jul 5 20:47:37 EDT 2022 % 0.13/0.34 % CPUTime : % 0.13/0.36 # No SInE strategy applied % 0.13/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.36 # % 0.13/0.36 # Presaturation interreduction done % 0.13/0.36 # Number of axioms: 12 Number of unprocessed: 12 % 0.13/0.36 # Tableaux proof search. % 0.13/0.36 # APR header successfully linked. % 0.13/0.36 # Hello from C++ % 0.13/0.36 # The folding up rule is enabled... % 0.13/0.36 # Local unification is enabled... % 0.13/0.36 # Any saturation attempts will use folding labels... % 0.13/0.36 # 12 beginning clauses after preprocessing and clausification % 0.13/0.36 # Creating start rules for all 1 conjectures. % 0.13/0.36 # There are 1 start rule candidates: % 0.13/0.36 # Found 4 unit axioms. % 0.13/0.36 # 1 start rule tableaux created. % 0.13/0.36 # 8 extension rule candidate clauses % 0.13/0.36 # 4 unit axiom clauses % 0.13/0.36 % 0.13/0.36 # Requested 8, 32 cores available to the main process. % 0.13/0.36 # There are not enough tableaux to fork, creating more from the initial 1 % 0.13/0.36 # There were 1 total branch saturation attempts. % 0.13/0.36 # There were 0 of these attempts blocked. % 0.13/0.36 # There were 0 deferred branch saturation attempts. % 0.13/0.36 # There were 0 free duplicated saturations. % 0.13/0.36 # There were 1 total successful branch saturations. % 0.13/0.36 # There were 0 successful branch saturations in interreduction. % 0.13/0.36 # There were 0 successful branch saturations on the branch. % 0.13/0.36 # There were 1 successful branch saturations after the branch. % 0.13/0.36 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.36 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.36 # Begin clausification derivation % 0.13/0.36 % 0.13/0.36 # End clausification derivation % 0.13/0.36 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.36 cnf(i_0_23, hypothesis, (prime(a))). % 0.13/0.36 cnf(i_0_18, plain, (less(X1,factorial_plus_one(X1)))). % 0.13/0.36 cnf(i_0_15, plain, (divides(X1,X1))). % 0.13/0.36 cnf(i_0_13, plain, (~less(X1,X1))). % 0.13/0.36 cnf(i_0_24, negated_conjecture, (less(factorial_plus_one(a),X1)|~prime(X1)|~less(a,X1))). % 0.13/0.36 cnf(i_0_14, plain, (~less(X1,X2)|~less(X2,X1))). % 0.13/0.36 cnf(i_0_21, plain, (prime(prime_divisor(X1))|prime(X1))). % 0.13/0.36 cnf(i_0_17, plain, (~divides(X1,X2)|~less(X2,X1))). % 0.13/0.36 cnf(i_0_19, plain, (less(X1,X2)|~divides(X2,factorial_plus_one(X1)))). % 0.13/0.36 cnf(i_0_22, plain, (prime(X1)|less(prime_divisor(X1),X1))). % 0.13/0.36 cnf(i_0_20, plain, (prime(X1)|divides(prime_divisor(X1),X1))). % 0.13/0.36 cnf(i_0_16, plain, (divides(X1,X2)|~divides(X3,X2)|~divides(X1,X3))). % 0.13/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.36 # Begin printing tableau % 0.13/0.36 # Found 6 steps % 0.13/0.36 cnf(i_0_24, negated_conjecture, (less(factorial_plus_one(a),factorial_plus_one(a))|~prime(factorial_plus_one(a))|~less(a,factorial_plus_one(a))), inference(start_rule)). % 0.13/0.36 cnf(i_0_25, plain, (less(factorial_plus_one(a),factorial_plus_one(a))), inference(closure_rule, [i_0_13])). % 0.13/0.36 cnf(i_0_27, plain, (~less(a,factorial_plus_one(a))), inference(closure_rule, [i_0_18])). % 0.13/0.36 cnf(i_0_26, plain, (~prime(factorial_plus_one(a))), inference(extension_rule, [i_0_20])). % 0.13/0.36 cnf(i_0_39, plain, (divides(prime_divisor(factorial_plus_one(a)),factorial_plus_one(a))), inference(extension_rule, [i_0_17])). % 0.13/0.36 cnf(i_0_51, plain, (~less(factorial_plus_one(a),prime_divisor(factorial_plus_one(a)))), inference(etableau_closure_rule, [i_0_51, ...])). % 0.13/0.36 # End printing tableau % 0.13/0.36 # SZS output end % 0.13/0.36 # Branches closed with saturation will be marked with an "s" % 0.13/0.36 # Returning from population with 3 new_tableaux and 0 remaining starting tableaux. % 0.13/0.36 # We now have 3 tableaux to operate on % 0.13/0.36 # Found closed tableau during pool population. % 0.13/0.36 # Proof search is over... % 0.13/0.36 # Freeing feature tree %------------------------------------------------------------------------------