↑ Up

Vampire---5.0.1.THM-Ref.s

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

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

% Result   : Theorem 4.98s 6.68s
% Output   : Refutation 4.98s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   46 (  13 unt;   0 def)
%            Number of atoms       :  122 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :  124 (  48   ~;  63   |;   6   &)
%                                         (   0 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   6 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :  110 ( 104   !;   6   ?)

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

fof(f6,axiom,
    ! [X0,X1,X2] :
      ( convergent_lines(X0,X1)
     => ( convergent_lines(X0,X2)
        | convergent_lines(X1,X2) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax6) ).

fof(f9,axiom,
    ! [X0,X1] :
      ( convergent_lines(X0,X1)
     => ~ apart_point_and_line(intersection_point(X0,X1),X0) ),
    file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',ci4) ).

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

fof(f15,axiom,
    ! [X0,X1] : ~ convergent_lines(parallel_through_point(X1,X0),X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cp1) ).

fof(f22,axiom,
    ! [X0,X1,X2,X3] :
      ( distinct_lines(X1,X2)
     => ( apart_point_and_line(X0,X1)
        | apart_point_and_line(X0,X2)
        | unorthogonal_lines(X1,X3)
        | unorthogonal_lines(X2,X3) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ouo1) ).

fof(f23,conjecture,
    ! [X0,X1,X2] :
      ( convergent_lines(X0,X1)
     => ( unorthogonal_lines(X0,X2)
        | unorthogonal_lines(X1,X2) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).

fof(f24,negated_conjecture,
    ~ ! [X0,X1,X2] :
        ( convergent_lines(X0,X1)
       => ( unorthogonal_lines(X0,X2)
          | unorthogonal_lines(X1,X2) ) ),
    inference(negated_conjecture,[status(cth)],[f23]) ).

fof(f25,plain,
    ? [X0,X1,X2] :
      ( ~ unorthogonal_lines(X0,X2)
      & ~ unorthogonal_lines(X1,X2)
      & convergent_lines(X0,X1) ),
    inference(ennf_transformation,[],[f24]) ).

fof(f26,plain,
    ? [X0,X1,X2] :
      ( ~ unorthogonal_lines(X0,X2)
      & ~ unorthogonal_lines(X1,X2)
      & convergent_lines(X0,X1) ),
    inference(flattening,[],[f25]) ).

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

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

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

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

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

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

fof(f37,plain,
    ! [X0,X1,X2,X3] :
      ( apart_point_and_line(X0,X1)
      | apart_point_and_line(X0,X2)
      | unorthogonal_lines(X1,X3)
      | unorthogonal_lines(X2,X3)
      | ~ distinct_lines(X1,X2) ),
    inference(ennf_transformation,[],[f22]) ).

fof(f38,plain,
    ! [X0,X1,X2,X3] :
      ( apart_point_and_line(X0,X1)
      | apart_point_and_line(X0,X2)
      | unorthogonal_lines(X1,X3)
      | unorthogonal_lines(X2,X3)
      | ~ distinct_lines(X1,X2) ),
    inference(flattening,[],[f37]) ).

fof(f39,plain,
    ( ~ unorthogonal_lines(sK0,sK2)
    & ~ unorthogonal_lines(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)],[f26]) ).

fof(f40,plain,
    convergent_lines(sK0,sK1),
    inference(cnf_transformation,[],[f39]) ).

fof(f41,plain,
    ~ unorthogonal_lines(sK1,sK2),
    inference(cnf_transformation,[],[f39]) ).

fof(f42,plain,
    ~ unorthogonal_lines(sK0,sK2),
    inference(cnf_transformation,[],[f39]) ).

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

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

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

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

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

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

fof(f55,plain,
    ! [X2,X3,X0,X1] :
      ( ~ distinct_lines(X1,X2)
      | apart_point_and_line(X0,X2)
      | unorthogonal_lines(X1,X3)
      | unorthogonal_lines(X2,X3)
      | apart_point_and_line(X0,X1) ),
    inference(cnf_transformation,[],[f38]) ).

fof(f59,plain,
    ! [X0,X1] :
      ( convergent_lines(X0,X1)
      | ~ convergent_lines(X1,X0) ),
    inference(resolution,[],[f53,f54]) ).

fof(f60,plain,
    ! [X2,X0,X1] :
      ( ~ convergent_lines(parallel_through_point(X1,X2),X0)
      | convergent_lines(X0,X1) ),
    inference(resolution,[],[f53,f49]) ).

fof(f66,plain,
    ! [X0,X1] : ~ convergent_lines(X0,parallel_through_point(X0,X1)),
    inference(resolution,[],[f59,f49]) ).

fof(f70,plain,
    ! [X2,X0,X1] :
      ( ~ convergent_lines(X1,X0)
      | convergent_lines(X0,parallel_through_point(X1,X2)) ),
    inference(resolution,[],[f66,f53]) ).

fof(f81,plain,
    ! [X2,X3,X0,X1,X4] :
      ( apart_point_and_line(X0,X1)
      | unorthogonal_lines(X2,X3)
      | unorthogonal_lines(X1,X3)
      | apart_point_and_line(X0,X2)
      | convergent_lines(X4,X1)
      | ~ convergent_lines(X4,X2) ),
    inference(resolution,[],[f55,f50]) ).

fof(f85,plain,
    ! [X2,X3,X0,X1,X4] :
      ( apart_point_and_line(intersection_point(X3,X2),X0)
      | unorthogonal_lines(X2,X1)
      | unorthogonal_lines(X0,X1)
      | convergent_lines(X4,X2)
      | ~ convergent_lines(X4,X0)
      | ~ convergent_lines(X3,X2) ),
    inference(resolution,[],[f81,f51]) ).

fof(f95,plain,
    ! [X0] : convergent_lines(sK1,parallel_through_point(sK0,X0)),
    inference(resolution,[],[f70,f40]) ).

fof(f100,plain,
    ! [X2,X3,X0,X1] :
      ( unorthogonal_lines(X0,X1)
      | unorthogonal_lines(X2,X1)
      | convergent_lines(X3,X0)
      | ~ convergent_lines(X3,X2)
      | ~ convergent_lines(X2,X0)
      | ~ convergent_lines(X2,X0) ),
    inference(resolution,[],[f85,f52]) ).

fof(f101,plain,
    ! [X2,X3,X0,X1] :
      ( unorthogonal_lines(X0,X1)
      | unorthogonal_lines(X2,X1)
      | convergent_lines(X3,X0)
      | ~ convergent_lines(X3,X2)
      | ~ convergent_lines(X2,X0) ),
    inference(duplicate_literal_removal,[],[f100]) ).

fof(f103,plain,
    ! [X2,X3,X0,X1] :
      ( unorthogonal_lines(X0,X1)
      | unorthogonal_lines(X2,X1)
      | convergent_lines(X3,X0)
      | ~ convergent_lines(X3,X2) ),
    inference(forward_subsumption_resolution,[],[f101,f53]) ).

fof(f105,plain,
    ! [X0,X1] : convergent_lines(parallel_through_point(sK0,X0),parallel_through_point(sK1,X1)),
    inference(resolution,[],[f95,f70]) ).

fof(f127,plain,
    ! [X0] : convergent_lines(parallel_through_point(sK1,X0),sK0),
    inference(resolution,[],[f105,f60]) ).

fof(f144,plain,
    ! [X0,X1] :
      ( unorthogonal_lines(X0,sK2)
      | convergent_lines(X1,sK1)
      | ~ convergent_lines(X1,X0) ),
    inference(resolution,[],[f103,f41]) ).

fof(f169,plain,
    ! [X0] :
      ( convergent_lines(X0,sK1)
      | ~ convergent_lines(X0,sK0) ),
    inference(resolution,[],[f144,f42]) ).

fof(f175,plain,
    ! [X0] : ~ convergent_lines(parallel_through_point(sK1,X0),sK0),
    inference(resolution,[],[f169,f49]) ).

fof(f182,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f175,f127]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GEO215+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/5.40  % Computer : n019.cluster.edu
% 0.12/5.40  % Model    : x86_64 x86_64
% 0.12/5.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/5.40  % Memory   : 8046.5625MB
% 0.12/5.40  % OS       : Linux 6.8.0-71-generic
% 0.12/5.40  % CPULimit : 300
% 0.12/5.40  % WCLimit  : 300
% 0.12/5.40  % DateTime : Sun Sep 27 07:41:24 UTC 2026
% 0.12/5.40  % CPUTime  : 
% 0.12/5.40  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/5.44  Running first-order theorem proving
% 0.12/5.44  Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.01/6.50  % (2770693)Detected formulas, will run a generic FOF schedule.
% 4.01/6.50  % (2770703)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1804970217:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 4.01/6.50  % (2770698)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=4212934808:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 4.01/6.50  % (2770704)dis-21_1_sil=8000:lcm=predicate:random_seed=3708097425: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)
% 4.01/6.50  % (2770699)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=1267130850:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 4.01/6.50  % (2770701)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3646732411:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 4.01/6.50  % (2770700)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=3998723970:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 4.01/6.50  % (2770702)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3083258094:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 4.01/6.50  % (2770702)Refutation not found, incomplete strategy
% 4.01/6.50  % (2770702)------------------------------
% 4.01/6.50  % (2770702)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.01/6.50  % (2770702)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.01/6.50  % (2770702)CaDiCaL version: 2.1.3
% 4.01/6.50  % (2770702)Termination reason: Refutation not found, incomplete strategy
% 4.01/6.50  % (2770702)Time elapsed: 0.003 s
% 4.01/6.50  % (2770702)Peak memory usage: 88 MB
% 4.01/6.50  % (2770702)Instructions burned: 3 (million)
% 4.01/6.50  % (2770703)Instruction limit reached! 
% 4.01/6.50  % (2770703)------------------------------
% 4.01/6.50  % (2770703)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.01/6.50  % (2770703)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.01/6.50  % (2770703)CaDiCaL version: 2.1.3
% 4.01/6.50  % (2770703)Termination reason: Instruction limit
% 4.01/6.50  % (2770703)Termination phase: Saturation
% 4.01/6.50  % (2770703)Time elapsed: 0.048 s
% 4.01/6.50  % (2770703)Peak memory usage: 89 MB
% 4.01/6.50  % (2770703)Instructions burned: 140 (million)
% 4.01/6.50  % (2770701)Instruction limit reached! 
% 4.01/6.50  % (2770701)------------------------------
% 4.01/6.50  % (2770701)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.01/6.50  % (2770701)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.01/6.50  % (2770701)CaDiCaL version: 2.1.3
% 4.01/6.50  % (2770701)Termination reason: Instruction limit
% 4.01/6.50  % (2770701)Termination phase: Saturation
% 4.01/6.50  % (2770701)Time elapsed: 0.054 s
% 4.01/6.50  % (2770701)Peak memory usage: 88 MB
% 4.01/6.50  % (2770701)Instructions burned: 110 (million)
% 4.01/6.50  % (2770704)Instruction limit reached! 
% 4.01/6.50  % (2770704)------------------------------
% 4.01/6.50  % (2770704)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.01/6.50  % (2770704)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.01/6.50  % (2770704)CaDiCaL version: 2.1.3
% 4.01/6.50  % (2770704)Termination reason: Instruction limit
% 4.01/6.50  % (2770704)Termination phase: Saturation
% 4.01/6.50  % (2770704)Time elapsed: 0.079 s
% 4.01/6.50  % (2770704)Peak memory usage: 89 MB
% 4.01/6.50  % (2770704)Instructions burned: 130 (million)
% 4.01/6.50  % (2770712)lrs+10_1_sil=8000:sp=occurrence:random_seed=2188512184:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 4.01/6.50  % (2770712)Instruction limit reached! 
% 4.01/6.50  % (2770712)------------------------------
% 4.01/6.50  % (2770712)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.01/6.50  % (2770712)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.01/6.50  % (2770712)CaDiCaL version: 2.1.3
% 4.01/6.50  % (2770712)Termination reason: Instruction limit
% 4.01/6.50  % (2770712)Termination phase: Saturation
% 4.01/6.50  % (2770712)Time elapsed: 0.083 s
% 4.01/6.50  % (2770712)Peak memory usage: 89 MB
% 4.01/6.50  % (2770712)Instructions burned: 286 (million)
% 4.98/6.68  % (2770713)lrs+10_1_sil=32000:urr=on:br=off:random_seed=3413788330:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/157Mi)
% 4.98/6.68  % (2770713)Refutation not found, incomplete strategy
% 4.98/6.68  % (2770713)------------------------------
% 4.98/6.68  % (2770713)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.98/6.68  % (2770713)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.98/6.68  % (2770713)CaDiCaL version: 2.1.3
% 4.98/6.68  % (2770713)Termination reason: Refutation not found, incomplete strategy
% 4.98/6.68  % (2770713)Time elapsed: 0.003 s
% 4.98/6.68  % (2770713)Peak memory usage: 88 MB
% 4.98/6.68  % (2770713)Instructions burned: 3 (million)
% 4.98/6.68  % (2770714)lrs+1011_1_sil=32000:sp=occurrence:random_seed=130003614:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 4.98/6.68  % (2770714)First to succeed.
% 4.98/6.68  % (2770714)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2770693"
% 4.98/6.68  % (2770702)------------------------------
% 4.98/6.68  % (2770702)------------------------------
% 4.98/6.68  % (2770717)dis+10_5:1_slsqr=1,4:sil=8000:fde=unused:erd=off:urr=full:fd=off:s2agt=8:br=off:slsq=on:random_seed=4104771418:s2a=on:i=248:s2at=1.23:gtg=position_2996 on theBenchmark for (2996ds/248Mi)
% 4.98/6.68  % (2770717)Instruction limit reached! 
% 4.98/6.68  % (2770717)------------------------------
% 4.98/6.68  % (2770717)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.98/6.68  % (2770717)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.98/6.68  % (2770717)CaDiCaL version: 2.1.3
% 4.98/6.68  % (2770717)Termination reason: Instruction limit
% 4.98/6.68  % (2770717)Termination phase: Saturation
% 4.98/6.68  % (2770717)Time elapsed: 0.072 s
% 4.98/6.68  % (2770717)Peak memory usage: 88 MB
% 4.98/6.68  % (2770717)Instructions burned: 248 (million)
% 4.98/6.68  % (2770719)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=1054500804:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2996 on theBenchmark for (2996ds/294Mi)
% 4.98/6.68  % (2770713)------------------------------
% 4.98/6.68  % (2770713)------------------------------
% 4.98/6.68  % (2770721)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=4239353078:i=2350_2995 on theBenchmark for (2995ds/2350Mi)
% 4.98/6.68  % (2770714)Refutation found. Thanks to Tanya!
% 4.98/6.68  % SZS status Theorem for theBenchmark
% 4.98/6.68  % SZS output start Proof for theBenchmark
% See solution above
% 4.98/6.68  % (2770714)------------------------------
% 4.98/6.68  % (2770714)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.98/6.68  % (2770714)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.98/6.68  % (2770714)CaDiCaL version: 2.1.3
% 4.98/6.68  % (2770714)Termination reason: Refutation
% 4.98/6.68  % (2770714)Time elapsed: 0.006 s
% 4.98/6.68  % (2770714)Peak memory usage: 88 MB
% 4.98/6.68  % (2770714)Instructions burned: 7 (million)
% 4.98/6.68  % (2770714)------------------------------
% 4.98/6.68  % (2770714)------------------------------
% 4.98/6.68  % (2770693)Success in time 0.624 s
% 4.98/6.68  % Vampire exiting
%------------------------------------------------------------------------------