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

% Computer : n019.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:25 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
    ! [X0,X1] :
      ( ~ p1(X0,f(X1))
      | q1(f(X0),X1)
      | q2(X0,f(X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_1) ).

fof(f2,negated_conjecture,
    ! [X0] : p1(a,X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_2) ).

fof(f3,negated_conjecture,
    ! [X0,X1] : ~ q2(X0,f(X1)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_3) ).

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

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

fof(f6,negated_conjecture,
    ! [X0,X1] : ~ q4(f(f(X0)),f(g(f(X1)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_6) ).

fof(f7,negated_conjecture,
    ! [X0,X1] :
      ( ~ q1(X0,f(X1))
      | p2(f(X0),X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_7) ).

fof(f8,plain,
    ! [X0,X1] :
      ( ~ p1(X0,f(X1))
      | q1(f(X0),X1) ),
    inference(forward_subsumption_resolution,[],[f1,f3]) ).

fof(f9,plain,
    ! [X0] : q1(f(a),X0),
    inference(resolution,[],[f8,f2]) ).

fof(f10,plain,
    ! [X0] : p2(f(f(a)),X0),
    inference(resolution,[],[f9,f7]) ).

fof(f11,plain,
    ! [X0] :
      ( q4(f(f(a)),f(X0))
      | q3(f(f(f(a))),X0) ),
    inference(resolution,[],[f10,f4]) ).

fof(f12,plain,
    ! [X0] : q3(f(f(f(a))),g(f(X0))),
    inference(resolution,[],[f11,f6]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN006-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.19  % Computer : n019.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:20:07 UTC 2026
% 0.08/0.19  % CPUTime  : 
% 0.08/0.19  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.30/0.26  % (4085323)Will run a generic schedule for satisfiability detection.
% 0.30/0.26  % (4085331)dis+10_1_sil=32000:sp=arity:random_seed=2070397564:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.30/0.26  % (4085331) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-4085323-4085331"...
% 0.30/0.26  % (4085331)...printing done.
% 0.30/0.26  % (4085329)% WARNING: option uhcvi not known.
% 0.30/0.26  % (4085331)Refutation found. Thanks to Tanya!
% 0.30/0.26  % SZS status Unsatisfiable for theBenchmark
% 0.30/0.26  % SZS output start Proof for theBenchmark
% See solution above
% 0.30/0.26  % (4085331)------------------------------
% 0.30/0.26  % (4085331)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.30/0.26  % (4085331)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.30/0.26  % (4085331)CaDiCaL version: 2.1.3
% 0.30/0.26  % (4085331)Termination reason: Refutation
% 0.30/0.26  % (4085331)Time elapsed: 0.001 s
% 0.30/0.26  % (4085331)Peak memory usage: 11 MB
% 0.30/0.26  % (4085323)Success in time 0.028 s
% 0.30/0.26  % Vampire exiting
%------------------------------------------------------------------------------