↑ Up

Vampire---5.0.1.UNS-Ref.s

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

% Result   : Unsatisfiable 5.15s 1.73s
% Output   : Refutation 5.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   49 (  27 unt;   8 def)
%            Number of atoms       :   83 (  30 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   67 (  33   ~;  28   |;   0   &)
%                                         (   6 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   7 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   5 con; 0-2 aty)
%            Number of variables   :    6 (   0 sgn   6   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f8,axiom,
    ! [X2,X0,X1] : least_upper_bound(X0,least_upper_bound(X1,X2)) = least_upper_bound(least_upper_bound(X0,X1),X2),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',associativity_of_lub) ).

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(f17,axiom,
    least_upper_bound(a,c) = c,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_lub1c_1) ).

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

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

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

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

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

fof(f23,definition,
    sF0 = least_upper_bound(a,b),
    introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).

fof(f24,plain,
    least_upper_bound(a,b) = sF0,
    inference(reorient_equations,[],[f23]) ).

fof(f25,definition,
    sF1 = greatest_lower_bound(sF0,c),
    introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).

fof(f26,plain,
    greatest_lower_bound(sF0,c) = sF1,
    inference(reorient_equations,[],[f25]) ).

fof(f27,plain,
    sF0 != sF1,
    inference(definition_folding,[],[f22,f26,f24,f24]) ).

fof(f33,definition,
    ( spl2_1
  <=> greatest_lower_bound(sF0,c) = sF1 ),
    introduced(definition,[new_symbols(definition,[spl2_1])],[avatar_definition]) ).

fof(f35,plain,
    ( greatest_lower_bound(sF0,c) = sF1
    | ~ spl2_1 ),
    inference(avatar_component_clause,[],[f33]) ).

fof(f36,plain,
    spl2_1,
    inference(avatar_split_clause,[],[f26,f33]) ).

fof(f42,definition,
    ( spl2_2
  <=> c = least_upper_bound(a,c) ),
    introduced(definition,[new_symbols(definition,[spl2_2])],[avatar_definition]) ).

fof(f44,plain,
    ( c = least_upper_bound(a,c)
    | ~ spl2_2 ),
    inference(avatar_component_clause,[],[f42]) ).

fof(f45,plain,
    spl2_2,
    inference(avatar_split_clause,[],[f18,f42]) ).

fof(f47,definition,
    ( spl2_3
  <=> least_upper_bound(a,b) = sF0 ),
    introduced(definition,[new_symbols(definition,[spl2_3])],[avatar_definition]) ).

fof(f49,plain,
    ( least_upper_bound(a,b) = sF0
    | ~ spl2_3 ),
    inference(avatar_component_clause,[],[f47]) ).

fof(f50,plain,
    spl2_3,
    inference(avatar_split_clause,[],[f24,f47]) ).

fof(f54,definition,
    ( spl2_4
  <=> c = least_upper_bound(b,c) ),
    introduced(definition,[new_symbols(definition,[spl2_4])],[avatar_definition]) ).

fof(f56,plain,
    ( c = least_upper_bound(b,c)
    | ~ spl2_4 ),
    inference(avatar_component_clause,[],[f54]) ).

fof(f57,plain,
    spl2_4,
    inference(avatar_split_clause,[],[f20,f54]) ).

fof(f70,definition,
    ( spl2_7
  <=> sF0 = sF1 ),
    introduced(definition,[new_symbols(definition,[spl2_7])],[avatar_definition]) ).

fof(f72,plain,
    ( sF0 != sF1
    | spl2_7 ),
    inference(avatar_component_clause,[],[f70]) ).

fof(f73,plain,
    ~ spl2_7,
    inference(avatar_split_clause,[],[f27,f70]) ).

fof(f118,plain,
    ( ! [X0] : least_upper_bound(a,least_upper_bound(b,X0)) = least_upper_bound(sF0,X0)
    | ~ spl2_3 ),
    inference(superposition,[],[f8,f49]) ).

fof(f431,plain,
    ( least_upper_bound(a,c) = least_upper_bound(sF0,c)
    | ~ spl2_3
    | ~ spl2_4 ),
    inference(superposition,[],[f118,f56]) ).

fof(f446,plain,
    ( c = least_upper_bound(sF0,c)
    | ~ spl2_2
    | ~ spl2_3
    | ~ spl2_4 ),
    inference(forward_demodulation,[],[f431,f44]) ).

fof(f450,definition,
    ( spl2_10
  <=> c = least_upper_bound(sF0,c) ),
    introduced(definition,[new_symbols(definition,[spl2_10])],[avatar_definition]) ).

fof(f452,plain,
    ( c = least_upper_bound(sF0,c)
    | ~ spl2_10 ),
    inference(avatar_component_clause,[],[f450]) ).

fof(f453,plain,
    ( spl2_10
    | ~ spl2_2
    | ~ spl2_3
    | ~ spl2_4 ),
    inference(avatar_split_clause,[],[f446,f54,f47,f42,f450]) ).

fof(f456,plain,
    ( sF0 = greatest_lower_bound(sF0,c)
    | ~ spl2_10 ),
    inference(superposition,[],[f12,f452]) ).

fof(f457,plain,
    ( sF0 = sF1
    | ~ spl2_1
    | ~ spl2_10 ),
    inference(forward_demodulation,[],[f456,f35]) ).

fof(f458,plain,
    ( $false
    | ~ spl2_1
    | spl2_7
    | ~ spl2_10 ),
    inference(forward_subsumption_resolution,[],[f457,f72]) ).

fof(f459,plain,
    ( ~ spl2_1
    | spl2_7
    | ~ spl2_10 ),
    inference(avatar_contradiction_clause,[],[f458]) ).

cnf(s1,plain,
    spl2_1,
    inference(sat_conversion,[],[f36]) ).

cnf(s2,plain,
    spl2_2,
    inference(sat_conversion,[],[f45]) ).

cnf(s3,plain,
    spl2_3,
    inference(sat_conversion,[],[f50]) ).

cnf(s4,plain,
    spl2_4,
    inference(sat_conversion,[],[f57]) ).

cnf(s7,plain,
    ~ spl2_7,
    inference(sat_conversion,[],[f73]) ).

cnf(s10,plain,
    ( ~ spl2_2
    | ~ spl2_3
    | ~ spl2_4
    | spl2_10 ),
    inference(sat_conversion,[],[f453]) ).

cnf(s11,plain,
    ( ~ spl2_1
    | spl2_7
    | ~ spl2_10 ),
    inference(sat_conversion,[],[f459]) ).

cnf(s15,plain,
    spl2_10,
    inference(rat,[],[s10,s3,s4,s2]) ).

cnf(s17,plain,
    ~ spl2_1,
    inference(rat,[],[s11,s7,s15]) ).

cnf(s18,plain,
    $false,
    inference(rat,[],[s1,s17]) ).

fof(f460,plain,
    $false,
    inference(avatar_sat_refutation,[],[s18]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP148-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.12/0.41  % Computer : n015.cluster.edu
% 0.12/0.41  % Model    : x86_64 x86_64
% 0.12/0.41  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.41  % Memory   : 8046.5625MB
% 0.12/0.41  % OS       : Linux 6.8.0-71-generic
% 0.12/0.41  % CPULimit : 300
% 0.12/0.41  % WCLimit  : 300
% 0.12/0.41  % DateTime : Sun Sep 27 09:36:45 UTC 2026
% 0.12/0.41  % CPUTime  : 
% 0.12/0.41  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.45  Running first-order theorem proving
% 0.12/0.45  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
% 5.15/1.73  % (1399939)Detected a unit-equality problem, will run specialized UEQ schedule.
% 5.15/1.73  % (1399944)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=730922444:i=138329:kws=inv_arity_squared:fgj=on:bd=preordered_2999 on theBenchmark for (2999ds/138329Mi)
% 5.15/1.73  % (1399948)dis+10_14_to=lpo:sil=8000:tgt=full:drc=off:sp=const_frequency:sos=all:random_seed=2666470068:i=181:gtgl=5:bs=unit_only:fsr=off:gtg=exists_all_2999 on theBenchmark for (2999ds/181Mi)
% 5.15/1.73  % (1399946)lrs+10_1_ncem=casc2026/models/loop5.pt:sil=128000:tgt=ground:npcc=on:spb=goal_then_units:urr=ec_only:random_seed=2914121808:i=130716:gtgl=4:add=on:doe=on:bd=all:gtg=exists_sym_2999 on theBenchmark for (2999ds/130716Mi)
% 5.15/1.73  % (1399947)ott-1010_1_sfv=off:to=lpo:sil=8000:fdtod=off:sp=reverse_frequency:spb=goal_then_units:fd=preordered:random_seed=3290347857:i=136:bd=preordered:ins=2:av=off_2999 on theBenchmark for (2999ds/136Mi)
% 5.15/1.73  % (1399945)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=597987456:i=130792:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/130792Mi)
% 5.15/1.73  % (1399949)lrs+10_3_to=lpo:sil=64000:drc=off:fde=unused:sp=reverse_frequency:acc=on:bsr=on:fd=preordered:nwc=1:random_seed=1962466710:avsq=on:i=257:avsqr=16,3:bd=preordered:fsr=off_2999 on theBenchmark for (2999ds/257Mi)
% 5.15/1.73  % (1399950)dis-1010_7_sil=8000:fde=unused:flr=on:random_seed=2700758121:i=1187:sd=4:av=off:ss=axioms:sgt=32_2999 on theBenchmark for (2999ds/1187Mi)
% 5.15/1.73  % (1399947)Instruction limit reached! 
% 5.15/1.73  % (1399947)------------------------------
% 5.15/1.73  % (1399947)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.15/1.73  % (1399947)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.15/1.73  % (1399947)CaDiCaL version: 2.1.3
% 5.15/1.73  % (1399947)Termination reason: Instruction limit
% 5.15/1.73  % (1399947)Termination phase: Saturation
% 5.15/1.73  % (1399947)Time elapsed: 0.084 s
% 5.15/1.73  % (1399947)Peak memory usage: 89 MB
% 5.15/1.73  % (1399947)Instructions burned: 137 (million)
% 5.15/1.73  % (1399948)Instruction limit reached! 
% 5.15/1.73  % (1399948)------------------------------
% 5.15/1.73  % (1399948)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.15/1.73  % (1399948)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.15/1.73  % (1399948)CaDiCaL version: 2.1.3
% 5.15/1.73  % (1399948)Termination reason: Instruction limit
% 5.15/1.73  % (1399948)Termination phase: Saturation
% 5.15/1.73  % (1399948)Time elapsed: 0.104 s
% 5.15/1.73  % (1399948)Peak memory usage: 89 MB
% 5.15/1.73  % (1399948)Instructions burned: 181 (million)
% 5.15/1.73  % (1399949)Instruction limit reached! 
% 5.15/1.73  % (1399949)------------------------------
% 5.15/1.73  % (1399949)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.15/1.73  % (1399949)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.15/1.73  % (1399949)CaDiCaL version: 2.1.3
% 5.15/1.73  % (1399949)Termination reason: Instruction limit
% 5.15/1.73  % (1399949)Termination phase: Saturation
% 5.15/1.73  % (1399949)Time elapsed: 0.162 s
% 5.15/1.73  % (1399949)Peak memory usage: 91 MB
% 5.15/1.73  % (1399949)Instructions burned: 260 (million)
% 5.15/1.73  % (1399958)lrs-1011_1_ncem=casc2026/models/loop8.pt:sil=32000:npcc=on:prc=on:fde=unused:lcm=predicate:bsr=on:flr=on:random_seed=1101441506:i=2051:gtgl=2:fgj=on:bd=all:gtg=exists_top_2997 on theBenchmark for (2997ds/2051Mi)
% 5.15/1.73  % (1399959)lrs-1002_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:npcc=on:random_seed=605957403:i=4948:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/4948Mi)
% 5.15/1.73  % (1399960)lrs+10_5:1_sil=8000:sos=all:urr=on:br=off:flr=on:random_seed=1898805536:i=215:ep=RSTC_2996 on theBenchmark for (2996ds/215Mi)
% 5.15/1.73  % (1399944)First to succeed.
% 5.15/1.73  % (1399944)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1399939"
% 5.15/1.73  % (1399950)Also succeeded, but the first one will report.
% 5.15/1.73  % (1399960)Instruction limit reached! 
% 5.15/1.73  % (1399960)------------------------------
% 5.15/1.73  % (1399960)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.15/1.73  % (1399960)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.15/1.73  % (1399960)CaDiCaL version: 2.1.3
% 5.15/1.73  % (1399960)Termination reason: Instruction limit
% 5.15/1.73  % (1399960)Termination phase: Saturation
% 5.15/1.73  % (1399960)Time elapsed: 0.118 s
% 5.15/1.73  % (1399960)Peak memory usage: 92 MB
% 5.15/1.73  % (1399960)Instructions burned: 216 (million)
% 5.15/1.73  % (1399944)Refutation found. Thanks to Tanya!
% 5.15/1.73  % SZS status Unsatisfiable for theBenchmark
% 5.15/1.73  % SZS output start Proof for theBenchmark
% See solution above
% 5.15/1.73  % (1399944)------------------------------
% 5.15/1.73  % (1399944)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.15/1.73  % (1399944)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.15/1.73  % (1399944)CaDiCaL version: 2.1.3
% 5.15/1.73  % (1399944)Termination reason: Refutation
% 5.15/1.73  % (1399944)Time elapsed: 0.373 s
% 5.15/1.73  % (1399944)Peak memory usage: 129 MB
% 5.15/1.73  % (1399944)Instructions burned: 987 (million)
% 5.15/1.73  % (1399944)------------------------------
% 5.15/1.73  % (1399944)------------------------------
% 5.15/1.73  % (1399939)Success in time 0.641 s
% 5.15/1.73  % Vampire exiting
%------------------------------------------------------------------------------