↑ Up

Vampire---5.0.1.UNS-Ref.s

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

% Computer : n018.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:15:59 AM UTC 2026

% Result   : Unsatisfiable 4.49s 1.82s
% Output   : Refutation 4.49s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   15
% Syntax   : Number of formulae    :   45 (  45 unt;   9 def)
%            Number of atoms       :   45 (  44 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    3 (   3   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   16 (  16 usr;   8 con; 0-2 aty)
%            Number of variables   :   42 (  42   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f2,negated_conjecture,
    ! [X0,X1] : ld(X0,mult(X0,X1)) = X1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f02) ).

fof(f3,negated_conjecture,
    ! [X0,X1] : mult(rd(X0,X1),X1) = X0,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f03) ).

fof(f4,negated_conjecture,
    ! [X0,X1] : rd(mult(X0,X1),X1) = X0,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f04) ).

fof(f9,axiom,
    ! [X0,X1] : mult(X0,mult(X1,op_c)) = mult(mult(X0,X1),op_c),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f09) ).

fof(f11,negated_conjecture,
    ! [X0] : op_d = ld(X0,mult(op_c,X0)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f11) ).

fof(f14,negated_conjecture,
    mult(x0,mult(x1,op_d)) != mult(mult(x0,x1),op_d),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal) ).

fof(f18,definition,
    ! [X0,X1] : sF1(X0,X1) = ld(X0,mult(X0,X1)),
    introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).

fof(f19,plain,
    ! [X0,X1] : ld(X0,mult(X0,X1)) = sF1(X0,X1),
    inference(reorient_equations,[],[f18]) ).

fof(f20,plain,
    ! [X0,X1] : sF1(X0,X1) = X1,
    inference(definition_folding,[],[f2,f19]) ).

fof(f21,definition,
    ! [X0,X1] : sF2(X0,X1) = mult(rd(X0,X1),X1),
    introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).

fof(f22,plain,
    ! [X0,X1] : mult(rd(X0,X1),X1) = sF2(X0,X1),
    inference(reorient_equations,[],[f21]) ).

fof(f23,plain,
    ! [X0,X1] : sF2(X0,X1) = X0,
    inference(definition_folding,[],[f3,f22]) ).

fof(f24,definition,
    ! [X0,X1] : sF3(X0,X1) = rd(mult(X0,X1),X1),
    introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).

fof(f25,plain,
    ! [X0,X1] : rd(mult(X0,X1),X1) = sF3(X0,X1),
    inference(reorient_equations,[],[f24]) ).

fof(f26,plain,
    ! [X0,X1] : sF3(X0,X1) = X0,
    inference(definition_folding,[],[f4,f25]) ).

fof(f33,definition,
    ! [X0] : sF6(X0) = mult(op_c,X0),
    introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).

fof(f34,plain,
    ! [X0] : mult(op_c,X0) = sF6(X0),
    inference(reorient_equations,[],[f33]) ).

fof(f35,definition,
    ! [X0] : sF7(X0) = ld(X0,sF6(X0)),
    introduced(definition,[new_symbols(definition,[sF7])],[function_definition]) ).

fof(f36,plain,
    ! [X0] : ld(X0,sF6(X0)) = sF7(X0),
    inference(reorient_equations,[],[f35]) ).

fof(f37,plain,
    ! [X0] : op_d = sF7(X0),
    inference(definition_folding,[],[f11,f36,f34]) ).

fof(f52,definition,
    sF14 = mult(x1,op_d),
    introduced(definition,[new_symbols(definition,[sF14])],[function_definition]) ).

fof(f53,plain,
    mult(x1,op_d) = sF14,
    inference(reorient_equations,[],[f52]) ).

fof(f54,definition,
    sF15 = mult(x0,sF14),
    introduced(definition,[new_symbols(definition,[sF15])],[function_definition]) ).

fof(f55,plain,
    mult(x0,sF14) = sF15,
    inference(reorient_equations,[],[f54]) ).

fof(f56,definition,
    sF16 = mult(x0,x1),
    introduced(definition,[new_symbols(definition,[sF16])],[function_definition]) ).

fof(f57,plain,
    mult(x0,x1) = sF16,
    inference(reorient_equations,[],[f56]) ).

fof(f58,definition,
    sF17 = mult(sF16,op_d),
    introduced(definition,[new_symbols(definition,[sF17])],[function_definition]) ).

fof(f59,plain,
    mult(sF16,op_d) = sF17,
    inference(reorient_equations,[],[f58]) ).

fof(f60,plain,
    sF15 != sF17,
    inference(definition_folding,[],[f14,f59,f57,f55,f53]) ).

fof(f63,plain,
    ! [X0] : op_d = ld(X0,sF6(X0)),
    inference(forward_demodulation,[],[f37,f36]) ).

fof(f66,plain,
    ! [X0,X1] : rd(mult(X0,X1),X1) = X0,
    inference(forward_demodulation,[],[f26,f25]) ).

fof(f67,plain,
    ! [X0,X1] : mult(rd(X0,X1),X1) = X0,
    inference(forward_demodulation,[],[f23,f22]) ).

fof(f68,plain,
    ! [X0,X1] : ld(X0,mult(X0,X1)) = X1,
    inference(forward_demodulation,[],[f20,f19]) ).

fof(f72,plain,
    ! [X0] : op_d = ld(X0,mult(op_c,X0)),
    inference(forward_demodulation,[],[f63,f34]) ).

fof(f101,plain,
    x0 = rd(sF16,x1),
    inference(superposition,[],[f66,f57]) ).

fof(f114,plain,
    ! [X0,X1] : mult(X0,op_c) = mult(rd(X0,X1),mult(X1,op_c)),
    inference(superposition,[],[f9,f67]) ).

fof(f151,plain,
    op_c = op_d,
    inference(superposition,[],[f72,f68]) ).

fof(f161,plain,
    sF14 = mult(x1,op_c),
    inference(superposition,[],[f53,f151]) ).

fof(f162,plain,
    sF17 = mult(sF16,op_c),
    inference(superposition,[],[f59,f151]) ).

fof(f1562,plain,
    mult(sF16,op_c) = mult(x0,mult(x1,op_c)),
    inference(superposition,[],[f114,f101]) ).

fof(f1605,plain,
    mult(x0,sF14) = mult(sF16,op_c),
    inference(forward_demodulation,[],[f1562,f161]) ).

fof(f1634,plain,
    mult(x0,sF14) = sF17,
    inference(forward_demodulation,[],[f1605,f162]) ).

fof(f1650,plain,
    sF15 = sF17,
    inference(forward_demodulation,[],[f1634,f55]) ).

fof(f1660,plain,
    sF15 != sF15,
    inference(superposition,[],[f60,f1650]) ).

fof(f1678,plain,
    $false,
    inference(trivial_inequality_removal,[],[f1660]) ).

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