↑ Up

Vampire-SAT---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire-SAT---5.0.1
% Problem  : SYN312-1 : TPTP v9.3.1. Bugfixed v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT

% Computer : n002.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:15 PM UTC 2026

% Result   : Unsatisfiable 0.10s 0.27s
% Output   : Refutation 0.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   23 (  17 unt;   0 def)
%            Number of atoms       :   30 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   29 (  22   ~;   7   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-1 aty)
%            Number of variables   :   17 (  17   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
    ! [X2,X3,X0,X1] :
      ( p(X0,X1,X2)
      | ~ p(X0,X3,X2)
      | ~ p(X3,X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause1) ).

fof(f2,negated_conjecture,
    ! [X2,X0,X1] :
      ( p(X0,X1,X2)
      | ~ p(X2,X1,X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause2) ).

fof(f3,negated_conjecture,
    ! [X2,X0,X1] :
      ( p(X0,X1,X2)
      | ~ p(X1,X0,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause3) ).

fof(f4,negated_conjecture,
    ! [X2,X0,X1] :
      ( p(X0,X1,f(X2))
      | ~ p(X0,X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause4) ).

fof(f5,negated_conjecture,
    ! [X2,X0,X1] :
      ( p(g(X0),X1,X2)
      | ~ p(X0,X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause5) ).

fof(f6,negated_conjecture,
    p(a,f(b),c),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause6) ).

fof(f7,negated_conjecture,
    p(f(b),d,c),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause7) ).

fof(f8,negated_conjecture,
    ~ p(f(g(a)),f(g(d)),f(g(c))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause8) ).

fof(f9,plain,
    ~ p(f(g(a)),f(g(d)),g(c)),
    inference(resolution,[],[f8,f4]) ).

fof(f13,plain,
    ~ p(g(c),f(g(d)),f(g(a))),
    inference(resolution,[],[f9,f2]) ).

fof(f16,plain,
    ~ p(g(c),f(g(d)),g(a)),
    inference(resolution,[],[f13,f4]) ).

fof(f20,plain,
    ~ p(c,f(g(d)),g(a)),
    inference(resolution,[],[f16,f5]) ).

fof(f24,plain,
    ~ p(g(a),f(g(d)),c),
    inference(resolution,[],[f20,f2]) ).

fof(f27,plain,
    ~ p(a,f(g(d)),c),
    inference(resolution,[],[f24,f5]) ).

fof(f30,plain,
    ~ p(f(g(d)),a,c),
    inference(resolution,[],[f27,f3]) ).

fof(f33,plain,
    ~ p(c,a,f(g(d))),
    inference(resolution,[],[f30,f2]) ).

fof(f36,plain,
    ~ p(c,a,g(d)),
    inference(resolution,[],[f33,f4]) ).

fof(f53,plain,
    ~ p(g(d),a,c),
    inference(resolution,[],[f36,f2]) ).

fof(f57,plain,
    ~ p(d,a,c),
    inference(resolution,[],[f53,f5]) ).

fof(f62,plain,
    ~ p(a,d,c),
    inference(resolution,[],[f57,f3]) ).

fof(f64,plain,
    ! [X0] :
      ( ~ p(a,X0,c)
      | ~ p(X0,d,c) ),
    inference(resolution,[],[f62,f1]) ).

fof(f378,plain,
    ~ p(a,f(b),c),
    inference(resolution,[],[f64,f7]) ).

fof(f383,plain,
    $false,
    inference(resolution,[],[f378,f6]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN312-1 : TPTP v9.3.1. Bugfixed v2.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.20  % Computer : n002.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:43:37 UTC 2026
% 0.10/0.20  % CPUTime  : 
% 0.10/0.20  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.23  Running first-order model finding
% 0.10/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.10/0.27  % (468741)Will run a generic schedule for satisfiability detection.
% 0.10/0.27  % (468752)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1776246212:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.10/0.27  % (468747)% WARNING: option uhcvi not known.
% 0.10/0.27  % (468752) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-468741-468752"...
% 0.10/0.27  % (468752)...printing done.
% 0.10/0.27  % (468752)Refutation found. Thanks to Tanya!
% 0.10/0.27  % SZS status Unsatisfiable for theBenchmark
% 0.10/0.27  % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.27  % (468752)------------------------------
% 0.10/0.27  % (468752)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.27  % (468752)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.28  % (468752)CaDiCaL version: 2.1.3
% 0.10/0.28  % (468752)Termination reason: Refutation
% 0.10/0.28  % (468752)Time elapsed: 0.003 s
% 0.10/0.28  % (468752)Peak memory usage: 11 MB
% 0.10/0.28  % (468752)Instructions burned: 8 (million)
% 0.10/0.28  % (468741)Success in time 0.038 s
% 0.10/0.28  % Vampire exiting
%------------------------------------------------------------------------------