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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : NUM015-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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n025.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:05 EDT 2024

% Result   : Unsatisfiable 0.56s 0.73s
% Output   : Refutation 0.56s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   36 (   3 unt;   0 def)
%            Number of atoms       :   86 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   93 (  43   ~;  45   |;   0   &)
%                                         (   5 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    9 (   8 usr;   6 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-1 aty)
%            Number of variables   :   19 (  19   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f54,plain,
    $false,
    inference(avatar_sat_refutation,[],[f26,f42,f44,f48,f50,f53]) ).

fof(f53,plain,
    ~ spl0_1,
    inference(avatar_contradiction_clause,[],[f52]) ).

fof(f52,plain,
    ( $false
    | ~ spl0_1 ),
    inference(subsumption_resolution,[],[f51,f1]) ).

fof(f1,axiom,
    ! [X0] : divides(X0,X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',divide_self) ).

fof(f51,plain,
    ( ~ divides(a,a)
    | ~ spl0_1 ),
    inference(resolution,[],[f22,f9]) ).

fof(f9,axiom,
    ! [X0] :
      ( ~ prime(X0)
      | ~ divides(X0,a) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_a_has_prime_divisor) ).

fof(f22,plain,
    ( prime(a)
    | ~ spl0_1 ),
    inference(avatar_component_clause,[],[f20]) ).

fof(f20,plain,
    ( spl0_1
  <=> prime(a) ),
    introduced(avatar_definition,[new_symbols(naming,[spl0_1])]) ).

fof(f50,plain,
    ( spl0_1
    | spl0_4 ),
    inference(avatar_split_clause,[],[f49,f35,f20]) ).

fof(f35,plain,
    ( spl0_4
  <=> less(divisor(a),a) ),
    introduced(avatar_definition,[new_symbols(naming,[spl0_4])]) ).

fof(f49,plain,
    ( prime(a)
    | spl0_4 ),
    inference(resolution,[],[f37,f5]) ).

fof(f5,axiom,
    ! [X0] :
      ( less(divisor(X0),X0)
      | prime(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',divisor2) ).

fof(f37,plain,
    ( ~ less(divisor(a),a)
    | spl0_4 ),
    inference(avatar_component_clause,[],[f35]) ).

fof(f48,plain,
    ( spl0_1
    | spl0_5 ),
    inference(avatar_split_clause,[],[f46,f39,f20]) ).

fof(f39,plain,
    ( spl0_5
  <=> divides(divisor(a),a) ),
    introduced(avatar_definition,[new_symbols(naming,[spl0_5])]) ).

fof(f46,plain,
    ( prime(a)
    | spl0_5 ),
    inference(resolution,[],[f41,f3]) ).

fof(f3,axiom,
    ! [X0] :
      ( divides(divisor(X0),X0)
      | prime(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prime) ).

fof(f41,plain,
    ( ~ divides(divisor(a),a)
    | spl0_5 ),
    inference(avatar_component_clause,[],[f39]) ).

fof(f44,plain,
    ( spl0_1
    | spl0_3 ),
    inference(avatar_split_clause,[],[f43,f31,f20]) ).

fof(f31,plain,
    ( spl0_3
  <=> less(n1,divisor(a)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl0_3])]) ).

fof(f43,plain,
    ( prime(a)
    | spl0_3 ),
    inference(resolution,[],[f33,f4]) ).

fof(f4,axiom,
    ! [X0] :
      ( less(n1,divisor(X0))
      | prime(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',divisor1) ).

fof(f33,plain,
    ( ~ less(n1,divisor(a))
    | spl0_3 ),
    inference(avatar_component_clause,[],[f31]) ).

fof(f42,plain,
    ( ~ spl0_3
    | ~ spl0_4
    | ~ spl0_5
    | ~ spl0_2 ),
    inference(avatar_split_clause,[],[f27,f24,f39,f35,f31]) ).

fof(f24,plain,
    ( spl0_2
  <=> ! [X0] :
        ( ~ divides(X0,a)
        | ~ divides(factor_of(divisor(a)),X0) ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl0_2])]) ).

fof(f27,plain,
    ( ~ divides(divisor(a),a)
    | ~ less(divisor(a),a)
    | ~ less(n1,divisor(a))
    | ~ spl0_2 ),
    inference(resolution,[],[f25,f7]) ).

fof(f7,axiom,
    ! [X0] :
      ( divides(factor_of(X0),X0)
      | ~ less(X0,a)
      | ~ less(n1,X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',factor2) ).

fof(f25,plain,
    ( ! [X0] :
        ( ~ divides(factor_of(divisor(a)),X0)
        | ~ divides(X0,a) )
    | ~ spl0_2 ),
    inference(avatar_component_clause,[],[f24]) ).

fof(f26,plain,
    ( spl0_1
    | spl0_2 ),
    inference(avatar_split_clause,[],[f18,f24,f20]) ).

fof(f18,plain,
    ! [X0] :
      ( ~ divides(X0,a)
      | ~ divides(factor_of(divisor(a)),X0)
      | prime(a) ),
    inference(duplicate_literal_removal,[],[f17]) ).

fof(f17,plain,
    ! [X0] :
      ( ~ divides(X0,a)
      | ~ divides(factor_of(divisor(a)),X0)
      | prime(a)
      | prime(a) ),
    inference(resolution,[],[f16,f5]) ).

fof(f16,plain,
    ! [X0,X1] :
      ( ~ less(divisor(X0),a)
      | ~ divides(X1,a)
      | ~ divides(factor_of(divisor(X0)),X1)
      | prime(X0) ),
    inference(resolution,[],[f11,f4]) ).

fof(f11,plain,
    ! [X0,X1] :
      ( ~ less(n1,X0)
      | ~ less(X0,a)
      | ~ divides(X1,a)
      | ~ divides(factor_of(X0),X1) ),
    inference(resolution,[],[f10,f2]) ).

fof(f2,axiom,
    ! [X2,X0,X1] :
      ( divides(X0,X2)
      | ~ divides(X1,X2)
      | ~ divides(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitive_divide) ).

fof(f10,plain,
    ! [X0] :
      ( ~ divides(factor_of(X0),a)
      | ~ less(n1,X0)
      | ~ less(X0,a) ),
    inference(resolution,[],[f6,f9]) ).

fof(f6,axiom,
    ! [X0] :
      ( prime(factor_of(X0))
      | ~ less(X0,a)
      | ~ less(n1,X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',factor1) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : NUM015-1 : TPTP v8.2.0. Released v1.0.0.
% 0.12/0.14  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.34  % Computer : n025.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.21/0.34  % WCLimit    : 300
% 0.21/0.34  % DateTime   : Mon May 20 05:37:22 EDT 2024
% 0.21/0.35  % CPUTime    : 
% 0.21/0.35  This is a CNF_UNS_RFO_NEQ_NHN problem
% 0.21/0.35  Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.56/0.73  % (12498)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  % (12494)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  % (12497)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  % (12493)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  % (12495)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  % (12499)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  % (12497)Refutation not found, incomplete strategy% (12497)------------------------------
% 0.56/0.73  % (12497)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.73  % (12497)Termination reason: Refutation not found, incomplete strategy
% 0.56/0.73  
% 0.56/0.73  % (12497)Memory used [KB]: 944
% 0.56/0.73  % (12497)Time elapsed: 0.002 s
% 0.56/0.73  % (12497)Instructions burned: 2 (million)
% 0.56/0.73  % (12496)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  % (12499)Refutation not found, incomplete strategy% (12499)------------------------------
% 0.56/0.73  % (12499)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.73  % (12499)Termination reason: Refutation not found, incomplete strategy
% 0.56/0.73  
% 0.56/0.73  % (12499)Memory used [KB]: 944
% 0.56/0.73  % (12499)Time elapsed: 0.003 s
% 0.56/0.73  % (12497)------------------------------
% 0.56/0.73  % (12497)------------------------------
% 0.56/0.73  % (12499)Instructions burned: 2 (million)
% 0.56/0.73  % (12499)------------------------------
% 0.56/0.73  % (12499)------------------------------
% 0.56/0.73  % (12494)First to succeed.
% 0.56/0.73  % (12495)Refutation not found, incomplete strategy% (12495)------------------------------
% 0.56/0.73  % (12495)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.73  % (12495)Termination reason: Refutation not found, incomplete strategy
% 0.56/0.73  
% 0.56/0.73  % (12495)Memory used [KB]: 961
% 0.56/0.73  % (12495)Time elapsed: 0.003 s
% 0.56/0.73  % (12495)Instructions burned: 2 (million)
% 0.56/0.73  % (12493)Also succeeded, but the first one will report.
% 0.56/0.73  % (12495)------------------------------
% 0.56/0.73  % (12495)------------------------------
% 0.56/0.73  % (12494)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-12491"
% 0.56/0.73  % (12492)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on theBenchmark for (2996ds/34Mi)
% 0.56/0.73  % (12494)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  % (12494)------------------------------
% 0.56/0.73  % (12494)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.73  % (12494)Termination reason: Refutation
% 0.56/0.73  
% 0.56/0.73  % (12494)Memory used [KB]: 987
% 0.56/0.73  % (12494)Time elapsed: 0.004 s
% 0.56/0.73  % (12494)Instructions burned: 3 (million)
% 0.56/0.73  % (12491)Success in time 0.374 s
% 0.56/0.73  % Vampire---4.8 exiting
%------------------------------------------------------------------------------