↑ 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  : GEO176+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 : n005.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:48 AM UTC 2026

% Result   : Theorem 0.17s 0.48s
% Output   : Refutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   32 (  10 unt;   2 def)
%            Number of atoms       :   76 (   0 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   72 (  28   ~;  26   |;  12   &)
%                                         (   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    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   37 (   0 sgn  29   !;   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)
        & ( apart_point_and_line(X0,X2)
          | apart_point_and_line(X0,X3) ) )
     => distinct_points(X0,intersection_point(X2,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)
          & ( apart_point_and_line(X0,X2)
            | apart_point_and_line(X0,X3) ) )
       => distinct_points(X0,intersection_point(X2,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] :
      ( ~ distinct_points(X0,intersection_point(X2,X3))
      & distinct_points(X0,X1)
      & convergent_lines(X2,X3)
      & ( apart_point_and_line(X0,X2)
        | apart_point_and_line(X0,X3) ) ),
    inference(ennf_transformation,[],[f14]) ).

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

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

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

fof(f48,plain,
    ( apart_point_and_line(sK0,sK3)
    | apart_point_and_line(sK0,sK2) ),
    inference(cnf_transformation,[],[f33]) ).

fof(f49,plain,
    convergent_lines(sK2,sK3),
    inference(cnf_transformation,[],[f33]) ).

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

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

fof(f57,plain,
    ! [X2,X0,X1] :
      ( ~ distinct_points(X2,intersection_point(X0,X1))
      | apart_point_and_line(X2,X1)
      | ~ convergent_lines(X0,X1) ),
    inference(consistent_polarity_flipping,[],[f42]) ).

fof(f61,plain,
    distinct_points(sK0,intersection_point(sK2,sK3)),
    inference(consistent_polarity_flipping,[],[f51]) ).

fof(f63,plain,
    ( ~ apart_point_and_line(sK0,sK3)
    | ~ apart_point_and_line(sK0,sK2) ),
    inference(consistent_polarity_flipping,[],[f48]) ).

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

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

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

fof(f72,plain,
    ( ~ spl4_1
    | ~ spl4_2 ),
    inference(avatar_split_clause,[],[f63,f69,f65]) ).

fof(f87,plain,
    ( apart_point_and_line(sK0,sK2)
    | ~ convergent_lines(sK2,sK3) ),
    inference(resolution,[],[f56,f61]) ).

fof(f92,plain,
    apart_point_and_line(sK0,sK2),
    inference(forward_subsumption_resolution,[],[f87,f49]) ).

fof(f93,plain,
    spl4_1,
    inference(avatar_split_clause,[],[f92,f65]) ).

fof(f96,plain,
    ( apart_point_and_line(sK0,sK3)
    | ~ convergent_lines(sK2,sK3) ),
    inference(resolution,[],[f57,f61]) ).

fof(f98,plain,
    ( ~ convergent_lines(sK2,sK3)
    | spl4_2 ),
    inference(forward_subsumption_resolution,[],[f96,f71]) ).

fof(f99,plain,
    ( $false
    | spl4_2 ),
    inference(forward_subsumption_resolution,[],[f98,f49]) ).

fof(f100,plain,
    spl4_2,
    inference(avatar_contradiction_clause,[],[f99]) ).

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

cnf(s3,plain,
    spl4_1,
    inference(sat_conversion,[],[f93]) ).

cnf(s4,plain,
    spl4_2,
    inference(sat_conversion,[],[f100]) ).

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

fof(f101,plain,
    $false,
    inference(avatar_sat_refutation,[],[s5]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GEO176+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.39  % Computer : n005.cluster.edu
% 0.12/0.39  % Model    : x86_64 x86_64
% 0.12/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.39  % Memory   : 8046.5625MB
% 0.12/0.39  % OS       : Linux 6.8.0-71-generic
% 0.12/0.39  % CPULimit : 300
% 0.12/0.39  % WCLimit  : 300
% 0.12/0.39  % DateTime : Sun Sep 27 07:23:48 UTC 2026
% 0.12/0.40  % CPUTime  : 
% 0.12/0.40  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.43  Running first-order model finding
% 0.12/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.17/0.48  % (3650461)Will run a generic schedule for satisfiability detection.
% 0.17/0.48  % (3650468)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2092409263:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.48  % (3650467)% WARNING: option uhcvi not known.
% 0.17/0.48  % (3650466)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2601993050_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.48  % (3650467)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1841145961:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.48  % (3650470)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2475299668:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.48  % (3650471)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2173214814:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.48  % (3650469)dis+10_1_sil=32000:sp=arity:random_seed=1202663764:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.48  % (3650472)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3192068828:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/0.48  % TRYING [1]
% 0.17/0.48  % TRYING [2]
% 0.17/0.48  % TRYING [3]
% 0.17/0.48  % (3650467) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3650461-3650467"...
% 0.17/0.48  % (3650469) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3650461-3650469"...
% 0.17/0.48  % TRYING [4]
% 0.17/0.48  % (3650471) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3650461-3650471"...
% 0.17/0.48  % (3650467)...printing done.
% 0.17/0.48  % (3650470) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3650461-3650470"...
% 0.17/0.48  % (3650469)...printing done.
% 0.17/0.48  % TRYING [5]
% 0.17/0.48  % (3650467)Refutation found. Thanks to Tanya!
% 0.17/0.48  % SZS status Theorem for theBenchmark
% 0.17/0.48  % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.48  % (3650467)------------------------------
% 0.17/0.48  % (3650467)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.48  % (3650467)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.48  % (3650467)CaDiCaL version: 2.1.3
% 0.17/0.48  % (3650467)Termination reason: Refutation
% 0.17/0.48  % (3650467)Time elapsed: 0.002 s
% 0.17/0.48  % (3650467)Peak memory usage: 12 MB
% 0.17/0.48  % (3650467)Instructions burned: 2 (million)
% 0.17/0.48  % (3650461)Success in time 0.04 s
% 0.17/0.48  % Vampire exiting
%------------------------------------------------------------------------------