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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : GEO176+1 : TPTP v8.1.2. Released v3.3.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 05:10:12 EDT 2024

% Result   : Theorem 0.61s 0.80s
% Output   : Refutation 0.61s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   33 (   6 unt;   0 def)
%            Number of atoms       :   90 (   0 equ)
%            Maximal formula atoms :   10 (   2 avg)
%            Number of connectives :   90 (  33   ~;  27   |;  21   &)
%                                         (   2 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   3 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   49 (  37   !;  12   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f61,plain,
    $false,
    inference(avatar_sat_refutation,[],[f49,f58,f60]) ).

fof(f60,plain,
    ~ spl4_1,
    inference(avatar_split_clause,[],[f59,f42]) ).

fof(f42,plain,
    ( spl4_1
  <=> apart_point_and_line(sK0,sK2) ),
    introduced(avatar_definition,[new_symbols(naming,[spl4_1])]) ).

fof(f59,plain,
    ~ apart_point_and_line(sK0,sK2),
    inference(subsumption_resolution,[],[f55,f31]) ).

fof(f31,plain,
    convergent_lines(sK2,sK3),
    inference(cnf_transformation,[],[f29]) ).

fof(f29,plain,
    ( ~ distinct_points(sK0,intersection_point(sK2,sK3))
    & ( apart_point_and_line(sK0,sK3)
      | apart_point_and_line(sK0,sK2) )
    & convergent_lines(sK2,sK3)
    & distinct_points(sK0,sK1) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f19,f28]) ).

fof(f28,plain,
    ( ? [X0,X1,X2,X3] :
        ( ~ distinct_points(X0,intersection_point(X2,X3))
        & ( apart_point_and_line(X0,X3)
          | apart_point_and_line(X0,X2) )
        & convergent_lines(X2,X3)
        & distinct_points(X0,X1) )
   => ( ~ distinct_points(sK0,intersection_point(sK2,sK3))
      & ( apart_point_and_line(sK0,sK3)
        | apart_point_and_line(sK0,sK2) )
      & convergent_lines(sK2,sK3)
      & distinct_points(sK0,sK1) ) ),
    introduced(choice_axiom,[]) ).

fof(f19,plain,
    ? [X0,X1,X2,X3] :
      ( ~ distinct_points(X0,intersection_point(X2,X3))
      & ( apart_point_and_line(X0,X3)
        | apart_point_and_line(X0,X2) )
      & convergent_lines(X2,X3)
      & distinct_points(X0,X1) ),
    inference(flattening,[],[f18]) ).

fof(f18,plain,
    ? [X0,X1,X2,X3] :
      ( ~ distinct_points(X0,intersection_point(X2,X3))
      & ( apart_point_and_line(X0,X3)
        | apart_point_and_line(X0,X2) )
      & convergent_lines(X2,X3)
      & distinct_points(X0,X1) ),
    inference(ennf_transformation,[],[f17]) ).

fof(f17,plain,
    ~ ! [X0,X1,X2,X3] :
        ( ( ( apart_point_and_line(X0,X3)
            | apart_point_and_line(X0,X2) )
          & convergent_lines(X2,X3)
          & distinct_points(X0,X1) )
       => distinct_points(X0,intersection_point(X2,X3)) ),
    inference(rectify,[],[f16]) ).

fof(f16,negated_conjecture,
    ~ ! [X0,X1,X3,X4] :
        ( ( ( apart_point_and_line(X0,X4)
            | apart_point_and_line(X0,X3) )
          & convergent_lines(X3,X4)
          & distinct_points(X0,X1) )
       => distinct_points(X0,intersection_point(X3,X4)) ),
    inference(negated_conjecture,[],[f15]) ).

fof(f15,conjecture,
    ! [X0,X1,X3,X4] :
      ( ( ( apart_point_and_line(X0,X4)
          | apart_point_and_line(X0,X3) )
        & convergent_lines(X3,X4)
        & distinct_points(X0,X1) )
     => distinct_points(X0,intersection_point(X3,X4)) ),
    file('/export/starexec/sandbox2/tmp/tmp.4pVypsxZRK/Vampire---4.8_24561',con) ).

fof(f55,plain,
    ( ~ apart_point_and_line(sK0,sK2)
    | ~ convergent_lines(sK2,sK3) ),
    inference(resolution,[],[f51,f38]) ).

fof(f38,plain,
    ! [X0,X1] :
      ( ~ apart_point_and_line(intersection_point(X0,X1),X0)
      | ~ convergent_lines(X0,X1) ),
    inference(cnf_transformation,[],[f25]) ).

fof(f25,plain,
    ! [X0,X1] :
      ( ~ apart_point_and_line(intersection_point(X0,X1),X0)
      | ~ convergent_lines(X0,X1) ),
    inference(ennf_transformation,[],[f9]) ).

fof(f9,axiom,
    ! [X0,X1] :
      ( convergent_lines(X0,X1)
     => ~ apart_point_and_line(intersection_point(X0,X1),X0) ),
    file('/export/starexec/sandbox2/tmp/tmp.4pVypsxZRK/Vampire---4.8_24561',ci3) ).

