↑ Up

Vampire---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : GEO062-3 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/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:51:24 AM UTC 2026

% Result   : Unsatisfiable 5.40s 1.83s
% Output   : Refutation 5.40s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   36 (  16 unt;   3 def)
%            Number of atoms       :   61 (  10 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   52 (  27   ~;  22   |;   0   &)
%                                         (   3 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   3 prp; 0-3 aty)
%            Number of functors    :    7 (   7 usr;   5 con; 0-4 aty)
%            Number of variables   :   35 (   0 sgn  35   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f4,axiom,
    ! [X2,X3,X0,X1] : between(X0,X1,extension(X0,X1,X2,X3)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',segment_construction1) ).

fof(f20,axiom,
    ! [X2,X3,X0,X1] : insertion(X0,X1,X2,X3) = extension(extension(X1,X0,lower_dimension_point_1,lower_dimension_point_2),X0,X2,X3),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',insertion) ).

fof(f45,axiom,
    ! [X2,X0,X1] :
      ( ~ between(X0,X1,X2)
      | X0 = X1
      | X2 = extension(X0,X1,X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d10_1) ).

fof(f46,plain,
    ! [X2,X0,X1] :
      ( ~ between(X0,X1,X2)
      | X0 = X1
      | extension(X0,X1,X1,X2) = X2 ),
    inference(reorient_equations,[],[f45]) ).

fof(f54,axiom,
    ! [X2,X0,X1] :
      ( between(X2,X1,X0)
      | ~ between(X0,X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1) ).

fof(f61,axiom,
    ! [X2,X3,X0,X1] :
      ( between(X1,X2,X3)
      | ~ between(X0,X2,X3)
      | ~ between(X0,X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',b5) ).

fof(f69,axiom,
    ! [X0,X1] : X0 != extension(X1,X0,lower_dimension_point_1,lower_dimension_point_2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',e3_1) ).

fof(f70,plain,
    ! [X0,X1] : extension(X1,X0,lower_dimension_point_1,lower_dimension_point_2) != X0,
    inference(reorient_equations,[],[f69]) ).

fof(f82,axiom,
    between(u,v,w),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',v_between_u_and_w) ).

fof(f83,negated_conjecture,
    v != insertion(u,w,u,v),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_v_equals_insertion) ).

fof(f94,plain,
    v != extension(extension(w,u,lower_dimension_point_1,lower_dimension_point_2),u,u,v),
    inference(definition_unfolding,[],[f83,f20]) ).

fof(f98,definition,
    ! [X0,X1] :
      ( sQ0_eqProxy(X0,X1)
    <=> X0 = X1 ),
    introduced(definition,[new_symbols(definition,[sQ0_eqProxy])],[equality_proxy_definition]) ).

fof(f104,plain,
    ! [X2,X0,X1] :
      ( sQ0_eqProxy(extension(X0,X1,X1,X2),X2)
      | sQ0_eqProxy(X0,X1)
      | ~ between(X0,X1,X2) ),
    inference(equality_proxy_replacement,[],[f46,f98,f98]) ).

fof(f117,plain,
    ! [X0,X1] : ~ sQ0_eqProxy(extension(X1,X0,lower_dimension_point_1,lower_dimension_point_2),X0),
    inference(equality_proxy_replacement,[],[f70,f98]) ).

fof(f120,plain,
    ~ sQ0_eqProxy(v,extension(extension(w,u,lower_dimension_point_1,lower_dimension_point_2),u,u,v)),
    inference(equality_proxy_replacement,[],[f94,f98]) ).

fof(f126,plain,
    ! [X0,X1] :
      ( sQ0_eqProxy(X1,X0)
      | ~ sQ0_eqProxy(X0,X1) ),
    inference(equality_proxy_axiom,[],[f98]) ).

fof(f127,plain,
    ~ sQ0_eqProxy(extension(extension(w,u,lower_dimension_point_1,lower_dimension_point_2),u,u,v),v),
    inference(resolution,[],[f126,f120]) ).

fof(f324,plain,
    ( sQ0_eqProxy(extension(w,u,lower_dimension_point_1,lower_dimension_point_2),u)
    | ~ between(extension(w,u,lower_dimension_point_1,lower_dimension_point_2),u,v) ),
    inference(resolution,[],[f104,f127]) ).

fof(f328,definition,
    ( spl1_1
  <=> between(extension(w,u,lower_dimension_point_1,lower_dimension_point_2),u,v) ),
    introduced(definition,[new_symbols(definition,[spl1_1])],[avatar_definition]) ).

fof(f329,plain,
    ( ~ between(extension(w,u,lower_dimension_point_1,lower_dimension_point_2),u,v)
    | spl1_1 ),
    inference(avatar_component_clause,[],[f328]) ).

fof(f331,definition,
    ( spl1_2
  <=> sQ0_eqProxy(extension(w,u,lower_dimension_point_1,lower_dimension_point_2),u) ),
    introduced(definition,[new_symbols(definition,[spl1_2])],[avatar_definition]) ).

fof(f332,plain,
    ( sQ0_eqProxy(extension(w,u,lower_dimension_point_1,lower_dimension_point_2),u)
    | ~ spl1_2 ),
    inference(avatar_component_clause,[],[f331]) ).

fof(f333,plain,
    ( ~ spl1_1
    | spl1_2 ),
    inference(avatar_split_clause,[],[f324,f331,f328]) ).

fof(f338,plain,
    ( ~ between(v,u,extension(w,u,lower_dimension_point_1,lower_dimension_point_2))
    | spl1_1 ),
    inference(resolution,[],[f329,f54]) ).

fof(f346,plain,
    ( ! [X0] :
        ( ~ between(X0,u,extension(w,u,lower_dimension_point_1,lower_dimension_point_2))
        | ~ between(X0,v,u) )
    | spl1_1 ),
    inference(resolution,[],[f338,f61]) ).

fof(f449,plain,
    ( ~ between(w,v,u)
    | spl1_1 ),
    inference(resolution,[],[f346,f4]) ).

fof(f467,plain,
    ( ~ between(u,v,w)
    | spl1_1 ),
    inference(resolution,[],[f449,f54]) ).

fof(f469,plain,
    ( $false
    | spl1_1 ),
    inference(resolution,[],[f467,f82]) ).

fof(f475,plain,
    spl1_1,
    inference(avatar_contradiction_clause,[],[f469]) ).

fof(f476,plain,
    ( $false
    | ~ spl1_2 ),
    inference(resolution,[],[f332,f117]) ).

fof(f477,plain,
    ~ spl1_2,
    inference(avatar_contradiction_clause,[],[f476]) ).

cnf(s1,plain,
    ( ~ spl1_1
    | spl1_2 ),
    inference(sat_conversion,[],[f333]) ).

cnf(s6,plain,
    spl1_1,
    inference(sat_conversion,[],[f475]) ).

cnf(s7,plain,
    ~ spl1_2,
    inference(sat_conversion,[],[f477]) ).

cnf(s8,plain,
    $false,
    inference(rat,[],[s1,s7,s6]) ).

fof(f478,plain,
    $false,
    inference(avatar_sat_refutation,[],[s8]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GEO062-3 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.40  % Computer : n019.cluster.edu
% 0.16/0.40  % Model    : x86_64 x86_64
% 0.16/0.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.40  % Memory   : 8046.5625MB
% 0.16/0.40  % OS       : Linux 6.8.0-71-generic
% 0.16/0.40  % CPULimit : 300
% 0.16/0.40  % WCLimit  : 300
% 0.16/0.40  % DateTime : Sun Sep 27 06:47:03 UTC 2026
% 0.16/0.41  % CPUTime  : 
% 0.16/0.41  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.46  Running first-order theorem proving
% 0.16/0.46  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
% 5.40/1.83  % (2748669)Input is clausal, will run a generic CNF schedule.
% 5.40/1.83  % (2748675)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=812792269:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 5.40/1.83  % (2748680)dis-21_1_sil=8000:lcm=predicate:random_seed=2786604930:st=5:avsq=on:i=117:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/117Mi)
% 5.40/1.83  % (2748674)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=3115608750:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 5.40/1.83  % (2748679)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=895769929:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 5.40/1.83  % (2748677)lrs+10_1_sil=8000:sp=occurrence:random_seed=1501210336:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 5.40/1.83  % (2748678)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=3196068964:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 5.40/1.83  % (2748676)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=1944788527:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 5.40/1.83  % (2748680)First to succeed.
% 5.40/1.83  % (2748680)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2748669"
% 5.40/1.83  % (2748677)Instruction limit reached! 
% 5.40/1.83  % (2748677)------------------------------
% 5.40/1.83  % (2748677)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.40/1.83  % (2748677)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.40/1.83  % (2748677)CaDiCaL version: 2.1.3
% 5.40/1.83  % (2748677)Termination reason: Instruction limit
% 5.40/1.83  % (2748677)Termination phase: Saturation
% 5.40/1.83  % (2748677)Time elapsed: 0.102 s
% 5.40/1.83  % (2748677)Peak memory usage: 89 MB
% 5.40/1.83  % (2748677)Instructions burned: 107 (million)
% 5.40/1.83  % (2748678)Instruction limit reached! 
% 5.40/1.83  % (2748678)------------------------------
% 5.40/1.83  % (2748678)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.40/1.83  % (2748678)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.40/1.83  % (2748678)CaDiCaL version: 2.1.3
% 5.40/1.83  % (2748678)Termination reason: Instruction limit
% 5.40/1.83  % (2748678)Termination phase: Saturation
% 5.40/1.83  % (2748678)Time elapsed: 0.118 s
% 5.40/1.83  % (2748678)Peak memory usage: 89 MB
% 5.40/1.83  % (2748678)Instructions burned: 114 (million)
% 5.40/1.83  % (2748679)Instruction limit reached! 
% 5.40/1.83  % (2748679)------------------------------
% 5.40/1.83  % (2748679)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.40/1.83  % (2748679)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.40/1.83  % (2748679)CaDiCaL version: 2.1.3
% 5.40/1.83  % (2748679)Termination reason: Instruction limit
% 5.40/1.83  % (2748679)Termination phase: Saturation
% 5.40/1.83  % (2748679)Time elapsed: 0.169 s
% 5.40/1.83  % (2748679)Peak memory usage: 89 MB
% 5.40/1.83  % (2748679)Instructions burned: 180 (million)
% 5.40/1.83  % (2748680)Refutation found. Thanks to Tanya!
% 5.40/1.83  % SZS status Unsatisfiable for theBenchmark
% 5.40/1.83  % SZS output start Proof for theBenchmark
% See solution above
% 5.40/1.83  % (2748680)------------------------------
% 5.40/1.83  % (2748680)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.40/1.83  % (2748680)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.40/1.83  % (2748680)CaDiCaL version: 2.1.3
% 5.40/1.83  % (2748680)Termination reason: Refutation
% 5.40/1.83  % (2748680)Time elapsed: 0.011 s
% 5.40/1.83  % (2748680)Peak memory usage: 89 MB
% 5.40/1.83  % (2748680)Instructions burned: 10 (million)
% 5.40/1.83  % (2748680)------------------------------
% 5.40/1.83  % (2748680)------------------------------
% 5.40/1.83  % (2748669)Success in time 0.649 s
% 5.40/1.83  % Vampire exiting
%------------------------------------------------------------------------------