↑ 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  : GRP138-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT

% 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:16:56 AM UTC 2026

% Result   : Unsatisfiable 1.65s 0.70s
% Output   : Refutation 2.10s
% 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/sandbox/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/sandbox/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/sandbox/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/sandbox/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/sandbox/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/sandbox/benchmark/Axioms/GRP004-2.ax',glb_absorbtion) ).

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

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

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

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

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

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

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

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

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

fof(f28,plain,
    sF1 = least_upper_bound(c,sF0),
    inference(forward_demodulation,[],[f26,f6]) ).

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

fof(f36,plain,
    a = least_upper_bound(a,sF0),
    inference(superposition,[],[f11,f24]) ).

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

fof(f59,plain,
    ! [X0] : greatest_lower_bound(a,greatest_lower_bound(b,X0)) = greatest_lower_bound(sF0,X0),
    inference(superposition,[],[f7,f24]) ).

fof(f79,plain,
    ! [X0] : least_upper_bound(a,least_upper_bound(c,X0)) = least_upper_bound(a,X0),
    inference(superposition,[],[f8,f18]) ).

fof(f80,plain,
    ! [X0] : least_upper_bound(b,least_upper_bound(c,X0)) = least_upper_bound(b,X0),
    inference(superposition,[],[f8,f20]) ).

fof(f100,plain,
    b = least_upper_bound(b,sF0),
    inference(superposition,[],[f35,f24]) ).

fof(f196,plain,
    sF0 = greatest_lower_bound(sF0,sF1),
    inference(superposition,[],[f39,f28]) ).

fof(f208,plain,
    sF0 = greatest_lower_bound(a,greatest_lower_bound(b,sF1)),
    inference(forward_demodulation,[],[f196,f59]) ).

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

fof(f290,plain,
    a = least_upper_bound(a,sF1),
    inference(forward_demodulation,[],[f284,f36]) ).

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

fof(f306,plain,
    b = least_upper_bound(b,sF1),
    inference(forward_demodulation,[],[f301,f100]) ).

fof(f312,plain,
    sF1 = greatest_lower_bound(sF1,a),
    inference(superposition,[],[f39,f290]) ).

fof(f316,plain,
    sF1 = greatest_lower_bound(a,sF1),
    inference(forward_demodulation,[],[f312,f5]) ).

fof(f342,plain,
    sF1 = greatest_lower_bound(sF1,b),
    inference(superposition,[],[f39,f306]) ).

fof(f346,plain,
    sF1 = greatest_lower_bound(b,sF1),
    inference(forward_demodulation,[],[f342,f5]) ).

fof(f1081,plain,
    sF0 = greatest_lower_bound(a,sF1),
    inference(superposition,[],[f208,f346]) ).

fof(f1253,plain,
    sF0 = sF1,
    inference(superposition,[],[f316,f1081]) ).

