TSTP Solution File: NUM016-1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : NUM016-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% Computer : n015.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 : Wed Aug 31 17:56:36 EDT 2022
% Result : Unsatisfiable 0.21s 0.48s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 19 ( 5 unt; 0 def)
% Number of atoms : 44 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 46 ( 21 ~; 25 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 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 : 14 ( 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f37,plain,
$false,
inference(subsumption_resolution,[],[f36,f26]) ).
fof(f26,plain,
~ less(a,prime_divisor(factorial_plus_one(a))),
inference(subsumption_resolution,[],[f25,f6]) ).
fof(f6,axiom,
! [X0] : less(X0,factorial_plus_one(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_prime_is_less_than_the_next_one) ).
fof(f25,plain,
( ~ less(a,prime_divisor(factorial_plus_one(a)))
| ~ less(a,factorial_plus_one(a)) ),
inference(subsumption_resolution,[],[f24,f1]) ).
fof(f1,axiom,
! [X0] : ~ less(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',nothing_is_less_than_itself) ).
fof(f24,plain,
( less(factorial_plus_one(a),factorial_plus_one(a))
| ~ less(a,prime_divisor(factorial_plus_one(a)))
| ~ less(a,factorial_plus_one(a)) ),
inference(duplicate_literal_removal,[],[f23]) ).
fof(f23,plain,
( ~ less(a,factorial_plus_one(a))
| less(factorial_plus_one(a),factorial_plus_one(a))
| ~ less(a,prime_divisor(factorial_plus_one(a)))
| ~ less(a,factorial_plus_one(a))
| less(factorial_plus_one(a),factorial_plus_one(a)) ),
inference(resolution,[],[f22,f15]) ).
fof(f15,plain,
! [X0] :
( less(factorial_plus_one(a),prime_divisor(X0))
| ~ less(a,prime_divisor(X0))
| ~ less(a,X0)
| less(factorial_plus_one(a),X0) ),
inference(resolution,[],[f14,f12]) ).
fof(f12,axiom,
! [X0] :
( ~ prime(X0)
| ~ less(a,X0)
| less(factorial_plus_one(a),X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_there_is_another_prime) ).
fof(f14,plain,
! [X0] :
( prime(X0)
| ~ less(a,prime_divisor(X0))
| less(factorial_plus_one(a),prime_divisor(X0)) ),
inference(resolution,[],[f9,f12]) ).
fof(f9,axiom,
! [X0] :
( prime(prime_divisor(X0))
| prime(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prime_divsiors) ).
fof(f22,plain,
! [X0] :
( ~ less(X0,prime_divisor(X0))
| ~ less(a,X0)
| less(factorial_plus_one(a),X0) ),
inference(resolution,[],[f21,f5]) ).
fof(f5,axiom,
! [X0,X1] :
( ~ divides(X0,X1)
| ~ less(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',small_divides_large) ).
fof(f21,plain,
! [X0] :
( divides(prime_divisor(X0),X0)
| ~ less(a,X0)
| less(factorial_plus_one(a),X0) ),
inference(resolution,[],[f8,f12]) ).
fof(f8,axiom,
! [X0] :
( prime(X0)
| divides(prime_divisor(X0),X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',division_by_prime_divisor) ).
fof(f36,plain,
less(a,prime_divisor(factorial_plus_one(a))),
inference(subsumption_resolution,[],[f35,f1]) ).
fof(f35,plain,
( less(factorial_plus_one(a),factorial_plus_one(a))
| less(a,prime_divisor(factorial_plus_one(a))) ),
inference(resolution,[],[f34,f6]) ).
fof(f34,plain,
! [X1] :
( ~ less(a,factorial_plus_one(X1))
| less(factorial_plus_one(a),factorial_plus_one(X1))
| less(X1,prime_divisor(factorial_plus_one(X1))) ),
inference(resolution,[],[f7,f21]) ).
fof(f7,axiom,
! [X0,X1] :
( ~ divides(X0,factorial_plus_one(X1))
| less(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',divisor_is_smaller) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : NUM016-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.14/0.34 % Computer : n015.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Aug 30 06:00:50 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.47 % (15167)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=49:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/49Mi)
% 0.21/0.48 % (15190)lrs+10_1:1_sos=all:ss=axioms:st=1.5:i=20:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/20Mi)
% 0.21/0.48 % (15167)First to succeed.
% 0.21/0.48 % (15167)Refutation found. Thanks to Tanya!
% 0.21/0.48 % SZS status Unsatisfiable for theBenchmark
% 0.21/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.48 % (15167)------------------------------
% 0.21/0.48 % (15167)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.48 % (15167)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.48 % (15167)Termination reason: Refutation
% 0.21/0.48
% 0.21/0.48 % (15167)Memory used [KB]: 1279
% 0.21/0.48 % (15167)Time elapsed: 0.100 s
% 0.21/0.48 % (15167)Instructions burned: 2 (million)
% 0.21/0.48 % (15167)------------------------------
% 0.21/0.48 % (15167)------------------------------
% 0.21/0.48 % (15158)Success in time 0.131 s
%------------------------------------------------------------------------------