↑ 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  : GEO528+1 : TPTP v9.3.1. Released v7.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT

% 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:54:40 AM UTC 2026

% Result   : Theorem 0.92s 0.57s
% Output   : Refutation 0.92s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   62 (  20 unt;   3 def)
%            Number of atoms       :  155 (  49 equ)
%            Maximal formula atoms :   14 (   2 avg)
%            Number of connectives :  155 (  62   ~;  80   |;  10   &)
%                                         (   3 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :   11 (   9 usr;   4 prp; 0-4 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-4 aty)
%            Number of variables   :   77 (   0 sgn  73   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f146,axiom,
    ! [X0,X1] : s_m(X0,midpoint(X0,X1),X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',aSatz8_22) ).

fof(f184,axiom,
    ! [X0,X1,X2] :
      ( ( X0 = X1
        | s_col(X0,X1,midpoint(X2,reflect(X0,X1,X2))) )
      & ( X0 = X1
        | X2 = reflect(X0,X1,X2)
        | perp(X0,X1,X2,reflect(X0,X1,X2)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',aSatz10_2a) ).

fof(f187,axiom,
    ! [X0,X1,X2] :
      ( X0 = X1
      | reflect(X0,X1,reflect(X0,X1,X2)) = X2 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',aSatz10_5) ).

fof(f190,axiom,
    ! [X0,X1,X2] :
      ( X0 = X1
      | reflect(X0,X1,X2) != X2
      | s_col(X0,X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',aSatz10_8a) ).

fof(f191,axiom,
    ! [X0,X1,X2] :
      ( X0 = X1
      | ~ s_col(X0,X1,X2)
      | reflect(X0,X1,X2) = X2 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',aSatz10_8b) ).

fof(f198,conjecture,
    ! [X0,X1,X2,X3] :
      ( X0 = X1
      | reflect(X0,X1,X2) != X3
      | s_col(X0,X1,X2)
      | opposite(X2,X0,X1,X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',aSatz10_14) ).

fof(f199,negated_conjecture,
    ~ ! [X0,X1,X2,X3] :
        ( X0 = X1
        | reflect(X0,X1,X2) != X3
        | s_col(X0,X1,X2)
        | opposite(X2,X0,X1,X3) ),
    inference(negated_conjecture,[status(cth)],[f198]) ).

fof(f208,axiom,
    ! [X0,X1,X2] :
      ( ( ~ s_m(X0,X1,X2)
        | s_t(X0,X1,X2) )
      & ( ~ s_m(X0,X1,X2)
        | s_e(X1,X0,X1,X2) )
      & ( ~ s_t(X0,X1,X2)
        | ~ s_e(X1,X0,X1,X2)
        | s_m(X0,X1,X2) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d_Defn7_1) ).

fof(f213,axiom,
    ! [X0,X1,X2,X3,X4] :
      ( ( X0 = X1
        | s_col(X0,X1,X2)
        | s_col(X0,X1,X3)
        | ~ s_t(X2,X4,X3)
        | ~ s_col(X0,X1,X4)
        | opposite(X2,X0,X1,X3) )
      & ( ~ opposite(X2,X0,X1,X3)
        | ~ s_col(X0,X1,X2) )
      & ( ~ opposite(X2,X0,X1,X3)
        | ~ s_col(X0,X1,X3) )
      & ( ~ opposite(X2,X0,X1,X3)
        | s_t(X2,il(X2,X3,X0,X1),X3) )
      & ( ~ opposite(X2,X0,X1,X3)
        | s_col(X0,X1,il(X2,X3,X0,X1)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d_Defn9_1) ).

fof(f215,plain,
    ? [X0,X1,X2,X3] :
      ( X0 != X1
      & reflect(X0,X1,X2) = X3
      & ~ s_col(X0,X1,X2)
      & ~ opposite(X2,X0,X1,X3) ),
    inference(ennf_transformation,[],[f199]) ).

fof(f389,plain,
    ! [X0,X1] : s_m(X0,midpoint(X0,X1),X1),
    inference(cnf_transformation,[],[f146]) ).

fof(f428,plain,
    ! [X2,X0,X1] :
      ( s_col(X0,X1,midpoint(X2,reflect(X0,X1,X2)))
      | X0 = X1 ),
    inference(cnf_transformation,[],[f184]) ).

fof(f433,plain,
    ! [X2,X0,X1] :
      ( reflect(X0,X1,reflect(X0,X1,X2)) = X2
      | X0 = X1 ),
    inference(cnf_transformation,[],[f187]) ).

fof(f436,plain,
    ! [X2,X0,X1] :
      ( s_col(X0,X1,X2)
      | reflect(X0,X1,X2) != X2
      | X0 = X1 ),
    inference(cnf_transformation,[],[f190]) ).

fof(f437,plain,
    ! [X2,X0,X1] :
      ( reflect(X0,X1,X2) = X2
      | ~ s_col(X0,X1,X2)
      | X0 = X1 ),
    inference(cnf_transformation,[],[f191]) ).

fof(f444,plain,
    ~ opposite(sK2,sK0,sK1,sK3),
    inference(cnf_transformation,[],[f215]) ).

fof(f445,plain,
    ~ s_col(sK0,sK1,sK2),
    inference(cnf_transformation,[],[f215]) ).

fof(f446,plain,
    sK3 = reflect(sK0,sK1,sK2),
    inference(cnf_transformation,[],[f215]) ).

fof(f447,plain,
    sK0 != sK1,
    inference(cnf_transformation,[],[f215]) ).

fof(f484,plain,
    ! [X2,X0,X1] :
      ( ~ s_m(X0,X1,X2)
      | s_t(X0,X1,X2) ),
    inference(cnf_transformation,[],[f208]) ).

fof(f506,plain,
    ! [X2,X3,X0,X1,X4] :
      ( opposite(X2,X0,X1,X3)
      | ~ s_col(X0,X1,X4)
      | ~ s_t(X2,X4,X3)
      | s_col(X0,X1,X3)
      | s_col(X0,X1,X2)
      | X0 = X1 ),
    inference(cnf_transformation,[],[f213]) ).

fof(f700,plain,
    ! [X2,X0,X1] :
      ( ~ s_col(X0,X1,midpoint(X2,reflect(X0,X1,X2)))
      | X0 = X1 ),
    inference(consistent_polarity_flipping,[],[f428]) ).

fof(f703,plain,
    ! [X2,X0,X1] :
      ( reflect(X0,X1,X2) != X2
      | ~ s_col(X0,X1,X2)
      | X0 = X1 ),
    inference(consistent_polarity_flipping,[],[f436]) ).

fof(f704,plain,
    ! [X2,X0,X1] :
      ( s_col(X0,X1,X2)
      | reflect(X0,X1,X2) = X2
      | X0 = X1 ),
    inference(consistent_polarity_flipping,[],[f437]) ).

fof(f711,plain,
    s_col(sK0,sK1,sK2),
    inference(consistent_polarity_flipping,[],[f445]) ).

fof(f712,plain,
    opposite(sK2,sK0,sK1,sK3),
    inference(consistent_polarity_flipping,[],[f444]) ).

fof(f766,plain,
    ! [X2,X3,X0,X1,X4] :
      ( ~ opposite(X2,X0,X1,X3)
      | s_col(X0,X1,X4)
      | ~ s_t(X2,X4,X3)
      | ~ s_col(X0,X1,X3)
      | ~ s_col(X0,X1,X2)
      | X0 = X1 ),
    inference(consistent_polarity_flipping,[],[f506]) ).

fof(f834,plain,
    ! [X0,X1] : s_t(X0,midpoint(X0,X1),X1),
    inference(resolution,[],[f484,f389]) ).

fof(f999,plain,
    ( sK2 = reflect(sK0,sK1,sK3)
    | sK0 = sK1 ),
    inference(superposition,[],[f433,f446]) ).

fof(f1000,plain,
    sK2 = reflect(sK0,sK1,sK3),
    inference(forward_subsumption_resolution,[],[f999,f447]) ).

fof(f1068,plain,
    ( ~ s_col(sK0,sK1,midpoint(sK2,sK3))
    | sK0 = sK1 ),
    inference(superposition,[],[f700,f446]) ).

fof(f1073,plain,
    ~ s_col(sK0,sK1,midpoint(sK2,sK3)),
    inference(forward_subsumption_resolution,[],[f1068,f447]) ).

fof(f1151,plain,
    ( sK2 != sK3
    | ~ s_col(sK0,sK1,sK2)
    | sK0 = sK1 ),
    inference(superposition,[],[f703,f446]) ).

fof(f1156,plain,
    ( sK2 != sK3
    | sK0 = sK1 ),
    inference(forward_subsumption_resolution,[],[f1151,f711]) ).

fof(f1158,definition,
    ( spl4_7
  <=> s_col(sK0,sK1,sK3) ),
    introduced(definition,[new_symbols(definition,[spl4_7])],[avatar_definition]) ).

fof(f1160,plain,
    ( ~ s_col(sK0,sK1,sK3)
    | spl4_7 ),
    inference(avatar_component_clause,[],[f1158]) ).

fof(f1162,definition,
    ( spl4_8
  <=> sK2 = sK3 ),
    introduced(definition,[new_symbols(definition,[spl4_8])],[avatar_definition]) ).

fof(f1164,plain,
    ( sK2 != sK3
    | spl4_8 ),
    inference(avatar_component_clause,[],[f1162]) ).

fof(f1166,plain,
    sK2 != sK3,
    inference(forward_subsumption_resolution,[],[f1156,f447]) ).

fof(f1167,plain,
    ~ spl4_8,
    inference(avatar_split_clause,[],[f1166,f1162]) ).

fof(f2928,plain,
    ! [X0] :
      ( s_col(sK0,sK1,X0)
      | ~ s_t(sK2,X0,sK3)
      | ~ s_col(sK0,sK1,sK3)
      | ~ s_col(sK0,sK1,sK2)
      | sK0 = sK1 ),
    inference(resolution,[],[f766,f712]) ).

fof(f2935,plain,
    ! [X0] :
      ( s_col(sK0,sK1,X0)
      | ~ s_t(sK2,X0,sK3)
      | ~ s_col(sK0,sK1,sK3)
      | sK0 = sK1 ),
    inference(forward_subsumption_resolution,[],[f2928,f711]) ).

fof(f2938,plain,
    ! [X0] :
      ( s_col(sK0,sK1,X0)
      | ~ s_t(sK2,X0,sK3)
      | ~ s_col(sK0,sK1,sK3) ),
    inference(forward_subsumption_resolution,[],[f2935,f447]) ).

fof(f2944,definition,
    ( spl4_34
  <=> ! [X0] :
        ( s_col(sK0,sK1,X0)
        | ~ s_t(sK2,X0,sK3) ) ),
    introduced(definition,[new_symbols(definition,[spl4_34])],[avatar_definition]) ).

fof(f2945,plain,
    ( ! [X0] :
        ( ~ s_t(sK2,X0,sK3)
        | s_col(sK0,sK1,X0) )
    | ~ spl4_34 ),
    inference(avatar_component_clause,[],[f2944]) ).

fof(f2946,plain,
    ( ~ spl4_7
    | spl4_34 ),
    inference(avatar_split_clause,[],[f2938,f2944,f1158]) ).

fof(f2955,plain,
    ( sK3 = reflect(sK0,sK1,sK3)
    | sK0 = sK1
    | spl4_7 ),
    inference(resolution,[],[f1160,f704]) ).

fof(f2956,plain,
    ( sK3 = reflect(sK0,sK1,sK3)
    | spl4_7 ),
    inference(forward_subsumption_resolution,[],[f2955,f447]) ).

fof(f2957,plain,
    ( sK2 = sK3
    | spl4_7 ),
    inference(forward_demodulation,[],[f2956,f1000]) ).

fof(f2958,plain,
    ( $false
    | spl4_7
    | spl4_8 ),
    inference(forward_subsumption_resolution,[],[f2957,f1164]) ).

fof(f2959,plain,
    ( spl4_7
    | spl4_8 ),
    inference(avatar_contradiction_clause,[],[f2958]) ).

fof(f3408,plain,
    ( s_col(sK0,sK1,midpoint(sK2,sK3))
    | ~ spl4_34 ),
    inference(resolution,[],[f2945,f834]) ).

fof(f3416,plain,
    ( $false
    | ~ spl4_34 ),
    inference(forward_subsumption_resolution,[],[f3408,f1073]) ).

fof(f3417,plain,
    ~ spl4_34,
    inference(avatar_contradiction_clause,[],[f3416]) ).

cnf(s3,plain,
    ~ spl4_8,
    inference(sat_conversion,[],[f1167]) ).

cnf(s42,plain,
    ( ~ spl4_7
    | spl4_34 ),
    inference(sat_conversion,[],[f2946]) ).

cnf(s43,plain,
    ( spl4_7
    | spl4_8 ),
    inference(sat_conversion,[],[f2959]) ).

cnf(s52,plain,
    ~ spl4_34,
    inference(sat_conversion,[],[f3417]) ).

cnf(s53,plain,
    ~ spl4_7,
    inference(rat,[],[s42,s52]) ).

cnf(s55,plain,
    spl4_8,
    inference(rat,[],[s43,s53]) ).

cnf(s60,plain,
    $false,
    inference(rat,[],[s3,s55]) ).

fof(f3418,plain,
    $false,
    inference(avatar_sat_refutation,[],[s60]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : GEO528+1 : TPTP v9.3.1. Released v7.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.37  % Computer : n002.cluster.edu
% 0.09/0.37  % Model    : x86_64 x86_64
% 0.09/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37  % Memory   : 8046.5625MB
% 0.09/0.37  % OS       : Linux 6.8.0-71-generic
% 0.09/0.38  % CPULimit : 300
% 0.09/0.38  % WCLimit  : 300
% 0.09/0.38  % DateTime : Sun Sep 27 08:29:22 UTC 2026
% 0.09/0.38  % CPUTime  : 
% 0.09/0.38  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.41  Running first-order model finding
% 0.09/0.41  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.92/0.57  % (3232647)Will run a generic schedule for satisfiability detection.
% 0.92/0.57  % (3232656)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2464465851:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.92/0.57  % (3232653)% WARNING: option uhcvi not known.
% 0.92/0.57  % (3232652)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2853316435_2999 on theBenchmark for (2999ds/0Mi)
% 0.92/0.57  % (3232653)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3449706471:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.92/0.57  % (3232654)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4136634625:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.92/0.57  % (3232655)dis+10_1_sil=32000:sp=arity:random_seed=114403474:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.92/0.57  % (3232657)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1117224266:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.92/0.57  % (3232658)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=735349359:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.92/0.57  % Detected minimum model sizes of [3]
% 0.92/0.57  % Detected maximum model sizes of [max]
% 0.92/0.57  % TRYING [3]
% 0.92/0.57  % (3232656)Instruction limit reached! 
% 0.92/0.57  % (3232656)------------------------------
% 0.92/0.57  % (3232656)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.92/0.57  % (3232656)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.92/0.57  % (3232656)CaDiCaL version: 2.1.3
% 0.92/0.57  % (3232656)Termination reason: Instruction limit
% 0.92/0.57  % (3232656)Termination phase: Saturation
% 0.92/0.57  % (3232656)Time elapsed: 0.038 s
% 0.92/0.57  % (3232656)Peak memory usage: 13 MB
% 0.92/0.57  % (3232656)Instructions burned: 117 (million)
% 0.92/0.57  % (3232666)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3090276899:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.92/0.57  % Detected minimum model sizes of [3]
% 0.92/0.57  % Detected maximum model sizes of [max]
% 0.92/0.57  % TRYING [3]
% 0.92/0.57  % (3232655)Instruction limit reached! 
% 0.92/0.57  % (3232655)------------------------------
% 0.92/0.57  % (3232655)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.92/0.57  % (3232655)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.92/0.57  % (3232655)CaDiCaL version: 2.1.3
% 0.92/0.57  % (3232655)Termination reason: Instruction limit
% 0.92/0.57  % (3232655)Termination phase: Saturation
% 0.92/0.57  % (3232655)Time elapsed: 0.065 s
% 0.92/0.57  % (3232655)Peak memory usage: 13 MB
% 0.92/0.57  % (3232655)Instructions burned: 104 (million)
% 0.92/0.57  % (3232657)Instruction limit reached! 
% 0.92/0.57  % (3232657)------------------------------
% 0.92/0.57  % (3232657)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.92/0.57  % (3232657)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.92/0.57  % (3232657)CaDiCaL version: 2.1.3
% 0.92/0.57  % (3232657)Termination reason: Instruction limit
% 0.92/0.57  % (3232657)Termination phase: Saturation
% 0.92/0.57  % (3232657)Time elapsed: 0.082 s
% 0.92/0.57  % (3232657)Peak memory usage: 13 MB
% 0.92/0.57  % (3232657)Instructions burned: 132 (million)
% 0.92/0.57  % (3232668)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2103837480:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 0.92/0.57  % (3232658)Instruction limit reached! 
% 0.92/0.57  % (3232658)------------------------------
% 0.92/0.57  % (3232658)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.92/0.57  % (3232658)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.92/0.57  % (3232658)CaDiCaL version: 2.1.3
% 0.92/0.57  % (3232658)Termination reason: Instruction limit
% 0.92/0.57  % (3232658)Termination phase: Saturation
% 0.92/0.57  % (3232658)Time elapsed: 0.097 s
% 0.92/0.57  % (3232658)Peak memory usage: 14 MB
% 0.92/0.57  % (3232658)Instructions burned: 159 (million)
% 0.92/0.57  % (3232653) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3232647-3232653"...
% 0.92/0.57  % (3232653)...printing done.
% 0.92/0.57  % (3232669)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=823937822:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 0.92/0.57  % (3232653)Refutation found. Thanks to Tanya!
% 0.92/0.57  % SZS status Theorem for theBenchmark
% 0.92/0.57  % SZS output start Proof for theBenchmark
% See solution above
% 0.92/0.57  % (3232653)------------------------------
% 0.92/0.57  % (3232653)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.92/0.57  % (3232653)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.92/0.57  % (3232653)CaDiCaL version: 2.1.3
% 0.92/0.57  % (3232653)Termination reason: Refutation
% 0.92/0.57  % (3232653)Time elapsed: 0.103 s
% 0.92/0.57  % (3232653)Peak memory usage: 14 MB
% 0.92/0.57  % (3232653)Instructions burned: 165 (million)
% 0.92/0.57  % (3232647)Success in time 0.15 s
% 0.92/0.57  % Vampire exiting
%------------------------------------------------------------------------------