TSTP Solution File: GEO217+1 by SnakeForV---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : GEO217+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s

% Computer : n006.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 Aug 31 16:09:18 EDT 2022

% Result   : Theorem 1.50s 0.58s
% Output   : Refutation 1.50s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   23 (   7 unt;   0 def)
%            Number of atoms       :   56 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   62 (  29   ~;  14   |;  13   &)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   41 (  32   !;   9   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f103,plain,
    $false,
    inference(unit_resulting_resolution,[],[f63,f52,f89,f56]) ).

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

fof(f44,plain,
    ! [X0,X1,X2] :
      ( convergent_lines(X1,X2)
      | convergent_lines(X0,X2)
      | ~ convergent_lines(X1,X0) ),
    inference(rectify,[],[f42]) ).

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

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

fof(f21,plain,
    ! [X2,X0,X1] :
      ( convergent_lines(X0,X2)
     => ( convergent_lines(X0,X1)
        | convergent_lines(X2,X1) ) ),
    inference(rectify,[],[f6]) ).

fof(f6,axiom,
    ! [X0,X2,X1] :
      ( convergent_lines(X0,X1)
     => ( convergent_lines(X1,X2)
        | convergent_lines(X0,X2) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax6) ).

fof(f89,plain,
    convergent_lines(sK0,sK2),
    inference(subsumption_resolution,[],[f85,f52]) ).

fof(f85,plain,
    ( convergent_lines(sK1,sK1)
    | convergent_lines(sK0,sK2) ),
    inference(resolution,[],[f67,f61]) ).

fof(f61,plain,
    ~ convergent_lines(sK2,sK1),
    inference(cnf_transformation,[],[f50]) ).

fof(f50,plain,
    ( ~ convergent_lines(sK2,sK0)
    & convergent_lines(sK1,sK0)
    & ~ convergent_lines(sK2,sK1) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f34,f49]) ).

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

fof(f34,plain,
    ? [X0,X1,X2] :
      ( ~ convergent_lines(X2,X0)
      & convergent_lines(X1,X0)
      & ~ convergent_lines(X2,X1) ),
    inference(flattening,[],[f33]) ).

fof(f33,plain,
    ? [X1,X2,X0] :
      ( convergent_lines(X1,X0)
      & ~ convergent_lines(X2,X0)
      & ~ convergent_lines(X2,X1) ),
    inference(ennf_transformation,[],[f20]) ).

fof(f20,plain,
    ~ ! [X1,X2,X0] :
        ( ( ~ convergent_lines(X2,X0)
          & ~ convergent_lines(X2,X1) )
       => ~ convergent_lines(X1,X0) ),
    inference(rectify,[],[f19]) ).

fof(f19,negated_conjecture,
    ~ ! [X7,X6,X5] :
        ( ( ~ convergent_lines(X5,X7)
          & ~ convergent_lines(X5,X6) )
       => ~ convergent_lines(X6,X7) ),
    inference(negated_conjecture,[],[f18]) ).

fof(f18,conjecture,
    ! [X7,X6,X5] :
      ( ( ~ convergent_lines(X5,X7)
        & ~ convergent_lines(X5,X6) )
     => ~ convergent_lines(X6,X7) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).

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

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

fof(f62,plain,
    convergent_lines(sK1,sK0),
    inference(cnf_transformation,[],[f50]) ).

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

fof(f3,axiom,
    ! [X0] : ~ convergent_lines(X0,X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',apart3) ).

fof(f63,plain,
    ~ convergent_lines(sK2,sK0),
    inference(cnf_transformation,[],[f50]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : GEO217+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.13/0.34  % Computer : n006.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Mon Aug 29 21:28:55 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 0.19/0.56  % (12000)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.56  % (12020)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 1.50/0.57  % (12020)First to succeed.
% 1.50/0.57  % (12008)lrs+10_1:2_br=off:nm=4:ss=included:urr=on:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 1.50/0.57  % (12015)ott+1010_1:1_sd=2:sos=on:sp=occurrence:ss=axioms:urr=on:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 1.50/0.57  % (12000)Also succeeded, but the first one will report.
% 1.50/0.57  % (12004)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 1.50/0.58  % (12020)Refutation found. Thanks to Tanya!
% 1.50/0.58  % SZS status Theorem for theBenchmark
% 1.50/0.58  % SZS output start Proof for theBenchmark
% See solution above
% 1.50/0.58  % (12020)------------------------------
% 1.50/0.58  % (12020)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.50/0.58  % (12020)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.50/0.58  % (12020)Termination reason: Refutation
% 1.50/0.58  
% 1.50/0.58  % (12020)Memory used [KB]: 1407
% 1.50/0.58  % (12020)Time elapsed: 0.088 s
% 1.50/0.58  % (12020)Instructions burned: 3 (million)
% 1.50/0.58  % (12020)------------------------------
% 1.50/0.58  % (12020)------------------------------
% 1.50/0.58  % (11996)Success in time 0.227 s
%------------------------------------------------------------------------------