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

% Computer : n015.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:41 AM UTC 2026

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

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

fof(f2,negated_conjecture,
    multiply(identity,a) != a,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_order3) ).

fof(f3,plain,
    a != multiply(identity,a),
    inference(reorient_equations,[],[f2]) ).

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

fof(f13,plain,
    ! [X2,X0,X1] : multiply(multiply(X1,X0),multiply(identity,X2)) = multiply(X1,multiply(X0,X2)),
    inference(superposition,[],[f7,f1]) ).

fof(f23,plain,
    ! [X2,X0,X1] : multiply(X0,multiply(X0,multiply(multiply(multiply(X0,X1),X2),multiply(X2,X2)))) = X1,
    inference(superposition,[],[f1,f13]) ).

fof(f25,plain,
    ! [X2,X0,X1] : multiply(X0,multiply(multiply(X0,multiply(X0,multiply(X1,X2))),multiply(identity,multiply(multiply(identity,X2),multiply(identity,X2))))) = X1,
    inference(superposition,[],[f1,f13]) ).

fof(f36,plain,
    ! [X2,X0,X1] : multiply(X0,multiply(X0,multiply(multiply(X0,multiply(X1,X2)),multiply(multiply(identity,X2),multiply(identity,X2))))) = X1,
    inference(forward_demodulation,[],[f25,f13]) ).

fof(f46,plain,
    ! [X2,X0,X1] : multiply(X0,multiply(X0,multiply(multiply(X0,multiply(X1,X2)),multiply(identity,multiply(X2,X2))))) = X1,
    inference(forward_demodulation,[],[f36,f13]) ).

fof(f51,plain,
    ! [X2,X0,X1] : multiply(X0,multiply(X0,multiply(X0,multiply(multiply(X1,X2),multiply(X2,X2))))) = X1,
    inference(forward_demodulation,[],[f46,f13]) ).

fof(f61,plain,
    ! [X0,X1] : multiply(X0,multiply(X0,multiply(multiply(X0,X1),multiply(identity,identity)))) = X1,
    inference(superposition,[],[f23,f13]) ).

fof(f72,plain,
    ! [X0,X1] : multiply(X0,multiply(X0,multiply(X0,multiply(X1,identity)))) = X1,
    inference(forward_demodulation,[],[f61,f13]) ).

fof(f109,plain,
    ! [X0,X1] : multiply(multiply(X1,multiply(X0,X0)),X0) = X1,
    inference(superposition,[],[f51,f51]) ).

fof(f148,plain,
    ! [X0,X1] : multiply(X0,multiply(multiply(multiply(identity,X1),multiply(identity,X1)),X1)) = X0,
    inference(superposition,[],[f13,f109]) ).

fof(f160,plain,
    ! [X0,X1] : multiply(X0,multiply(multiply(identity,multiply(X1,X1)),X1)) = X0,
    inference(forward_demodulation,[],[f148,f13]) ).

fof(f166,plain,
    ! [X0] : multiply(X0,identity) = X0,
    inference(forward_demodulation,[],[f160,f109]) ).

fof(f176,plain,
    ! [X0,X1] : multiply(X1,multiply(X1,multiply(X1,X0))) = X0,
    inference(superposition,[],[f72,f166]) ).

fof(f219,plain,
    ! [X0] : identity = multiply(X0,multiply(X0,X0)),
    inference(superposition,[],[f176,f166]) ).

fof(f261,plain,
    ! [X0] : multiply(identity,X0) = X0,
    inference(superposition,[],[f109,f219]) ).

fof(f295,plain,
    a != a,
    inference(superposition,[],[f3,f261]) ).

fof(f329,plain,
    $false,
    inference(trivial_inequality_removal,[],[f295]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP116-1 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.38  % Computer : n015.cluster.edu
% 0.11/0.38  % Model    : x86_64 x86_64
% 0.11/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38  % Memory   : 8046.5625MB
% 0.11/0.38  % OS       : Linux 6.8.0-71-generic
% 0.11/0.38  % CPULimit : 300
% 0.11/0.38  % WCLimit  : 300
% 0.11/0.38  % DateTime : Sun Sep 27 09:22:45 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.38  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.40  Running first-order model finding
% 0.11/0.40  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.11/0.44  % (1390898)Will run a generic schedule for satisfiability detection.
% 0.11/0.44  % (1390905)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1410100814:i=88024:add=on:rawr=on_3000 on theBenchmark for (3000ds/88024Mi)
% 0.11/0.44  % (1390904)% WARNING: option uhcvi not known.
% 0.11/0.44  % (1390905) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1390898-1390905"...
% 0.11/0.44  % (1390905)...printing done.
% 0.11/0.44  % (1390903)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=121137420_3000 on theBenchmark for (3000ds/0Mi)
% 0.11/0.44  % (1390907)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2059391334:i=116_3000 on theBenchmark for (3000ds/116Mi)
% 0.11/0.44  % TRYING [1]
% 0.11/0.44  % (1390908)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4015468302:i=131_3000 on theBenchmark for (3000ds/131Mi)
% 0.11/0.44  % TRYING [2]
% 0.11/0.44  % (1390905)Refutation found. Thanks to Tanya!
% 0.11/0.44  % SZS status Unsatisfiable for theBenchmark
% 0.11/0.44  % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.44  % (1390905)------------------------------
% 0.11/0.44  % (1390905)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.44  % (1390905)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.44  % (1390905)CaDiCaL version: 2.1.3
% 0.11/0.44  % (1390905)Termination reason: Refutation
% 0.11/0.44  % (1390905)Time elapsed: 0.006 s
% 0.11/0.44  % (1390905)Peak memory usage: 11 MB
% 0.11/0.44  % (1390905)Instructions burned: 16 (million)
% 0.11/0.44  % (1390898)Success in time 0.022 s
% 0.11/0.44  % Vampire exiting
%------------------------------------------------------------------------------