TSTP Solution File: NUM016-1 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : NUM016-1 : TPTP v8.2.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n024.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 : Tue May 21 01:37:06 EDT 2024

% Result   : Unsatisfiable 0.56s 0.73s
% Output   : Refutation 0.56s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   18 (  10 unt;   0 def)
%            Number of atoms       :   27 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   20 (  11   ~;   9   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    3 (   2 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 (  10   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f35,plain,
    $false,
    inference(subsumption_resolution,[],[f31,f15]) ).

fof(f15,plain,
    ~ prime(factorial_plus_one(a)),
    inference(subsumption_resolution,[],[f13,f1]) ).

fof(f1,axiom,
    ! [X0] : ~ less(X0,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',nothing_is_less_than_itself) ).

fof(f13,plain,
    ( less(factorial_plus_one(a),factorial_plus_one(a))
    | ~ prime(factorial_plus_one(a)) ),
    inference(resolution,[],[f12,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(f12,axiom,
    ! [X0] :
      ( ~ less(a,X0)
      | less(factorial_plus_one(a),X0)
      | ~ prime(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_there_is_another_prime) ).

fof(f31,plain,
    prime(factorial_plus_one(a)),
    inference(resolution,[],[f30,f9]) ).

fof(f9,axiom,
    ! [X0] :
      ( prime(prime_divisor(X0))
      | prime(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prime_divsiors) ).

fof(f30,plain,
    ~ prime(prime_divisor(factorial_plus_one(a))),
    inference(subsumption_resolution,[],[f26,f20]) ).

fof(f20,plain,
    ~ less(factorial_plus_one(a),prime_divisor(factorial_plus_one(a))),
    inference(resolution,[],[f16,f2]) ).

fof(f2,axiom,
    ! [X0,X1] :
      ( ~ less(X1,X0)
      | ~ less(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',numbers_are_different) ).

fof(f16,plain,
    less(prime_divisor(factorial_plus_one(a)),factorial_plus_one(a)),
    inference(resolution,[],[f15,f10]) ).

fof(f10,axiom,
    ! [X0] :
      ( less(prime_divisor(X0),X0)
      | prime(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',smaller_prime_divisors) ).

fof(f26,plain,
    ( less(factorial_plus_one(a),prime_divisor(factorial_plus_one(a)))
    | ~ prime(prime_divisor(factorial_plus_one(a))) ),
    inference(resolution,[],[f22,f12]) ).

fof(f22,plain,
    less(a,prime_divisor(factorial_plus_one(a))),
    inference(resolution,[],[f18,f7]) ).

fof(f7,axiom,
    ! [X0,X1] :
      ( less(X1,X0)
      | ~ divides(X0,factorial_plus_one(X1)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',divisor_is_smaller) ).

fof(f18,plain,
    divides(prime_divisor(factorial_plus_one(a)),factorial_plus_one(a)),
    inference(resolution,[],[f15,f8]) ).

fof(f8,axiom,
    ! [X0] :
      ( divides(prime_divisor(X0),X0)
      | prime(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',division_by_prime_divisor) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : NUM016-1 : TPTP v8.2.0. Released v1.0.0.
% 0.11/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.13/0.34  % Computer : n024.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   : Mon May 20 04:39:53 EDT 2024
% 0.13/0.34  % CPUTime    : 
% 0.13/0.34  This is a CNF_UNS_RFO_NEQ_NHN problem
% 0.13/0.34  Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.56/0.73  % (14124)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on theBenchmark for (2996ds/83Mi)
% 0.56/0.73  % (14124)Refutation not found, incomplete strategy% (14124)------------------------------
% 0.56/0.73  % (14124)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.73  % (14124)Termination reason: Refutation not found, incomplete strategy
% 0.56/0.73  
% 0.56/0.73  % (14124)Memory used [KB]: 964
% 0.56/0.73  % (14124)Time elapsed: 0.002 s
% 0.56/0.73  % (14124)Instructions burned: 2 (million)
% 0.56/0.73  % (14120)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.56/0.73  % (14124)------------------------------
% 0.56/0.73  % (14124)------------------------------
% 0.56/0.73  % (14121)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2996ds/33Mi)
% 0.56/0.73  % (14122)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on theBenchmark for (2996ds/34Mi)
% 0.56/0.73  % (14119)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on theBenchmark for (2996ds/51Mi)
% 0.56/0.73  % (14121)Refutation not found, incomplete strategy% (14121)------------------------------
% 0.56/0.73  % (14121)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.73  % (14123)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.56/0.73  % (14121)Termination reason: Refutation not found, incomplete strategy
% 0.56/0.73  
% 0.56/0.73  % (14121)Memory used [KB]: 964
% 0.56/0.73  % (14121)Time elapsed: 0.002 s
% 0.56/0.73  % (14121)Instructions burned: 2 (million)
% 0.56/0.73  % (14122)First to succeed.
% 0.56/0.73  % (14121)------------------------------
% 0.56/0.73  % (14121)------------------------------
% 0.56/0.73  % (14119)Also succeeded, but the first one will report.
% 0.56/0.73  % (14122)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-14117"
% 0.56/0.73  % (14123)Refutation not found, incomplete strategy% (14123)------------------------------
% 0.56/0.73  % (14123)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.73  % (14123)Termination reason: Refutation not found, incomplete strategy
% 0.56/0.73  
% 0.56/0.73  % (14123)Memory used [KB]: 963
% 0.56/0.73  % (14123)Time elapsed: 0.003 s
% 0.56/0.73  % (14123)Instructions burned: 2 (million)
% 0.56/0.73  % (14125)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2996ds/56Mi)
% 0.56/0.73  % (14120)Also succeeded, but the first one will report.
% 0.56/0.73  % (14123)------------------------------
% 0.56/0.73  % (14123)------------------------------
% 0.56/0.73  % (14126)lrs+21_1:16_sil=2000:sp=occurrence:urr=on:flr=on:i=55:sd=1:nm=0:ins=3:ss=included:rawr=on:br=off_0 on theBenchmark for (2996ds/55Mi)
% 0.56/0.73  % (14122)Refutation found. Thanks to Tanya!
% 0.56/0.73  % SZS status Unsatisfiable for theBenchmark
% 0.56/0.73  % SZS output start Proof for theBenchmark
% See solution above
% 0.56/0.73  % (14122)------------------------------
% 0.56/0.73  % (14122)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.73  % (14122)Termination reason: Refutation
% 0.56/0.73  
% 0.56/0.73  % (14122)Memory used [KB]: 974
% 0.56/0.73  % (14122)Time elapsed: 0.003 s
% 0.56/0.73  % (14122)Instructions burned: 2 (million)
% 0.56/0.73  % (14117)Success in time 0.38 s
% 0.56/0.73  % Vampire---4.8 exiting
%------------------------------------------------------------------------------