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

% Computer : n004.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:06:42 PM UTC 2026

% Result   : Theorem 0.19s 0.28s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   15 (  10 unt;   0 def)
%            Number of atoms       :   24 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   21 (  12   ~;   7   |;   1   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   13 (  13   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    big_f(f(a,b),f(b,c)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel57_1) ).

fof(f2,axiom,
    big_f(f(b,c),f(a,c)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel57_2) ).

fof(f3,axiom,
    ! [X0,X1,X2] :
      ( ( big_f(X0,X1)
        & big_f(X1,X2) )
     => big_f(X0,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel57_3) ).

fof(f4,conjecture,
    big_f(f(a,b),f(a,c)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel57) ).

fof(f5,negated_conjecture,
    ~ big_f(f(a,b),f(a,c)),
    inference(negated_conjecture,[status(cth)],[f4]) ).

fof(f6,plain,
    ~ big_f(f(a,b),f(a,c)),
    inference(flattening,[],[f5]) ).

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

fof(f8,plain,
    ! [X0,X1,X2] :
      ( big_f(X0,X2)
      | ~ big_f(X0,X1)
      | ~ big_f(X1,X2) ),
    inference(flattening,[],[f7]) ).

fof(f9,plain,
    big_f(f(a,b),f(b,c)),
    inference(cnf_transformation,[],[f1]) ).

fof(f10,plain,
    big_f(f(b,c),f(a,c)),
    inference(cnf_transformation,[],[f2]) ).

fof(f11,plain,
    ! [X2,X0,X1] :
      ( ~ big_f(X1,X2)
      | ~ big_f(X0,X1)
      | big_f(X0,X2) ),
    inference(cnf_transformation,[],[f8]) ).

fof(f12,plain,
    ~ big_f(f(a,b),f(a,c)),
    inference(cnf_transformation,[],[f6]) ).

fof(f19,plain,
    ! [X0] :
      ( ~ big_f(X0,f(a,c))
      | ~ big_f(f(a,b),X0) ),
    inference(resolution,[],[f11,f12]) ).

fof(f22,plain,
    ~ big_f(f(a,b),f(b,c)),
    inference(resolution,[],[f19,f10]) ).

fof(f25,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f22,f9]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN079+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.19  % Computer : n004.cluster.edu
% 0.08/0.19  % Model    : x86_64 x86_64
% 0.08/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19  % Memory   : 8046.5625MB
% 0.08/0.19  % OS       : Linux 6.8.0-71-generic
% 0.08/0.19  % CPULimit : 300
% 0.08/0.19  % WCLimit  : 300
% 0.08/0.19  % DateTime : Mon Sep 28 15:30:09 UTC 2026
% 0.08/0.20  % CPUTime  : 
% 0.08/0.20  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.23  Running first-order model finding
% 0.08/0.23  Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.28  % (458996)Will run a generic schedule for satisfiability detection.
% 0.19/0.28  % (459005)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=301818533:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.28  % (459005) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-458996-459005"...
% 0.19/0.28  % (459005)...printing done.
% 0.19/0.28  % (459005)Refutation found. Thanks to Tanya!
% 0.19/0.28  % SZS status Theorem for theBenchmark
% 0.19/0.28  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.28  % (459005)------------------------------
% 0.19/0.28  % (459005)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.28  % (459005)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.28  % (459005)CaDiCaL version: 2.1.3
% 0.19/0.28  % (459005)Termination reason: Refutation
% 0.19/0.28  % (459005)Time elapsed: 0.001 s
% 0.19/0.28  % (459005)Peak memory usage: 11 MB
% 0.19/0.28  % (459005)Instructions burned: 1 (million)
% 0.19/0.28  % (458996)Success in time 0.038 s
% 0.19/0.28  % Vampire exiting
%------------------------------------------------------------------------------