↑ Up

Vampire---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : GRP141-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 : n020.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:04 AM UTC 2026

% Result   : Unsatisfiable 3.01s 1.11s
% Output   : Refutation 3.01s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   19 (  19 unt;   0 def)
%            Number of atoms       :   19 (  18 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    6 (   6   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :    9 (   9   !;   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(f7,axiom,
    ! [X2,X0,X1] : greatest_lower_bound(X0,greatest_lower_bound(X1,X2)) = greatest_lower_bound(greatest_lower_bound(X0,X1),X2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',associativity_of_glb) ).

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

fof(f17,axiom,
    least_upper_bound(a,c) = a,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_glb1d_1) ).

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

fof(f19,axiom,
    least_upper_bound(b,c) = b,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_glb1d_2) ).

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

fof(f21,negated_conjecture,
    greatest_lower_bound(greatest_lower_bound(a,b),c) != c,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_ax_glb1d) ).

fof(f22,plain,
    c != greatest_lower_bound(greatest_lower_bound(a,b),c),
    inference(reorient_equations,[],[f21]) ).

fof(f25,plain,
    a = least_upper_bound(c,a),
    inference(superposition,[],[f6,f18]) ).

fof(f26,plain,
    b = least_upper_bound(c,b),
    inference(superposition,[],[f6,f20]) ).

fof(f40,plain,
    c = greatest_lower_bound(c,a),
    inference(superposition,[],[f12,f25]) ).

fof(f43,plain,
    c = greatest_lower_bound(c,b),
    inference(superposition,[],[f12,f26]) ).

fof(f113,plain,
    c != greatest_lower_bound(a,greatest_lower_bound(b,c)),
    inference(superposition,[],[f22,f7]) ).

fof(f121,plain,
    c != greatest_lower_bound(a,greatest_lower_bound(c,b)),
    inference(forward_demodulation,[],[f113,f5]) ).

fof(f123,plain,
    c != greatest_lower_bound(a,c),
    inference(forward_demodulation,[],[f121,f43]) ).

fof(f125,plain,
    c != greatest_lower_bound(c,a),
    inference(forward_demodulation,[],[f123,f5]) ).

fof(f126,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f125,f40]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP141-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.39  % Computer : n020.cluster.edu
% 0.12/0.39  % Model    : x86_64 x86_64
% 0.12/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.39  % Memory   : 8046.5625MB
% 0.12/0.39  % OS       : Linux 6.8.0-71-generic
% 0.12/0.39  % CPULimit : 300
% 0.12/0.39  % WCLimit  : 300
% 0.12/0.39  % DateTime : Sun Sep 27 09:33:34 UTC 2026
% 0.12/0.39  % CPUTime  : 
% 0.12/0.39  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.42  Running first-order theorem proving
% 0.12/0.42  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.01/1.11  % (3131057)Detected a unit-equality problem, will run specialized UEQ schedule.
% 3.01/1.11  % (3131068)dis-1010_7_sil=8000:fde=unused:flr=on:random_seed=3019086441:i=1187:sd=4:av=off:ss=axioms:sgt=32_2999 on theBenchmark for (2999ds/1187Mi)
% 3.01/1.11  % (3131064)lrs+10_1_ncem=casc2026/models/loop5.pt:sil=128000:tgt=ground:npcc=on:spb=goal_then_units:urr=ec_only:random_seed=2326692376:i=130716:gtgl=4:add=on:doe=on:bd=all:gtg=exists_sym_2999 on theBenchmark for (2999ds/130716Mi)
% 3.01/1.11  % (3131066)dis+10_14_to=lpo:sil=8000:tgt=full:drc=off:sp=const_frequency:sos=all:random_seed=3081715085:i=181:gtgl=5:bs=unit_only:fsr=off:gtg=exists_all_2999 on theBenchmark for (2999ds/181Mi)
% 3.01/1.11  % (3131065)ott-1010_1_sfv=off:to=lpo:sil=8000:fdtod=off:sp=reverse_frequency:spb=goal_then_units:fd=preordered:random_seed=3564290814:i=136:bd=preordered:ins=2:av=off_2999 on theBenchmark for (2999ds/136Mi)
% 3.01/1.11  % (3131062)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=292245047:i=138329:kws=inv_arity_squared:fgj=on:bd=preordered_2999 on theBenchmark for (2999ds/138329Mi)
% 3.01/1.11  % (3131063)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=3441246180:i=130792:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/130792Mi)
% 3.01/1.11  % (3131068)First to succeed.
% 3.01/1.11  % (3131065)Also succeeded, but the first one will report.
% 3.01/1.11  % (3131068)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3131057"
% 3.01/1.11  % (3131067)lrs+10_3_to=lpo:sil=64000:drc=off:fde=unused:sp=reverse_frequency:acc=on:bsr=on:fd=preordered:nwc=1:random_seed=1891650855:avsq=on:i=257:avsqr=16,3:bd=preordered:fsr=off_2999 on theBenchmark for (2999ds/257Mi)
% 3.01/1.11  % (3131067)Also succeeded, but the first one will report.
% 3.01/1.11  % (3131066)Also succeeded, but the first one will report.
% 3.01/1.11  % (3131068)Refutation found. Thanks to Tanya!
% 3.01/1.11  % SZS status Unsatisfiable for theBenchmark
% 3.01/1.11  % SZS output start Proof for theBenchmark
% See solution above
% 3.01/1.11  % (3131068)------------------------------
% 3.01/1.11  % (3131068)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.01/1.11  % (3131068)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.01/1.11  % (3131068)CaDiCaL version: 2.1.3
% 3.01/1.11  % (3131068)Termination reason: Refutation
% 3.01/1.11  % (3131068)Time elapsed: 0.005 s
% 3.01/1.11  % (3131068)Peak memory usage: 88 MB
% 3.01/1.11  % (3131068)Instructions burned: 5 (million)
% 3.01/1.11  % (3131068)------------------------------
% 3.01/1.11  % (3131068)------------------------------
% 3.01/1.11  % (3131057)Success in time 0.394 s
% 3.01/1.11  % Vampire exiting
%------------------------------------------------------------------------------