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

% Computer : n003.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 10:16:58 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(f6,axiom,
    ! [X0,X1] : least_upper_bound(X0,X1) = least_upper_bound(X1,X0),
    file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',symmetry_of_lub) ).

fof(f15,axiom,
    ! [X2,X0,X1] : multiply(least_upper_bound(X0,X1),X2) = least_upper_bound(multiply(X0,X2),multiply(X1,X2)),
    file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_lub2) ).

fof(f17,axiom,
    least_upper_bound(a,b) = b,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_mono1a_1) ).

fof(f18,plain,
    b = least_upper_bound(a,b),
    inference(reorient_equations,[],[f17]) ).

fof(f19,negated_conjecture,
    least_upper_bound(multiply(a,c),multiply(b,c)) != multiply(b,c),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_ax_mono1a) ).

fof(f20,plain,
    multiply(b,c) != least_upper_bound(multiply(a,c),multiply(b,c)),
    inference(reorient_equations,[],[f19]) ).

fof(f25,plain,
    multiply(b,c) != least_upper_bound(multiply(b,c),multiply(a,c)),
    inference(superposition,[],[f20,f6]) ).

fof(f26,plain,
    b = least_upper_bound(b,a),
    inference(superposition,[],[f18,f6]) ).

fof(f27,plain,
    multiply(b,c) != multiply(least_upper_bound(b,a),c),
    inference(forward_demodulation,[],[f25,f15]) ).

fof(f29,plain,
    multiply(b,c) != multiply(b,c),
    inference(forward_demodulation,[],[f27,f26]) ).

fof(f30,plain,
    $false,
    inference(trivial_inequality_removal,[],[f29]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : GRP154-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.36  % Computer : n003.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Sun Sep 27 09:35:41 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.40  Running first-order model finding
% 0.10/0.40  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.44  % (249329)Will run a generic schedule for satisfiability detection.
% 0.10/0.44  % (249338)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3385656332:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.10/0.44  % (249338) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-249329-249338"...
% 0.10/0.44  % (249338)...printing done.
% 0.10/0.44  % (249338)Refutation found. Thanks to Tanya!
% 0.10/0.44  % SZS status Unsatisfiable for theBenchmark
% 0.10/0.44  % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.44  % (249338)------------------------------
% 0.10/0.44  % (249338)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.44  % (249338)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.44  % (249338)CaDiCaL version: 2.1.3
% 0.10/0.44  % (249338)Termination reason: Refutation
% 0.10/0.44  % (249338)Time elapsed: 0.001 s
% 0.10/0.44  % (249338)Peak memory usage: 11 MB
% 0.10/0.44  % (249338)Instructions burned: 1 (million)
% 0.10/0.44  % (249329)Success in time 0.028 s
% 0.10/0.44  % Vampire exiting
%------------------------------------------------------------------------------