↑ 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  : SYN349-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 : 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:07:25 PM UTC 2026

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

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

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

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

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

fof(f8,negated_conjecture,
    ! [X0,X1] :
      ( ~ f(g(X0,X1),w(X0))
      | ~ f(g(X0,X1),X1)
      | f(X1,g(X0,X1))
      | f(X0,g(X0,X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause8) ).

fof(f10,negated_conjecture,
    ! [X0,X1] :
      ( ~ f(X0,g(X0,X1))
      | ~ f(g(X0,X1),X1)
      | ~ f(X1,g(X0,X1))
      | ~ f(g(X0,X1),w(X0)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause10) ).

fof(f12,plain,
    ! [X0] :
      ( f(g(X0,w(X0)),w(X0))
      | ~ f(X0,g(X0,w(X0)))
      | f(g(X0,w(X0)),w(X0))
      | ~ f(X0,g(X0,w(X0))) ),
    inference(resolution,[],[f3,f2]) ).

fof(f13,plain,
    ! [X0] :
      ( f(g(X0,w(X0)),w(X0))
      | ~ f(X0,g(X0,w(X0))) ),
    inference(duplicate_literal_removal,[],[f12]) ).

fof(f16,plain,
    ! [X0] :
      ( f(g(X0,w(X0)),w(X0))
      | f(w(X0),g(X0,w(X0)))
      | f(X0,g(X0,w(X0))) ),
    inference(factoring,[],[f5]) ).

fof(f18,plain,
    ! [X0] :
      ( f(g(X0,w(X0)),w(X0))
      | f(X0,g(X0,w(X0))) ),
    inference(forward_subsumption_resolution,[],[f16,f1]) ).

fof(f19,plain,
    ! [X0] : f(g(X0,w(X0)),w(X0)),
    inference(forward_subsumption_resolution,[],[f18,f13]) ).

fof(f24,plain,
    ! [X0] :
      ( ~ f(g(X0,w(X0)),w(X0))
      | f(w(X0),g(X0,w(X0)))
      | f(X0,g(X0,w(X0))) ),
    inference(resolution,[],[f19,f8]) ).

fof(f26,plain,
    ! [X0] :
      ( f(w(X0),g(X0,w(X0)))
      | f(X0,g(X0,w(X0))) ),
    inference(forward_subsumption_resolution,[],[f24,f19]) ).

fof(f27,plain,
    ! [X0] : f(X0,g(X0,w(X0))),
    inference(forward_subsumption_resolution,[],[f26,f1]) ).

fof(f29,plain,
    ! [X0] :
      ( ~ f(g(X0,w(X0)),w(X0))
      | ~ f(w(X0),g(X0,w(X0)))
      | ~ f(g(X0,w(X0)),w(X0)) ),
    inference(resolution,[],[f27,f10]) ).

fof(f32,plain,
    ! [X0] :
      ( ~ f(g(X0,w(X0)),w(X0))
      | ~ f(w(X0),g(X0,w(X0))) ),
    inference(duplicate_literal_removal,[],[f29]) ).

fof(f33,plain,
    ! [X0] : ~ f(w(X0),g(X0,w(X0))),
    inference(forward_subsumption_resolution,[],[f32,f19]) ).

fof(f34,plain,
    ! [X0] : ~ f(X0,g(X0,w(X0))),
    inference(resolution,[],[f33,f2]) ).

fof(f35,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f34,f27]) ).

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