TSTP Solution File: DAT334_21 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : DAT334_21 : 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 : n028.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 : Mon May 20 19:50:43 EDT 2024

% Result   : Theorem 0.47s 0.65s
% Output   : Refutation 0.47s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   28 (   4 unt;   9 typ;   0 def)
%            Number of atoms       :  100 (   0 equ)
%            Maximal formula atoms :    6 (   5 avg)
%            Number of connectives :   62 (  20   ~;  10   |;  25   &)
%                                         (   0 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of FOOLs       :   39 (  39 fml;   0 var)
%            Number of types       :    3 (   1 usr)
%            Number of type conns  :   10 (   6   >;   4   *;   0   +;   0  <<)
%            Number of predicates  :   10 (   9 usr;   7 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-1 aty)
%            Number of variables   :   24 (  15   !;   9   ?;  13   :)

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

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

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

tff(func_def_8,type,
    sK1: '$ki_world' > $i ).

tff(func_def_9,type,
    sK2: '$ki_world' > '$ki_world' ).

tff(func_def_10,type,
    sK3: '$ki_world' > $i ).

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

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

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

tff(f36,plain,
    $false,
    inference(subsumption_resolution,[],[f34,f22]) ).

tff(f22,plain,
    '$ki_accessible'('$ki_local_world',sK0),
    inference(cnf_transformation,[],[f15]) ).

tff(f15,plain,
    ( ! [X1] :
        ( ~ teach(sK0,X1,cs)
        | ~ '$ki_exists_in_world_$i'(sK0,X1) )
    & '$ki_accessible'('$ki_local_world',sK0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f10,f14]) ).

tff(f14,plain,
    ( ? [X0: '$ki_world'] :
        ( ! [X1] :
            ( ~ teach(X0,X1,cs)
            | ~ '$ki_exists_in_world_$i'(X0,X1) )
        & '$ki_accessible'('$ki_local_world',X0) )
   => ( ! [X1] :
          ( ~ teach(sK0,X1,cs)
          | ~ '$ki_exists_in_world_$i'(sK0,X1) )
      & '$ki_accessible'('$ki_local_world',sK0) ) ),
    introduced(choice_axiom,[]) ).

tff(f10,plain,
    ? [X0: '$ki_world'] :
      ( ! [X1] :
          ( ~ teach(X0,X1,cs)
          | ~ '$ki_exists_in_world_$i'(X0,X1) )
      & '$ki_accessible'('$ki_local_world',X0) ),
    inference(ennf_transformation,[],[f7]) ).

tff(f7,plain,
    ~ ! [X0: '$ki_world'] :
        ( '$ki_accessible'('$ki_local_world',X0)
       => ? [X1] :
            ( teach(X0,X1,cs)
            & '$ki_exists_in_world_$i'(X0,X1) ) ),
    inference(rectify,[],[f6]) ).

tff(f6,negated_conjecture,
    ~ ! [X0: '$ki_world'] :
        ( '$ki_accessible'('$ki_local_world',X0)
       => ? [X2] :
            ( teach(X0,X2,cs)
            & '$ki_exists_in_world_$i'(X0,X2) ) ),
    inference(negated_conjecture,[],[f5]) ).

tff(f5,conjecture,
    ! [X0: '$ki_world'] :
      ( '$ki_accessible'('$ki_local_world',X0)
     => ? [X2] :
          ( teach(X0,X2,cs)
          & '$ki_exists_in_world_$i'(X0,X2) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',verify) ).

tff(f34,plain,
    ~ '$ki_accessible'('$ki_local_world',sK0),
    inference(resolution,[],[f33,f25]) ).

tff(f25,plain,
    ! [X0: '$ki_world'] :
      ( '$ki_exists_in_world_$i'(X0,sK1(X0))
      | ~ '$ki_accessible'('$ki_local_world',X0) ),
    inference(cnf_transformation,[],[f17]) ).

tff(f17,plain,
    ! [X0: '$ki_world'] :
      ( ( teach(X0,sue,psych)
        & teach(X0,mary,psych)
        & teach(X0,sK1(X0),cs)
        & '$ki_exists_in_world_$i'(X0,sK1(X0))
        & teach(X0,john,math) )
      | ~ '$ki_accessible'('$ki_local_world',X0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f11,f16]) ).

tff(f16,plain,
    ! [X0: '$ki_world'] :
      ( ? [X1] :
          ( teach(X0,X1,cs)
          & '$ki_exists_in_world_$i'(X0,X1) )
     => ( teach(X0,sK1(X0),cs)
        & '$ki_exists_in_world_$i'(X0,sK1(X0)) ) ),
    introduced(choice_axiom,[]) ).

tff(f11,plain,
    ! [X0: '$ki_world'] :
      ( ( teach(X0,sue,psych)
        & teach(X0,mary,psych)
        & ? [X1] :
            ( teach(X0,X1,cs)
            & '$ki_exists_in_world_$i'(X0,X1) )
        & teach(X0,john,math) )
      | ~ '$ki_accessible'('$ki_local_world',X0) ),
    inference(ennf_transformation,[],[f8]) ).

tff(f8,plain,
    ! [X0: '$ki_world'] :
      ( '$ki_accessible'('$ki_local_world',X0)
     => ( teach(X0,sue,psych)
        & teach(X0,mary,psych)
        & ? [X1] :
            ( teach(X0,X1,cs)
            & '$ki_exists_in_world_$i'(X0,X1) )
        & teach(X0,john,math) ) ),
    inference(rectify,[],[f4]) ).

tff(f4,axiom,
    ! [X0: '$ki_world'] :
      ( '$ki_accessible'('$ki_local_world',X0)
     => ( teach(X0,sue,psych)
        & teach(X0,mary,psych)
        & ? [X2] :
            ( teach(X0,X2,cs)
            & '$ki_exists_in_world_$i'(X0,X2) )
        & teach(X0,john,math) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',db) ).

tff(f33,plain,
    ~ '$ki_exists_in_world_$i'(sK0,sK1(sK0)),
    inference(subsumption_resolution,[],[f32,f22]) ).

tff(f32,plain,
    ( ~ '$ki_accessible'('$ki_local_world',sK0)
    | ~ '$ki_exists_in_world_$i'(sK0,sK1(sK0)) ),
    inference(resolution,[],[f26,f23]) ).

tff(f23,plain,
    ! [X1: $i] :
      ( ~ teach(sK0,X1,cs)
      | ~ '$ki_exists_in_world_$i'(sK0,X1) ),
    inference(cnf_transformation,[],[f15]) ).

tff(f26,plain,
    ! [X0: '$ki_world'] :
      ( teach(X0,sK1(X0),cs)
      | ~ '$ki_accessible'('$ki_local_world',X0) ),
    inference(cnf_transformation,[],[f17]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem    : DAT334_21 : TPTP v8.2.0. Released v8.2.0.
% 0.11/0.12  % 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.11/0.33  % Computer : n028.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit   : 300
% 0.11/0.33  % WCLimit    : 300
% 0.11/0.33  % DateTime   : Sun May 19 23:27:38 EDT 2024
% 0.11/0.33  % CPUTime    : 
% 0.11/0.33  This is a TF0_THM_NEQ_NAR problem
% 0.11/0.33  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.47/0.65  % (12691)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.47/0.65  % (12691)Refutation not found, incomplete strategy% (12691)------------------------------
% 0.47/0.65  % (12691)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.47/0.65  % (12691)Termination reason: Refutation not found, incomplete strategy
% 0.47/0.65  
% 0.47/0.65  % (12691)Memory used [KB]: 948
% 0.47/0.65  % (12691)Time elapsed: 0.001 s
% 0.47/0.65  % (12691)Instructions burned: 2 (million)
% 0.47/0.65  % (12691)------------------------------
% 0.47/0.65  % (12691)------------------------------
% 0.47/0.65  % (12684)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.47/0.65  % (12686)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.47/0.65  % (12687)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.47/0.65  % (12685)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.47/0.65  % (12689)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.47/0.65  % (12690)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.47/0.65  % (12688)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.47/0.65  % (12689)Refutation not found, incomplete strategy% (12689)------------------------------
% 0.47/0.65  % (12689)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.47/0.65  % (12689)Termination reason: Refutation not found, incomplete strategy
% 0.47/0.65  
% 0.47/0.65  % (12689)Memory used [KB]: 948
% 0.47/0.65  % (12689)Time elapsed: 0.002 s
% 0.47/0.65  % (12689)Instructions burned: 2 (million)
% 0.47/0.65  % (12684)First to succeed.
% 0.47/0.65  % (12686)Also succeeded, but the first one will report.
% 0.47/0.65  % (12690)Refutation not found, incomplete strategy% (12690)------------------------------
% 0.47/0.65  % (12690)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.47/0.65  % (12688)Also succeeded, but the first one will report.
% 0.47/0.65  % (12689)------------------------------
% 0.47/0.65  % (12689)------------------------------
% 0.47/0.65  % (12685)Also succeeded, but the first one will report.
% 0.47/0.65  % (12690)Termination reason: Refutation not found, incomplete strategy
% 0.47/0.65  
% 0.47/0.65  % (12690)Memory used [KB]: 952
% 0.47/0.65  % (12690)Time elapsed: 0.003 s
% 0.47/0.65  % (12690)Instructions burned: 2 (million)
% 0.47/0.65  % (12684)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-12683"
% 0.47/0.65  % (12690)------------------------------
% 0.47/0.65  % (12690)------------------------------
% 0.47/0.65  % (12692)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.47/0.65  % (12684)Refutation found. Thanks to Tanya!
% 0.47/0.65  % SZS status Theorem for theBenchmark
% 0.47/0.65  % SZS output start Proof for theBenchmark
% See solution above
% 0.47/0.65  % (12684)------------------------------
% 0.47/0.65  % (12684)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.47/0.65  % (12684)Termination reason: Refutation
% 0.47/0.65  
% 0.47/0.65  % (12684)Memory used [KB]: 962
% 0.47/0.65  % (12684)Time elapsed: 0.003 s
% 0.47/0.65  % (12684)Instructions burned: 3 (million)
% 0.47/0.65  % (12683)Success in time 0.313 s
% 0.47/0.65  % Vampire---4.8 exiting
%------------------------------------------------------------------------------