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

% Computer : n014.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 12:30:37 PM UTC 2026

% Result   : Theorem 0.17s 0.47s
% Output   : Refutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   33 (   6 unt;   2 def)
%            Number of atoms       :  104 (   0 equ)
%            Maximal formula atoms :    9 (   3 avg)
%            Number of connectives :  109 (  38   ~;  35   |;  26   &)
%                                         (   2 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    8 (   7 usr;   3 prp; 0-3 aty)
%            Number of functors    :    9 (   9 usr;   6 con; 0-1 aty)
%            Number of variables   :   58 (   0 sgn  40   !;  18   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f10,axiom,
    ! [X0,X1,X2] :
      ( ( occurrence_of(X0,X2)
        & leaf_occ(X1,X0) )
     => ~ ? [X3] : min_precedes(X1,X3,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_09) ).

fof(f33,axiom,
    ! [X0] :
      ( occurrence_of(X0,tptp0)
     => ? [X1,X2,X3] :
          ( occurrence_of(X1,tptp3)
          & root_occ(X1,X0)
          & occurrence_of(X2,tptp4)
          & next_subocc(X1,X2,tptp0)
          & ( occurrence_of(X3,tptp1)
            | occurrence_of(X3,tptp2) )
          & next_subocc(X2,X3,tptp0)
          & leaf_occ(X3,X0) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_32) ).

fof(f46,conjecture,
    ! [X0] :
      ( occurrence_of(X0,tptp0)
     => ? [X1,X2] :
          ( leaf_occ(X2,X0)
          & ( occurrence_of(X2,tptp1)
           => ~ ? [X3] :
                  ( occurrence_of(X3,tptp2)
                  & min_precedes(X1,X3,tptp0) ) )
          & ( occurrence_of(X2,tptp2)
           => ~ ? [X4] :
                  ( occurrence_of(X4,tptp1)
                  & min_precedes(X1,X4,tptp0) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).

fof(f47,negated_conjecture,
    ~ ! [X0] :
        ( occurrence_of(X0,tptp0)
       => ? [X1,X2] :
            ( leaf_occ(X2,X0)
            & ( occurrence_of(X2,tptp1)
             => ~ ? [X3] :
                    ( occurrence_of(X3,tptp2)
                    & min_precedes(X1,X3,tptp0) ) )
            & ( occurrence_of(X2,tptp2)
             => ~ ? [X4] :
                    ( occurrence_of(X4,tptp1)
                    & min_precedes(X1,X4,tptp0) ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f46]) ).

fof(f69,plain,
    ! [X0,X1,X2] :
      ( ! [X3] : ~ min_precedes(X1,X3,X2)
      | ~ occurrence_of(X0,X2)
      | ~ leaf_occ(X1,X0) ),
    inference(ennf_transformation,[],[f10]) ).

fof(f70,plain,
    ! [X0,X1,X2] :
      ( ! [X3] : ~ min_precedes(X1,X3,X2)
      | ~ occurrence_of(X0,X2)
      | ~ leaf_occ(X1,X0) ),
    inference(flattening,[],[f69]) ).

fof(f96,plain,
    ! [X0] :
      ( ? [X1,X2,X3] :
          ( occurrence_of(X1,tptp3)
          & root_occ(X1,X0)
          & occurrence_of(X2,tptp4)
          & next_subocc(X1,X2,tptp0)
          & ( occurrence_of(X3,tptp1)
            | occurrence_of(X3,tptp2) )
          & next_subocc(X2,X3,tptp0)
          & leaf_occ(X3,X0) )
      | ~ occurrence_of(X0,tptp0) ),
    inference(ennf_transformation,[],[f33]) ).

fof(f97,plain,
    ? [X0] :
      ( ! [X1,X2] :
          ( ~ leaf_occ(X2,X0)
          | ( ? [X3] :
                ( occurrence_of(X3,tptp2)
                & min_precedes(X1,X3,tptp0) )
            & occurrence_of(X2,tptp1) )
          | ( ? [X4] :
                ( occurrence_of(X4,tptp1)
                & min_precedes(X1,X4,tptp0) )
            & occurrence_of(X2,tptp2) ) )
      & occurrence_of(X0,tptp0) ),
    inference(ennf_transformation,[],[f47]) ).

fof(f111,plain,
    ! [X2,X3,X0,X1] :
      ( ~ leaf_occ(X1,X0)
      | ~ occurrence_of(X0,X2)
      | ~ min_precedes(X1,X3,X2) ),
    inference(cnf_transformation,[],[f70]) ).

fof(f154,plain,
    ! [X0] :
      ( ~ occurrence_of(X0,tptp0)
      | leaf_occ(sK14(X0),X0) ),
    inference(cnf_transformation,[],[f96]) ).

fof(f175,plain,
    ! [X2,X1] :
      ( min_precedes(X1,sK16(X1),tptp0)
      | min_precedes(X1,sK17(X1),tptp0)
      | ~ leaf_occ(X2,sK15) ),
    inference(cnf_transformation,[],[f97]) ).

fof(f180,plain,
    occurrence_of(sK15,tptp0),
    inference(cnf_transformation,[],[f97]) ).

fof(f192,plain,
    ! [X2,X3,X0,X1] :
      ( ~ min_precedes(X1,X3,X2)
      | ~ occurrence_of(X0,X2)
      | leaf_occ(X1,X0) ),
    inference(consistent_polarity_flipping,[],[f111]) ).

fof(f218,plain,
    ! [X0] :
      ( ~ leaf_occ(sK14(X0),X0)
      | ~ occurrence_of(X0,tptp0) ),
    inference(consistent_polarity_flipping,[],[f154]) ).

fof(f228,plain,
    ! [X2,X1] :
      ( min_precedes(X1,sK16(X1),tptp0)
      | min_precedes(X1,sK17(X1),tptp0)
      | leaf_occ(X2,sK15) ),
    inference(consistent_polarity_flipping,[],[f175]) ).

fof(f245,definition,
    ( spl18_4
  <=> ! [X2] : leaf_occ(X2,sK15) ),
    introduced(definition,[new_symbols(definition,[spl18_4])],[avatar_definition]) ).

fof(f246,plain,
    ( ! [X2] : leaf_occ(X2,sK15)
    | ~ spl18_4 ),
    inference(avatar_component_clause,[],[f245]) ).

fof(f256,definition,
    ( spl18_7
  <=> ! [X1] :
        ( min_precedes(X1,sK16(X1),tptp0)
        | min_precedes(X1,sK17(X1),tptp0) ) ),
    introduced(definition,[new_symbols(definition,[spl18_7])],[avatar_definition]) ).

fof(f257,plain,
    ( ! [X1] :
        ( min_precedes(X1,sK17(X1),tptp0)
        | min_precedes(X1,sK16(X1),tptp0) )
    | ~ spl18_7 ),
    inference(avatar_component_clause,[],[f256]) ).

fof(f258,plain,
    ( spl18_4
    | spl18_7 ),
    inference(avatar_split_clause,[],[f228,f256,f245]) ).

fof(f288,plain,
    ( ~ occurrence_of(sK15,tptp0)
    | ~ spl18_4 ),
    inference(resolution,[],[f218,f246]) ).

fof(f289,plain,
    ( $false
    | ~ spl18_4 ),
    inference(forward_subsumption_resolution,[],[f288,f180]) ).

fof(f290,plain,
    ~ spl18_4,
    inference(avatar_contradiction_clause,[],[f289]) ).

fof(f345,plain,
    ( ! [X0,X1] :
        ( ~ occurrence_of(X0,tptp0)
        | leaf_occ(X1,X0)
        | min_precedes(X1,sK16(X1),tptp0) )
    | ~ spl18_7 ),
    inference(resolution,[],[f192,f257]) ).

fof(f348,plain,
    ( ! [X0,X1] :
        ( ~ occurrence_of(X0,tptp0)
        | leaf_occ(X1,X0) )
    | ~ spl18_7 ),
    inference(forward_subsumption_resolution,[],[f345,f192]) ).

fof(f368,plain,
    ( ! [X0] : leaf_occ(X0,sK15)
    | ~ spl18_7 ),
    inference(resolution,[],[f348,f180]) ).

fof(f369,plain,
    ( spl18_4
    | ~ spl18_7 ),
    inference(avatar_split_clause,[],[f368,f256,f245]) ).

cnf(s5,plain,
    ( spl18_4
    | spl18_7 ),
    inference(sat_conversion,[],[f258]) ).

cnf(s9,plain,
    ~ spl18_4,
    inference(sat_conversion,[],[f290]) ).

cnf(s10,plain,
    ( spl18_4
    | ~ spl18_7 ),
    inference(sat_conversion,[],[f369]) ).

cnf(s11,plain,
    ~ spl18_7,
    inference(rat,[],[s10,s9]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : PRO010+4 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.39  % Computer : n014.cluster.edu
% 0.12/0.39  % Model    : x86_64 x86_64
% 0.12/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.39  % Memory   : 8046.5625MB
% 0.12/0.39  % OS       : Linux 6.8.0-71-generic
% 0.12/0.39  % CPULimit : 300
% 0.12/0.39  % WCLimit  : 300
% 0.12/0.39  % DateTime : Sun Sep 27 22:21:16 UTC 2026
% 0.12/0.39  % CPUTime  : 
% 0.12/0.39  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.42  Running first-order model finding
% 0.12/0.42  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.17/0.47  % (1225930)Will run a generic schedule for satisfiability detection.
% 0.17/0.47  % (1225936)% WARNING: option uhcvi not known.
% 0.17/0.47  % (1225936)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3263939483:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.47  % (1225936) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1225930-1225936"...
% 0.17/0.47  % (1225936)...printing done.
% 0.17/0.47  % (1225936)Refutation found. Thanks to Tanya!
% 0.17/0.47  % SZS status Theorem for theBenchmark
% 0.17/0.47  % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.47  % (1225936)------------------------------
% 0.17/0.47  % (1225936)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.47  % (1225936)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.47  % (1225936)CaDiCaL version: 2.1.3
% 0.17/0.47  % (1225936)Termination reason: Refutation
% 0.17/0.47  % (1225936)Time elapsed: 0.004 s
% 0.17/0.47  % (1225936)Peak memory usage: 12 MB
% 0.17/0.47  % (1225936)Instructions burned: 9 (million)
% 0.17/0.47  % (1225930)Success in time 0.032 s
% 0.17/0.47  % Vampire exiting
%------------------------------------------------------------------------------