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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : LCL188-1 : TPTP v8.1.2. Released v1.1.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 : n032.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 07:33:44 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
fof(f85,plain,
    $false,
    inference(unit_resulting_resolution,[],[f10,f2,f35,f8]) ).

fof(f8,axiom,
    ! [X3,X4,X5] :
      ( theorem(or(not(X3),X5))
      | ~ axiom(or(not(X3),X4))
      | ~ theorem(or(not(X4),X5)) ),
    file('/export/starexec/sandbox2/tmp/tmp.VHv6XIE6OX/Vampire---4.8_26517',rule_3) ).

fof(f35,plain,
    ~ theorem(or(not(or(p,q)),or(p,q))),
    inference(unit_resulting_resolution,[],[f9,f4,f7]) ).

fof(f7,axiom,
    ! [X3,X4] :
      ( theorem(X3)
      | ~ axiom(or(not(X4),X3))
      | ~ theorem(X4) ),
    file('/export/starexec/sandbox2/tmp/tmp.VHv6XIE6OX/Vampire---4.8_26517',rule_2) ).

fof(f4,axiom,
    ! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
    file('/export/starexec/sandbox2/tmp/tmp.VHv6XIE6OX/Vampire---4.8_26517',axiom_1_5) ).

fof(f9,axiom,
    ~ theorem(or(p,or(not(or(p,q)),q))),
    file('/export/starexec/sandbox2/tmp/tmp.VHv6XIE6OX/Vampire---4.8_26517',prove_this) ).

fof(f2,axiom,
    ! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
    file('/export/starexec/sandbox2/tmp/tmp.VHv6XIE6OX/Vampire---4.8_26517',axiom_1_3) ).

fof(f10,plain,
    ! [X0] : theorem(or(not(or(X0,X0)),X0)),
    inference(unit_resulting_resolution,[],[f1,f6]) ).

fof(f6,axiom,
    ! [X3] :
      ( theorem(X3)
      | ~ axiom(X3) ),
    file('/export/starexec/sandbox2/tmp/tmp.VHv6XIE6OX/Vampire---4.8_26517',rule_1) ).

fof(f1,axiom,
    ! [X0] : axiom(or(not(or(X0,X0)),X0)),
    file('/export/starexec/sandbox2/tmp/tmp.VHv6XIE6OX/Vampire---4.8_26517',axiom_1_2) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10  % Problem    : LCL188-1 : TPTP v8.1.2. Released v1.1.0.
% 0.03/0.11  % 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.12/0.31  % Computer : n032.cluster.edu
% 0.12/0.31  % Model    : x86_64 x86_64
% 0.12/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.31  % Memory   : 8042.1875MB
% 0.12/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.31  % CPULimit   : 300
% 0.12/0.31  % WCLimit    : 300
% 0.12/0.31  % DateTime   : Fri May  3 14:02:39 EDT 2024
% 0.12/0.31  % CPUTime    : 
% 0.12/0.31  This is a CNF_UNS_RFO_NEQ_HRN problem
% 0.12/0.31  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.VHv6XIE6OX/Vampire---4.8_26517
% 0.50/0.66  % (26628)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.50/0.66  % (26629)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 Vampire---4 for (2996ds/34Mi)
% 0.50/0.66  % (26631)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.50/0.66  % (26630)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.50/0.66  % (26625)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.50/0.66  % (26632)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.50/0.66  % (26630)Refutation not found, incomplete strategy% (26630)------------------------------
% 0.50/0.66  % (26630)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.50/0.66  % (26630)Termination reason: Refutation not found, incomplete strategy
% 0.50/0.66  
% 0.50/0.66  % (26630)Memory used [KB]: 958
% 0.50/0.66  % (26630)Time elapsed: 0.002 s
% 0.50/0.66  % (26630)Instructions burned: 2 (million)
% 0.50/0.66  % (26627)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.50/0.66  % (26630)------------------------------
% 0.50/0.66  % (26630)------------------------------
% 0.50/0.66  % (26628)First to succeed.
% 0.50/0.66  % (26629)Also succeeded, but the first one will report.
% 0.50/0.66  % (26628)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-26624"
% 0.50/0.66  % (26631)Also succeeded, but the first one will report.
% 0.50/0.66  % (26625)Also succeeded, but the first one will report.
% 0.50/0.66  % (26628)Refutation found. Thanks to Tanya!
% 0.50/0.66  % SZS status Unsatisfiable for Vampire---4
% 0.50/0.66  % SZS output start Proof for Vampire---4
% See solution above
% 0.50/0.66  % (26628)------------------------------
% 0.50/0.66  % (26628)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.50/0.66  % (26628)Termination reason: Refutation
% 0.50/0.66  
% 0.50/0.66  % (26628)Memory used [KB]: 997
% 0.50/0.66  % (26628)Time elapsed: 0.003 s
% 0.50/0.66  % (26628)Instructions burned: 5 (million)
% 0.50/0.66  % (26624)Success in time 0.348 s
% 0.50/0.66  % Vampire---4.8 exiting
%------------------------------------------------------------------------------