↑ 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  : SYN331+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:20 PM UTC 2026

% Result   : Theorem 0.09s 0.25s
% Output   : Refutation 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   11 (   4 unt;   0 def)
%            Number of atoms       :   42 (   0 equ)
%            Maximal formula atoms :    8 (   3 avg)
%            Number of connectives :   38 (   7   ~;   9   |;  10   &)
%                                         (   4 <=>;   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    :    1 (   1 usr;   0 con; 2-2 aty)
%            Number of variables   :   23 (  17   !;   6   ?)

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

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

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

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

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

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

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

fof(f12,plain,
    ! [X0,X1] :
      ( big_f(X0,X1)
      | big_f(X1,X0) ),
    inference(resolution,[],[f6,f5]) ).

fof(f18,plain,
    ! [X0] : big_f(X0,X0),
    inference(factoring,[],[f12]) ).

fof(f19,plain,
    ! [X0,X1] : big_f(X0,X1),
    inference(backward_subsumption_resolution,[],[f6,f18]) ).

fof(f20,plain,
    $false,
    inference(backward_subsumption_resolution,[],[f10,f19]) ).

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