↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : GEO192+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n002.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:51:54 AM UTC 2026

% Result   : Theorem 3.41s 1.23s
% Output   : Refutation 3.41s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   48 (  12 unt;   2 def)
%            Number of atoms       :  106 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   99 (  41   ~;  40   |;   8   &)
%                                         (   2 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   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   :   54 (   0 sgn  48   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f2,axiom,
    ! [X0] : ~ distinct_lines(X0,X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',apart2) ).

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

fof(f9,axiom,
    ! [X0,X1] :
      ( convergent_lines(X0,X1)
     => ~ apart_point_and_line(intersection_point(X0,X1),X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ci3) ).

fof(f10,axiom,
    ! [X0,X1] :
      ( convergent_lines(X0,X1)
     => ~ apart_point_and_line(intersection_point(X0,X1),X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ci4) ).

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/sandbox/benchmark/theBenchmark.p',ceq2) ).

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

fof(f16,negated_conjecture,
    ~ ! [X0,X1,X2] :
        ( convergent_lines(X0,X1)
       => ( apart_point_and_line(intersection_point(X0,X1),X2)
         => ( distinct_lines(X0,X2)
            & distinct_lines(X1,X2) ) ) ),
    inference(negated_conjecture,[status(cth)],[f15]) ).

fof(f17,plain,
    ? [X0,X1,X2] :
      ( ( ~ distinct_lines(X0,X2)
        | ~ distinct_lines(X1,X2) )
      & apart_point_and_line(intersection_point(X0,X1),X2)
      & convergent_lines(X0,X1) ),
    inference(ennf_transformation,[],[f16]) ).

fof(f18,plain,
    ? [X0,X1,X2] :
      ( ( ~ distinct_lines(X0,X2)
        | ~ distinct_lines(X1,X2) )
      & apart_point_and_line(intersection_point(X0,X1),X2)
      & convergent_lines(X0,X1) ),
    inference(flattening,[],[f17]) ).

fof(f19,plain,
    ! [X0,X1] :
      ( ~ apart_point_and_line(intersection_point(X0,X1),X1)
      | ~ convergent_lines(X0,X1) ),
    inference(ennf_transformation,[],[f10]) ).

fof(f20,plain,
    ! [X0,X1] :
      ( ~ apart_point_and_line(intersection_point(X0,X1),X0)
      | ~ convergent_lines(X0,X1) ),
    inference(ennf_transformation,[],[f9]) ).

fof(f23,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(f24,plain,
    ! [X0,X1,X2] :
      ( distinct_lines(X1,X2)
      | apart_point_and_line(X0,X2)
      | ~ apart_point_and_line(X0,X1) ),
    inference(flattening,[],[f23]) ).

fof(f27,plain,
    ! [X0,X1,X2] :
      ( distinct_lines(X0,X2)
      | distinct_lines(X1,X2)
      | ~ distinct_lines(X0,X1) ),
    inference(ennf_transformation,[],[f5]) ).

fof(f28,plain,
    ! [X0,X1,X2] :
      ( distinct_lines(X0,X2)
      | distinct_lines(X1,X2)
      | ~ distinct_lines(X0,X1) ),
    inference(flattening,[],[f27]) ).

fof(f37,plain,
    ( ( ~ distinct_lines(sK0,sK2)
      | ~ distinct_lines(sK1,sK2) )
    & apart_point_and_line(intersection_point(sK0,sK1),sK2)
    & convergent_lines(sK0,sK1) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f18]) ).

fof(f38,plain,
    convergent_lines(sK0,sK1),
    inference(cnf_transformation,[],[f37]) ).

fof(f39,plain,
    apart_point_and_line(intersection_point(sK0,sK1),sK2),
    inference(cnf_transformation,[],[f37]) ).

fof(f40,plain,
    ( ~ distinct_lines(sK0,sK2)
    | ~ distinct_lines(sK1,sK2) ),
    inference(cnf_transformation,[],[f37]) ).

fof(f41,plain,
    ! [X0,X1] :
      ( ~ convergent_lines(X0,X1)
      | ~ apart_point_and_line(intersection_point(X0,X1),X1) ),
    inference(cnf_transformation,[],[f19]) ).

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

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

fof(f46,plain,
    ! [X2,X0,X1] :
      ( distinct_lines(X1,X2)
      | distinct_lines(X0,X2)
      | ~ distinct_lines(X0,X1) ),
    inference(cnf_transformation,[],[f28]) ).

fof(f47,plain,
    ! [X0] : ~ distinct_lines(X0,X0),
    inference(cnf_transformation,[],[f2]) ).

fof(f56,definition,
    ( spl3_1
  <=> distinct_lines(sK1,sK2) ),
    introduced(definition,[new_symbols(definition,[spl3_1])],[avatar_definition]) ).

fof(f57,plain,
    ( ~ distinct_lines(sK1,sK2)
    | spl3_1 ),
    inference(avatar_component_clause,[],[f56]) ).

fof(f59,definition,
    ( spl3_2
  <=> distinct_lines(sK0,sK2) ),
    introduced(definition,[new_symbols(definition,[spl3_2])],[avatar_definition]) ).

fof(f60,plain,
    ( ~ distinct_lines(sK0,sK2)
    | spl3_2 ),
    inference(avatar_component_clause,[],[f59]) ).

fof(f61,plain,
    ( ~ spl3_1
    | ~ spl3_2 ),
    inference(avatar_split_clause,[],[f40,f59,f56]) ).

fof(f62,plain,
    ~ apart_point_and_line(intersection_point(sK0,sK1),sK1),
    inference(resolution,[],[f41,f38]) ).

fof(f63,plain,
    ~ apart_point_and_line(intersection_point(sK0,sK1),sK0),
    inference(resolution,[],[f42,f38]) ).

fof(f71,plain,
    ( ! [X0] :
        ( distinct_lines(X0,sK2)
        | ~ distinct_lines(X0,sK1) )
    | spl3_1 ),
    inference(resolution,[],[f46,f57]) ).

fof(f74,plain,
    ( ~ distinct_lines(sK2,sK1)
    | spl3_1 ),
    inference(resolution,[],[f71,f47]) ).

fof(f76,plain,
    ( ! [X0] :
        ( ~ apart_point_and_line(X0,sK2)
        | apart_point_and_line(X0,sK1) )
    | spl3_1 ),
    inference(resolution,[],[f74,f44]) ).

fof(f80,plain,
    ( apart_point_and_line(intersection_point(sK0,sK1),sK1)
    | spl3_1 ),
    inference(resolution,[],[f76,f39]) ).

fof(f82,plain,
    ( $false
    | spl3_1 ),
    inference(resolution,[],[f80,f62]) ).

fof(f83,plain,
    spl3_1,
    inference(avatar_contradiction_clause,[],[f82]) ).

fof(f84,plain,
    ( ! [X0] :
        ( distinct_lines(X0,sK2)
        | ~ distinct_lines(X0,sK0) )
    | spl3_2 ),
    inference(resolution,[],[f60,f46]) ).

fof(f86,plain,
    ( ~ distinct_lines(sK2,sK0)
    | spl3_2 ),
    inference(resolution,[],[f84,f47]) ).

fof(f89,plain,
    ( ! [X0] :
        ( ~ apart_point_and_line(X0,sK2)
        | apart_point_and_line(X0,sK0) )
    | spl3_2 ),
    inference(resolution,[],[f86,f44]) ).

fof(f93,plain,
    ( apart_point_and_line(intersection_point(sK0,sK1),sK0)
    | spl3_2 ),
    inference(resolution,[],[f89,f39]) ).

fof(f95,plain,
    ( $false
    | spl3_2 ),
    inference(resolution,[],[f93,f63]) ).

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

cnf(s1,plain,
    ( ~ spl3_1
    | ~ spl3_2 ),
    inference(sat_conversion,[],[f61]) ).

cnf(s2,plain,
    spl3_1,
    inference(sat_conversion,[],[f83]) ).

cnf(s3,plain,
    spl3_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  : GEO192+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.36  % Computer : n002.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Sun Sep 27 07:33:21 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.40  Running first-order theorem proving
% 0.09/0.40  Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.41/1.23  % (3206633)Detected formulas, will run a generic FOF schedule.
% 3.41/1.23  % (3206643)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2536136814:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.41/1.23  % (3206644)dis-21_1_sil=8000:lcm=predicate:random_seed=952432976:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 3.41/1.23  % (3206638)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=2924535795:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.41/1.23  % (3206641)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=468732657:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.41/1.23  % (3206642)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3955427578:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.41/1.23  % (3206640)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=4068210788:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.41/1.23  % (3206639)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=1897539556:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.41/1.23  % (3206642)Also succeeded, but the first one will report.
% 3.41/1.23  % (3206644)First to succeed.
% 3.41/1.23  % (3206641)Also succeeded, but the first one will report.
% 3.41/1.23  % (3206643)Also succeeded, but the first one will report.
% 3.41/1.23  % (3206644)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3206633"
% 3.41/1.23  % (3206644)Refutation found. Thanks to Tanya!
% 3.41/1.23  % SZS status Theorem for theBenchmark
% 3.41/1.23  % SZS output start Proof for theBenchmark
% See solution above
% 3.41/1.23  % (3206644)------------------------------
% 3.41/1.23  % (3206644)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.41/1.23  % (3206644)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.41/1.23  % (3206644)CaDiCaL version: 2.1.3
% 3.41/1.23  % (3206644)Termination reason: Refutation
% 3.41/1.23  % (3206644)Time elapsed: 0.003 s
% 3.41/1.23  % (3206644)Peak memory usage: 89 MB
% 3.41/1.23  % (3206644)Instructions burned: 2 (million)
% 3.41/1.23  % (3206644)------------------------------
% 3.41/1.23  % (3206644)------------------------------
% 3.41/1.23  % (3206633)Success in time 0.426 s
% 3.41/1.23  % Vampire exiting
%------------------------------------------------------------------------------