↑ Up

Vampire---5.0.1.UNS-Ref.s

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

% Computer : n010.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:07 AM UTC 2026

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

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

fof(f6,axiom,
    ! [X0,X1] : least_upper_bound(X0,X1) = least_upper_bound(X1,X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_of_lub) ).

fof(f11,axiom,
    ! [X0,X1] : least_upper_bound(X0,greatest_lower_bound(X0,X1)) = X0,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',lub_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/sandbox/benchmark/theBenchmark.p',monotony_lub1) ).

fof(f17,axiom,
    greatest_lower_bound(a,b) = a,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_mono2c_1) ).

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

fof(f19,negated_conjecture,
    least_upper_bound(multiply(c,a),multiply(c,b)) != multiply(c,b),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_ax_mono2c) ).

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

fof(f21,definition,
    ~ sP0(multiply(c,b)),
    introduced(definition,[new_symbols(definition,[sP0])],[inequality_splitting_name_introduction]) ).

fof(f22,plain,
    sP0(least_upper_bound(multiply(c,a),multiply(c,b))),
    inference(inequality_splitting,[],[f20,f21]) ).

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

fof(f38,plain,
    b = least_upper_bound(b,a),
    inference(superposition,[],[f26,f18]) ).

fof(f67,plain,
    b = least_upper_bound(a,b),
    inference(superposition,[],[f6,f38]) ).

fof(f98,plain,
    ! [X0] : multiply(X0,b) = least_upper_bound(multiply(X0,a),multiply(X0,b)),
    inference(superposition,[],[f13,f67]) ).

fof(f112,plain,
    sP0(multiply(c,b)),
    inference(backward_demodulation,[],[f22,f98]) ).

fof(f119,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f112,f21]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : GRP159-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.37  % Computer : n010.cluster.edu
% 0.12/0.37  % Model    : x86_64 x86_64
% 0.12/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37  % Memory   : 8046.5625MB
% 0.12/0.37  % OS       : Linux 6.8.0-71-generic
% 0.12/0.37  % CPULimit : 300
% 0.12/0.37  % WCLimit  : 300
% 0.12/0.37  % DateTime : Sun Sep 27 09:34:31 UTC 2026
% 0.12/0.38  % CPUTime  : 
% 0.12/0.38  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.43  Running first-order theorem proving
% 0.12/0.43  Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.40/1.27  % (694208)Detected a unit-equality problem, will run specialized UEQ schedule.
% 3.40/1.27  % (694224)dis-1010_7_sil=8000:fde=unused:flr=on:random_seed=3085471919:i=1187:sd=4:av=off:ss=axioms:sgt=32_2999 on theBenchmark for (2999ds/1187Mi)
% 3.40/1.27  % (694222)dis+10_14_to=lpo:sil=8000:tgt=full:drc=off:sp=const_frequency:sos=all:random_seed=246104948:i=181:gtgl=5:bs=unit_only:fsr=off:gtg=exists_all_2999 on theBenchmark for (2999ds/181Mi)
% 3.40/1.27  % (694217)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=2649218991:i=138329:kws=inv_arity_squared:fgj=on:bd=preordered_2999 on theBenchmark for (2999ds/138329Mi)
% 3.40/1.27  % (694218)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=218494508:i=130792:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/130792Mi)
% 3.40/1.27  % (694219)lrs+10_1_ncem=casc2026/models/loop5.pt:sil=128000:tgt=ground:npcc=on:spb=goal_then_units:urr=ec_only:random_seed=1287321597:i=130716:gtgl=4:add=on:doe=on:bd=all:gtg=exists_sym_2999 on theBenchmark for (2999ds/130716Mi)
% 3.40/1.27  % (694220)ott-1010_1_sfv=off:to=lpo:sil=8000:fdtod=off:sp=reverse_frequency:spb=goal_then_units:fd=preordered:random_seed=2984475962:i=136:bd=preordered:ins=2:av=off_2999 on theBenchmark for (2999ds/136Mi)
% 3.40/1.27  % (694220)First to succeed.
% 3.40/1.27  % (694220)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-694208"
% 3.40/1.27  % (694224)Also succeeded, but the first one will report.
% 3.40/1.27  % (694223)lrs+10_3_to=lpo:sil=64000:drc=off:fde=unused:sp=reverse_frequency:acc=on:bsr=on:fd=preordered:nwc=1:random_seed=3589211988:avsq=on:i=257:avsqr=16,3:bd=preordered:fsr=off_2999 on theBenchmark for (2999ds/257Mi)
% 3.40/1.27  % (694223)Also succeeded, but the first one will report.
% 3.40/1.27  % (694222)Instruction limit reached! 
% 3.40/1.27  % (694222)------------------------------
% 3.40/1.27  % (694222)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.40/1.27  % (694222)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.40/1.27  % (694222)CaDiCaL version: 2.1.3
% 3.40/1.27  % (694222)Termination reason: Instruction limit
% 3.40/1.27  % (694222)Termination phase: Saturation
% 3.40/1.27  % (694222)Time elapsed: 0.105 s
% 3.40/1.27  % (694222)Peak memory usage: 89 MB
% 3.40/1.27  % (694222)Instructions burned: 182 (million)
% 3.40/1.27  % (694220)Refutation found. Thanks to Tanya!
% 3.40/1.27  % SZS status Unsatisfiable for theBenchmark
% 3.40/1.27  % SZS output start Proof for theBenchmark
% See solution above
% 3.40/1.27  % (694220)------------------------------
% 3.40/1.27  % (694220)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.40/1.27  % (694220)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.40/1.27  % (694220)CaDiCaL version: 2.1.3
% 3.40/1.27  % (694220)Termination reason: Refutation
% 3.40/1.27  % (694220)Time elapsed: 0.005 s
% 3.40/1.27  % (694220)Peak memory usage: 88 MB
% 3.40/1.27  % (694220)Instructions burned: 6 (million)
% 3.40/1.27  % (694220)------------------------------
% 3.40/1.27  % (694220)------------------------------
% 3.40/1.27  % (694208)Success in time 0.423 s
% 3.40/1.27  % Vampire exiting
%------------------------------------------------------------------------------