↑ 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  : FLD071-4 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT

% Computer : n006.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 09:49:50 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(f10,axiom,
    ! [X2,X0,X1] :
      ( ~ product(X1,X0,X2)
      | product(X0,X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/FLD002-0.ax',commutativity_multiplication) ).

fof(f25,axiom,
    ! [X2,X0,X1] :
      ( ~ product(X1,X2,X0)
      | ~ less_or_equal(additive_identity,X1)
      | ~ less_or_equal(additive_identity,X2)
      | less_or_equal(additive_identity,X0) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/FLD002-0.ax',compatibility_of_order_relation_and_multiplication) ).

fof(f30,negated_conjecture,
    less_or_equal(additive_identity,a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal_4) ).

fof(f31,negated_conjecture,
    less_or_equal(additive_identity,b),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal_5) ).

fof(f32,negated_conjecture,
    product(a,b,u),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product_6) ).

fof(f33,negated_conjecture,
    ~ less_or_equal(additive_identity,u),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_less_or_equal_7) ).

fof(f36,plain,
    product(b,a,u),
    inference(resolution,[],[f10,f32]) ).

fof(f88,plain,
    ( ~ less_or_equal(additive_identity,b)
    | ~ less_or_equal(additive_identity,a)
    | less_or_equal(additive_identity,u) ),
    inference(resolution,[],[f25,f36]) ).

fof(f89,plain,
    ( ~ less_or_equal(additive_identity,a)
    | less_or_equal(additive_identity,u) ),
    inference(forward_subsumption_resolution,[],[f88,f31]) ).

fof(f95,plain,
    less_or_equal(additive_identity,u),
    inference(forward_subsumption_resolution,[],[f89,f30]) ).

fof(f97,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f95,f33]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : FLD071-4 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.22  % Computer : n006.cluster.edu
% 0.08/0.22  % Model    : x86_64 x86_64
% 0.08/0.22  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.22  % Memory   : 8046.5625MB
% 0.08/0.22  % OS       : Linux 6.8.0-71-generic
% 0.08/0.22  % CPULimit : 300
% 0.08/0.22  % WCLimit  : 300
% 0.08/0.22  % DateTime : Tue Sep 29 00:49:11 UTC 2026
% 0.08/0.22  % CPUTime  : 
% 0.08/0.22  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.25  Running first-order model finding
% 0.08/0.25  Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.30  % (368125)Will run a generic schedule for satisfiability detection.
% 0.18/0.30  % (368133)dis+10_1_sil=32000:sp=arity:random_seed=3143207682:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.18/0.30  % (368133) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-368125-368133"...
% 0.18/0.30  % (368133)...printing done.
% 0.18/0.30  % (368133)Refutation found. Thanks to Tanya!
% 0.18/0.30  % SZS status Unsatisfiable for theBenchmark
% 0.18/0.30  % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.30  % (368133)------------------------------
% 0.18/0.30  % (368133)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.30  % (368133)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.30  % (368133)CaDiCaL version: 2.1.3
% 0.18/0.30  % (368133)Termination reason: Refutation
% 0.18/0.30  % (368133)Time elapsed: 0.001 s
% 0.18/0.30  % (368133)Peak memory usage: 11 MB
% 0.18/0.30  % (368133)Instructions burned: 2 (million)
% 0.18/0.30  % (368125)Success in time 0.034 s
% 0.18/0.30  % Vampire exiting
%------------------------------------------------------------------------------