↑ Up

Vampire-SAT---5.0.1.UNS-Ref.s

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

% Computer : n002.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:16:57 AM UTC 2026

% Result   : Unsatisfiable 2.08s 0.87s
% Output   : Refutation 2.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   38 (  38 unt;   2 def)
%            Number of atoms       :   38 (  37 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  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   5 con; 0-2 aty)
%            Number of variables   :   21 (  21   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f5,axiom,
    ! [X0,X1] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0),
    file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',symmetry_of_glb) ).

fof(f6,axiom,
    ! [X0,X1] : least_upper_bound(X0,X1) = least_upper_bound(X1,X0),
    file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',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/sandbox2/benchmark/Axioms/GRP004-2.ax',associativity_of_glb) ).

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/Axioms/GRP004-2.ax',associativity_of_lub) ).

fof(f11,axiom,
    ! [X0,X1] : least_upper_bound(X0,greatest_lower_bound(X0,X1)) = X0,
    file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',lub_absorbtion) ).

fof(f12,axiom,
    ! [X0,X1] : greatest_lower_bound(X0,least_upper_bound(X0,X1)) = X0,
    file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',glb_absorbtion) ).

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

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

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

fof(f20,plain,
    b = greatest_lower_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_lub1b) ).

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(f28,plain,
    sF1 = greatest_lower_bound(c,sF0),
    inference(forward_demodulation,[],[f26,f5]) ).

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

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

fof(f44,plain,
    a = greatest_lower_bound(a,sF0),
    inference(superposition,[],[f12,f24]) ).

fof(f59,plain,
    ! [X0] : greatest_lower_bound(a,greatest_lower_bound(c,X0)) = greatest_lower_bound(a,X0),
    inference(superposition,[],[f7,f18]) ).

fof(f60,plain,
    ! [X0] : greatest_lower_bound(b,greatest_lower_bound(c,X0)) = greatest_lower_bound(b,X0),
    inference(superposition,[],[f7,f20]) ).

fof(f81,plain,
    ! [X0] : least_upper_bound(a,least_upper_bound(b,X0)) = least_upper_bound(sF0,X0),
    inference(superposition,[],[f8,f24]) ).

fof(f103,plain,
    sF0 = least_upper_bound(sF0,sF1),
    inference(superposition,[],[f35,f28]) ).

fof(f110,plain,
    sF0 = least_upper_bound(a,least_upper_bound(b,sF1)),
    inference(forward_demodulation,[],[f103,f81]) ).

fof(f197,plain,
    b = greatest_lower_bound(b,sF0),
    inference(superposition,[],[f42,f24]) ).

fof(f284,plain,
    greatest_lower_bound(a,sF0) = greatest_lower_bound(a,sF1),
    inference(superposition,[],[f59,f28]) ).

fof(f290,plain,
    a = greatest_lower_bound(a,sF1),
    inference(forward_demodulation,[],[f284,f44]) ).

fof(f301,plain,
    greatest_lower_bound(b,sF0) = greatest_lower_bound(b,sF1),
    inference(superposition,[],[f60,f28]) ).

fof(f306,plain,
    b = greatest_lower_bound(b,sF1),
    inference(forward_demodulation,[],[f301,f197]) ).

fof(f312,plain,
    sF1 = least_upper_bound(sF1,a),
    inference(superposition,[],[f35,f290]) ).

fof(f316,plain,
    sF1 = least_upper_bound(a,sF1),
    inference(forward_demodulation,[],[f312,f6]) ).

fof(f348,plain,
    sF1 = least_upper_bound(sF1,b),
    inference(superposition,[],[f35,f306]) ).

fof(f352,plain,
    sF1 = least_upper_bound(b,sF1),
    inference(forward_demodulation,[],[f348,f6]) ).

fof(f1171,plain,
    sF0 = least_upper_bound(a,sF1),
    inference(superposition,[],[f110,f352]) ).

fof(f1301,plain,
    sF0 = sF1,
    inference(superposition,[],[f316,f1171]) ).

fof(f1313,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f1301,f27]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : GRP147-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.37  % Computer : n002.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Sun Sep 27 09:36:07 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.37  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.41  Running first-order model finding
% 0.11/0.41  Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.08/0.87  % (3286282)Will run a generic schedule for satisfiability detection.
% 2.08/0.87  % (3286287)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=716997897_2999 on theBenchmark for (2999ds/0Mi)
% 2.08/0.87  % TRYING [1]
% 2.08/0.87  % TRYING [2]
% 2.08/0.87  % TRYING [3]
% 2.08/0.87  % (3286288)% WARNING: option uhcvi not known.
% 2.08/0.87  % TRYING [4]
% 2.08/0.87  % (3286293)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3222854324:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 2.08/0.87  % (3286289)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1810816517:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 2.08/0.87  % (3286290)dis+10_1_sil=32000:sp=arity:random_seed=2322303888:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 2.08/0.87  % (3286291)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1974809615:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 2.08/0.87  % (3286292)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=518498326:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 2.08/0.87  % (3286288)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=187267864:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 2.08/0.87  % TRYING [5]
% 2.08/0.87  % (3286290)Instruction limit reached! 
% 2.08/0.87  % (3286290)------------------------------
% 2.08/0.87  % (3286290)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.08/0.87  % (3286290)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.08/0.87  % (3286290)CaDiCaL version: 2.1.3
% 2.08/0.87  % (3286290)Termination reason: Instruction limit
% 2.08/0.87  % (3286290)Termination phase: Saturation
% 2.08/0.87  % (3286290)Time elapsed: 0.059 s
% 2.08/0.87  % (3286290)Peak memory usage: 12 MB
% 2.08/0.87  % (3286290)Instructions burned: 103 (million)
% 2.08/0.87  % (3286291)Instruction limit reached! 
% 2.08/0.87  % (3286291)------------------------------
% 2.08/0.87  % (3286291)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.08/0.87  % (3286291)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.08/0.87  % (3286291)CaDiCaL version: 2.1.3
% 2.08/0.87  % (3286291)Termination reason: Instruction limit
% 2.08/0.87  % (3286291)Termination phase: Saturation
% 2.08/0.87  % (3286291)Time elapsed: 0.070 s
% 2.08/0.87  % (3286291)Peak memory usage: 12 MB
% 2.08/0.87  % (3286291)Instructions burned: 116 (million)
% 2.08/0.87  % TRYING [6]
% 2.08/0.87  % (3286301)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3875600827:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 2.08/0.87  % (3286292)Instruction limit reached! 
% 2.08/0.87  % (3286292)------------------------------
% 2.08/0.87  % (3286292)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.08/0.87  % (3286292)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.08/0.87  % (3286292)CaDiCaL version: 2.1.3
% 2.08/0.87  % (3286292)Termination reason: Instruction limit
% 2.08/0.87  % (3286292)Termination phase: Saturation
% 2.08/0.87  % (3286292)Time elapsed: 0.081 s
% 2.08/0.87  % (3286292)Peak memory usage: 13 MB
% 2.08/0.87  % (3286292)Instructions burned: 132 (million)
% 2.08/0.87  % TRYING [1]
% 2.08/0.87  % TRYING [2]
% 2.08/0.87  % TRYING [3]
% 2.08/0.87  % (3286302)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2828787708:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 2.08/0.87  % TRYING [4]
% 2.08/0.87  % (3286293)Instruction limit reached! 
% 2.08/0.87  % (3286293)------------------------------
% 2.08/0.87  % (3286293)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.08/0.87  % (3286293)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.08/0.87  % (3286293)CaDiCaL version: 2.1.3
% 2.08/0.87  % (3286293)Termination reason: Instruction limit
% 2.08/0.87  % (3286293)Termination phase: Saturation
% 2.08/0.87  % (3286293)Time elapsed: 0.098 s
% 2.08/0.87  % (3286293)Peak memory usage: 12 MB
% 2.08/0.87  % (3286293)Instructions burned: 160 (million)
% 2.08/0.87  % (3286304)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=1898590113:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 2.08/0.87  % (3286306)ott-21_1_sil=16000:fs=off:random_seed=3707786608:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 2.08/0.87  % TRYING [5]
% 2.08/0.87  % (3286302)Instruction limit reached! 
% 2.08/0.87  % (3286302)------------------------------
% 2.08/0.87  % (3286302)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.08/0.87  % (3286302)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.08/0.87  % (3286302)CaDiCaL version: 2.1.3
% 2.08/0.87  % (3286302)Termination reason: Instruction limit
% 2.08/0.87  % (3286302)Termination phase: Saturation
% 2.08/0.87  % (3286302)Time elapsed: 0.085 s
% 2.08/0.87  % (3286302)Peak memory usage: 13 MB
% 2.08/0.87  % (3286302)Instructions burned: 131 (million)
% 2.08/0.87  % (3286306)Instruction limit reached! 
% 2.08/0.87  % (3286306)------------------------------
% 2.08/0.87  % (3286306)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.08/0.87  % (3286306)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.08/0.87  % (3286306)CaDiCaL version: 2.1.3
% 2.08/0.87  % (3286306)Termination reason: Instruction limit
% 2.08/0.87  % (3286306)Termination phase: Saturation
% 2.08/0.87  % (3286306)Time elapsed: 0.078 s
% 2.08/0.87  % (3286306)Peak memory usage: 12 MB
% 2.08/0.87  % (3286306)Instructions burned: 181 (million)
% 2.08/0.87  % (3286309)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=3686390033:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 2.08/0.87  % TRYING [6]
% 2.08/0.87  % (3286311)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=3309857848:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 2.08/0.87  % TRYING [1]
% 2.08/0.87  % TRYING [2]
% 2.08/0.87  % TRYING [3]
% 2.08/0.87  % TRYING [4]
% 2.08/0.87  % TRYING [5]
% 2.08/0.87  % (3286301)Instruction limit reached! 
% 2.08/0.87  % (3286301)------------------------------
% 2.08/0.87  % (3286301)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.08/0.87  % (3286301)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.08/0.87  % (3286301)CaDiCaL version: 2.1.3
% 2.08/0.87  % (3286301)Termination reason: Instruction limit
% 2.08/0.87  % (3286301)Termination phase: Finite model building constraint generation
% 2.08/0.87  % (3286301)Time elapsed: 0.267 s
% 2.08/0.87  % (3286301)Peak memory usage: 38 MB
% 2.08/0.87  % (3286301)Instructions burned: 714 (million)
% 2.08/0.87  % (3286373)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=4267133070:i=1179_2996 on theBenchmark for (2996ds/1179Mi)
% 2.08/0.87  % TRYING [7]
% 2.08/0.87  % (3286373) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3286282-3286373"...
% 2.08/0.87  % (3286373)...printing done.
% 2.08/0.87  % (3286373)Refutation found. Thanks to Tanya!
% 2.08/0.87  % SZS status Unsatisfiable for theBenchmark
% 2.08/0.87  % SZS output start Proof for theBenchmark
% See solution above
% 2.08/0.87  % (3286373)------------------------------
% 2.08/0.87  % (3286373)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.08/0.87  % (3286373)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.08/0.87  % (3286373)CaDiCaL version: 2.1.3
% 2.08/0.87  % (3286373)Termination reason: Refutation
% 2.08/0.87  % (3286373)Time elapsed: 0.038 s
% 2.08/0.87  % (3286373)Peak memory usage: 12 MB
% 2.08/0.87  % (3286373)Instructions burned: 47 (million)
% 2.08/0.87  % (3286282)Success in time 0.452 s
% 2.08/0.87  % Vampire exiting
%------------------------------------------------------------------------------