↑ 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  : SYO125^5 : 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 : n013.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 : Wed Sep 30 08:49:00 AM UTC 2026

% Result   : Theorem 0.21s 0.26s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   31 (   5 unt;   0 typ;   3 def)
%            Number of atoms       :  107 (  15 equ)
%            Maximal formula atoms :    6 (   3 avg)
%            Number of connectives :   67 (  21   ~;  18   |;   7   &)
%                                         (  16 <=>;   3  =>;   0  <=;   2 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    0 (   0 avg)
%            Number of FOOLs       :   30 (  30 fml;   0 var)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    9 (   6 usr;   8 prp; 0-2 aty)
%            Number of functors    :    0 (   0 usr;   0 con; --- aty)
%            Number of variables   :    0 (   0 sgn   0   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
tff(func_def_0,type,
    cR: $o ).

tff(func_def_1,type,
    cP: $o ).

tff(func_def_2,type,
    cQ: $o ).

tff(f1,conjecture,
    ( ( ( cQ
      <=> cR )
      & ( cP
      <=> cQ ) )
   => ( cP
    <=> cR ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTRIV4) ).

tff(f2,negated_conjecture,
    ~ ( ( ( cQ
        <=> cR )
        & ( cP
        <=> cQ ) )
     => ( cP
      <=> cR ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

tff(f3,plain,
    ~ ( ( ( cQ
        <=> cR )
        & ( cP
        <=> cQ ) )
     => ( cP
      <=> cR ) ),
    inference(rectify,[],[f2]) ).

tff(f4,plain,
    ( ( cP
    <~> cR )
    & ( cQ
    <=> cR )
    & ( cP
    <=> cQ ) ),
    inference(ennf_transformation,[],[f3]) ).

tff(f5,plain,
    ( ( cP
    <~> cR )
    & ( cQ
    <=> cR )
    & ( cP
    <=> cQ ) ),
    inference(flattening,[],[f4]) ).

tff(f6,plain,
    ( ( cR = $true )
    | ( cP = $true ) ),
    inference(cnf_transformation,[],[f5]) ).

tff(f7,plain,
    ( ( cR != $true )
    | ( cP != $true ) ),
    inference(cnf_transformation,[],[f5]) ).

tff(f8,plain,
    ( ( cR != $true )
    | ( cQ = $true ) ),
    inference(cnf_transformation,[],[f5]) ).

tff(f9,plain,
    ( ( cR = $true )
    | ( cQ != $true ) ),
    inference(cnf_transformation,[],[f5]) ).

tff(f10,plain,
    ( ( cQ != $true )
    | ( cP = $true ) ),
    inference(cnf_transformation,[],[f5]) ).

tff(f11,plain,
    ( ( cQ = $true )
    | ( cP != $true ) ),
    inference(cnf_transformation,[],[f5]) ).

tff(f15,definition,
    ( spl0_1
  <=> ( cP = $true ) ),
    introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).

tff(f19,definition,
    ( spl0_2
  <=> ( cR = $true ) ),
    introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).

tff(f22,plain,
    ( spl0_1
    | spl0_2 ),
    inference(avatar_split_clause,[],[f6,f19,f15]) ).

tff(f23,plain,
    ( ~ spl0_1
    | ~ spl0_2 ),
    inference(avatar_split_clause,[],[f7,f19,f15]) ).

tff(f25,definition,
    ( spl0_3
  <=> ( cQ = $true ) ),
    introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).

tff(f28,plain,
    ( spl0_3
    | ~ spl0_2 ),
    inference(avatar_split_clause,[],[f8,f19,f25]) ).

tff(f29,plain,
    ( ~ spl0_3
    | spl0_2 ),
    inference(avatar_split_clause,[],[f9,f19,f25]) ).

tff(f30,plain,
    ( spl0_1
    | ~ spl0_3 ),
    inference(avatar_split_clause,[],[f10,f25,f15]) ).

tff(f31,plain,
    ( ~ spl0_1
    | spl0_3 ),
    inference(avatar_split_clause,[],[f11,f25,f15]) ).

cnf(s1,plain,
    ( spl0_1
    | spl0_2 ),
    inference(sat_conversion,[],[f22]) ).

cnf(s2,plain,
    ( ~ spl0_1
    | ~ spl0_2 ),
    inference(sat_conversion,[],[f23]) ).

cnf(s3,plain,
    ( ~ spl0_2
    | spl0_3 ),
    inference(sat_conversion,[],[f28]) ).

cnf(s4,plain,
    ( spl0_2
    | ~ spl0_3 ),
    inference(sat_conversion,[],[f29]) ).

cnf(s5,plain,
    ( spl0_1
    | ~ spl0_3 ),
    inference(sat_conversion,[],[f30]) ).

cnf(s6,plain,
    ( ~ spl0_1
    | spl0_3 ),
    inference(sat_conversion,[],[f31]) ).

cnf(s7,plain,
    spl0_1,
    inference(rat,[],[s3,s1,s5]) ).

cnf(s8,plain,
    spl0_3,
    inference(rat,[],[s6,s7]) ).

cnf(s9,plain,
    ~ spl0_2,
    inference(rat,[],[s2,s7]) ).

cnf(s10,plain,
    $false,
    inference(rat,[],[s4,s8,s9]) ).

tff(f32,plain,
    $false,
    inference(avatar_sat_refutation,[],[s10]) ).

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