↑ Up

Vampire-SAT---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire-SAT---5.0.1
% Problem  : GEO191+3 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT

% Computer : n011.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue Sep 29 09:53:54 AM UTC 2026

% Result   : Theorem 0.19s 0.49s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   49 (  13 unt;   2 def)
%            Number of atoms       :  116 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :  105 (  38   ~;  44   |;  16   &)
%                                         (   2 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   3 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-2 aty)
%            Number of variables   :   75 (   0 sgn  67   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f3,axiom,
    ! [X0] : ~ convergent_lines(X0,X0),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',apart3) ).

fof(f6,axiom,
    ! [X0,X1,X2] :
      ( convergent_lines(X0,X1)
     => ( convergent_lines(X0,X2)
        | convergent_lines(X1,X2) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',ax6) ).

fof(f13,axiom,
    ! [X0,X1,X2] :
      ( apart_point_and_line(X0,X1)
     => ( distinct_lines(X1,X2)
        | apart_point_and_line(X0,X2) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',ceq2) ).

fof(f15,axiom,
    ! [X0,X1] :
      ( distinct_lines(X0,X1)
     => convergent_lines(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+1.ax',p1) ).

fof(f16,axiom,
    ! [X0,X1] : ~ convergent_lines(parallel_through_point(X1,X0),X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+2.ax',cp1) ).

fof(f17,axiom,
    ! [X0,X1] : ~ apart_point_and_line(X0,parallel_through_point(X1,X0)),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+2.ax',cp2) ).

fof(f36,conjecture,
    ! [X0,X1,X2,X3] :
      ( ( convergent_lines(X0,X1)
        & convergent_lines(X2,X3)
        & ( apart_point_and_line(intersection_point(X0,X1),X2)
          | apart_point_and_line(intersection_point(X0,X1),X3) ) )
     => ( apart_point_and_line(intersection_point(X2,X3),X0)
        | apart_point_and_line(intersection_point(X2,X3),X1) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).

fof(f37,negated_conjecture,
    ~ ! [X0,X1,X2,X3] :
        ( ( convergent_lines(X0,X1)
          & convergent_lines(X2,X3)
          & ( apart_point_and_line(intersection_point(X0,X1),X2)
            | apart_point_and_line(intersection_point(X0,X1),X3) ) )
       => ( apart_point_and_line(intersection_point(X2,X3),X0)
          | apart_point_and_line(intersection_point(X2,X3),X1) ) ),
    inference(negated_conjecture,[status(cth)],[f36]) ).

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

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

fof(f52,plain,
    ! [X0,X1,X2] :
      ( distinct_lines(X1,X2)
      | apart_point_and_line(X0,X2)
      | ~ apart_point_and_line(X0,X1) ),
    inference(ennf_transformation,[],[f13]) ).

fof(f53,plain,
    ! [X0,X1,X2] :
      ( distinct_lines(X1,X2)
      | apart_point_and_line(X0,X2)
      | ~ apart_point_and_line(X0,X1) ),
    inference(flattening,[],[f52]) ).

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

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

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

fof(f78,plain,
    ( ~ apart_point_and_line(intersection_point(sK2,sK3),sK0)
    & ~ apart_point_and_line(intersection_point(sK2,sK3),sK1)
    & convergent_lines(sK0,sK1)
    & convergent_lines(sK2,sK3)
    & ( apart_point_and_line(intersection_point(sK0,sK1),sK2)
      | apart_point_and_line(intersection_point(sK0,sK1),sK3) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f77]) ).

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

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

fof(f91,plain,
    ! [X2,X0,X1] :
      ( distinct_lines(X1,X2)
      | apart_point_and_line(X0,X2)
      | ~ apart_point_and_line(X0,X1) ),
    inference(cnf_transformation,[],[f53]) ).

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

fof(f94,plain,
    ! [X0,X1] : ~ convergent_lines(parallel_through_point(X1,X0),X1),
    inference(cnf_transformation,[],[f16]) ).

fof(f95,plain,
    ! [X0,X1] : ~ apart_point_and_line(X0,parallel_through_point(X1,X0)),
    inference(cnf_transformation,[],[f17]) ).

fof(f115,plain,
    ( apart_point_and_line(intersection_point(sK0,sK1),sK2)
    | apart_point_and_line(intersection_point(sK0,sK1),sK3) ),
    inference(cnf_transformation,[],[f78]) ).

fof(f128,plain,
    ! [X2,X0,X1] :
      ( apart_point_and_line(X0,X1)
      | ~ apart_point_and_line(X0,X2)
      | ~ distinct_lines(X1,X2) ),
    inference(consistent_polarity_flipping,[],[f91]) ).

fof(f130,plain,
    ! [X0,X1] :
      ( convergent_lines(X0,X1)
      | distinct_lines(X0,X1) ),
    inference(consistent_polarity_flipping,[],[f93]) ).

fof(f131,plain,
    ! [X0,X1] : apart_point_and_line(X0,parallel_through_point(X1,X0)),
    inference(consistent_polarity_flipping,[],[f95]) ).

fof(f149,plain,
    ( ~ apart_point_and_line(intersection_point(sK0,sK1),sK2)
    | ~ apart_point_and_line(intersection_point(sK0,sK1),sK3) ),
    inference(consistent_polarity_flipping,[],[f115]) ).

fof(f151,definition,
    ( spl4_1
  <=> apart_point_and_line(intersection_point(sK0,sK1),sK3) ),
    introduced(definition,[new_symbols(definition,[spl4_1])],[avatar_definition]) ).

fof(f153,plain,
    ( ~ apart_point_and_line(intersection_point(sK0,sK1),sK3)
    | spl4_1 ),
    inference(avatar_component_clause,[],[f151]) ).

fof(f155,definition,
    ( spl4_2
  <=> apart_point_and_line(intersection_point(sK0,sK1),sK2) ),
    introduced(definition,[new_symbols(definition,[spl4_2])],[avatar_definition]) ).

fof(f157,plain,
    ( ~ apart_point_and_line(intersection_point(sK0,sK1),sK2)
    | spl4_2 ),
    inference(avatar_component_clause,[],[f155]) ).

fof(f158,plain,
    ( ~ spl4_1
    | ~ spl4_2 ),
    inference(avatar_split_clause,[],[f149,f155,f151]) ).

fof(f164,plain,
    ! [X2,X0,X1] :
      ( ~ convergent_lines(X0,parallel_through_point(X1,X2))
      | convergent_lines(X0,X1) ),
    inference(resolution,[],[f84,f94]) ).

fof(f166,plain,
    ! [X2,X0,X1] :
      ( distinct_lines(X0,parallel_through_point(X1,X2))
      | convergent_lines(X0,X1) ),
    inference(resolution,[],[f164,f130]) ).

fof(f177,plain,
    ( ! [X0] :
        ( ~ apart_point_and_line(intersection_point(sK0,sK1),X0)
        | ~ distinct_lines(sK3,X0) )
    | spl4_1 ),
    inference(resolution,[],[f128,f153]) ).

fof(f178,plain,
    ( ! [X0] :
        ( ~ apart_point_and_line(intersection_point(sK0,sK1),X0)
        | ~ distinct_lines(sK2,X0) )
    | spl4_2 ),
    inference(resolution,[],[f128,f157]) ).

fof(f187,plain,
    ( ! [X0] : ~ distinct_lines(sK3,parallel_through_point(X0,intersection_point(sK0,sK1)))
    | spl4_1 ),
    inference(resolution,[],[f177,f131]) ).

fof(f217,plain,
    ( ! [X0] : convergent_lines(sK3,X0)
    | spl4_1 ),
    inference(resolution,[],[f187,f166]) ).

fof(f219,plain,
    ( $false
    | spl4_1 ),
    inference(resolution,[],[f217,f81]) ).

fof(f221,plain,
    spl4_1,
    inference(avatar_contradiction_clause,[],[f219]) ).

fof(f229,plain,
    ( ! [X0] : ~ distinct_lines(sK2,parallel_through_point(X0,intersection_point(sK0,sK1)))
    | spl4_2 ),
    inference(resolution,[],[f178,f131]) ).

fof(f255,plain,
    ( ! [X0] : convergent_lines(sK2,X0)
    | spl4_2 ),
    inference(resolution,[],[f229,f166]) ).

fof(f257,plain,
    ( $false
    | spl4_2 ),
    inference(resolution,[],[f255,f81]) ).

fof(f259,plain,
    spl4_2,
    inference(avatar_contradiction_clause,[],[f257]) ).

cnf(s1,plain,
    ( ~ spl4_1
    | ~ spl4_2 ),
    inference(sat_conversion,[],[f158]) ).

cnf(s5,plain,
    spl4_1,
    inference(sat_conversion,[],[f221]) ).

cnf(s8,plain,
    spl4_2,
    inference(sat_conversion,[],[f259]) ).

cnf(s9,plain,
    $false,
    inference(rat,[],[s1,s8,s5]) ).

fof(f260,plain,
    $false,
    inference(avatar_sat_refutation,[],[s9]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GEO191+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.37  % Computer : n011.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.38  % CPULimit : 300
% 0.11/0.38  % WCLimit  : 300
% 0.11/0.38  % DateTime : Sun Sep 27 07:30:45 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.38  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.43  Running first-order model finding
% 0.11/0.43  Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.49  % (2065705)Will run a generic schedule for satisfiability detection.
% 0.19/0.49  % (2065710)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1937434854_2999 on theBenchmark for (2999ds/0Mi)
% 0.19/0.49  % TRYING [1]
% 0.19/0.49  % TRYING [2]
% 0.19/0.49  % TRYING [3]
% 0.19/0.49  % TRYING [4]
% 0.19/0.49  % (2065711)% WARNING: option uhcvi not known.
% 0.19/0.49  % TRYING [5]
% 0.19/0.49  % (2065711)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2600206159:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.49  % (2065712)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2865783869:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.49  % (2065716)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1903032367:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.19/0.49  % (2065713)dis+10_1_sil=32000:sp=arity:random_seed=4208959217:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.19/0.49  % TRYING [6]
% 0.19/0.49  % (2065714)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4093143347:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.49  % (2065715)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2968214798:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.49  % (2065716) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2065705-2065716"...
% 0.19/0.49  % (2065716)...printing done.
% 0.19/0.49  % (2065716)Refutation found. Thanks to Tanya!
% 0.19/0.49  % SZS status Theorem for theBenchmark
% 0.19/0.49  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.49  % (2065716)------------------------------
% 0.19/0.49  % (2065716)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.49  % (2065716)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.49  % (2065716)CaDiCaL version: 2.1.3
% 0.19/0.49  % (2065716)Termination reason: Refutation
% 0.19/0.49  % (2065716)Time elapsed: 0.006 s
% 0.19/0.49  % (2065716)Peak memory usage: 12 MB
% 0.19/0.49  % (2065716)Instructions burned: 5 (million)
% 0.19/0.49  % (2065705)Success in time 0.046 s
% 0.19/0.49  % Vampire exiting
%------------------------------------------------------------------------------