↑ 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  : GEO185+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT

% Computer : n001.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:52 AM UTC 2026

% Result   : Theorem 0.11s 0.46s
% Output   : Refutation 0.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   29 (   9 unt;   2 def)
%            Number of atoms       :   72 (   0 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   77 (  34   ~;  20   |;  17   &)
%                                         (   2 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 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   :   31 (   0 sgn  23   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f8,axiom,
    ! [X0,X1,X2] :
      ( convergent_lines(X0,X1)
     => ( ( apart_point_and_line(X2,X0)
          | apart_point_and_line(X2,X1) )
       => distinct_points(X2,intersection_point(X0,X1)) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO008+0.ax',con2) ).

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

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

fof(f23,plain,
    ! [X0,X1,X2] :
      ( distinct_points(X2,intersection_point(X0,X1))
      | ( ~ apart_point_and_line(X2,X0)
        & ~ apart_point_and_line(X2,X1) )
      | ~ convergent_lines(X0,X1) ),
    inference(ennf_transformation,[],[f8]) ).

fof(f24,plain,
    ! [X0,X1,X2] :
      ( distinct_points(X2,intersection_point(X0,X1))
      | ( ~ apart_point_and_line(X2,X0)
        & ~ apart_point_and_line(X2,X1) )
      | ~ convergent_lines(X0,X1) ),
    inference(flattening,[],[f23]) ).

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

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

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

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

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

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

fof(f50,plain,
    convergent_lines(sK2,sK3),
    inference(cnf_transformation,[],[f34]) ).

fof(f52,plain,
    ( apart_point_and_line(sK0,sK2)
    | apart_point_and_line(sK0,sK3) ),
    inference(cnf_transformation,[],[f34]) ).

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

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

fof(f60,plain,
    ( apart_point_and_line(sK0,sK2)
    | ~ spl4_2 ),
    inference(avatar_component_clause,[],[f58]) ).

fof(f61,plain,
    ( spl4_1
    | spl4_2 ),
    inference(avatar_split_clause,[],[f52,f58,f54]) ).

fof(f85,plain,
    ( ~ apart_point_and_line(sK0,sK3)
    | ~ convergent_lines(sK2,sK3) ),
    inference(resolution,[],[f43,f49]) ).

fof(f88,plain,
    ~ apart_point_and_line(sK0,sK3),
    inference(forward_subsumption_resolution,[],[f85,f50]) ).

fof(f89,plain,
    ~ spl4_1,
    inference(avatar_split_clause,[],[f88,f54]) ).

fof(f91,plain,
    ( ~ apart_point_and_line(sK0,sK2)
    | ~ convergent_lines(sK2,sK3) ),
    inference(resolution,[],[f44,f49]) ).

fof(f94,plain,
    ( ~ convergent_lines(sK2,sK3)
    | ~ spl4_2 ),
    inference(forward_subsumption_resolution,[],[f91,f60]) ).

fof(f95,plain,
    ( $false
    | ~ spl4_2 ),
    inference(forward_subsumption_resolution,[],[f94,f50]) ).

fof(f96,plain,
    ~ spl4_2,
    inference(avatar_contradiction_clause,[],[f95]) ).

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

cnf(s2,plain,
    ~ spl4_1,
    inference(sat_conversion,[],[f89]) ).

cnf(s3,plain,
    ~ spl4_2,
    inference(sat_conversion,[],[f96]) ).

cnf(s4,plain,
    $false,
    inference(rat,[],[s1,s3,s2]) ).

fof(f97,plain,
    $false,
    inference(avatar_sat_refutation,[],[s4]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : GEO185+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.38  % Computer : n001.cluster.edu
% 0.11/0.38  % Model    : x86_64 x86_64
% 0.11/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38  % Memory   : 8046.5625MB
% 0.11/0.38  % 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:33:45 UTC 2026
% 0.11/0.39  % CPUTime  : 
% 0.11/0.39  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.42  Running first-order model finding
% 0.11/0.42  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.11/0.46  % (3222798)Will run a generic schedule for satisfiability detection.
% 0.11/0.46  % (3222806)dis+10_1_sil=32000:sp=arity:random_seed=2596592458:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.11/0.46  % (3222806) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3222798-3222806"...
% 0.11/0.46  % (3222806)...printing done.
% 0.11/0.46  % (3222806)Refutation found. Thanks to Tanya!
% 0.11/0.46  % SZS status Theorem for theBenchmark
% 0.11/0.46  % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.46  % (3222806)------------------------------
% 0.11/0.46  % (3222806)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.46  % (3222806)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.46  % (3222806)CaDiCaL version: 2.1.3
% 0.11/0.46  % (3222806)Termination reason: Refutation
% 0.11/0.46  % (3222806)Time elapsed: 0.002 s
% 0.11/0.46  % (3222806)Peak memory usage: 12 MB
% 0.11/0.46  % (3222806)Instructions burned: 2 (million)
% 0.11/0.46  % (3222798)Success in time 0.031 s
% 0.11/0.46  % Vampire exiting
%------------------------------------------------------------------------------