↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : GEO194+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 : n016.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:55 AM UTC 2026

% Result   : Theorem 3.10s 1.33s
% Output   : Refutation 3.74s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   20
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   53 (  12 unt;   1 def)
%            Number of atoms       :  154 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :  150 (  49   ~;  74   |;  17   &)
%                                         (   1 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   2 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   84 (   0 sgn  78   !;   6   ?)

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

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(f11,axiom,
    ! [X0,X1,X2,X3] :
      ( ( distinct_points(X0,X1)
        & distinct_lines(X2,X3) )
     => ( apart_point_and_line(X0,X2)
        | apart_point_and_line(X0,X3)
        | apart_point_and_line(X1,X2)
        | apart_point_and_line(X1,X3) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cu1) ).

fof(f12,axiom,
    ! [X0,X1,X2] :
      ( apart_point_and_line(X0,X1)
     => ( distinct_points(X0,X2)
        | apart_point_and_line(X2,X1) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ceq1) ).

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

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

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

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

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

fof(f27,plain,
    ! [X0,X1,X2,X3] :
      ( apart_point_and_line(X0,X2)
      | apart_point_and_line(X0,X3)
      | apart_point_and_line(X1,X2)
      | apart_point_and_line(X1,X3)
      | ~ distinct_points(X0,X1)
      | ~ distinct_lines(X2,X3) ),
    inference(ennf_transformation,[],[f11]) ).

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

fof(f29,plain,
    ! [X0,X1,X2] :
      ( distinct_points(X0,X2)
      | apart_point_and_line(X2,X1)
      | ~ apart_point_and_line(X0,X1) ),
    inference(ennf_transformation,[],[f12]) ).

fof(f30,plain,
    ! [X0,X1,X2] :
      ( distinct_points(X0,X2)
      | apart_point_and_line(X2,X1)
      | ~ apart_point_and_line(X0,X1) ),
    inference(flattening,[],[f29]) ).

fof(f33,plain,
    ! [X0,X1,X2] :
      ( distinct_lines(X1,X2)
      | convergent_lines(X0,X2)
      | ~ convergent_lines(X0,X1) ),
    inference(ennf_transformation,[],[f14]) ).

fof(f34,plain,
    ! [X0,X1,X2] :
      ( distinct_lines(X1,X2)
      | convergent_lines(X0,X2)
      | ~ convergent_lines(X0,X1) ),
    inference(flattening,[],[f33]) ).

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

fof(f36,plain,
    ? [X0,X1,X2] :
      ( ~ apart_point_and_line(intersection_point(X0,X2),X1)
      & apart_point_and_line(intersection_point(X0,X1),X2)
      & convergent_lines(X0,X1)
      & convergent_lines(X2,X1)
      & convergent_lines(X0,X2) ),
    inference(flattening,[],[f35]) ).

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

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

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

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

fof(f48,plain,
    ! [X2,X3,X0,X1] :
      ( ~ distinct_lines(X2,X3)
      | apart_point_and_line(X0,X3)
      | apart_point_and_line(X1,X2)
      | apart_point_and_line(X1,X3)
      | ~ distinct_points(X0,X1)
      | apart_point_and_line(X0,X2) ),
    inference(cnf_transformation,[],[f28]) ).

fof(f49,plain,
    ! [X2,X0,X1] :
      ( ~ apart_point_and_line(X0,X1)
      | apart_point_and_line(X2,X1)
      | distinct_points(X0,X2) ),
    inference(cnf_transformation,[],[f30]) ).

fof(f51,plain,
    ! [X2,X0,X1] :
      ( convergent_lines(X0,X2)
      | distinct_lines(X1,X2)
      | ~ convergent_lines(X0,X1) ),
    inference(cnf_transformation,[],[f34]) ).

fof(f52,plain,
    convergent_lines(sK0,sK2),
    inference(cnf_transformation,[],[f37]) ).

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

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

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

fof(f58,plain,
    ! [X0] :
      ( distinct_points(intersection_point(sK0,sK1),X0)
      | apart_point_and_line(X0,sK2) ),
    inference(resolution,[],[f49,f55]) ).

fof(f62,plain,
    ! [X0,X1] :
      ( distinct_lines(X0,X1)
      | ~ convergent_lines(X1,X0) ),
    inference(resolution,[],[f51,f40]) ).

fof(f68,plain,
    ! [X2,X3,X0,X1] :
      ( ~ distinct_points(X2,X3)
      | apart_point_and_line(X2,X0)
      | apart_point_and_line(X3,X1)
      | apart_point_and_line(X3,X0)
      | ~ convergent_lines(X0,X1)
      | apart_point_and_line(X2,X1) ),
    inference(resolution,[],[f62,f48]) ).

fof(f83,plain,
    ! [X2,X0,X1] :
      ( apart_point_and_line(X1,sK2)
      | apart_point_and_line(X1,X2)
      | apart_point_and_line(X1,X0)
      | ~ convergent_lines(X0,X2)
      | apart_point_and_line(intersection_point(sK0,sK1),X2)
      | apart_point_and_line(intersection_point(sK0,sK1),X0) ),
    inference(resolution,[],[f68,f58]) ).

fof(f96,plain,
    ! [X2,X0,X1] :
      ( ~ convergent_lines(X0,sK2)
      | apart_point_and_line(intersection_point(X0,sK2),X2)
      | ~ convergent_lines(X2,X1)
      | apart_point_and_line(intersection_point(sK0,sK1),X1)
      | apart_point_and_line(intersection_point(sK0,sK1),X2)
      | apart_point_and_line(intersection_point(X0,sK2),X1) ),
    inference(resolution,[],[f83,f47]) ).

fof(f191,plain,
    ! [X0,X1] :
      ( apart_point_and_line(intersection_point(sK0,sK1),X1)
      | ~ convergent_lines(X0,X1)
      | apart_point_and_line(intersection_point(sK0,sK2),X0)
      | apart_point_and_line(intersection_point(sK0,sK1),X0)
      | apart_point_and_line(intersection_point(sK0,sK2),X1) ),
    inference(resolution,[],[f96,f52]) ).

fof(f406,plain,
    ! [X0] :
      ( ~ convergent_lines(X0,sK1)
      | apart_point_and_line(intersection_point(sK0,sK2),X0)
      | apart_point_and_line(intersection_point(sK0,sK1),X0)
      | apart_point_and_line(intersection_point(sK0,sK2),sK1)
      | ~ convergent_lines(sK0,sK1) ),
    inference(resolution,[],[f191,f47]) ).

fof(f411,plain,
    ! [X0] :
      ( ~ convergent_lines(X0,sK1)
      | apart_point_and_line(intersection_point(sK0,sK2),X0)
      | apart_point_and_line(intersection_point(sK0,sK1),X0)
      | ~ convergent_lines(sK0,sK1) ),
    inference(forward_subsumption_resolution,[],[f406,f56]) ).

fof(f413,plain,
    ! [X0] :
      ( ~ convergent_lines(X0,sK1)
      | apart_point_and_line(intersection_point(sK0,sK2),X0)
      | apart_point_and_line(intersection_point(sK0,sK1),X0) ),
    inference(forward_subsumption_resolution,[],[f411,f54]) ).

fof(f415,definition,
    ( spl3_12
  <=> apart_point_and_line(intersection_point(sK0,sK2),sK0) ),
    introduced(definition,[new_symbols(definition,[spl3_12])],[avatar_definition]) ).

fof(f416,plain,
    ( ~ apart_point_and_line(intersection_point(sK0,sK2),sK0)
    | spl3_12 ),
    inference(avatar_component_clause,[],[f415]) ).

fof(f417,plain,
    ( apart_point_and_line(intersection_point(sK0,sK2),sK0)
    | ~ spl3_12 ),
    inference(avatar_component_clause,[],[f415]) ).

fof(f433,plain,
    ( ~ convergent_lines(sK0,sK2)
    | ~ spl3_12 ),
    inference(resolution,[],[f417,f46]) ).

fof(f436,plain,
    ( $false
    | ~ spl3_12 ),
    inference(forward_subsumption_resolution,[],[f433,f52]) ).

fof(f437,plain,
    ~ spl3_12,
    inference(avatar_contradiction_clause,[],[f436]) ).

fof(f495,plain,
    ( apart_point_and_line(intersection_point(sK0,sK2),sK0)
    | apart_point_and_line(intersection_point(sK0,sK1),sK0) ),
    inference(resolution,[],[f413,f54]) ).

fof(f500,plain,
    ( apart_point_and_line(intersection_point(sK0,sK1),sK0)
    | spl3_12 ),
    inference(forward_subsumption_resolution,[],[f495,f416]) ).

fof(f506,plain,
    ( ~ convergent_lines(sK0,sK1)
    | spl3_12 ),
    inference(resolution,[],[f500,f46]) ).

fof(f509,plain,
    ( $false
    | spl3_12 ),
    inference(forward_subsumption_resolution,[],[f506,f54]) ).

fof(f510,plain,
    spl3_12,
    inference(avatar_contradiction_clause,[],[f509]) ).

cnf(s11,plain,
    ~ spl3_12,
    inference(sat_conversion,[],[f437]) ).

cnf(s12,plain,
    spl3_12,
    inference(sat_conversion,[],[f510]) ).

cnf(s13,plain,
    $false,
    inference(rat,[],[s11,s12]) ).

fof(f511,plain,
    $false,
    inference(avatar_sat_refutation,[],[s13]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GEO194+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.38  % Computer : n016.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:35:46 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.38  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.42  Running first-order theorem proving
% 0.11/0.42  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.10/1.33  % (2294418)Detected formulas, will run a generic FOF schedule.
% 3.10/1.33  % (2294512)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1225333975:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.10/1.33  % (2294512)Refutation not found, incomplete strategy
% 3.10/1.33  % (2294512)------------------------------
% 3.10/1.33  % (2294512)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.10/1.33  % (2294512)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.10/1.33  % (2294512)CaDiCaL version: 2.1.3
% 3.10/1.33  % (2294512)Termination reason: Refutation not found, incomplete strategy
% 3.10/1.33  % (2294512)Time elapsed: 0.001 s
% 3.10/1.33  % (2294512)Peak memory usage: 87 MB
% 3.10/1.33  % (2294510)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=1622771417:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.10/1.33  % (2294509)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=1284012687:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.10/1.33  % (2294518)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3086855405:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.10/1.33  % (2294511)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=1142579494:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.10/1.33  % (2294519)dis-21_1_sil=8000:lcm=predicate:random_seed=1285020539: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.10/1.33  % (2294513)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2630729932:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.10/1.33  % (2294513)Refutation not found, incomplete strategy
% 3.10/1.33  % (2294513)------------------------------
% 3.10/1.33  % (2294513)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.10/1.33  % (2294513)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.10/1.33  % (2294513)CaDiCaL version: 2.1.3
% 3.10/1.33  % (2294513)Termination reason: Refutation not found, incomplete strategy
% 3.10/1.33  % (2294513)Time elapsed: 0.001 s
% 3.10/1.33  % (2294513)Peak memory usage: 88 MB
% 3.10/1.33  % (2294518)First to succeed.
% 3.10/1.33  % (2294518)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2294418"
% 3.10/1.33  % (2294519)Instruction limit reached! 
% 3.10/1.33  % (2294519)------------------------------
% 3.10/1.33  % (2294519)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.10/1.33  % (2294519)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.10/1.33  % (2294519)CaDiCaL version: 2.1.3
% 3.10/1.33  % (2294519)Termination reason: Instruction limit
% 3.10/1.33  % (2294519)Termination phase: Saturation
% 3.10/1.33  % (2294519)Time elapsed: 0.069 s
% 3.10/1.33  % (2294519)Peak memory usage: 88 MB
% 3.10/1.33  % (2294519)Instructions burned: 129 (million)
% 3.10/1.33  % (2294512)------------------------------
% 3.10/1.33  % (2294512)------------------------------
% 3.10/1.33  % (2294538)lrs+10_1_sil=8000:sp=occurrence:random_seed=1043567239:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 3.10/1.33  % (2294539)lrs+10_1_sil=32000:urr=on:br=off:random_seed=3744329575:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 3.10/1.33  % (2294539)Also succeeded, but the first one will report.
% 3.10/1.33  % (2294513)------------------------------
% 3.10/1.33  % (2294513)------------------------------
% 3.10/1.33  % (2294518)Refutation found. Thanks to Tanya!
% 3.10/1.33  % SZS status Theorem for theBenchmark
% 3.10/1.33  % SZS output start Proof for theBenchmark
% See solution above
% 3.74/1.44  % (2294518)------------------------------
% 3.74/1.44  % (2294518)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.74/1.44  % (2294518)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.74/1.44  % (2294518)CaDiCaL version: 2.1.3
% 3.74/1.44  % (2294518)Termination reason: Refutation
% 3.74/1.44  % (2294518)Time elapsed: 0.024 s
% 3.74/1.44  % (2294518)Peak memory usage: 89 MB
% 3.74/1.44  % (2294518)Instructions burned: 39 (million)
% 3.74/1.44  % (2294518)------------------------------
% 3.74/1.44  % (2294518)------------------------------
% 3.74/1.44  % (2294418)Success in time 0.468 s
% 3.74/1.44  % Vampire exiting
%------------------------------------------------------------------------------