↑ Up

Vampire---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : GRP190-1 : 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 : n001.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:17 AM UTC 2026

% Result   : Unsatisfiable 11.06s 2.73s
% Output   : Refutation 11.06s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   37 (  37 unt;   0 def)
%            Number of atoms       :   37 (  36 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    2 (   2   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   3 con; 0-2 aty)
%            Number of variables   :   55 (  55   !;   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(f6,axiom,
    ! [X0,X1] : least_upper_bound(X0,X1) = least_upper_bound(X1,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetry_of_lub) ).

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

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

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

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/sandbox2/benchmark/theBenchmark.p',monotony_lub2) ).

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

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

fof(f19,negated_conjecture,
    least_upper_bound(inverse(a),inverse(b)) != inverse(b),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_p39a) ).

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

fof(f22,plain,
    ! [X0,X1] : least_upper_bound(X1,greatest_lower_bound(X0,X1)) = X1,
    inference(superposition,[],[f11,f5]) ).

fof(f26,plain,
    ! [X0,X1] : greatest_lower_bound(X1,least_upper_bound(X0,X1)) = X1,
    inference(superposition,[],[f12,f6]) ).

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

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

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

fof(f89,plain,
    ! [X0] : identity = multiply(inverse(inverse(inverse(X0))),X0),
    inference(superposition,[],[f77,f80]) ).

fof(f106,plain,
    ! [X0] : multiply(inverse(inverse(inverse(inverse(X0)))),identity) = X0,
    inference(superposition,[],[f77,f89]) ).

fof(f110,plain,
    ! [X0] : inverse(inverse(X0)) = X0,
    inference(forward_demodulation,[],[f106,f80]) ).

fof(f134,plain,
    ! [X0] : multiply(X0,identity) = X0,
    inference(superposition,[],[f80,f110]) ).

fof(f314,plain,
    ! [X0,X1] : multiply(inverse(X0),least_upper_bound(X0,X1)) = least_upper_bound(identity,multiply(inverse(X0),X1)),
    inference(superposition,[],[f13,f3]) ).

fof(f611,plain,
    ! [X0,X1] : multiply(least_upper_bound(inverse(X0),X1),X0) = least_upper_bound(identity,multiply(X1,X0)),
    inference(superposition,[],[f15,f3]) ).

fof(f3938,plain,
    ! [X0,X1] : multiply(inverse(X0),X0) = least_upper_bound(identity,multiply(greatest_lower_bound(X1,inverse(X0)),X0)),
    inference(superposition,[],[f611,f22]) ).

fof(f3990,plain,
    ! [X0,X1] : identity = least_upper_bound(identity,multiply(greatest_lower_bound(X1,inverse(X0)),X0)),
    inference(forward_demodulation,[],[f3938,f3]) ).

fof(f4009,plain,
    ! [X0,X1] : identity = least_upper_bound(identity,multiply(greatest_lower_bound(X1,X0),inverse(X0))),
    inference(superposition,[],[f3990,f110]) ).

fof(f4155,plain,
    ! [X0,X1] : identity = least_upper_bound(identity,multiply(X0,inverse(least_upper_bound(X1,X0)))),
    inference(superposition,[],[f4009,f26]) ).

fof(f8454,plain,
    ! [X0,X1] : least_upper_bound(X0,X1) = multiply(inverse(inverse(X0)),least_upper_bound(identity,multiply(inverse(X0),X1))),
    inference(superposition,[],[f77,f314]) ).

fof(f8510,plain,
    ! [X0,X1] : least_upper_bound(X0,X1) = multiply(X0,least_upper_bound(identity,multiply(inverse(X0),X1))),
    inference(forward_demodulation,[],[f8454,f110]) ).

fof(f28643,plain,
    ! [X0,X1] : multiply(X0,identity) = least_upper_bound(X0,inverse(least_upper_bound(X1,inverse(X0)))),
    inference(superposition,[],[f8510,f4155]) ).

fof(f28777,plain,
    ! [X0,X1] : least_upper_bound(X0,inverse(least_upper_bound(X1,inverse(X0)))) = X0,
    inference(forward_demodulation,[],[f28643,f134]) ).

fof(f28898,plain,
    ! [X0,X1] : inverse(X0) = least_upper_bound(inverse(X0),inverse(least_upper_bound(X1,X0))),
    inference(superposition,[],[f28777,f110]) ).

fof(f29968,plain,
    inverse(b) = least_upper_bound(inverse(b),inverse(a)),
    inference(superposition,[],[f28898,f18]) ).

fof(f30050,plain,
    inverse(b) = least_upper_bound(inverse(a),inverse(b)),
    inference(forward_demodulation,[],[f29968,f6]) ).

fof(f30124,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f30050,f20]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP190-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.43  % Computer : n001.cluster.edu
% 0.16/0.43  % Model    : x86_64 x86_64
% 0.16/0.43  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.43  % Memory   : 8046.5625MB
% 0.16/0.43  % OS       : Linux 6.8.0-71-generic
% 0.16/0.43  % CPULimit : 300
% 0.16/0.43  % WCLimit  : 300
% 0.16/0.43  % DateTime : Sun Sep 27 09:42:30 UTC 2026
% 0.16/0.43  % CPUTime  : 
% 0.16/0.43  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.20/0.48  Running first-order theorem proving
% 0.20/0.48  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
% 11.06/2.73  % (3302754)Detected a unit-equality problem, will run specialized UEQ schedule.
% 11.06/2.73  % (3302761)lrs+10_1_ncem=casc2026/models/loop5.pt:sil=128000:tgt=ground:npcc=on:spb=goal_then_units:urr=ec_only:random_seed=3164614544:i=130716:gtgl=4:add=on:doe=on:bd=all:gtg=exists_sym_2999 on theBenchmark for (2999ds/130716Mi)
% 11.06/2.73  % (3302765)dis-1010_7_sil=8000:fde=unused:flr=on:random_seed=3601413116:i=1187:sd=4:av=off:ss=axioms:sgt=32_2999 on theBenchmark for (2999ds/1187Mi)
% 11.06/2.73  % (3302760)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=1783603835:i=130792:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/130792Mi)
% 11.06/2.73  % (3302759)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=3445590489:i=138329:kws=inv_arity_squared:fgj=on:bd=preordered_2999 on theBenchmark for (2999ds/138329Mi)
% 11.06/2.73  % (3302763)dis+10_14_to=lpo:sil=8000:tgt=full:drc=off:sp=const_frequency:sos=all:random_seed=2631629957:i=181:gtgl=5:bs=unit_only:fsr=off:gtg=exists_all_2999 on theBenchmark for (2999ds/181Mi)
% 11.06/2.73  % (3302762)ott-1010_1_sfv=off:to=lpo:sil=8000:fdtod=off:sp=reverse_frequency:spb=goal_then_units:fd=preordered:random_seed=3400616617:i=136:bd=preordered:ins=2:av=off_2999 on theBenchmark for (2999ds/136Mi)
% 11.06/2.73  % (3302764)lrs+10_3_to=lpo:sil=64000:drc=off:fde=unused:sp=reverse_frequency:acc=on:bsr=on:fd=preordered:nwc=1:random_seed=4123728585:avsq=on:i=257:avsqr=16,3:bd=preordered:fsr=off_2999 on theBenchmark for (2999ds/257Mi)
% 11.06/2.73  % (3302762)Instruction limit reached! 
% 11.06/2.73  % (3302762)------------------------------
% 11.06/2.73  % (3302762)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.06/2.73  % (3302762)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.06/2.73  % (3302762)CaDiCaL version: 2.1.3
% 11.06/2.73  % (3302762)Termination reason: Instruction limit
% 11.06/2.73  % (3302762)Termination phase: Saturation
% 11.06/2.73  % (3302762)Time elapsed: 0.134 s
% 11.06/2.73  % (3302762)Peak memory usage: 89 MB
% 11.06/2.73  % (3302762)Instructions burned: 136 (million)
% 11.06/2.73  % (3302763)Instruction limit reached! 
% 11.06/2.73  % (3302763)------------------------------
% 11.06/2.73  % (3302763)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.06/2.73  % (3302763)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.06/2.73  % (3302763)CaDiCaL version: 2.1.3
% 11.06/2.73  % (3302763)Termination reason: Instruction limit
% 11.06/2.73  % (3302763)Termination phase: Saturation
% 11.06/2.73  % (3302763)Time elapsed: 0.167 s
% 11.06/2.73  % (3302763)Peak memory usage: 89 MB
% 11.06/2.73  % (3302763)Instructions burned: 182 (million)
% 11.06/2.73  % (3302764)Instruction limit reached! 
% 11.06/2.73  % (3302764)------------------------------
% 11.06/2.73  % (3302764)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.06/2.73  % (3302764)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.06/2.73  % (3302764)CaDiCaL version: 2.1.3
% 11.06/2.73  % (3302764)Termination reason: Instruction limit
% 11.06/2.73  % (3302764)Termination phase: Saturation
% 11.06/2.73  % (3302764)Time elapsed: 0.271 s
% 11.06/2.73  % (3302764)Peak memory usage: 91 MB
% 11.06/2.73  % (3302764)Instructions burned: 258 (million)
% 11.06/2.73  % (3302773)lrs-1011_1_ncem=casc2026/models/loop8.pt:sil=32000:npcc=on:prc=on:fde=unused:lcm=predicate:bsr=on:flr=on:random_seed=529332387:i=2051:gtgl=2:fgj=on:bd=all:gtg=exists_top_2995 on theBenchmark for (2995ds/2051Mi)
% 11.06/2.73  % (3302774)lrs-1002_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:npcc=on:random_seed=1134798048:i=4948:ss=axioms:sgt=16_2995 on theBenchmark for (2995ds/4948Mi)
% 11.06/2.73  % (3302775)lrs+10_5:1_sil=8000:sos=all:urr=on:br=off:flr=on:random_seed=1478086920:i=215:ep=RSTC_2994 on theBenchmark for (2994ds/215Mi)
% 11.06/2.73  % (3302775)Instruction limit reached! 
% 11.06/2.73  % (3302775)------------------------------
% 11.06/2.73  % (3302775)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.06/2.73  % (3302775)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.06/2.73  % (3302775)CaDiCaL version: 2.1.3
% 11.06/2.73  % (3302775)Termination reason: Instruction limit
% 11.06/2.73  % (3302775)Termination phase: Saturation
% 11.06/2.73  % (3302775)Time elapsed: 0.197 s
% 11.06/2.73  % (3302775)Peak memory usage: 92 MB
% 11.06/2.73  % (3302775)Instructions burned: 215 (million)
% 11.06/2.73  % (3302765)First to succeed.
% 11.06/2.73  % (3302765)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3302754"
% 11.06/2.73  % (3302761)Also succeeded, but the first one will report.
% 11.06/2.73  % (3302760)Also succeeded, but the first one will report.
% 11.06/2.73  % (3302779)lrs+11_1_sil=16000:tgt=full:fde=none:sp=reverse_frequency:lma=off:fs=off:acc=on:bsr=unit_only:rp=on:random_seed=525459517:avsq=on:i=317:avsqr=1,16:kws=arity_squared:add=off:fgj=on:ins=10:fsr=off:gtg=exists_sym_2990 on theBenchmark for (2990ds/317Mi)
% 11.06/2.73  % (3302765)Refutation found. Thanks to Tanya!
% 11.06/2.73  % SZS status Unsatisfiable for theBenchmark
% 11.06/2.73  % SZS output start Proof for theBenchmark
% See solution above
% 11.06/2.73  % (3302765)------------------------------
% 11.06/2.73  % (3302765)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.06/2.73  % (3302765)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.06/2.73  % (3302765)CaDiCaL version: 2.1.3
% 11.06/2.73  % (3302765)Termination reason: Refutation
% 11.06/2.73  % (3302765)Time elapsed: 0.851 s
% 11.06/2.73  % (3302765)Peak memory usage: 97 MB
% 11.06/2.73  % (3302765)Instructions burned: 962 (million)
% 11.06/2.73  % (3302765)------------------------------
% 11.06/2.73  % (3302765)------------------------------
% 11.06/2.73  % (3302754)Success in time 1.457 s
% 11.06/2.73  % Vampire exiting
%------------------------------------------------------------------------------