↑ Up

Vampire---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : GRP165-2 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n016.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:13:08 AM UTC 2026

% Result   : Unsatisfiable 2.64s 1.33s
% Output   : Refutation 2.64s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   22 (  22 unt;   1 def)
%            Number of atoms       :   22 (  18 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    :    4 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   21 (  21   !;   0   ?)

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

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

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

fof(f4,axiom,
    ! [X2,X0,X1] : multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',associativity) ).

fof(f5,axiom,
    ! [X0,X1] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetry_of_glb) ).

fof(f14,axiom,
    ! [X2,X0,X1] : multiply(X0,greatest_lower_bound(X1,X2)) = greatest_lower_bound(multiply(X0,X1),multiply(X0,X2)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',monotony_glb1) ).

fof(f17,axiom,
    greatest_lower_bound(a,identity) = identity,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lat1b_1) ).

fof(f18,plain,
    identity = greatest_lower_bound(a,identity),
    inference(reorient_equations,[],[f17]) ).

fof(f19,negated_conjecture,
    greatest_lower_bound(a,multiply(a,a)) != a,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_lat1b) ).

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

fof(f21,definition,
    ~ sP0(greatest_lower_bound(a,multiply(a,a))),
    introduced(definition,[new_symbols(definition,[sP0])],[inequality_splitting_name_introduction]) ).

fof(f22,plain,
    sP0(a),
    inference(inequality_splitting,[],[f20,f21]) ).

fof(f26,plain,
    identity = greatest_lower_bound(identity,a),
    inference(superposition,[],[f18,f5]) ).

fof(f43,plain,
    ! [X0,X1] : multiply(inverse(X0),multiply(X0,X1)) = multiply(identity,X1),
    inference(superposition,[],[f4,f3]) ).

fof(f46,plain,
    ! [X0,X1] : multiply(inverse(X0),multiply(X0,X1)) = X1,
    inference(forward_demodulation,[],[f43,f1]) ).

fof(f149,plain,
    ! [X0] : multiply(inverse(inverse(X0)),identity) = X0,
    inference(superposition,[],[f46,f3]) ).

fof(f151,plain,
    ! [X0,X1] : multiply(X1,X0) = multiply(inverse(inverse(X1)),X0),
    inference(superposition,[],[f46,f46]) ).

fof(f156,plain,
    ! [X0] : multiply(X0,identity) = X0,
    inference(forward_demodulation,[],[f149,f151]) ).

fof(f165,plain,
    ! [X0] : multiply(X0,identity) = greatest_lower_bound(multiply(X0,identity),multiply(X0,a)),
    inference(superposition,[],[f14,f26]) ).

fof(f184,plain,
    ! [X0] : greatest_lower_bound(X0,multiply(X0,a)) = X0,
    inference(forward_demodulation,[],[f165,f156]) ).

fof(f192,plain,
    ~ sP0(a),
    inference(backward_demodulation,[],[f21,f184]) ).

fof(f197,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f192,f22]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : GRP165-2 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.37  % Computer : n016.cluster.edu
% 0.09/0.37  % Model    : x86_64 x86_64
% 0.09/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37  % Memory   : 8046.5625MB
% 0.09/0.37  % OS       : Linux 6.8.0-71-generic
% 0.09/0.38  % CPULimit : 300
% 0.09/0.38  % WCLimit  : 300
% 0.09/0.38  % DateTime : Sun Sep 27 09:39:17 UTC 2026
% 0.09/0.38  % CPUTime  : 
% 0.09/0.38  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.40  Running first-order theorem proving
% 0.09/0.40  Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.64/1.33  % (2366222)Detected a unit-equality problem, will run specialized UEQ schedule.
% 2.64/1.33  % (2366230)ott-1010_1_sfv=off:to=lpo:sil=8000:fdtod=off:sp=reverse_frequency:spb=goal_then_units:fd=preordered:random_seed=2966820699:i=136:bd=preordered:ins=2:av=off_2999 on theBenchmark for (2999ds/136Mi)
% 2.64/1.33  % (2366230)First to succeed.
% 2.64/1.33  % (2366230)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2366222"
% 2.64/1.33  % (2366229)lrs+10_1_ncem=casc2026/models/loop5.pt:sil=128000:tgt=ground:npcc=on:spb=goal_then_units:urr=ec_only:random_seed=3158360780:i=130716:gtgl=4:add=on:doe=on:bd=all:gtg=exists_sym_2999 on theBenchmark for (2999ds/130716Mi)
% 2.64/1.33  % (2366227)lrs+1002_1_ncem=casc2026/models/loop7.pt:sil=128000:tgt=ground:npcc=on:drc=off:sp=reverse_frequency:spb=goal:acc=on:s2agt=16:kmz=on:sac=on:random_seed=22891873:i=138329:kws=inv_arity_squared:fgj=on:bd=preordered_2999 on theBenchmark for (2999ds/138329Mi)
% 2.64/1.33  % (2366231)dis+10_14_to=lpo:sil=8000:tgt=full:drc=off:sp=const_frequency:sos=all:random_seed=3054934179:i=181:gtgl=5:bs=unit_only:fsr=off:gtg=exists_all_2999 on theBenchmark for (2999ds/181Mi)
% 2.64/1.33  % (2366228)lrs+11_1_ncem=casc2026/models/loop6.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=2488769481:i=130792:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/130792Mi)
% 2.64/1.33  % (2366233)dis-1010_7_sil=8000:fde=unused:flr=on:random_seed=1203071359:i=1187:sd=4:av=off:ss=axioms:sgt=32_2999 on theBenchmark for (2999ds/1187Mi)
% 2.64/1.33  % (2366232)lrs+10_3_to=lpo:sil=64000:drc=off:fde=unused:sp=reverse_frequency:acc=on:bsr=on:fd=preordered:nwc=1:random_seed=1849552535:avsq=on:i=257:avsqr=16,3:bd=preordered:fsr=off_2999 on theBenchmark for (2999ds/257Mi)
% 2.64/1.33  % (2366231)Also succeeded, but the first one will report.
% 2.64/1.33  % (2366232)Also succeeded, but the first one will report.
% 2.64/1.33  % (2366233)Also succeeded, but the first one will report.
% 2.64/1.33  % (2366230)Refutation found. Thanks to Tanya!
% 2.64/1.33  % SZS status Unsatisfiable for theBenchmark
% 2.64/1.33  % SZS output start Proof for theBenchmark
% See solution above
% 2.64/1.33  % (2366230)------------------------------
% 2.64/1.33  % (2366230)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.64/1.33  % (2366230)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.64/1.33  % (2366230)CaDiCaL version: 2.1.3
% 2.64/1.33  % (2366230)Termination reason: Refutation
% 2.64/1.33  % (2366230)Time elapsed: 0.004 s
% 2.64/1.33  % (2366230)Peak memory usage: 88 MB
% 2.64/1.33  % (2366230)Instructions burned: 9 (million)
% 2.64/1.33  % (2366230)------------------------------
% 2.64/1.33  % (2366230)------------------------------
% 2.64/1.33  % (2366222)Success in time 0.289 s
% 2.64/1.33  % Vampire exiting
%------------------------------------------------------------------------------