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

% Computer : n007.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 11:57:52 AM UTC 2026

% Result   : Theorem 0.11s 0.45s
% Output   : Refutation 0.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   21 (   8 unt;   2 def)
%            Number of atoms       :   54 (   0 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   56 (  23   ~;  18   |;   6   &)
%                                         (   4 <=>;   4  =>;   0  <=;   1 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    0 (   0 avg)
%            Number of predicates  :    5 (   4 usr;   5 prp; 0-0 aty)
%            Number of functors    :    0 (   0 usr;   0 con; --- aty)
%            Number of variables   :    0 (   0 sgn   0   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    ( ( ~ p
     => q )
  <=> ( ~ q
     => p ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel4) ).

fof(f2,negated_conjecture,
    ~ ( ( ~ p
       => q )
    <=> ( ~ q
       => p ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

fof(f3,plain,
    ( ( q
      | p )
  <~> ( p
      | q ) ),
    inference(ennf_transformation,[],[f2]) ).

fof(f4,plain,
    ( ( ( ~ p
        & ~ q )
      | ( ~ q
        & ~ p ) )
    & ( p
      | q
      | q
      | p ) ),
    inference(nnf_transformation,[],[f3]) ).

fof(f5,plain,
    ( ( ( ~ p
        & ~ q )
      | ( ~ q
        & ~ p ) )
    & ( p
      | q
      | q
      | p ) ),
    inference(flattening,[],[f4]) ).

fof(f6,plain,
    ( p
    | q
    | q
    | p ),
    inference(cnf_transformation,[],[f5]) ).

fof(f8,plain,
    ( ~ q
    | ~ q ),
    inference(cnf_transformation,[],[f5]) ).

fof(f9,plain,
    ( ~ p
    | ~ p ),
    inference(cnf_transformation,[],[f5]) ).

fof(f11,plain,
    ( p
    | q ),
    inference(duplicate_literal_removal,[],[f6]) ).

fof(f12,plain,
    ~ q,
    inference(duplicate_literal_removal,[],[f8]) ).

fof(f13,plain,
    ~ p,
    inference(duplicate_literal_removal,[],[f9]) ).

fof(f15,definition,
    ( spl0_1
  <=> q ),
    introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).

fof(f19,definition,
    ( spl0_2
  <=> p ),
    introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).

fof(f22,plain,
    ( spl0_1
    | spl0_2 ),
    inference(avatar_split_clause,[],[f11,f19,f15]) ).

fof(f24,plain,
    ~ spl0_1,
    inference(avatar_split_clause,[],[f12,f15]) ).

fof(f25,plain,
    ~ spl0_2,
    inference(avatar_split_clause,[],[f13,f19]) ).

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

cnf(s3,plain,
    ~ spl0_1,
    inference(sat_conversion,[],[f24]) ).

cnf(s4,plain,
    ~ spl0_2,
    inference(sat_conversion,[],[f25]) ).

cnf(s6,plain,
    $false,
    inference(rat,[],[s1,s4,s3]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL181+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.38  % Computer : n007.cluster.edu
% 0.11/0.38  % Model    : x86_64 x86_64
% 0.11/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38  % Memory   : 8046.5625MB
% 0.11/0.38  % OS       : Linux 6.8.0-71-generic
% 0.11/0.38  % CPULimit : 300
% 0.11/0.38  % WCLimit  : 300
% 0.11/0.38  % DateTime : Sun Sep 27 15:23:10 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.38  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.42  Running first-order model finding
% 0.11/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.11/0.45  % (1584002)Will run a generic schedule for satisfiability detection.
% 0.11/0.45  % (1584012)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1126890622:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.11/0.45  % (1584012) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1584002-1584012"...
% 0.11/0.45  % (1584012)...printing done.
% 0.11/0.45  % (1584008)% WARNING: option uhcvi not known.
% 0.11/0.45  % (1584012)Refutation found. Thanks to Tanya!
% 0.11/0.45  % SZS status Theorem for theBenchmark
% 0.11/0.45  % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.46  % (1584012)------------------------------
% 0.11/0.46  % (1584012)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.46  % (1584012)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.46  % (1584012)CaDiCaL version: 2.1.3
% 0.11/0.46  % (1584012)Termination reason: Refutation
% 0.11/0.46  % (1584012)Time elapsed: 0.001 s
% 0.11/0.46  % (1584012)Peak memory usage: 12 MB
% 0.11/0.46  % (1584002)Success in time 0.028 s
% 0.11/0.46  % Vampire exiting
%------------------------------------------------------------------------------