↑ Up

Vampire---5.0.1.UNS-Ref.s

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

% Computer : n009.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 11:45:49 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1] : meet(X0,join(X0,X1)) = X0,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',absorption) ).

fof(f2,axiom,
    ! [X2,X0,X1] : meet(X0,join(X1,X2)) = join(meet(X2,X0),meet(X1,X0)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',distribution) ).

fof(f3,negated_conjecture,
    join(a,meet(a,b)) != a,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_absorbtion_dual) ).

fof(f4,plain,
    a != join(a,meet(a,b)),
    inference(reorient_equations,[],[f3]) ).

fof(f7,plain,
    ! [X2,X0,X1] : meet(X2,X0) = meet(meet(X2,X0),meet(X0,join(X1,X2))),
    inference(superposition,[],[f1,f2]) ).

fof(f11,plain,
    ! [X0,X1] : meet(X1,X0) = meet(meet(X1,X0),X0),
    inference(superposition,[],[f7,f1]) ).

fof(f19,plain,
    ! [X2,X0,X1] : meet(X1,join(meet(X0,X1),X2)) = join(meet(X2,X1),meet(X0,X1)),
    inference(superposition,[],[f2,f11]) ).

fof(f20,plain,
    ! [X2,X0,X1] : join(meet(X0,X1),meet(X2,X1)) = meet(X1,join(X2,meet(X0,X1))),
    inference(superposition,[],[f2,f11]) ).

fof(f21,plain,
    ! [X2,X0,X1] : meet(X1,join(X2,X0)) = meet(X1,join(X2,meet(X0,X1))),
    inference(forward_demodulation,[],[f20,f2]) ).

fof(f22,plain,
    ! [X2,X0,X1] : meet(X1,join(meet(X0,X1),X2)) = meet(X1,join(X0,X2)),
    inference(forward_demodulation,[],[f19,f2]) ).

fof(f42,plain,
    ! [X2,X0,X1] : meet(X0,meet(X0,join(X1,X2))) = meet(X0,join(X2,meet(X1,X0))),
    inference(superposition,[],[f22,f2]) ).

fof(f54,plain,
    ! [X2,X0,X1] : meet(X0,meet(X0,join(X1,X2))) = meet(X0,join(X2,X1)),
    inference(forward_demodulation,[],[f42,f21]) ).

fof(f56,plain,
    ! [X0,X1] : meet(X0,join(X1,X0)) = meet(X0,X0),
    inference(superposition,[],[f54,f1]) ).

fof(f86,plain,
    ! [X0] : meet(X0,X0) = X0,
    inference(superposition,[],[f56,f1]) ).

fof(f102,plain,
    ! [X0,X1] : meet(X0,join(X0,X1)) = join(meet(X1,X0),X0),
    inference(superposition,[],[f2,f86]) ).

fof(f103,plain,
    ! [X0,X1] : join(X0,meet(X1,X0)) = meet(X0,join(X1,X0)),
    inference(superposition,[],[f2,f86]) ).

fof(f110,plain,
    ! [X0,X1] : join(X0,meet(X1,X0)) = meet(X0,X0),
    inference(forward_demodulation,[],[f103,f56]) ).

fof(f111,plain,
    ! [X0,X1] : join(meet(X1,X0),X0) = X0,
    inference(forward_demodulation,[],[f102,f1]) ).

fof(f113,plain,
    ! [X0,X1] : join(X0,meet(X1,X0)) = X0,
    inference(forward_demodulation,[],[f110,f86]) ).

fof(f121,plain,
    ! [X0] : join(X0,X0) = X0,
    inference(superposition,[],[f111,f86]) ).

fof(f143,plain,
    ! [X0,X1] : meet(X0,X1) = meet(X1,join(X0,X0)),
    inference(superposition,[],[f2,f121]) ).

fof(f146,plain,
    ! [X0,X1] : meet(X1,X0) = meet(X0,X1),
    inference(forward_demodulation,[],[f143,f121]) ).

fof(f345,plain,
    ! [X0,X1] : join(X0,meet(X0,X1)) = X0,
    inference(superposition,[],[f113,f146]) ).

fof(f393,plain,
    a != a,
    inference(superposition,[],[f4,f345]) ).

fof(f409,plain,
    $false,
    inference(trivial_inequality_removal,[],[f393]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LAT008-1 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.38  % Computer : n009.cluster.edu
% 0.12/0.38  % Model    : x86_64 x86_64
% 0.12/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38  % Memory   : 8046.5625MB
% 0.12/0.38  % 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 13:56:15 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
% 2.56/1.33  % (2052955)Detected a unit-equality problem, will run specialized UEQ schedule.
% 2.56/1.33  % (2052966)dis-1010_7_sil=8000:fde=unused:flr=on:random_seed=2897187816:i=1187:sd=4:av=off:ss=axioms:sgt=32_2999 on theBenchmark for (2999ds/1187Mi)
% 2.56/1.33  % (2052966)First to succeed.
% 2.56/1.33  % (2052966)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2052955"
% 2.56/1.33  % (2052964)dis+10_14_to=lpo:sil=8000:tgt=full:drc=off:sp=const_frequency:sos=all:random_seed=3004685584:i=181:gtgl=5:bs=unit_only:fsr=off:gtg=exists_all_2999 on theBenchmark for (2999ds/181Mi)
% 2.56/1.33  % (2052962)lrs+10_1_ncem=casc2026/models/loop5.pt:sil=128000:tgt=ground:npcc=on:spb=goal_then_units:urr=ec_only:random_seed=3309685043:i=130716:gtgl=4:add=on:doe=on:bd=all:gtg=exists_sym_2999 on theBenchmark for (2999ds/130716Mi)
% 2.56/1.33  % (2052961)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=1216318269:i=130792:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/130792Mi)
% 2.56/1.33  % (2052963)ott-1010_1_sfv=off:to=lpo:sil=8000:fdtod=off:sp=reverse_frequency:spb=goal_then_units:fd=preordered:random_seed=1790022413:i=136:bd=preordered:ins=2:av=off_2999 on theBenchmark for (2999ds/136Mi)
% 2.56/1.33  % (2052960)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=943319498:i=138329:kws=inv_arity_squared:fgj=on:bd=preordered_2999 on theBenchmark for (2999ds/138329Mi)
% 2.56/1.33  % (2052965)lrs+10_3_to=lpo:sil=64000:drc=off:fde=unused:sp=reverse_frequency:acc=on:bsr=on:fd=preordered:nwc=1:random_seed=2745510251:avsq=on:i=257:avsqr=16,3:bd=preordered:fsr=off_2999 on theBenchmark for (2999ds/257Mi)
% 2.56/1.33  % (2052965)Also succeeded, but the first one will report.
% 2.56/1.33  % (2052963)Also succeeded, but the first one will report.
% 2.56/1.33  % (2052964)Instruction limit reached! 
% 2.56/1.33  % (2052964)------------------------------
% 2.56/1.33  % (2052964)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.56/1.33  % (2052964)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.56/1.33  % (2052964)CaDiCaL version: 2.1.3
% 2.56/1.33  % (2052964)Termination reason: Instruction limit
% 2.56/1.33  % (2052964)Termination phase: Saturation
% 2.56/1.33  % (2052964)Time elapsed: 0.105 s
% 2.56/1.33  % (2052964)Peak memory usage: 89 MB
% 2.56/1.33  % (2052964)Instructions burned: 182 (million)
% 2.56/1.33  % (2052966)Refutation found. Thanks to Tanya!
% 2.56/1.33  % SZS status Unsatisfiable for theBenchmark
% 2.56/1.33  % SZS output start Proof for theBenchmark
% See solution above
% 2.56/1.33  % (2052966)------------------------------
% 2.56/1.33  % (2052966)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.56/1.33  % (2052966)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.56/1.33  % (2052966)CaDiCaL version: 2.1.3
% 2.56/1.33  % (2052966)Termination reason: Refutation
% 2.56/1.33  % (2052966)Time elapsed: 0.006 s
% 2.56/1.33  % (2052966)Peak memory usage: 88 MB
% 2.56/1.33  % (2052966)Instructions burned: 16 (million)
% 2.56/1.33  % (2052966)------------------------------
% 2.56/1.33  % (2052966)------------------------------
% 2.56/1.33  % (2052955)Success in time 0.274 s
% 2.56/1.33  % Vampire exiting
%------------------------------------------------------------------------------