TSTP Solution File: CSR031+2 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : CSR031+2 : TPTP v8.1.2. Released v3.4.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 : n007.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 : Sun May  5 04:49:02 EDT 2024

% Result   : Theorem 0.58s 0.76s
% Output   : Refutation 0.58s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   15 (   8 unt;   0 def)
%            Number of atoms       :   22 (   0 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   17 (  10   ~;   4   |;   1   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   11 (  11   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1282,plain,
    $false,
    inference(unit_resulting_resolution,[],[f1238,f1272,f1261]) ).

fof(f1261,plain,
    ! [X0] :
      ( ~ collection(X0)
      | ~ individual(X0) ),
    inference(cnf_transformation,[],[f1215]) ).

fof(f1215,plain,
    ! [X0] :
      ( ~ individual(X0)
      | ~ collection(X0) ),
    inference(ennf_transformation,[],[f289]) ).

fof(f289,axiom,
    ! [X0] :
      ~ ( individual(X0)
        & collection(X0) ),
    file('/export/starexec/sandbox2/tmp/tmp.Q8uJYpWl9e/Vampire---4.8_31306',ax1_289) ).

fof(f1272,plain,
    collection(c_tptptptpcol_16_8398),
    inference(unit_resulting_resolution,[],[f1229,f1233]) ).

fof(f1233,plain,
    ! [X0,X1] :
      ( ~ disjointwith(X0,X1)
      | collection(X0) ),
    inference(cnf_transformation,[],[f1178]) ).

fof(f1178,plain,
    ! [X0,X1] :
      ( collection(X0)
      | ~ disjointwith(X0,X1) ),
    inference(ennf_transformation,[],[f1138]) ).

fof(f1138,plain,
    ! [X0,X1] :
      ( disjointwith(X0,X1)
     => collection(X0) ),
    inference(rectify,[],[f1119]) ).

fof(f1119,axiom,
    ! [X9,X5] :
      ( disjointwith(X9,X5)
     => collection(X9) ),
    file('/export/starexec/sandbox2/tmp/tmp.Q8uJYpWl9e/Vampire---4.8_31306',ax1_1119) ).

fof(f1229,plain,
    disjointwith(c_tptptptpcol_16_8398,c_tptpcol_16_18488),
    inference(cnf_transformation,[],[f1134]) ).

fof(f1134,plain,
    disjointwith(c_tptptptpcol_16_8398,c_tptpcol_16_18488),
    inference(flattening,[],[f1133]) ).

fof(f1133,negated_conjecture,
    ~ ~ disjointwith(c_tptptptpcol_16_8398,c_tptpcol_16_18488),
    inference(negated_conjecture,[],[f1132]) ).

fof(f1132,conjecture,
    ~ disjointwith(c_tptptptpcol_16_8398,c_tptpcol_16_18488),
    file('/export/starexec/sandbox2/tmp/tmp.Q8uJYpWl9e/Vampire---4.8_31306',query81) ).

fof(f1238,plain,
    individual(c_tptptptpcol_16_8398),
    inference(cnf_transformation,[],[f447]) ).

fof(f447,axiom,
    individual(c_tptptptpcol_16_8398),
    file('/export/starexec/sandbox2/tmp/tmp.Q8uJYpWl9e/Vampire---4.8_31306',ax1_447) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : CSR031+2 : TPTP v8.1.2. Released v3.4.0.
% 0.07/0.15  % 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.16/0.36  % Computer : n007.cluster.edu
% 0.16/0.36  % Model    : x86_64 x86_64
% 0.16/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36  % Memory   : 8042.1875MB
% 0.16/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36  % CPULimit   : 300
% 0.16/0.36  % WCLimit    : 300
% 0.16/0.36  % DateTime   : Fri May  3 20:07:23 EDT 2024
% 0.16/0.36  % CPUTime    : 
% 0.16/0.36  This is a FOF_THM_RFO_NEQ problem
% 0.16/0.36  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/tmp/tmp.Q8uJYpWl9e/Vampire---4.8_31306
% 0.58/0.75  % (31531)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 Vampire---4 for (2996ds/83Mi)
% 0.58/0.75  % (31525)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 Vampire---4 for (2996ds/34Mi)
% 0.58/0.75  % (31527)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.58/0.75  % (31526)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 Vampire---4 for (2996ds/51Mi)
% 0.58/0.75  % (31528)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.58/0.75  % (31530)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.58/0.75  % (31532)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2996ds/56Mi)
% 0.58/0.76  % (31531)First to succeed.
% 0.58/0.76  % (31531)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-31521"
% 0.58/0.76  % (31528)Refutation not found, incomplete strategy% (31528)------------------------------
% 0.58/0.76  % (31528)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.76  % (31528)Termination reason: Refutation not found, incomplete strategy
% 0.58/0.76  
% 0.58/0.76  % (31528)Memory used [KB]: 1750
% 0.58/0.76  % (31528)Time elapsed: 0.005 s
% 0.58/0.76  % (31528)Instructions burned: 5 (million)
% 0.58/0.76  % (31527)Also succeeded, but the first one will report.
% 0.58/0.76  % (31525)Refutation not found, incomplete strategy% (31525)------------------------------
% 0.58/0.76  % (31525)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.76  % (31525)Termination reason: Refutation not found, incomplete strategy
% 0.58/0.76  
% 0.58/0.76  % (31525)Memory used [KB]: 1750
% 0.58/0.76  % (31525)Time elapsed: 0.005 s
% 0.58/0.76  % (31525)Instructions burned: 6 (million)
% 0.58/0.76  % (31531)Refutation found. Thanks to Tanya!
% 0.58/0.76  % SZS status Theorem for Vampire---4
% 0.58/0.76  % SZS output start Proof for Vampire---4
% See solution above
% 0.58/0.76  % (31531)------------------------------
% 0.58/0.76  % (31531)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.76  % (31531)Termination reason: Refutation
% 0.58/0.76  
% 0.58/0.76  % (31531)Memory used [KB]: 1809
% 0.58/0.76  % (31531)Time elapsed: 0.005 s
% 0.58/0.76  % (31531)Instructions burned: 11 (million)
% 0.58/0.76  % (31521)Success in time 0.385 s
% 0.58/0.76  % Vampire---4.8 exiting
%------------------------------------------------------------------------------