%------------------------------------------------------------------------------
% File : PyRes---1.5
% Problem : NUM016-2 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% Computer : n026.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 : 300s
% DateTime : Thu May 9 17:35:01 EDT 2024
% Result : Unsatisfiable 0.21s 0.53s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 16 ( 5 unt; 6 nHn; 11 RR)
% Number of literals : 29 ( 0 equ; 9 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 12 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(nothing_is_less_than_itself,axiom,
~ less(X2,X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',nothing_is_less_than_itself) ).
cnf(a_prime_is_less_than_the_next_one,axiom,
less(X3,factorial_plus_one(X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_prime_is_less_than_the_next_one) ).
cnf(prove_there_is_another_prime,negated_conjecture,
( ~ prime(X15)
| ~ less(a,X15)
| less(factorial_plus_one(a),X15) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_there_is_another_prime) ).
cnf(c6,plain,
( ~ prime(factorial_plus_one(a))
| less(factorial_plus_one(a),factorial_plus_one(a)) ),
inference(resolution,[status(thm)],[prove_there_is_another_prime,a_prime_is_less_than_the_next_one]) ).
cnf(numbers_are_different,axiom,
( ~ less(X5,X4)
| ~ less(X4,X5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',numbers_are_different) ).
cnf(smaller_prime_divisors,axiom,
( prime(X12)
| less(prime_divisor(X12),X12) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',smaller_prime_divisors) ).
cnf(c3,plain,
( prime(X13)
| ~ less(X13,prime_divisor(X13)) ),
inference(resolution,[status(thm)],[smaller_prime_divisors,numbers_are_different]) ).
cnf(prime_divsiors,axiom,
( prime(X10)
| prime(prime_divisor(X10)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prime_divsiors) ).
cnf(divisor_is_smaller,axiom,
( ~ divides(X9,factorial_plus_one(X8))
| less(X8,X9) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',divisor_is_smaller) ).
cnf(division_by_prime_divisor,axiom,
( prime(X11)
| divides(prime_divisor(X11),X11) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',division_by_prime_divisor) ).
cnf(c2,plain,
( prime(factorial_plus_one(X14))
| less(X14,prime_divisor(factorial_plus_one(X14))) ),
inference(resolution,[status(thm)],[division_by_prime_divisor,divisor_is_smaller]) ).
cnf(c5,plain,
( ~ prime(prime_divisor(factorial_plus_one(a)))
| less(factorial_plus_one(a),prime_divisor(factorial_plus_one(a)))
| prime(factorial_plus_one(a)) ),
inference(resolution,[status(thm)],[prove_there_is_another_prime,c2]) ).
cnf(c16,plain,
( less(factorial_plus_one(a),prime_divisor(factorial_plus_one(a)))
| prime(factorial_plus_one(a)) ),
inference(resolution,[status(thm)],[c5,prime_divsiors]) ).
cnf(c18,plain,
prime(factorial_plus_one(a)),
inference(resolution,[status(thm)],[c16,c3]) ).
cnf(c21,plain,
less(factorial_plus_one(a),factorial_plus_one(a)),
inference(resolution,[status(thm)],[c18,c6]) ).
cnf(c23,plain,
$false,
inference(resolution,[status(thm)],[c21,nothing_is_less_than_itself]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM016-2 : TPTP v8.1.2. Released v1.0.0.
% 0.03/0.13 % Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.13/0.34 % Computer : n026.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Wed May 8 16:33:38 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.21/0.53 % Version: 1.5
% 0.21/0.53 % SZS status Unsatisfiable
% 0.21/0.53 % SZS output start CNFRefutation
% See solution above
% 0.21/0.53
% 0.21/0.53 % Initial clauses : 8
% 0.21/0.53 % Processed clauses : 19
% 0.21/0.53 % Factors computed : 1
% 0.21/0.53 % Resolvents computed: 23
% 0.21/0.53 % Tautologies deleted: 0
% 0.21/0.53 % Forward subsumed : 2
% 0.21/0.53 % Backward subsumed : 4
% 0.21/0.53 % -------- CPU Time ---------
% 0.21/0.53 % User time : 0.168 s
% 0.21/0.53 % System time : 0.018 s
% 0.21/0.53 % Total time : 0.186 s
%------------------------------------------------------------------------------