TSTP Solution File: SYN001+1 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SYN001+1 : TPTP v8.2.0. Released v2.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 : n021.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 08:20:19 EDT 2024

% Result   : Theorem 0.56s 0.71s
% Output   : Refutation 0.56s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    1
% Syntax   : Number of formulae    :    9 (   3 unt;   0 def)
%            Number of atoms       :   17 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   14 (   6   ~;   4   |;   1   &)
%                                         (   2 <=>;   0  =>;   0  <=;   1 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    0 (   0 avg)
%            Number of predicates  :    2 (   1 usr;   2 prp; 0-0 aty)
%            Number of functors    :    0 (   0 usr;   0 con; --- aty)
%            Number of variables   :    0 (   0   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f9,plain,
    $false,
    inference(subsumption_resolution,[],[f7,f8]) ).

fof(f8,plain,
    ~ p,
    inference(duplicate_literal_removal,[],[f6]) ).

fof(f6,plain,
    ( ~ p
    | ~ p ),
    inference(cnf_transformation,[],[f4]) ).

fof(f4,plain,
    ( ( ~ p
      | ~ p )
    & ( p
      | p ) ),
    inference(nnf_transformation,[],[f3]) ).

fof(f3,plain,
    ( p
  <~> p ),
    inference(ennf_transformation,[],[f2]) ).

fof(f2,negated_conjecture,
    ~ ( p
    <=> p ),
    inference(negated_conjecture,[],[f1]) ).

fof(f1,conjecture,
    ( p
  <=> p ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel2) ).

fof(f7,plain,
    p,
    inference(duplicate_literal_removal,[],[f5]) ).

fof(f5,plain,
    ( p
    | p ),
    inference(cnf_transformation,[],[f4]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11  % Problem    : SYN001+1 : TPTP v8.2.0. Released v2.0.0.
% 0.10/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.35  % Computer : n021.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Mon May 20 13:46:08 EDT 2024
% 0.13/0.35  % CPUTime    : 
% 0.13/0.35  This is a FOF_THM_PRP problem
% 0.13/0.35  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.71  % (17068)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.71  % (17064)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.71  % (17065)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.71  % (17066)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.71  % (17069)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.71  % (17070)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.71  % (17068)First to succeed.
% 0.56/0.71  % (17064)Also succeeded, but the first one will report.
% 0.56/0.71  % (17066)Also succeeded, but the first one will report.
% 0.56/0.71  % (17067)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.71  % (17065)Also succeeded, but the first one will report.
% 0.56/0.71  % (17068)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-17063"
% 0.56/0.71  % (17069)Also succeeded, but the first one will report.
% 0.56/0.71  % (17070)Also succeeded, but the first one will report.
% 0.56/0.71  % (17071)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.71  % (17067)Also succeeded, but the first one will report.
% 0.56/0.71  % (17068)Refutation found. Thanks to Tanya!
% 0.56/0.71  % SZS status Theorem for theBenchmark
% 0.56/0.71  % SZS output start Proof for theBenchmark
% See solution above
% 0.56/0.71  % (17068)------------------------------
% 0.56/0.71  % (17068)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.71  % (17068)Termination reason: Refutation
% 0.56/0.71  
% 0.56/0.71  % (17068)Memory used [KB]: 951
% 0.56/0.71  % (17068)Time elapsed: 0.002 s
% 0.56/0.71  % (17068)Instructions burned: 2 (million)
% 0.56/0.71  % (17063)Success in time 0.356 s
% 0.56/0.72  % Vampire---4.8 exiting
%------------------------------------------------------------------------------