↑ 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  : RNG007-4 : TPTP v9.3.1. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/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 12:35:41 PM UTC 2026

% Result   : Unsatisfiable 0.14s 0.49s
% Output   : Refutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   18 (  18 unt;   0 def)
%            Number of atoms       :   18 (  17 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    3 (   3   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   2 avg)
%            Maximal term depth    :    3 (   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   :   18 (  18   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f2,axiom,
    ! [X0] : add(additive_inverse(X0),X0) = additive_identity,
    file('/export/starexec/sandbox2/benchmark/Axioms/RNG002-0.ax',left_additive_inverse) ).

fof(f3,plain,
    ! [X0] : additive_identity = add(additive_inverse(X0),X0),
    inference(reorient_equations,[],[f2]) ).

fof(f8,axiom,
    ! [X0] : additive_inverse(additive_inverse(X0)) = X0,
    file('/export/starexec/sandbox2/benchmark/Axioms/RNG002-0.ax',additive_inverse_additive_inverse) ).

fof(f14,axiom,
    ! [X0,X1] : multiply(X0,additive_inverse(X1)) = additive_inverse(multiply(X0,X1)),
    file('/export/starexec/sandbox2/benchmark/Axioms/RNG002-0.ax',multiply_additive_inverse1) ).

fof(f15,axiom,
    ! [X0,X1] : multiply(additive_inverse(X0),X1) = additive_inverse(multiply(X0,X1)),
    file('/export/starexec/sandbox2/benchmark/Axioms/RNG002-0.ax',multiply_additive_inverse2) ).

fof(f16,plain,
    ! [X0,X1] : additive_inverse(multiply(X0,X1)) = multiply(additive_inverse(X0),X1),
    inference(reorient_equations,[],[f15]) ).

fof(f18,axiom,
    ! [X0,X1] : add(X0,X1) = add(X1,X0),
    file('/export/starexec/sandbox2/benchmark/Axioms/RNG002-0.ax',commutative_addition) ).

fof(f20,axiom,
    ! [X0] : multiply(X0,X0) = X0,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',boolean_ring) ).

fof(f21,negated_conjecture,
    add(a,a) != additive_identity,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_inverse) ).

fof(f22,plain,
    additive_identity != add(a,a),
    inference(reorient_equations,[],[f21]) ).

fof(f23,plain,
    ! [X0] : additive_identity = add(X0,additive_inverse(X0)),
    inference(forward_demodulation,[],[f3,f18]) ).

fof(f43,plain,
    ! [X0] : additive_inverse(X0) = multiply(X0,additive_inverse(X0)),
    inference(superposition,[],[f14,f20]) ).

fof(f72,plain,
    ! [X0] : additive_inverse(additive_inverse(X0)) = multiply(additive_inverse(X0),additive_inverse(X0)),
    inference(superposition,[],[f16,f43]) ).

fof(f76,plain,
    ! [X0] : additive_inverse(X0) = additive_inverse(additive_inverse(X0)),
    inference(forward_demodulation,[],[f72,f20]) ).

fof(f81,plain,
    ! [X0] : additive_inverse(X0) = X0,
    inference(forward_demodulation,[],[f76,f8]) ).

fof(f123,plain,
    ! [X0] : additive_identity = add(X0,X0),
    inference(superposition,[],[f23,f81]) ).

fof(f175,plain,
    additive_identity != additive_identity,
    inference(superposition,[],[f22,f123]) ).

fof(f176,plain,
    $false,
    inference(trivial_inequality_removal,[],[f175]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : RNG007-4 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.14/0.41  % Computer : n003.cluster.edu
% 0.14/0.41  % Model    : x86_64 x86_64
% 0.14/0.41  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.41  % Memory   : 8046.5625MB
% 0.14/0.41  % OS       : Linux 6.8.0-71-generic
% 0.14/0.41  % CPULimit : 300
% 0.14/0.42  % WCLimit  : 300
% 0.14/0.42  % DateTime : Sun Sep 27 22:59:57 UTC 2026
% 0.14/0.42  % CPUTime  : 
% 0.14/0.42  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.14/0.45  Running first-order model finding
% 0.14/0.45  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.14/0.49  % (1023384)Will run a generic schedule for satisfiability detection.
% 0.14/0.49  % (1023394)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2164767004:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.14/0.49  % (1023394) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1023384-1023394"...
% 0.14/0.49  % (1023394)...printing done.
% 0.14/0.49  % (1023394)Refutation found. Thanks to Tanya!
% 0.14/0.49  % SZS status Unsatisfiable for theBenchmark
% 0.14/0.49  % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.49  % (1023394)------------------------------
% 0.14/0.49  % (1023394)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.14/0.49  % (1023394)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.14/0.49  % (1023394)CaDiCaL version: 2.1.3
% 0.14/0.49  % (1023394)Termination reason: Refutation
% 0.14/0.49  % (1023394)Time elapsed: 0.004 s
% 0.14/0.49  % (1023394)Peak memory usage: 11 MB
% 0.14/0.49  % (1023394)Instructions burned: 5 (million)
% 0.14/0.49  % (1023384)Success in time 0.027 s
% 0.14/0.49  % Vampire exiting
%------------------------------------------------------------------------------