TSTP Solution File: GEO171+3 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : GEO171+3 : 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/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 : Wed May  1 02:22:41 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
fof(f83,plain,
    $false,
    inference(subsumption_resolution,[],[f82,f61]) ).

fof(f61,plain,
    ! [X0] : ~ convergent_lines(X0,X0),
    inference(cnf_transformation,[],[f3]) ).

fof(f3,axiom,
    ! [X0] : ~ convergent_lines(X0,X0),
    file('/export/starexec/sandbox2/tmp/tmp.VhzfUCz2j4/Vampire---4.8_6968',apart3) ).

fof(f82,plain,
    convergent_lines(sK0,sK0),
    inference(resolution,[],[f72,f52]) ).

fof(f52,plain,
    convergent_lines(sK0,sK1),
    inference(cnf_transformation,[],[f51]) ).

fof(f51,plain,
    ( ~ distinct_lines(sK0,sK1)
    & convergent_lines(sK0,sK1) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f38,f50]) ).

fof(f50,plain,
    ( ? [X0,X1] :
        ( ~ distinct_lines(X0,X1)
        & convergent_lines(X0,X1) )
   => ( ~ distinct_lines(sK0,sK1)
      & convergent_lines(sK0,sK1) ) ),
    introduced(choice_axiom,[]) ).

fof(f38,plain,
    ? [X0,X1] :
      ( ~ distinct_lines(X0,X1)
      & convergent_lines(X0,X1) ),
    inference(ennf_transformation,[],[f37]) ).

fof(f37,negated_conjecture,
    ~ ! [X0,X1] :
        ( convergent_lines(X0,X1)
       => distinct_lines(X0,X1) ),
    inference(negated_conjecture,[],[f36]) ).

fof(f36,conjecture,
    ! [X0,X1] :
      ( convergent_lines(X0,X1)
     => distinct_lines(X0,X1) ),
    file('/export/starexec/sandbox2/tmp/tmp.VhzfUCz2j4/Vampire---4.8_6968',con) ).

fof(f72,plain,
    ! [X0] :
      ( ~ convergent_lines(X0,sK1)
      | convergent_lines(X0,sK0) ),
    inference(resolution,[],[f69,f56]) ).

fof(f56,plain,
    ! [X2,X0,X1] :
      ( distinct_lines(X1,X2)
      | convergent_lines(X0,X2)
      | ~ convergent_lines(X0,X1) ),
    inference(cnf_transformation,[],[f43]) ).

fof(f43,plain,
    ! [X0,X1,X2] :
      ( convergent_lines(X0,X2)
      | distinct_lines(X1,X2)
      | ~ convergent_lines(X0,X1) ),
    inference(flattening,[],[f42]) ).

fof(f42,plain,
    ! [X0,X1,X2] :
      ( convergent_lines(X0,X2)
      | distinct_lines(X1,X2)
      | ~ convergent_lines(X0,X1) ),
    inference(ennf_transformation,[],[f14]) ).

fof(f14,axiom,
    ! [X0,X1,X2] :
      ( convergent_lines(X0,X1)
     => ( convergent_lines(X0,X2)
        | distinct_lines(X1,X2) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.VhzfUCz2j4/Vampire---4.8_6968',ceq3) ).

fof(f69,plain,
    ~ distinct_lines(sK1,sK0),
    inference(resolution,[],[f67,f55]) ).

fof(f55,plain,
    ! [X0,X1] :
      ( convergent_lines(X0,X1)
      | ~ distinct_lines(X0,X1) ),
    inference(cnf_transformation,[],[f41]) ).

fof(f41,plain,
    ! [X0,X1] :
      ( convergent_lines(X0,X1)
      | ~ distinct_lines(X0,X1) ),
    inference(ennf_transformation,[],[f15]) ).

fof(f15,axiom,
    ! [X0,X1] :
      ( distinct_lines(X0,X1)
     => convergent_lines(X0,X1) ),
    file('/export/starexec/sandbox2/tmp/tmp.VhzfUCz2j4/Vampire---4.8_6968',p1) ).

fof(f67,plain,
    ~ convergent_lines(sK1,sK0),
    inference(resolution,[],[f64,f61]) ).

fof(f64,plain,
    ! [X0] :
      ( convergent_lines(X0,sK1)
      | ~ convergent_lines(X0,sK0) ),
    inference(resolution,[],[f53,f56]) ).

fof(f53,plain,
    ~ distinct_lines(sK0,sK1),
    inference(cnf_transformation,[],[f51]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem    : GEO171+3 : TPTP v8.1.2. Released v4.0.0.
% 0.03/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.15/0.36  % Computer : n007.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   : Tue Apr 30 18:51:18 EDT 2024
% 0.15/0.36  % CPUTime    : 
% 0.15/0.36  This is a FOF_THM_RFO_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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.VhzfUCz2j4/Vampire---4.8_6968
% 0.61/0.81  % (7161)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 (2995ds/56Mi)
% 0.61/0.81  % (7161)First to succeed.
% 0.61/0.81  % (7153)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 (2995ds/34Mi)
% 0.61/0.81  % (7155)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.61/0.81  % (7154)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 (2995ds/51Mi)
% 0.61/0.81  % (7156)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.61/0.81  % (7158)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.61/0.81  % (7157)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 (2995ds/34Mi)
% 0.61/0.81  % (7160)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 (2995ds/83Mi)
% 0.61/0.81  % (7161)Refutation found. Thanks to Tanya!
% 0.61/0.81  % SZS status Theorem for Vampire---4
% 0.61/0.81  % SZS output start Proof for Vampire---4
% See solution above
% 0.61/0.81  % (7161)------------------------------
% 0.61/0.81  % (7161)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.81  % (7161)Termination reason: Refutation
% 0.61/0.81  
% 0.61/0.81  % (7161)Memory used [KB]: 1105
% 0.61/0.81  % (7161)Time elapsed: 0.002 s
% 0.61/0.81  % (7161)Instructions burned: 3 (million)
% 0.61/0.81  % (7161)------------------------------
% 0.61/0.81  % (7161)------------------------------
% 0.61/0.81  % (7092)Success in time 0.439 s
% 0.61/0.81  % Vampire---4.8 exiting
%------------------------------------------------------------------------------