TSTP Solution File: NLP267_2 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : NLP267_2 : TPTP v8.2.0. Released v8.2.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 : n006.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:03:33 EDT 2024

% Result   : Theorem 0.54s 0.74s
% Output   : Refutation 0.54s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   28 (   4 unt;   7 typ;   0 def)
%            Number of atoms       :   77 (   0 equ)
%            Maximal formula atoms :    4 (   3 avg)
%            Number of connectives :   51 (  23   ~;  16   |;   5   &)
%                                         (   0 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of FOOLs       :   28 (  28 fml;   0 var)
%            Number of types       :    3 (   1 usr)
%            Number of type conns  :    8 (   4   >;   4   *;   0   +;   0  <<)
%            Number of predicates  :    8 (   7 usr;   4 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   16 (  14   !;   2   ?;  16   :)

% Comments : 
%------------------------------------------------------------------------------
tff(type_def_5,type,
    '$ki_world': $tType ).

tff(func_def_0,type,
    '$ki_local_world': '$ki_world' ).

tff(func_def_6,type,
    sK0: '$ki_world' ).

tff(pred_def_1,type,
    '$ki_accessible': ( '$ki_world' * '$ki_world' ) > $o ).

tff(pred_def_2,type,
    price: ( '$ki_world' * $i ) > $o ).

tff(pred_def_3,type,
    dest: ( '$ki_world' * $i ) > $o ).

tff(pred_def_4,type,
    class: ( '$ki_world' * $i ) > $o ).

tff(f32,plain,
    $false,
    inference(subsumption_resolution,[],[f31,f21]) ).

tff(f21,plain,
    '$ki_accessible'('$ki_local_world',sK0),
    inference(cnf_transformation,[],[f20]) ).

tff(f20,plain,
    ( ~ price(sK0,seventy)
    & '$ki_accessible'('$ki_local_world',sK0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f10,f19]) ).

tff(f19,plain,
    ( ? [X0: '$ki_world'] :
        ( ~ price(X0,seventy)
        & '$ki_accessible'('$ki_local_world',X0) )
   => ( ~ price(sK0,seventy)
      & '$ki_accessible'('$ki_local_world',sK0) ) ),
    introduced(choice_axiom,[]) ).

tff(f10,plain,
    ? [X0: '$ki_world'] :
      ( ~ price(X0,seventy)
      & '$ki_accessible'('$ki_local_world',X0) ),
    inference(ennf_transformation,[],[f9]) ).

tff(f9,negated_conjecture,
    ~ ! [X0: '$ki_world'] :
        ( '$ki_accessible'('$ki_local_world',X0)
       => price(X0,seventy) ),
    inference(negated_conjecture,[],[f8]) ).

tff(f8,conjecture,
    ! [X0: '$ki_world'] :
      ( '$ki_accessible'('$ki_local_world',X0)
     => price(X0,seventy) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',verify) ).

tff(f31,plain,
    ~ '$ki_accessible'('$ki_local_world',sK0),
    inference(resolution,[],[f30,f22]) ).

tff(f22,plain,
    ~ price(sK0,seventy),
    inference(cnf_transformation,[],[f20]) ).

tff(f30,plain,
    ! [X0: '$ki_world'] :
      ( price(X0,seventy)
      | ~ '$ki_accessible'('$ki_local_world',X0) ),
    inference(subsumption_resolution,[],[f29,f24]) ).

tff(f24,plain,
    ! [X0: '$ki_world'] :
      ( dest(X0,paris)
      | ~ '$ki_accessible'('$ki_local_world',X0) ),
    inference(cnf_transformation,[],[f12]) ).

tff(f12,plain,
    ! [X0: '$ki_world'] :
      ( dest(X0,paris)
      | ~ '$ki_accessible'('$ki_local_world',X0) ),
    inference(ennf_transformation,[],[f6]) ).

tff(f6,axiom,
    ! [X0: '$ki_world'] :
      ( '$ki_accessible'('$ki_local_world',X0)
     => dest(X0,paris) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',belief1) ).

tff(f29,plain,
    ! [X0: '$ki_world'] :
      ( price(X0,seventy)
      | ~ dest(X0,paris)
      | ~ '$ki_accessible'('$ki_local_world',X0) ),
    inference(subsumption_resolution,[],[f25,f23]) ).

tff(f23,plain,
    ! [X0: '$ki_world'] :
      ( class(X0,second)
      | ~ '$ki_accessible'('$ki_local_world',X0) ),
    inference(cnf_transformation,[],[f11]) ).

tff(f11,plain,
    ! [X0: '$ki_world'] :
      ( class(X0,second)
      | ~ '$ki_accessible'('$ki_local_world',X0) ),
    inference(ennf_transformation,[],[f7]) ).

tff(f7,axiom,
    ! [X0: '$ki_world'] :
      ( '$ki_accessible'('$ki_local_world',X0)
     => class(X0,second) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',belief2) ).

tff(f25,plain,
    ! [X0: '$ki_world'] :
      ( price(X0,seventy)
      | ~ class(X0,second)
      | ~ dest(X0,paris)
      | ~ '$ki_accessible'('$ki_local_world',X0) ),
    inference(cnf_transformation,[],[f14]) ).

tff(f14,plain,
    ! [X0: '$ki_world'] :
      ( price(X0,seventy)
      | ~ class(X0,second)
      | ~ dest(X0,paris)
      | ~ '$ki_accessible'('$ki_local_world',X0) ),
    inference(flattening,[],[f13]) ).

tff(f13,plain,
    ! [X0: '$ki_world'] :
      ( price(X0,seventy)
      | ~ class(X0,second)
      | ~ dest(X0,paris)
      | ~ '$ki_accessible'('$ki_local_world',X0) ),
    inference(ennf_transformation,[],[f3]) ).

tff(f3,axiom,
    ! [X0: '$ki_world'] :
      ( '$ki_accessible'('$ki_local_world',X0)
     => ( ( class(X0,second)
          & dest(X0,paris) )
       => price(X0,seventy) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',law2) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : NLP267_2 : TPTP v8.2.0. Released v8.2.0.
% 0.07/0.15  % 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.15/0.35  % Computer : n006.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit   : 300
% 0.15/0.35  % WCLimit    : 300
% 0.15/0.35  % DateTime   : Sun May 19 22:16:38 EDT 2024
% 0.15/0.35  % CPUTime    : 
% 0.15/0.35  This is a TF0_THM_NEQ_NAR problem
% 0.15/0.36  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.54/0.74  % (12328)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.54/0.74  % (12328)Refutation not found, incomplete strategy% (12328)------------------------------
% 0.54/0.74  % (12328)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.74  % (12328)Termination reason: Refutation not found, incomplete strategy
% 0.54/0.74  
% 0.54/0.74  % (12328)Memory used [KB]: 947
% 0.54/0.74  % (12328)Time elapsed: 0.001 s
% 0.54/0.74  % (12328)Instructions burned: 2 (million)
% 0.54/0.74  % (12328)------------------------------
% 0.54/0.74  % (12328)------------------------------
% 0.54/0.74  % (12321)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.54/0.74  % (12323)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.54/0.74  % (12322)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.54/0.74  % (12325)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.54/0.74  % (12326)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.54/0.74  % (12327)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.54/0.74  % (12324)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.54/0.74  % (12324)Refutation not found, incomplete strategy% (12324)------------------------------
% 0.54/0.74  % (12324)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.74  % (12324)Termination reason: Refutation not found, incomplete strategy
% 0.54/0.74  
% 0.54/0.74  % (12324)Memory used [KB]: 943
% 0.54/0.74  % (12324)Time elapsed: 0.002 s
% 0.54/0.74  % (12324)Instructions burned: 2 (million)
% 0.54/0.74  % (12326)Refutation not found, incomplete strategy% (12326)------------------------------
% 0.54/0.74  % (12326)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.74  % (12325)Refutation not found, incomplete strategy% (12325)------------------------------
% 0.54/0.74  % (12325)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.74  % (12325)Termination reason: Refutation not found, incomplete strategy
% 0.54/0.74  
% 0.54/0.74  % (12325)Memory used [KB]: 952
% 0.54/0.74  % (12325)Time elapsed: 0.002 s
% 0.54/0.74  % (12325)Instructions burned: 2 (million)
% 0.54/0.74  % (12321)First to succeed.
% 0.54/0.74  % (12326)Termination reason: Refutation not found, incomplete strategy
% 0.54/0.74  
% 0.54/0.74  % (12326)Memory used [KB]: 947
% 0.54/0.74  % (12326)Time elapsed: 0.002 s
% 0.54/0.74  % (12326)Instructions burned: 2 (million)
% 0.54/0.74  % (12323)Also succeeded, but the first one will report.
% 0.54/0.74  % (12324)------------------------------
% 0.54/0.74  % (12324)------------------------------
% 0.54/0.74  % (12325)------------------------------
% 0.54/0.74  % (12325)------------------------------
% 0.54/0.74  % (12326)------------------------------
% 0.54/0.74  % (12326)------------------------------
% 0.54/0.74  % (12327)Also succeeded, but the first one will report.
% 0.54/0.74  % (12322)Also succeeded, but the first one will report.
% 0.54/0.74  % (12321)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-12320"
% 0.54/0.74  % (12329)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.54/0.74  % (12321)Refutation found. Thanks to Tanya!
% 0.54/0.74  % SZS status Theorem for theBenchmark
% 0.54/0.74  % SZS output start Proof for theBenchmark
% See solution above
% 0.54/0.74  % (12321)------------------------------
% 0.54/0.74  % (12321)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.74  % (12321)Termination reason: Refutation
% 0.54/0.74  
% 0.54/0.74  % (12321)Memory used [KB]: 972
% 0.54/0.74  % (12321)Time elapsed: 0.003 s
% 0.54/0.74  % (12321)Instructions burned: 3 (million)
% 0.54/0.74  % (12320)Success in time 0.379 s
% 0.54/0.74  % Vampire---4.8 exiting
%------------------------------------------------------------------------------