↑ 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  : SYN327+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 : n026.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:07:19 PM UTC 2026

% Result   : Theorem 0.21s 0.26s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    1
% Syntax   : Number of formulae    :    9 (   3 unt;   0 def)
%            Number of atoms       :   36 (   0 equ)
%            Maximal formula atoms :    7 (   4 avg)
%            Number of connectives :   44 (  17   ~;   7   |;  12   &)
%                                         (   0 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   6 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   1 con; 0-1 aty)
%            Number of variables   :   14 (   8   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    ! [X0] :
    ? [X1] :
    ! [X2] :
      ( big_f(X1,X0)
     => ( ( big_f(X0,X2)
         => big_f(X0,X1) )
        & ( big_f(X0,X1)
         => ( ~ big_f(X0,X2)
           => ( big_f(X1,X0)
              & big_f(X2,X1) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',church_46_12_2) ).

fof(f2,negated_conjecture,
    ~ ! [X0] :
      ? [X1] :
      ! [X2] :
        ( big_f(X1,X0)
       => ( ( big_f(X0,X2)
           => big_f(X0,X1) )
          & ( big_f(X0,X1)
           => ( ~ big_f(X0,X2)
             => ( big_f(X1,X0)
                & big_f(X2,X1) ) ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

fof(f3,plain,
    ? [X0] :
    ! [X1] :
    ? [X2] :
      ( ( ( ~ big_f(X0,X1)
          & big_f(X0,X2) )
        | ( ( ~ big_f(X1,X0)
            | ~ big_f(X2,X1) )
          & ~ big_f(X0,X2)
          & big_f(X0,X1) ) )
      & big_f(X1,X0) ),
    inference(ennf_transformation,[],[f2]) ).

fof(f4,plain,
    ? [X0] :
    ! [X1] :
    ? [X2] :
      ( ( ( ~ big_f(X0,X1)
          & big_f(X0,X2) )
        | ( ( ~ big_f(X1,X0)
            | ~ big_f(X2,X1) )
          & ~ big_f(X0,X2)
          & big_f(X0,X1) ) )
      & big_f(X1,X0) ),
    inference(flattening,[],[f3]) ).

fof(f5,plain,
    ! [X1] :
      ( ~ big_f(sK1(X1),X1)
      | ~ big_f(X1,sK0)
      | ~ big_f(sK0,X1) ),
    inference(cnf_transformation,[],[f4]) ).

fof(f9,plain,
    ! [X1] : big_f(X1,sK0),
    inference(cnf_transformation,[],[f4]) ).

fof(f11,plain,
    ( ~ big_f(sK0,sK0)
    | ~ big_f(sK0,sK0) ),
    inference(resolution,[],[f5,f9]) ).

fof(f12,plain,
    ~ big_f(sK0,sK0),
    inference(duplicate_literal_removal,[],[f11]) ).

fof(f13,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f12,f9]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN327+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.20  % Computer : n026.cluster.edu
% 0.10/0.20  % Model    : x86_64 x86_64
% 0.10/0.20  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.20  % Memory   : 8046.5625MB
% 0.10/0.20  % OS       : Linux 6.8.0-71-generic
% 0.10/0.20  % CPULimit : 300
% 0.10/0.20  % WCLimit  : 300
% 0.10/0.20  % DateTime : Mon Sep 28 15:44:57 UTC 2026
% 0.10/0.20  % CPUTime  : 
% 0.10/0.20  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.23  Running first-order model finding
% 0.10/0.23  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  % (3963295)Will run a generic schedule for satisfiability detection.
% 0.21/0.26  % (3963304)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=423498845:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.21/0.26  % (3963304) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3963295-3963304"...
% 0.21/0.26  % (3963304)...printing done.
% 0.21/0.26  % (3963304)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  % (3963304)------------------------------
% 0.21/0.26  % (3963304)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.26  % (3963304)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.26  % (3963304)CaDiCaL version: 2.1.3
% 0.21/0.26  % (3963304)Termination reason: Refutation
% 0.21/0.26  % (3963304)Time elapsed: 0.001 s
% 0.21/0.26  % (3963304)Peak memory usage: 11 MB
% 0.21/0.26  % (3963295)Success in time 0.026 s
% 0.21/0.26  % Vampire exiting
%------------------------------------------------------------------------------