TSTP Solution File: NUM016-2 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : NUM016-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% 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 14:06:07 EDT 2022
% Result : Unsatisfiable 0.19s 0.50s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 8
% Syntax : Number of clauses : 15 ( 9 unt; 3 nHn; 11 RR)
% Number of literals : 22 ( 0 equ; 8 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 : 10 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(nothing_is_less_than_itself,axiom,
~ less(X,X),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nothing_is_less_than_itself) ).
cnf(numbers_are_different,axiom,
( ~ less(X,Y)
| ~ less(Y,X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',numbers_are_different) ).
cnf(a_prime_is_less_than_the_next_one,axiom,
less(X,factorial_plus_one(X)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_prime_is_less_than_the_next_one) ).
cnf(divisor_is_smaller,axiom,
( ~ divides(X,factorial_plus_one(Y))
| less(Y,X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',divisor_is_smaller) ).
cnf(division_by_prime_divisor,axiom,
( prime(X)
| divides(prime_divisor(X),X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',division_by_prime_divisor) ).
cnf(prime_divsiors,axiom,
( prime(X)
| prime(prime_divisor(X)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prime_divsiors) ).
cnf(smaller_prime_divisors,axiom,
( prime(X)
| less(prime_divisor(X),X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',smaller_prime_divisors) ).
cnf(prove_there_is_another_prime,negated_conjecture,
( ~ prime(X)
| ~ less(a,X)
| less(factorial_plus_one(a),X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_there_is_another_prime) ).
cnf(12,plain,
~ prime(factorial_plus_one(a)),
inference('UR-RESOLVE',[status(thm)],[prove_there_is_another_prime,a_prime_is_less_than_the_next_one,nothing_is_less_than_itself]) ).
cnf(13,plain,
prime(prime_divisor(factorial_plus_one(a))),
inference('UR-RESOLVE',[status(thm)],[prime_divsiors,12]) ).
cnf(14,plain,
less(prime_divisor(factorial_plus_one(a)),factorial_plus_one(a)),
inference('UR-RESOLVE',[status(thm)],[smaller_prime_divisors,12]) ).
cnf(15,plain,
divides(prime_divisor(factorial_plus_one(a)),factorial_plus_one(a)),
inference('UR-RESOLVE',[status(thm)],[division_by_prime_divisor,12]) ).
cnf(17,plain,
~ less(factorial_plus_one(a),prime_divisor(factorial_plus_one(a))),
inference('UR-RESOLVE',[status(thm)],[numbers_are_different,14]) ).
cnf(18,plain,
less(a,prime_divisor(factorial_plus_one(a))),
inference('HYPERRESOLVE',[status(thm)],[divisor_is_smaller,15]) ).
cnf(20,plain,
$false,
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[prove_there_is_another_prime,18,13]),17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM016-2 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : run-snark %s %d
% 0.12/0.34 % Computer : n017.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Wed Jul 6 15:49:59 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.46 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.47 *
% 0.19/0.47 *
% 0.19/0.47 #<PACKAGE "SNARK-USER">
% 0.19/0.47 *
% 0.19/0.47 SNARK-TPTP-OPTIONS
% 0.19/0.47 *
% 0.19/0.47 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.47 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.47 (USE-FACTORING :POS)
% 0.19/0.47 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.47 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.47 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.47 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.47 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.47 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.47 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.47 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.47 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.47 (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.47 *
% 0.19/0.47 "."
% 0.19/0.47 *
% 0.19/0.47 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-06T15:49:59
% 0.19/0.47 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n017.cluster.edu at 2022-07-06T15:49:59
% 0.19/0.50
% 0.19/0.50
% 0.19/0.50 #||
% 0.19/0.50 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.50 % SZS output start Refutation
% See solution above
% 0.19/0.50 ||#
% 0.19/0.50
% 0.19/0.50 ; Summary of computation:
% 0.19/0.50 ; 26 formulas have been input or derived (from 17 formulas).
% 0.19/0.50 ; 20 (77%) were retained. Of these,
% 0.19/0.50 ; 20 (100%) are still being kept.
% 0.19/0.50 ;
% 0.19/0.50 ; Run time in seconds excluding printing time:
% 0.19/0.50 ; 0.002 8% Read assertion file (1 call)
% 0.19/0.50 ; 0.000 0% Assert (8 calls)
% 0.19/0.50 ; 0.001 4% Process new row (20 calls)
% 0.19/0.50 ; 0.001 4% Resolution (32 calls)
% 0.19/0.50 ; 0.000 0% Paramodulation (16 calls)
% 0.19/0.50 ; 0.000 0% Factoring (3 calls)
% 0.19/0.50 ; 0.000 0% Condensing (7 calls)
% 0.19/0.50 ; 0.001 4% Forward subsumption (7 calls)
% 0.19/0.50 ; 0.000 0% Backward subsumption (7 calls)
% 0.19/0.50 ; 0.000 0% Clause clause subsumption (1 call)
% 0.19/0.50 ; 0.000 0% Forward simplification (20 calls)
% 0.19/0.50 ; 0.000 0% Backward simplification (20 calls)
% 0.19/0.50 ; 0.000 0% Ordering (8 calls)
% 0.19/0.50 ; 0.000 0% Sortal reasoning (32 calls)
% 0.19/0.50 ; 0.000 0% Purity testing (1 call)
% 0.19/0.50 ; 0.021 81% Other
% 0.19/0.50 ; 0.026 Total
% 0.19/0.50 ; 0.030 Real time
% 0.19/0.50 ;
% 0.19/0.50 ; Term-hash-array has 30 terms in all.
% 0.19/0.50 ; Feature-vector-row-index has 7 entries (7 at peak, 7 added, 0 deleted).
% 0.19/0.50 ; Feature-vector-row-index has 23 nodes (23 at peak, 23 added, 0 deleted).
% 0.19/0.50 ; Retrieved 1 possibly forward subsuming row in 7 calls.
% 0.19/0.50 ; Retrieved 0 possibly backward subsumed rows in 7 calls.
% 0.19/0.50 ; Path-index has 31 entries (31 at peak, 31 added, 0 deleted).
% 0.19/0.50 ; Path-index has 56 nodes (56 at peak, 56 added, 0 deleted).
% 0.19/0.50 ; Trie-index has 31 entries (31 at peak, 31 added, 0 deleted).
% 0.19/0.50 ; Trie-index has 63 nodes (63 at peak, 63 added, 0 deleted).
% 0.19/0.50 ; Retrieved 18 generalization terms in 17 calls.
% 0.19/0.50 ; Retrieved 14 instance terms in 12 calls.
% 0.19/0.50 ; Retrieved 197 unifiable terms in 100 calls.
% 0.19/0.50 ;
% 0.19/0.50 ; The agenda of rows to process has 1 entry:
% 0.19/0.50 ; 1 with value 18
% 0.19/0.50 ; The agenda of rows to give has 3 entries:
% 0.19/0.50 ; 2 with value (4 12) 1 with value (4 14)
% 0.19/0.50 Evaluation took:
% 0.19/0.50 0.03 seconds of real time
% 0.19/0.50 0.024911 seconds of user run time
% 0.19/0.50 0.004789 seconds of system run time
% 0.19/0.50 0 calls to %EVAL
% 0.19/0.50 0 page faults and
% 0.19/0.50 2,141,328 bytes consed.
% 0.19/0.50 :PROOF-FOUND
% 0.19/0.50 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-06T15:49:59
% 0.19/0.50 :PROOF-FOUND
% 0.19/0.50 *
%------------------------------------------------------------------------------