TSTP Solution File: LCL662+1.001 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : LCL662+1.001 : TPTP v8.1.2. Released v4.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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n027.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:39:28 EDT 2024

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

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

fof(f7,plain,
    p1(sK0),
    inference(cnf_transformation,[],[f6]) ).

fof(f6,plain,
    ( ~ p1(sK0)
    & p1(sK0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f4,f5]) ).

fof(f5,plain,
    ( ? [X0] :
        ( ~ p1(X0)
        & p1(X0) )
   => ( ~ p1(sK0)
      & p1(sK0) ) ),
    introduced(choice_axiom,[]) ).

fof(f4,plain,
    ? [X0] :
      ( ~ p1(X0)
      & p1(X0) ),
    inference(ennf_transformation,[],[f3]) ).

fof(f3,plain,
    ? [X0] :
      ~ ( p1(X0)
        | ~ p1(X0) ),
    inference(flattening,[],[f2]) ).

fof(f2,negated_conjecture,
    ~ ~ ? [X0] :
          ~ ( p1(X0)
            | ~ p1(X0) ),
    inference(negated_conjecture,[],[f1]) ).

fof(f1,conjecture,
    ~ ? [X0] :
        ~ ( p1(X0)
          | ~ p1(X0) ),
    file('/export/starexec/sandbox/tmp/tmp.4LgrqAtkOQ/Vampire---4.8_13124',main) ).

fof(f8,plain,
    ~ p1(sK0),
    inference(cnf_transformation,[],[f6]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : LCL662+1.001 : TPTP v8.1.2. Released v4.0.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.36  % Computer : n027.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit   : 300
% 0.15/0.36  % WCLimit    : 300
% 0.15/0.36  % DateTime   : Fri May  3 14:02:51 EDT 2024
% 0.15/0.36  % CPUTime    : 
% 0.15/0.36  This is a FOF_THM_EPR_NEQ 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/tmp/tmp.4LgrqAtkOQ/Vampire---4.8_13124
% 0.55/0.74  % (13404)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.55/0.74  % (13410)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.55/0.74  % (13404)First to succeed.
% 0.55/0.74  % (13410)Also succeeded, but the first one will report.
% 0.55/0.74  % (13404)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-13397"
% 0.55/0.75  % (13404)Refutation found. Thanks to Tanya!
% 0.55/0.75  % SZS status Theorem for Vampire---4
% 0.55/0.75  % SZS output start Proof for Vampire---4
% See solution above
% 0.55/0.75  % (13404)------------------------------
% 0.55/0.75  % (13404)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.75  % (13404)Termination reason: Refutation
% 0.55/0.75  
% 0.55/0.75  % (13404)Memory used [KB]: 952
% 0.55/0.75  % (13404)Time elapsed: 0.002 s
% 0.55/0.75  % (13404)Instructions burned: 2 (million)
% 0.55/0.75  % (13397)Success in time 0.379 s
% 0.55/0.75  % Vampire---4.8 exiting
%------------------------------------------------------------------------------