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

% Computer : n015.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:32:26 PM UTC 2026

% Result   : Unsatisfiable 0.10s 0.24s
% Output   : Refutation 0.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   22 (   9 unt;   0 def)
%            Number of atoms       :   43 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   46 (  25   ~;  21   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   5 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   59 (  59   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X2,X0,X1] : top(f(f(X0,X1),f(X2,a)),f(f(X2,f(X1,a)),X0)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_1) ).

fof(f2,negated_conjecture,
    ! [X0] : ~ seq(succ(succ(succ(zero))),X0,X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove) ).

fof(f3,axiom,
    ! [X0,X1] :
      ( ~ top(X0,X1)
      | step(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rewrite_top) ).

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

fof(f5,axiom,
    ! [X2,X0,X1] :
      ( step(f(X2,X0),f(X2,X1))
      | ~ step(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rewrite_right) ).

fof(f6,axiom,
    ! [X0] : seq(zero,X0,X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rewrite_sequence_zero) ).

fof(f7,axiom,
    ! [X2,X3,X0,X1] :
      ( ~ seq(X0,X1,X2)
      | ~ step(X2,X3)
      | seq(succ(X0),X1,X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rewrite_sequence_succ) ).

fof(f8,plain,
    ! [X2,X0,X1] : ~ top(f(f(X0,X1),f(X2,a)),f(f(X2,f(X1,a)),X0)),
    inference(consistent_polarity_flipping,[],[f1]) ).

fof(f9,plain,
    ! [X0] : seq(succ(succ(succ(zero))),X0,X0),
    inference(consistent_polarity_flipping,[],[f2]) ).

fof(f10,plain,
    ! [X0,X1] :
      ( top(X0,X1)
      | step(X0,X1) ),
    inference(consistent_polarity_flipping,[],[f3]) ).

fof(f11,plain,
    ! [X0] : ~ seq(zero,X0,X0),
    inference(consistent_polarity_flipping,[],[f6]) ).

fof(f12,plain,
    ! [X2,X3,X0,X1] :
      ( ~ seq(succ(X0),X1,X3)
      | ~ step(X2,X3)
      | seq(X0,X1,X2) ),
    inference(consistent_polarity_flipping,[],[f7]) ).

fof(f13,plain,
    ! [X0,X1] :
      ( seq(succ(succ(zero)),X1,X0)
      | ~ step(X0,X1) ),
    inference(resolution,[],[f12,f9]) ).

fof(f14,plain,
    ! [X2,X0,X1] : step(f(f(X0,X1),f(X2,a)),f(f(X2,f(X1,a)),X0)),
    inference(resolution,[],[f8,f10]) ).

fof(f15,plain,
    ! [X2,X0,X1] :
      ( ~ step(X2,X0)
      | ~ step(X0,X1)
      | seq(succ(zero),X1,X2) ),
    inference(resolution,[],[f13,f12]) ).

fof(f16,plain,
    ! [X2,X3,X0,X1] :
      ( ~ step(f(X0,X1),X2)
      | seq(succ(zero),X2,f(X3,X1))
      | ~ step(X3,X0) ),
    inference(resolution,[],[f15,f4]) ).

fof(f20,plain,
    ! [X2,X3,X0,X1] :
      ( seq(succ(zero),f(X0,X1),f(X2,X3))
      | ~ step(X2,X0)
      | ~ step(X3,X1) ),
    inference(resolution,[],[f16,f5]) ).

fof(f29,plain,
    ! [X2,X3,X0,X1,X4] :
      ( ~ step(X4,f(X0,X2))
      | ~ step(X2,X3)
      | ~ step(X0,X1)
      | seq(zero,f(X1,X3),X4) ),
    inference(resolution,[],[f20,f12]) ).

fof(f40,plain,
    ! [X2,X3,X0,X1,X4] :
      ( seq(zero,f(X4,X1),f(f(X0,X3),f(X2,a)))
      | ~ step(f(X2,f(X3,a)),X4)
      | ~ step(X0,X1) ),
    inference(resolution,[],[f29,f14]) ).

fof(f88,plain,
    ! [X2,X0,X1] :
      ( ~ step(f(X0,f(X1,a)),f(X2,X1))
      | ~ step(X2,f(X0,a)) ),
    inference(resolution,[],[f40,f11]) ).

fof(f90,plain,
    ! [X0,X1] : ~ step(f(X0,f(X1,a)),f(f(X0,X1),a)),
    inference(resolution,[],[f88,f14]) ).

fof(f99,plain,
    $false,
    inference(resolution,[],[f90,f14]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYO691-1.000 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.16  % Computer : n015.cluster.edu
% 0.10/0.16  % Model    : x86_64 x86_64
% 0.10/0.16  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.16  % Memory   : 8046.5625MB
% 0.10/0.16  % OS       : Linux 6.8.0-71-generic
% 0.10/0.16  % CPULimit : 300
% 0.10/0.16  % WCLimit  : 300
% 0.10/0.16  % DateTime : Mon Sep 28 18:12:09 UTC 2026
% 0.10/0.16  % CPUTime  : 
% 0.10/0.16  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.19  Running first-order model finding
% 0.10/0.19  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.24  % (2855248)Will run a generic schedule for satisfiability detection.
% 0.10/0.24  % (2855264)% WARNING: option uhcvi not known.
% 0.10/0.24  % (2855264)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=332515969:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.10/0.24  % (2855264) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2855248-2855264"...
% 0.10/0.24  % (2855264)...printing done.
% 0.10/0.24  % (2855264)Refutation found. Thanks to Tanya!
% 0.10/0.24  % SZS status Unsatisfiable for theBenchmark
% 0.10/0.24  % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.24  % (2855264)------------------------------
% 0.10/0.24  % (2855264)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.24  % (2855264)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.24  % (2855264)CaDiCaL version: 2.1.3
% 0.10/0.24  % (2855264)Termination reason: Refutation
% 0.10/0.24  % (2855264)Time elapsed: 0.005 s
% 0.10/0.24  % (2855264)Peak memory usage: 11 MB
% 0.10/0.24  % (2855264)Instructions burned: 7 (million)
% 0.10/0.24  % (2855248)Success in time 0.034 s
% 0.10/0.24  % Vampire exiting
%------------------------------------------------------------------------------