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

% Computer : n012.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:53:36 AM UTC 2026

% Result   : Theorem 0.06s 0.38s
% Output   : Refutation 0.06s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   36 (  13 unt;   2 def)
%            Number of atoms       :   79 (   6 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   88 (  45   ~;  33   |;   5   &)
%                                         (   3 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   3 prp; 0-4 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-4 aty)
%            Number of variables   :   48 (   0 sgn  43   !;   5   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f17,axiom,
    ! [X0,X1,X2,X3] :
      ( between_c(X0,X1,X2,X3)
    <=> ( X1 != X3
        & ? [X4] :
            ( part_of(X4,X0)
            & end_point(X1,X4)
            & end_point(X3,X4)
            & inner_point(X2,X4) ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO004+1.ax',between_c_defn) ).

fof(f18,conjecture,
    ! [X0,X1,X2,X3] :
      ( between_c(X0,X1,X2,X3)
     => between_c(X0,X3,X2,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',theorem_3_8_2) ).

fof(f19,negated_conjecture,
    ~ ! [X0,X1,X2,X3] :
        ( between_c(X0,X1,X2,X3)
       => between_c(X0,X3,X2,X1) ),
    inference(negated_conjecture,[status(cth)],[f18]) ).

fof(f41,plain,
    ? [X0,X1,X2,X3] :
      ( ~ between_c(X0,X3,X2,X1)
      & between_c(X0,X1,X2,X3) ),
    inference(ennf_transformation,[],[f19]) ).

fof(f83,plain,
    ! [X2,X3,X0,X1,X4] :
      ( between_c(X0,X1,X2,X3)
      | ~ end_point(X3,X4)
      | ~ end_point(X1,X4)
      | ~ part_of(X4,X0)
      | X1 = X3
      | ~ inner_point(X2,X4) ),
    inference(cnf_transformation,[],[f17]) ).

fof(f84,plain,
    ! [X2,X3,X0,X1] :
      ( ~ between_c(X0,X1,X2,X3)
      | inner_point(X2,sK13(X0,X1,X2,X3)) ),
    inference(cnf_transformation,[],[f17]) ).

fof(f85,plain,
    ! [X2,X3,X0,X1] :
      ( ~ between_c(X0,X1,X2,X3)
      | end_point(X3,sK13(X0,X1,X2,X3)) ),
    inference(cnf_transformation,[],[f17]) ).

fof(f86,plain,
    ! [X2,X3,X0,X1] :
      ( ~ between_c(X0,X1,X2,X3)
      | end_point(X1,sK13(X0,X1,X2,X3)) ),
    inference(cnf_transformation,[],[f17]) ).

fof(f87,plain,
    ! [X2,X3,X0,X1] :
      ( ~ between_c(X0,X1,X2,X3)
      | part_of(sK13(X0,X1,X2,X3),X0) ),
    inference(cnf_transformation,[],[f17]) ).

fof(f88,plain,
    ! [X2,X3,X0,X1] :
      ( X1 != X3
      | ~ between_c(X0,X1,X2,X3) ),
    inference(cnf_transformation,[],[f17]) ).

fof(f89,plain,
    between_c(sK14,sK15,sK16,sK17),
    inference(cnf_transformation,[],[f41]) ).

fof(f90,plain,
    ~ between_c(sK14,sK17,sK16,sK15),
    inference(cnf_transformation,[],[f41]) ).

fof(f95,plain,
    ! [X2,X3,X0] : ~ between_c(X0,X3,X2,X3),
    inference(equality_resolution,[],[f88]) ).

fof(f147,plain,
    inner_point(sK16,sK13(sK14,sK15,sK16,sK17)),
    inference(resolution,[],[f84,f89]) ).

fof(f152,plain,
    end_point(sK17,sK13(sK14,sK15,sK16,sK17)),
    inference(resolution,[],[f85,f89]) ).

fof(f157,plain,
    end_point(sK15,sK13(sK14,sK15,sK16,sK17)),
    inference(resolution,[],[f86,f89]) ).

fof(f162,plain,
    part_of(sK13(sK14,sK15,sK16,sK17),sK14),
    inference(resolution,[],[f87,f89]) ).

fof(f282,plain,
    ! [X0] :
      ( ~ end_point(sK15,X0)
      | ~ end_point(sK17,X0)
      | ~ part_of(X0,sK14)
      | sK15 = sK17
      | ~ inner_point(sK16,X0) ),
    inference(resolution,[],[f83,f90]) ).

fof(f290,definition,
    ( spl18_3
  <=> sK15 = sK17 ),
    introduced(definition,[new_symbols(definition,[spl18_3])],[avatar_definition]) ).

fof(f292,plain,
    ( sK15 = sK17
    | ~ spl18_3 ),
    inference(avatar_component_clause,[],[f290]) ).

fof(f294,definition,
    ( spl18_4
  <=> ! [X0] :
        ( ~ end_point(sK15,X0)
        | ~ inner_point(sK16,X0)
        | ~ part_of(X0,sK14)
        | ~ end_point(sK17,X0) ) ),
    introduced(definition,[new_symbols(definition,[spl18_4])],[avatar_definition]) ).

fof(f295,plain,
    ( ! [X0] :
        ( ~ inner_point(sK16,X0)
        | ~ end_point(sK15,X0)
        | ~ part_of(X0,sK14)
        | ~ end_point(sK17,X0) )
    | ~ spl18_4 ),
    inference(avatar_component_clause,[],[f294]) ).

fof(f296,plain,
    ( spl18_3
    | spl18_4 ),
    inference(avatar_split_clause,[],[f282,f294,f290]) ).

fof(f297,plain,
    ( between_c(sK14,sK15,sK16,sK15)
    | ~ spl18_3 ),
    inference(superposition,[],[f89,f292]) ).

fof(f318,plain,
    ( $false
    | ~ spl18_3 ),
    inference(forward_subsumption_resolution,[],[f297,f95]) ).

fof(f319,plain,
    ~ spl18_3,
    inference(avatar_contradiction_clause,[],[f318]) ).

fof(f503,plain,
    ( ~ end_point(sK15,sK13(sK14,sK15,sK16,sK17))
    | ~ part_of(sK13(sK14,sK15,sK16,sK17),sK14)
    | ~ end_point(sK17,sK13(sK14,sK15,sK16,sK17))
    | ~ spl18_4 ),
    inference(resolution,[],[f295,f147]) ).

fof(f507,plain,
    ( ~ part_of(sK13(sK14,sK15,sK16,sK17),sK14)
    | ~ end_point(sK17,sK13(sK14,sK15,sK16,sK17))
    | ~ spl18_4 ),
    inference(forward_subsumption_resolution,[],[f503,f157]) ).

fof(f509,plain,
    ( ~ end_point(sK17,sK13(sK14,sK15,sK16,sK17))
    | ~ spl18_4 ),
    inference(forward_subsumption_resolution,[],[f507,f162]) ).

fof(f512,plain,
    ( $false
    | ~ spl18_4 ),
    inference(forward_subsumption_resolution,[],[f509,f152]) ).

fof(f513,plain,
    ~ spl18_4,
    inference(avatar_contradiction_clause,[],[f512]) ).

cnf(s2,plain,
    ( spl18_3
    | spl18_4 ),
    inference(sat_conversion,[],[f296]) ).

cnf(s3,plain,
    ~ spl18_3,
    inference(sat_conversion,[],[f319]) ).

cnf(s5,plain,
    ~ spl18_4,
    inference(sat_conversion,[],[f513]) ).

cnf(s6,plain,
    $false,
    inference(rat,[],[s2,s5,s3]) ).

fof(f514,plain,
    $false,
    inference(avatar_sat_refutation,[],[s6]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : GEO112+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.02  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.04/0.30  % Computer : n012.cluster.edu
% 0.04/0.30  % Model    : x86_64 x86_64
% 0.04/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.30  % Memory   : 8046.5625MB
% 0.04/0.30  % OS       : Linux 6.8.0-71-generic
% 0.04/0.30  % CPULimit : 300
% 0.04/0.30  % WCLimit  : 300
% 0.04/0.30  % DateTime : Sun Sep 27 07:03:05 UTC 2026
% 0.04/0.31  % CPUTime  : 
% 0.04/0.31  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.04/0.32  Running first-order model finding
% 0.04/0.32  Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.38  % (2027441)Will run a generic schedule for satisfiability detection.
% 0.06/0.38  % (2027447)% WARNING: option uhcvi not known.
% 0.06/0.38  % (2027447)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3779897918:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.06/0.38  % (2027446)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=52963639_2999 on theBenchmark for (2999ds/0Mi)
% 0.06/0.38  % (2027449)dis+10_1_sil=32000:sp=arity:random_seed=2936377146:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.06/0.38  % (2027448)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3240403079:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.06/0.38  % (2027450)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1639826622:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.06/0.38  % (2027451)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4038342465:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.06/0.38  % (2027452)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1694525758:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.06/0.38  % TRYING [1]
% 0.06/0.38  % TRYING [2]
% 0.06/0.38  % TRYING [3]
% 0.06/0.38  % TRYING [4]
% 0.06/0.38  % (2027450) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2027441-2027450"...
% 0.06/0.38  % (2027450)...printing done.
% 0.06/0.38  % (2027450)Refutation found. Thanks to Tanya!
% 0.06/0.38  % SZS status Theorem for theBenchmark
% 0.06/0.38  % SZS output start Proof for theBenchmark
% See solution above
% 0.06/0.38  % (2027450)------------------------------
% 0.06/0.38  % (2027450)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.06/0.38  % (2027450)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.06/0.38  % (2027450)CaDiCaL version: 2.1.3
% 0.06/0.38  % (2027450)Termination reason: Refutation
% 0.06/0.38  % (2027450)Time elapsed: 0.023 s
% 0.06/0.38  % (2027450)Peak memory usage: 13 MB
% 0.06/0.38  % (2027450)Instructions burned: 91 (million)
% 0.06/0.38  % (2027441)Success in time 0.051 s
% 0.06/0.38  % Vampire exiting
%------------------------------------------------------------------------------