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

% Computer : n003.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.08s 0.26s
% Output   : Refutation 0.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   19 (  15 unt;   0 def)
%            Number of atoms       :   23 (   0 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :    9 (   5   ~;   4   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-1 aty)
%            Number of variables   :   12 (  12   !;   0   ?)

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

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

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

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

fof(f5,negated_conjecture,
    ~ p(a,b,c),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause5) ).

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

fof(f7,plain,
    p(g(a),f(g(b)),f(g(c))),
    inference(resolution,[],[f6,f4]) ).

fof(f10,plain,
    p(f(g(b)),g(a),f(g(c))),
    inference(resolution,[],[f7,f2]) ).

fof(f12,plain,
    p(g(b),g(a),f(g(c))),
    inference(resolution,[],[f10,f4]) ).

fof(f16,plain,
    p(f(g(c)),g(a),g(b)),
    inference(resolution,[],[f12,f1]) ).

fof(f19,plain,
    p(g(c),g(a),g(b)),
    inference(resolution,[],[f16,f4]) ).

fof(f26,plain,
    p(g(c),g(a),b),
    inference(resolution,[],[f19,f3]) ).

fof(f30,plain,
    p(b,g(a),g(c)),
    inference(resolution,[],[f26,f1]) ).

fof(f40,plain,
    p(b,g(a),c),
    inference(resolution,[],[f30,f3]) ).

fof(f43,plain,
    p(g(a),b,c),
    inference(resolution,[],[f40,f2]) ).

fof(f69,plain,
    p(c,b,g(a)),
    inference(resolution,[],[f43,f1]) ).

fof(f75,plain,
    p(c,b,a),
    inference(resolution,[],[f69,f3]) ).

fof(f90,plain,
    p(a,b,c),
    inference(resolution,[],[f75,f1]) ).

fof(f91,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f90,f5]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN310-1 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.19  % Computer : n003.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:42:42 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.22  Running first-order model finding
% 0.08/0.22  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.08/0.26  % (1714813)Will run a generic schedule for satisfiability detection.
% 0.08/0.26  % (1714827)% WARNING: option uhcvi not known.
% 0.08/0.26  % (1714827)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3731830162:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.08/0.26  % (1714827) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1714813-1714827"...
% 0.08/0.26  % (1714827)...printing done.
% 0.08/0.26  % (1714827)Refutation found. Thanks to Tanya!
% 0.08/0.26  % SZS status Unsatisfiable for theBenchmark
% 0.08/0.26  % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.26  % (1714827)------------------------------
% 0.08/0.26  % (1714827)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.26  % (1714827)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.26  % (1714827)CaDiCaL version: 2.1.3
% 0.08/0.26  % (1714827)Termination reason: Refutation
% 0.08/0.26  % (1714827)Time elapsed: 0.001 s
% 0.08/0.26  % (1714827)Peak memory usage: 11 MB
% 0.08/0.26  % (1714827)Instructions burned: 2 (million)
% 0.08/0.26  % (1714813)Success in time 0.03 s
% 0.08/0.26  % Vampire exiting
%------------------------------------------------------------------------------