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

% Computer : n006.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 02:31:19 PM UTC 2026

% Result   : Theorem 0.07s 0.24s
% Output   : Refutation 0.07s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   59 (   6 unt;   0 typ;   9 def)
%            Number of atoms       :  248 (  42 equ)
%            Maximal formula atoms :    6 (   4 avg)
%            Number of connectives :  178 (  73   ~;  91   |;   5   &)
%                                         (   9 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of FOOLs       :   84 (  84 fml;   0 var)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :   15 (  12 usr;  14 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   0 con; 1-1 aty)
%            Number of variables   :    0 (   0 sgn   0   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
tff(func_def_0,type,
    f: $o > $i ).

tff(func_def_1,type,
    f1: $o > $i ).

tff(func_def_2,type,
    f2: $o > $i ).

tff(func_def_3,type,
    g: $o > $i ).

tff(func_def_4,type,
    g1: $o > $i ).

tff(func_def_5,type,
    g2: $o > $i ).

tff(f1,conjecture,
    ( ( f(a) = g(b) )
    | ( f(b) != g(a) )
    | ( f1(a) = g1(c) )
    | ( f1(c) != g1(a) )
    | ( f2(b) = g2(c) )
    | ( f2(c) != g2(b) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).

tff(f2,negated_conjecture,
    ~ ( ( f(a) = g(b) )
      | ( f(b) != g(a) )
      | ( f1(a) = g1(c) )
      | ( f1(c) != g1(a) )
      | ( f2(b) = g2(c) )
      | ( f2(c) != g2(b) ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

tff(f3,plain,
    ~ ( ( f(a) = g(b) )
      | ( f(b) != g(a) )
      | ( f1(a) = g1(c) )
      | ( f1(c) != g1(a) )
      | ( f2(b) = g2(c) )
      | ( f2(c) != g2(b) ) ),
    inference(rectify,[],[f2]) ).

tff(f4,plain,
    ( ( f(a) != g(b) )
    & ( f(b) = g(a) )
    & ( f1(a) != g1(c) )
    & ( f1(c) = g1(a) )
    & ( f2(b) != g2(c) )
    & ( f2(c) = g2(b) ) ),
    inference(ennf_transformation,[],[f3]) ).

tff(f6,plain,
    ( b
    | a
    | ( g($false) != f($false) ) ),
    inference(cnf_transformation,[],[f4]) ).

tff(f7,plain,
    ( ~ b
    | ~ a
    | ( g($true) != f($true) ) ),
    inference(cnf_transformation,[],[f4]) ).

tff(f10,plain,
    ( a
    | b
    | ( g($false) = f($false) ) ),
    inference(cnf_transformation,[],[f4]) ).

tff(f11,plain,
    ( ~ a
    | ~ b
    | ( g($true) = f($true) ) ),
    inference(cnf_transformation,[],[f4]) ).

tff(f14,plain,
    ( c
    | a
    | ( g1($false) != f1($false) ) ),
    inference(cnf_transformation,[],[f4]) ).

tff(f15,plain,
    ( ~ c
    | ~ a
    | ( g1($true) != f1($true) ) ),
    inference(cnf_transformation,[],[f4]) ).

tff(f18,plain,
    ( a
    | c
    | ( g1($false) = f1($false) ) ),
    inference(cnf_transformation,[],[f4]) ).

tff(f19,plain,
    ( ~ a
    | ~ c
    | ( g1($true) = f1($true) ) ),
    inference(cnf_transformation,[],[f4]) ).

tff(f22,plain,
    ( c
    | b
    | ( g2($false) != f2($false) ) ),
    inference(cnf_transformation,[],[f4]) ).

tff(f23,plain,
    ( ~ c
    | ~ b
    | ( g2($true) != f2($true) ) ),
    inference(cnf_transformation,[],[f4]) ).

tff(f26,plain,
    ( b
    | c
    | ( g2($false) = f2($false) ) ),
    inference(cnf_transformation,[],[f4]) ).

tff(f27,plain,
    ( ~ b
    | ~ c
    | ( g2($true) = f2($true) ) ),
    inference(cnf_transformation,[],[f4]) ).

tff(f36,definition,
    ( spl0_2
  <=> a ),
    introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).

tff(f40,definition,
    ( spl0_3
  <=> b ),
    introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).

tff(f45,definition,
    ( spl0_4
  <=> ( g($false) = f($false) ) ),
    introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).

tff(f48,plain,
    ( ~ spl0_4
    | spl0_2
    | spl0_3 ),
    inference(avatar_split_clause,[],[f6,f40,f36,f45]) ).

tff(f50,definition,
    ( spl0_5
  <=> ( g($true) = f($true) ) ),
    introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).

tff(f53,plain,
    ( ~ spl0_5
    | ~ spl0_2
    | ~ spl0_3 ),
    inference(avatar_split_clause,[],[f7,f40,f36,f50]) ).

tff(f60,plain,
    ( spl0_4
    | spl0_3
    | spl0_2 ),
    inference(avatar_split_clause,[],[f10,f36,f40,f45]) ).

tff(f61,plain,
    ( spl0_5
    | ~ spl0_3
    | ~ spl0_2 ),
    inference(avatar_split_clause,[],[f11,f36,f40,f50]) ).

tff(f68,definition,
    ( spl0_8
  <=> c ),
    introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).

tff(f73,definition,
    ( spl0_9
  <=> ( g1($false) = f1($false) ) ),
    introduced(definition,[new_symbols(definition,[spl0_9])],[avatar_definition]) ).

tff(f76,plain,
    ( ~ spl0_9
    | spl0_2
    | spl0_8 ),
    inference(avatar_split_clause,[],[f14,f68,f36,f73]) ).

tff(f78,definition,
    ( spl0_10
  <=> ( g1($true) = f1($true) ) ),
    introduced(definition,[new_symbols(definition,[spl0_10])],[avatar_definition]) ).

tff(f81,plain,
    ( ~ spl0_10
    | ~ spl0_2
    | ~ spl0_8 ),
    inference(avatar_split_clause,[],[f15,f68,f36,f78]) ).

tff(f88,plain,
    ( spl0_9
    | spl0_8
    | spl0_2 ),
    inference(avatar_split_clause,[],[f18,f36,f68,f73]) ).

tff(f89,plain,
    ( spl0_10
    | ~ spl0_8
    | ~ spl0_2 ),
    inference(avatar_split_clause,[],[f19,f36,f68,f78]) ).

tff(f97,definition,
    ( spl0_13
  <=> ( g2($false) = f2($false) ) ),
    introduced(definition,[new_symbols(definition,[spl0_13])],[avatar_definition]) ).

tff(f100,plain,
    ( ~ spl0_13
    | spl0_3
    | spl0_8 ),
    inference(avatar_split_clause,[],[f22,f68,f40,f97]) ).

tff(f102,definition,
    ( spl0_14
  <=> ( g2($true) = f2($true) ) ),
    introduced(definition,[new_symbols(definition,[spl0_14])],[avatar_definition]) ).

tff(f105,plain,
    ( ~ spl0_14
    | ~ spl0_3
    | ~ spl0_8 ),
    inference(avatar_split_clause,[],[f23,f68,f40,f102]) ).

tff(f112,plain,
    ( spl0_13
    | spl0_8
    | spl0_3 ),
    inference(avatar_split_clause,[],[f26,f40,f68,f97]) ).

tff(f113,plain,
    ( spl0_14
    | ~ spl0_8
    | ~ spl0_3 ),
    inference(avatar_split_clause,[],[f27,f40,f68,f102]) ).

cnf(s2,plain,
    ( spl0_2
    | spl0_3
    | ~ spl0_4 ),
    inference(sat_conversion,[],[f48]) ).

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

cnf(s6,plain,
    ( spl0_2
    | spl0_3
    | spl0_4 ),
    inference(sat_conversion,[],[f60]) ).

cnf(s7,plain,
    ( ~ spl0_2
    | ~ spl0_3
    | spl0_5 ),
    inference(sat_conversion,[],[f61]) ).

cnf(s10,plain,
    ( spl0_2
    | spl0_8
    | ~ spl0_9 ),
    inference(sat_conversion,[],[f76]) ).

cnf(s11,plain,
    ( ~ spl0_2
    | ~ spl0_8
    | ~ spl0_10 ),
    inference(sat_conversion,[],[f81]) ).

cnf(s14,plain,
    ( spl0_2
    | spl0_8
    | spl0_9 ),
    inference(sat_conversion,[],[f88]) ).

cnf(s15,plain,
    ( ~ spl0_2
    | ~ spl0_8
    | spl0_10 ),
    inference(sat_conversion,[],[f89]) ).

cnf(s18,plain,
    ( spl0_3
    | spl0_8
    | ~ spl0_13 ),
    inference(sat_conversion,[],[f100]) ).

cnf(s19,plain,
    ( ~ spl0_3
    | ~ spl0_8
    | ~ spl0_14 ),
    inference(sat_conversion,[],[f105]) ).

cnf(s22,plain,
    ( spl0_3
    | spl0_8
    | spl0_13 ),
    inference(sat_conversion,[],[f112]) ).

cnf(s23,plain,
    ( ~ spl0_3
    | ~ spl0_8
    | spl0_14 ),
    inference(sat_conversion,[],[f113]) ).

cnf(s25,plain,
    ( spl0_2
    | spl0_3 ),
    inference(rat,[],[s2,s6]) ).

cnf(s27,plain,
    ( spl0_8
    | spl0_3 ),
    inference(rat,[],[s18,s22]) ).

cnf(s28,plain,
    ( ~ spl0_8
    | ~ spl0_2 ),
    inference(rat,[],[s11,s15]) ).

cnf(s29,plain,
    ( ~ spl0_3
    | ~ spl0_2 ),
    inference(rat,[],[s3,s7]) ).

cnf(s30,plain,
    ~ spl0_2,
    inference(rat,[],[s29,s27,s28]) ).

cnf(s32,plain,
    spl0_3,
    inference(rat,[],[s25,s30]) ).

cnf(s34,plain,
    spl0_8,
    inference(rat,[],[s10,s14,s30]) ).

cnf(s37,plain,
    spl0_14,
    inference(rat,[],[s23,s32,s34]) ).

cnf(s38,plain,
    $false,
    inference(rat,[],[s19,s32,s34,s37]) ).

tff(f115,plain,
    $false,
    inference(avatar_sat_refutation,[],[s38]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYO499_8 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.18  % Computer : n006.cluster.edu
% 0.07/0.18  % Model    : x86_64 x86_64
% 0.07/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18  % Memory   : 8046.5625MB
% 0.07/0.18  % OS       : Linux 6.8.0-71-generic
% 0.07/0.19  % CPULimit : 300
% 0.07/0.19  % WCLimit  : 300
% 0.07/0.19  % DateTime : Mon Sep 28 17:45:55 UTC 2026
% 0.07/0.19  % CPUTime  : 
% 0.07/0.19  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.22  Running first-order model finding
% 0.07/0.22  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.07/0.24  % (4190661)Will run a generic schedule for satisfiability detection.
% 0.07/0.24  % (4190675)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2892083832:i=116_3000 on theBenchmark for (3000ds/116Mi)
% 0.07/0.24  % (4190675) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-4190661-4190675"...
% 0.07/0.24  % (4190675)...printing done.
% 0.07/0.24  % (4190675)Refutation found. Thanks to Tanya!
% 0.07/0.24  % SZS status Theorem for theBenchmark
% 0.07/0.24  % SZS output start Proof for theBenchmark
% See solution above
% 0.07/0.24  % (4190675)------------------------------
% 0.07/0.24  % (4190675)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.07/0.24  % (4190675)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.07/0.24  % (4190675)CaDiCaL version: 2.1.3
% 0.07/0.24  % (4190675)Termination reason: Refutation
% 0.07/0.24  % (4190675)Time elapsed: 0.001 s
% 0.07/0.24  % (4190675)Peak memory usage: 12 MB
% 0.07/0.24  % (4190675)Instructions burned: 2 (million)
% 0.07/0.24  % (4190661)Success in time 0.016 s
% 0.07/0.24  % Vampire exiting
%------------------------------------------------------------------------------