TSTP Solution File: NUM016-2 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : NUM016-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% Computer : n017.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 11:30:28 EDT 2022
% Result : Unsatisfiable 0.12s 0.34s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : NUM016-2 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.33 % Computer : n017.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 : Wed Jul 6 15:50:44 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34 % SZS status Unsatisfiable
% 0.12/0.34 % SZS output begin IncompleteProof
% 0.12/0.34 cnf(c0, axiom,
% 0.12/0.34 less(factorial_plus_one(a),X0) | ~less(a,X0) | ~prime(X0)).
% 0.12/0.34 cnf(c1, plain,
% 0.12/0.34 less(factorial_plus_one(a),X0) | ~less(a,X0) | ~prime(X0),
% 0.12/0.34 inference(start, [], [c0])).
% 0.12/0.34
% 0.12/0.34 cnf(c2, axiom,
% 0.12/0.34 ~less(X1,X1)).
% 0.12/0.34 cnf(a0, assumption,
% 0.12/0.34 factorial_plus_one(a) = X1).
% 0.12/0.34 cnf(a1, assumption,
% 0.12/0.34 X0 = X1).
% 0.12/0.34 cnf(c3, plain,
% 0.12/0.34 ~less(a,X0) | ~prime(X0),
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.12/0.34 cnf(c4, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.12/0.34
% 0.12/0.34 cnf(c5, axiom,
% 0.12/0.34 less(X2,factorial_plus_one(X2))).
% 0.12/0.34 cnf(a2, assumption,
% 0.12/0.34 a = X2).
% 0.12/0.34 cnf(a3, assumption,
% 0.12/0.34 X0 = factorial_plus_one(X2)).
% 0.12/0.34 cnf(c6, plain,
% 0.12/0.34 ~prime(X0),
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a2, a3])], [c3, c5])).
% 0.12/0.34 cnf(c7, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a2, a3])], [c3, c5])).
% 0.12/0.34
% 0.12/0.34 cnf(c8, axiom,
% 0.12/0.34 prime(prime_divisor(X3)) | prime(X3)).
% 0.12/0.34 cnf(a4, assumption,
% 0.12/0.34 X0 = X3).
% 0.12/0.34 cnf(c9, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a4])], [c6, c8])).
% 0.12/0.34 cnf(c10, plain,
% 0.12/0.34 prime(prime_divisor(X3)),
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a4])], [c6, c8])).
% 0.12/0.34
% 0.12/0.34 cnf(c11, axiom,
% 0.12/0.34 less(factorial_plus_one(a),X4) | ~less(a,X4) | ~prime(X4)).
% 0.12/0.34 cnf(a5, assumption,
% 0.12/0.34 prime_divisor(X3) = X4).
% 0.12/0.34 cnf(c12, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a5])], [c10, c11])).
% 0.12/0.34 cnf(c13, plain,
% 0.12/0.34 less(factorial_plus_one(a),X4) | ~less(a,X4),
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a5])], [c10, c11])).
% 0.12/0.34
% 0.12/0.34 cnf(c14, axiom,
% 0.12/0.34 ~less(X5,X6) | ~less(X6,X5)).
% 0.12/0.34 cnf(a6, assumption,
% 0.12/0.34 factorial_plus_one(a) = X6).
% 0.12/0.34 cnf(a7, assumption,
% 0.12/0.34 X4 = X5).
% 0.12/0.34 cnf(c15, plain,
% 0.12/0.34 ~less(a,X4),
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a6, a7])], [c13, c14])).
% 0.12/0.34 cnf(c16, plain,
% 0.12/0.34 ~less(X5,X6),
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a6, a7])], [c13, c14])).
% 0.12/0.34
% 0.12/0.34 cnf(c17, axiom,
% 0.12/0.34 less(prime_divisor(X7),X7) | prime(X7)).
% 0.12/0.34 cnf(a8, assumption,
% 0.12/0.34 X5 = prime_divisor(X7)).
% 0.12/0.34 cnf(a9, assumption,
% 0.12/0.34 X6 = X7).
% 0.12/0.34 cnf(c18, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a8, a9])], [c16, c17])).
% 0.12/0.34 cnf(c19, plain,
% 0.12/0.34 prime(X7),
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a8, a9])], [c16, c17])).
% 0.12/0.34
% 0.12/0.34 cnf(c20, plain,
% 0.12/0.34 ~prime(X0)).
% 0.12/0.34 cnf(a10, assumption,
% 0.12/0.34 X7 = X0).
% 0.12/0.34 cnf(c21, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(predicate_reduction, [assumptions([a10])], [c19, c20])).
% 0.12/0.34
% 0.12/0.34 cnf(c22, axiom,
% 0.12/0.34 less(X8,X9) | ~divides(X9,factorial_plus_one(X8))).
% 0.12/0.34 cnf(a11, assumption,
% 0.12/0.34 a = X8).
% 0.12/0.34 cnf(a12, assumption,
% 0.12/0.34 X4 = X9).
% 0.12/0.34 cnf(c23, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a11, a12])], [c15, c22])).
% 0.12/0.34 cnf(c24, plain,
% 0.12/0.34 ~divides(X9,factorial_plus_one(X8)),
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a11, a12])], [c15, c22])).
% 0.12/0.34
% 0.12/0.34 cnf(c25, axiom,
% 0.12/0.34 divides(prime_divisor(X10),X10) | prime(X10)).
% 0.12/0.34 cnf(a13, assumption,
% 0.12/0.34 X9 = prime_divisor(X10)).
% 0.12/0.34 cnf(a14, assumption,
% 0.12/0.34 factorial_plus_one(X8) = X10).
% 0.12/0.34 cnf(c26, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a13, a14])], [c24, c25])).
% 0.12/0.34 cnf(c27, plain,
% 0.12/0.34 prime(X10),
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a13, a14])], [c24, c25])).
% 0.12/0.34
% 0.12/0.34 cnf(c28, plain,
% 0.12/0.34 ~prime(X0)).
% 0.12/0.34 cnf(a15, assumption,
% 0.12/0.34 X10 = X0).
% 0.12/0.34 cnf(c29, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(predicate_reduction, [assumptions([a15])], [c27, c28])).
% 0.12/0.34
% 0.12/0.34 cnf(c30, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(constraint_solving, [
% 0.12/0.34 bind(X0, factorial_plus_one(a)),
% 0.12/0.34 bind(X1, factorial_plus_one(a)),
% 0.12/0.34 bind(X2, a),
% 0.12/0.34 bind(X3, factorial_plus_one(a)),
% 0.12/0.34 bind(X4, prime_divisor(X3)),
% 0.12/0.34 bind(X5, prime_divisor(X3)),
% 0.12/0.34 bind(X6, factorial_plus_one(a)),
% 0.12/0.34 bind(X7, factorial_plus_one(a)),
% 0.12/0.34 bind(X8, a),
% 0.12/0.34 bind(X9, prime_divisor(X3)),
% 0.12/0.34 bind(X10, factorial_plus_one(a))
% 0.12/0.34 ],
% 0.12/0.34 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15])).
% 0.12/0.34
% 0.12/0.34 % SZS output end IncompleteProof
%------------------------------------------------------------------------------