↑ 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  : SWV006-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 : 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 01:19:57 PM UTC 2026

% Result   : Unsatisfiable 0.10s 0.26s
% Output   : Refutation 0.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   11 (   7 unt;   0 def)
%            Number of atoms       :   17 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   14 (   8   ~;   6   |;   0   &)
%                                         (   0 <=>;   0  =>;   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    :    5 (   5 usr;   3 con; 0-1 aty)
%            Number of variables   :    7 (   7   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f6,axiom,
    ! [X0] : less_than(X0,successor(X0)),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV001-0.ax',less_than_successor) ).

fof(f7,axiom,
    ! [X2,X0,X1] :
      ( ~ less_than(X0,X2)
      | less_than(X0,X1)
      | ~ less_than(X2,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV001-0.ax',transitivity_of_less_than) ).

fof(f9,axiom,
    ! [X0] : ~ less_than(X0,X0),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV001-0.ax',x_not_less_than_x) ).

fof(f17,negated_conjecture,
    less_than(i,n),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_3) ).

fof(f19,negated_conjecture,
    less_than(a(i),a(m)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_5) ).

fof(f20,negated_conjecture,
    ! [X0] :
      ( ~ less_than(a(X0),a(m))
      | ~ less_than(X0,successor(n))
      | less_than(X0,i) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_6) ).

fof(f31,plain,
    ( ~ less_than(i,successor(n))
    | less_than(i,i) ),
    inference(resolution,[],[f20,f19]) ).

fof(f32,plain,
    ~ less_than(i,successor(n)),
    inference(forward_subsumption_resolution,[],[f31,f9]) ).

fof(f60,plain,
    ! [X0] :
      ( ~ less_than(n,X0)
      | less_than(i,X0) ),
    inference(resolution,[],[f7,f17]) ).

fof(f158,plain,
    less_than(i,successor(n)),
    inference(resolution,[],[f60,f6]) ).

fof(f163,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f158,f32]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV006-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.10/0.20  % Computer : n004.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 09:41:52 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.26  % (242896)Will run a generic schedule for satisfiability detection.
% 0.10/0.26  % (242909)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3834961550:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.10/0.26  % (242909) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-242896-242909"...
% 0.10/0.26  % (242905)% WARNING: option uhcvi not known.
% 0.10/0.26  % (242909)...printing done.
% 0.10/0.26  % (242909)Refutation found. Thanks to Tanya!
% 0.10/0.26  % SZS status Unsatisfiable for theBenchmark
% 0.10/0.26  % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.26  % (242909)------------------------------
% 0.10/0.26  % (242909)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.26  % (242909)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.26  % (242909)CaDiCaL version: 2.1.3
% 0.10/0.26  % (242909)Termination reason: Refutation
% 0.10/0.26  % (242909)Time elapsed: 0.002 s
% 0.10/0.26  % (242909)Peak memory usage: 11 MB
% 0.10/0.26  % (242909)Instructions burned: 4 (million)
% 0.10/0.26  % (242896)Success in time 0.018 s
% 0.10/0.26  % Vampire exiting
%------------------------------------------------------------------------------