↑ 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  : GRP493-1 : TPTP v9.3.1. Released v2.6.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/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 10:17:57 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X2,X0,X1] : double_divide(double_divide(identity,X0),double_divide(double_divide(double_divide(X1,X2),double_divide(identity,identity)),double_divide(X0,X2))) = X1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).

fof(f2,axiom,
    ! [X0,X1] : multiply(X0,X1) = double_divide(double_divide(X1,X0),identity),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).

fof(f3,axiom,
    ! [X0] : inverse(X0) = double_divide(X0,identity),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inverse) ).

fof(f4,axiom,
    ! [X0] : identity = double_divide(X0,inverse(X0)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',identity) ).

fof(f5,negated_conjecture,
    multiply(inverse(a1),a1) != identity,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_1) ).

fof(f6,plain,
    identity != multiply(inverse(a1),a1),
    inference(reorient_equations,[],[f5]) ).

fof(f7,plain,
    ! [X0] : identity = double_divide(X0,double_divide(X0,identity)),
    inference(definition_unfolding,[],[f4,f3]) ).

fof(f8,plain,
    identity != double_divide(double_divide(a1,double_divide(a1,identity)),identity),
    inference(definition_unfolding,[],[f6,f2,f3]) ).

fof(f9,plain,
    identity != double_divide(identity,identity),
    inference(superposition,[],[f8,f7]) ).

fof(f11,plain,
    ! [X0,X1] : double_divide(double_divide(identity,X0),double_divide(double_divide(identity,double_divide(identity,identity)),double_divide(X0,double_divide(X1,identity)))) = X1,
    inference(superposition,[],[f1,f7]) ).

fof(f16,plain,
    ! [X0,X1] : double_divide(double_divide(identity,X0),double_divide(identity,double_divide(X0,double_divide(X1,identity)))) = X1,
    inference(forward_demodulation,[],[f11,f7]) ).

fof(f23,plain,
    ! [X0] : double_divide(double_divide(identity,X0),double_divide(identity,identity)) = X0,
    inference(superposition,[],[f16,f7]) ).

fof(f26,plain,
    double_divide(identity,identity) = double_divide(identity,double_divide(identity,identity)),
    inference(superposition,[],[f23,f7]) ).

fof(f32,plain,
    identity = double_divide(identity,identity),
    inference(forward_demodulation,[],[f26,f7]) ).

fof(f33,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f32,f9]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP493-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.37  % Computer : n019.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Sun Sep 27 10:06:04 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.39  Running first-order model finding
% 0.10/0.39  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.10/0.43  % (2858288)Will run a generic schedule for satisfiability detection.
% 0.10/0.43  % (2858296)dis+10_1_sil=32000:sp=arity:random_seed=3639454851:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.10/0.43  % (2858296) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2858288-2858296"...
% 0.10/0.43  % (2858296)...printing done.
% 0.10/0.43  % (2858296)Refutation found. Thanks to Tanya!
% 0.10/0.43  % SZS status Unsatisfiable for theBenchmark
% 0.10/0.43  % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.43  % (2858296)------------------------------
% 0.10/0.43  % (2858296)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.43  % (2858296)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.43  % (2858296)CaDiCaL version: 2.1.3
% 0.10/0.43  % (2858296)Termination reason: Refutation
% 0.10/0.43  % (2858296)Time elapsed: 0.001 s
% 0.10/0.43  % (2858296)Peak memory usage: 11 MB
% 0.10/0.43  % (2858296)Instructions burned: 2 (million)
% 0.10/0.43  % (2858288)Success in time 0.028 s
% 0.10/0.43  % Vampire exiting
%------------------------------------------------------------------------------