fof(f1268,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f1253,f27]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP138-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.37  % Computer : n020.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:33:08 UTC 2026
% 0.12/0.37  % CPUTime  : 
% 0.12/0.37  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.40  Running first-order model finding
% 0.12/0.40  Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.65/0.70  % (3130223)Will run a generic schedule for satisfiability detection.
% 1.65/0.70  % (3130232)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1436604449:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.65/0.70  % (3130229)% WARNING: option uhcvi not known.
% 1.65/0.70  % (3130231)dis+10_1_sil=32000:sp=arity:random_seed=444820294:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.65/0.70  % (3130228)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1103755547_2999 on theBenchmark for (2999ds/0Mi)
% 1.65/0.70  % (3130229)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=841593524:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.65/0.70  % (3130230)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2179576244:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.65/0.70  % (3130233)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2890679787:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 1.65/0.70  % TRYING [1]
% 1.65/0.70  % (3130234)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3176954330:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.65/0.70  % TRYING [2]
% 1.65/0.70  % TRYING [3]
% 1.65/0.70  % TRYING [4]
% 1.65/0.70  % (3130232)Instruction limit reached! 
% 1.65/0.70  % (3130232)------------------------------
% 1.65/0.70  % (3130232)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.65/0.70  % (3130232)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.65/0.70  % (3130232)CaDiCaL version: 2.1.3
% 1.65/0.70  % (3130232)Termination reason: Instruction limit
% 1.65/0.70  % (3130232)Termination phase: Saturation
% 1.65/0.70  % (3130232)Time elapsed: 0.039 s
% 1.65/0.70  % (3130232)Peak memory usage: 12 MB
% 1.65/0.70  % (3130232)Instructions burned: 117 (million)
% 1.65/0.70  % TRYING [5]
% 1.65/0.70  % (3130242)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=669652450:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 1.65/0.70  % TRYING [1]
% 1.65/0.70  % TRYING [2]
% 1.65/0.70  % TRYING [3]
% 1.65/0.70  % TRYING [4]
% 1.65/0.70  % (3130231)Instruction limit reached! 
% 1.65/0.70  % (3130231)------------------------------
% 1.65/0.70  % (3130231)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.65/0.70  % (3130231)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.65/0.70  % (3130231)CaDiCaL version: 2.1.3
% 1.65/0.70  % (3130231)Termination reason: Instruction limit
% 1.65/0.70  % (3130231)Termination phase: Saturation
% 1.65/0.70  % (3130231)Time elapsed: 0.060 s
% 1.65/0.70  % (3130231)Peak memory usage: 12 MB
% 1.65/0.70  % (3130231)Instructions burned: 104 (million)
% 1.65/0.70  % TRYING [5]
% 1.65/0.70  % (3130244)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=4128755380:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 1.65/0.70  % (3130233)Instruction limit reached! 
% 1.65/0.70  % (3130233)------------------------------
% 1.65/0.70  % (3130233)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.65/0.70  % (3130233)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.65/0.70  % (3130233)CaDiCaL version: 2.1.3
% 1.65/0.70  % (3130233)Termination reason: Instruction limit
% 1.65/0.70  % (3130233)Termination phase: Saturation
% 1.65/0.70  % (3130233)Time elapsed: 0.080 s
% 1.65/0.70  % (3130233)Peak memory usage: 12 MB
% 1.65/0.70  % (3130233)Instructions burned: 131 (million)
% 1.65/0.70  % (3130234)Instruction limit reached! 
% 1.65/0.70  % (3130234)------------------------------
% 1.65/0.70  % (3130234)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.65/0.70  % (3130234)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.65/0.70  % (3130234)CaDiCaL version: 2.1.3
% 1.65/0.70  % (3130234)Termination reason: Instruction limit
% 1.65/0.70  % (3130234)Termination phase: Saturation
% 1.65/0.70  % (3130234)Time elapsed: 0.097 s
% 1.65/0.70  % (3130234)Peak memory usage: 12 MB
% 1.65/0.70  % (3130234)Instructions burned: 159 (million)
% 1.65/0.70  % (3130246)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=555102245:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 1.65/0.70  % TRYING [6]
% 1.65/0.70  % (3130247)ott-21_1_sil=16000:fs=off:random_seed=3750489959:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 1.65/0.70  % TRYING [6]
% 1.65/0.70  % (3130244)Instruction limit reached! 
% 1.65/0.70  % (3130244)------------------------------
% 1.65/0.70  % (3130244)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.65/0.70  % (3130244)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.65/0.70  % (3130244)CaDiCaL version: 2.1.3
% 1.65/0.70  % (3130244)Termination reason: Instruction limit
% 1.65/0.70  % (3130244)Termination phase: Saturation
% 1.65/0.70  % (3130244)Time elapsed: 0.085 s
% 1.65/0.70  % (3130244)Peak memory usage: 13 MB
% 1.65/0.70  % (3130244)Instructions burned: 132 (million)
% 1.65/0.70  % (3130250)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=3260108786:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 1.65/0.70  % (3130242)Instruction limit reached! 
% 1.65/0.70  % (3130242)------------------------------
% 1.65/0.70  % (3130242)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.65/0.70  % (3130242)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.65/0.70  % (3130242)CaDiCaL version: 2.1.3
% 1.65/0.70  % (3130242)Termination reason: Instruction limit
% 1.65/0.70  % (3130242)Termination phase: Finite model building constraint generation
% 1.65/0.70  % (3130242)Time elapsed: 0.142 s
% 1.65/0.70  % (3130242)Peak memory usage: 38 MB
% 1.65/0.70  % (3130242)Instructions burned: 715 (million)
% 1.65/0.70  % (3130247)Instruction limit reached! 
% 1.65/0.70  % (3130247)------------------------------
% 1.65/0.70  % (3130247)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.65/0.70  % (3130247)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.65/0.70  % (3130247)CaDiCaL version: 2.1.3
% 1.65/0.70  % (3130247)Termination reason: Instruction limit
% 1.65/0.70  % (3130247)Termination phase: Saturation
% 1.65/0.70  % (3130247)Time elapsed: 0.079 s
% 1.65/0.70  % (3130247)Peak memory usage: 11 MB
% 1.65/0.70  % (3130247)Instructions burned: 181 (million)
% 1.65/0.70  % (3130252)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=4035413145:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 1.65/0.70  % TRYING [1]
% 1.65/0.70  % TRYING [2]
% 1.65/0.70  % TRYING [3]
% 1.65/0.70  % TRYING [4]
% 1.65/0.70  % (3130254)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=3188498325:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 1.65/0.70  % (3130254) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3130223-3130254"...
% 1.65/0.70  % (3130254)...printing done.
% 1.65/0.70  % (3130254)Refutation found. Thanks to Tanya!
% 1.65/0.70  % SZS status Unsatisfiable for theBenchmark
% 1.65/0.70  % SZS output start Proof for theBenchmark
% See solution above
% 2.10/0.70  % (3130254)------------------------------
% 2.10/0.70  % (3130254)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.10/0.70  % (3130254)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.10/0.70  % (3130254)CaDiCaL version: 2.1.3
% 2.10/0.70  % (3130254)Termination reason: Refutation
% 2.10/0.70  % (3130254)Time elapsed: 0.029 s
% 2.10/0.70  % (3130254)Peak memory usage: 12 MB
% 2.10/0.70  % (3130254)Instructions burned: 46 (million)
% 2.10/0.70  % (3130223)Success in time 0.292 s
% 2.10/0.70  % Vampire exiting
%------------------------------------------------------------------------------