fof(f51,plain,
    ! [X0] :
      ( apart_point_and_line(intersection_point(sK2,sK3),X0)
      | ~ apart_point_and_line(sK0,X0) ),
    inference(resolution,[],[f33,f34]) ).

fof(f34,plain,
    ! [X2,X0,X1] :
      ( distinct_points(X0,X2)
      | apart_point_and_line(X2,X1)
      | ~ apart_point_and_line(X0,X1) ),
    inference(cnf_transformation,[],[f21]) ).

fof(f21,plain,
    ! [X0,X1,X2] :
      ( apart_point_and_line(X2,X1)
      | distinct_points(X0,X2)
      | ~ apart_point_and_line(X0,X1) ),
    inference(flattening,[],[f20]) ).

fof(f20,plain,
    ! [X0,X1,X2] :
      ( apart_point_and_line(X2,X1)
      | distinct_points(X0,X2)
      | ~ apart_point_and_line(X0,X1) ),
    inference(ennf_transformation,[],[f12]) ).

fof(f12,axiom,
    ! [X0,X1,X2] :
      ( apart_point_and_line(X0,X1)
     => ( apart_point_and_line(X2,X1)
        | distinct_points(X0,X2) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.4pVypsxZRK/Vampire---4.8_24561',ceq1) ).

fof(f33,plain,
    ~ distinct_points(sK0,intersection_point(sK2,sK3)),
    inference(cnf_transformation,[],[f29]) ).

fof(f58,plain,
    ~ spl4_2,
    inference(avatar_contradiction_clause,[],[f57]) ).

fof(f57,plain,
    ( $false
    | ~ spl4_2 ),
    inference(subsumption_resolution,[],[f56,f31]) ).

fof(f56,plain,
    ( ~ convergent_lines(sK2,sK3)
    | ~ spl4_2 ),
    inference(subsumption_resolution,[],[f54,f48]) ).

fof(f48,plain,
    ( apart_point_and_line(sK0,sK3)
    | ~ spl4_2 ),
    inference(avatar_component_clause,[],[f46]) ).

fof(f46,plain,
    ( spl4_2
  <=> apart_point_and_line(sK0,sK3) ),
    introduced(avatar_definition,[new_symbols(naming,[spl4_2])]) ).

fof(f54,plain,
    ( ~ apart_point_and_line(sK0,sK3)
    | ~ convergent_lines(sK2,sK3) ),
    inference(resolution,[],[f51,f37]) ).

fof(f37,plain,
    ! [X0,X1] :
      ( ~ apart_point_and_line(intersection_point(X0,X1),X1)
      | ~ convergent_lines(X0,X1) ),
    inference(cnf_transformation,[],[f24]) ).

fof(f24,plain,
    ! [X0,X1] :
      ( ~ apart_point_and_line(intersection_point(X0,X1),X1)
      | ~ convergent_lines(X0,X1) ),
    inference(ennf_transformation,[],[f10]) ).

fof(f10,axiom,
    ! [X0,X1] :
      ( convergent_lines(X0,X1)
     => ~ apart_point_and_line(intersection_point(X0,X1),X1) ),
    file('/export/starexec/sandbox2/tmp/tmp.4pVypsxZRK/Vampire---4.8_24561',ci4) ).

fof(f49,plain,
    ( spl4_1
    | spl4_2 ),
    inference(avatar_split_clause,[],[f32,f46,f42]) ).

fof(f32,plain,
    ( apart_point_and_line(sK0,sK3)
    | apart_point_and_line(sK0,sK2) ),
    inference(cnf_transformation,[],[f29]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : GEO176+1 : TPTP v8.1.2. Released v3.3.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.14/0.36  % Computer : n007.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit   : 300
% 0.14/0.36  % WCLimit    : 300
% 0.14/0.36  % DateTime   : Fri May  3 22:03:08 EDT 2024
% 0.14/0.36  % CPUTime    : 
% 0.14/0.36  This is a FOF_THM_RFO_NEQ problem
% 0.14/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.4pVypsxZRK/Vampire---4.8_24561
% 0.61/0.80  % (24806)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.80  % (24811)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.80  % (24811)First to succeed.
% 0.61/0.80  % (24806)Also succeeded, but the first one will report.
% 0.61/0.80  % (24804)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.80  % (24805)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.80  % (24808)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.80  % (24807)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.80  % (24809)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.80  % (24810)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.80  % (24811)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-24772"
% 0.61/0.80  % (24811)Refutation found. Thanks to Tanya!
% 0.61/0.80  % SZS status Theorem for Vampire---4
% 0.61/0.80  % SZS output start Proof for Vampire---4
% See solution above
% 0.61/0.80  % (24811)------------------------------
% 0.61/0.80  % (24811)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.80  % (24811)Termination reason: Refutation
% 0.61/0.80  
% 0.61/0.80  % (24811)Memory used [KB]: 987
% 0.61/0.80  % (24811)Time elapsed: 0.002 s
% 0.61/0.80  % (24811)Instructions burned: 3 (million)
% 0.61/0.80  % (24772)Success in time 0.432 s
% 0.61/0.80  % Vampire---4.8 exiting
%------------------------------------------------------------------------------