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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : GEO252+3 : TPTP v8.2.0. 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 : n029.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 : Mon May 20 20:09:48 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
fof(f102,plain,
    $false,
    inference(subsumption_resolution,[],[f77,f86]) ).

fof(f86,plain,
    ! [X0,X1] : ~ left_apart_point(X0,X1),
    inference(cnf_transformation,[],[f61]) ).

fof(f61,plain,
    ! [X0,X1] :
      ( ~ left_apart_point(X0,reverse_line(X1))
      & ~ left_apart_point(X0,X1) ),
    inference(ennf_transformation,[],[f43]) ).

fof(f43,plain,
    ! [X0,X1] :
      ~ ( left_apart_point(X0,reverse_line(X1))
        | left_apart_point(X0,X1) ),
    inference(rectify,[],[f20]) ).

fof(f20,axiom,
    ! [X2,X3] :
      ~ ( left_apart_point(X2,reverse_line(X3))
        | left_apart_point(X2,X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax10_basics) ).

fof(f77,plain,
    left_apart_point(sK0,sK2),
    inference(cnf_transformation,[],[f75]) ).

fof(f75,plain,
    ( ( ~ left_convergent_lines(line_connecting(sK0,sK1),sK2)
      | ~ distinct_points(sK0,sK1) )
    & right_apart_point(sK1,sK2)
    & left_apart_point(sK0,sK2) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f55,f74]) ).

fof(f74,plain,
    ( ? [X0,X1,X2] :
        ( ( ~ left_convergent_lines(line_connecting(X0,X1),X2)
          | ~ distinct_points(X0,X1) )
        & right_apart_point(X1,X2)
        & left_apart_point(X0,X2) )
   => ( ( ~ left_convergent_lines(line_connecting(sK0,sK1),sK2)
        | ~ distinct_points(sK0,sK1) )
      & right_apart_point(sK1,sK2)
      & left_apart_point(sK0,sK2) ) ),
    introduced(choice_axiom,[]) ).

fof(f55,plain,
    ? [X0,X1,X2] :
      ( ( ~ left_convergent_lines(line_connecting(X0,X1),X2)
        | ~ distinct_points(X0,X1) )
      & right_apart_point(X1,X2)
      & left_apart_point(X0,X2) ),
    inference(flattening,[],[f54]) ).

fof(f54,plain,
    ? [X0,X1,X2] :
      ( ( ~ left_convergent_lines(line_connecting(X0,X1),X2)
        | ~ distinct_points(X0,X1) )
      & right_apart_point(X1,X2)
      & left_apart_point(X0,X2) ),
    inference(ennf_transformation,[],[f39]) ).

fof(f39,plain,
    ~ ! [X0,X1,X2] :
        ( ( right_apart_point(X1,X2)
          & left_apart_point(X0,X2) )
       => ( left_convergent_lines(line_connecting(X0,X1),X2)
          & distinct_points(X0,X1) ) ),
    inference(rectify,[],[f38]) ).

fof(f38,negated_conjecture,
    ~ ! [X2,X5,X3] :
        ( ( right_apart_point(X5,X3)
          & left_apart_point(X2,X3) )
       => ( left_convergent_lines(line_connecting(X2,X5),X3)
          & distinct_points(X2,X5) ) ),
    inference(negated_conjecture,[],[f37]) ).

fof(f37,conjecture,
    ! [X2,X5,X3] :
      ( ( right_apart_point(X5,X3)
        & left_apart_point(X2,X3) )
     => ( left_convergent_lines(line_connecting(X2,X5),X3)
        & distinct_points(X2,X5) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : GEO252+3 : TPTP v8.2.0. Released v4.0.0.
% 0.11/0.14  % 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.34  % Computer : n029.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit   : 300
% 0.14/0.34  % WCLimit    : 300
% 0.14/0.34  % DateTime   : Sun May 19 15:19:08 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.14/0.35  This is a FOF_THM_RFO_NEQ problem
% 0.14/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.63/0.79  % (4332)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2995ds/45Mi)
% 0.63/0.79  % (4332)First to succeed.
% 0.63/0.79  % (4327)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 (2995ds/34Mi)
% 0.63/0.79  % (4329)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.63/0.79  % (4330)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2995ds/33Mi)
% 0.63/0.79  % (4328)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 (2995ds/51Mi)
% 0.63/0.79  % (4332)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-4326"
% 0.63/0.79  % (4331)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 (2995ds/34Mi)
% 0.63/0.79  % (4332)Refutation found. Thanks to Tanya!
% 0.63/0.79  % SZS status Theorem for theBenchmark
% 0.63/0.79  % SZS output start Proof for theBenchmark
% See solution above
% 0.63/0.79  % (4332)------------------------------
% 0.63/0.79  % (4332)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.63/0.79  % (4332)Termination reason: Refutation
% 0.63/0.79  
% 0.63/0.79  % (4332)Memory used [KB]: 1050
% 0.63/0.79  % (4332)Time elapsed: 0.002 s
% 0.63/0.79  % (4332)Instructions burned: 3 (million)
% 0.63/0.79  % (4326)Success in time 0.433 s
% 0.63/0.79  % Vampire---4.8 exiting
%------------------------------------------------------------------------------