↑ Up

Vampire---5.0.1.UNS-Ref.s

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

% Result   : Unsatisfiable 2.68s 1.34s
% Output   : Refutation 2.68s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   32 (  32 unt;   5 def)
%            Number of atoms       :   32 (  31 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    4 (   4   ~;   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    :   11 (  11 usr;   5 con; 0-2 aty)
%            Number of variables   :   28 (  28   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
    ! [X0] : multiply(identity,X0) = X0,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_identity) ).

fof(f2,axiom,
    ! [X0] : multiply(inverse(X0),X0) = identity,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_inverse) ).

fof(f3,plain,
    ! [X0] : identity = multiply(inverse(X0),X0),
    inference(reorient_equations,[],[f2]) ).

fof(f6,axiom,
    ! [X0,X1] : least_upper_bound(X0,X1) = least_upper_bound(X1,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetry_of_lub) ).

fof(f15,axiom,
    ! [X2,X0,X1] : multiply(least_upper_bound(X0,X1),X2) = least_upper_bound(multiply(X0,X2),multiply(X1,X2)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',monotony_lub2) ).

fof(f17,negated_conjecture,
    ! [X0] : least_upper_bound(identity,X0) = X0,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p40a_1) ).

fof(f18,negated_conjecture,
    multiply(a,b) != multiply(b,a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_p40a) ).

fof(f19,definition,
    ! [X0] : sF0(X0) = multiply(identity,X0),
    introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).

fof(f20,plain,
    ! [X0] : multiply(identity,X0) = sF0(X0),
    inference(reorient_equations,[],[f19]) ).

fof(f21,plain,
    ! [X0] : sF0(X0) = X0,
    inference(definition_folding,[],[f1,f20]) ).

fof(f22,definition,
    ! [X0] : sF1(X0) = multiply(inverse(X0),X0),
    introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).

fof(f23,plain,
    ! [X0] : multiply(inverse(X0),X0) = sF1(X0),
    inference(reorient_equations,[],[f22]) ).

fof(f24,plain,
    ! [X0] : identity = sF1(X0),
    inference(definition_folding,[],[f3,f23]) ).

fof(f25,definition,
    ! [X0] : sF2(X0) = least_upper_bound(identity,X0),
    introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).

fof(f26,plain,
    ! [X0] : least_upper_bound(identity,X0) = sF2(X0),
    inference(reorient_equations,[],[f25]) ).

fof(f27,plain,
    ! [X0] : sF2(X0) = X0,
    inference(definition_folding,[],[f17,f26]) ).

fof(f28,definition,
    sF3 = multiply(a,b),
    introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).

fof(f29,plain,
    multiply(a,b) = sF3,
    inference(reorient_equations,[],[f28]) ).

fof(f30,definition,
    sF4 = multiply(b,a),
    introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).

fof(f31,plain,
    multiply(b,a) = sF4,
    inference(reorient_equations,[],[f30]) ).

fof(f32,plain,
    sF3 != sF4,
    inference(definition_folding,[],[f18,f31,f29]) ).

fof(f33,plain,
    ! [X0] : least_upper_bound(identity,X0) = X0,
    inference(forward_demodulation,[],[f27,f26]) ).

fof(f34,plain,
    ! [X0] : multiply(identity,X0) = X0,
    inference(forward_demodulation,[],[f21,f20]) ).

fof(f35,plain,
    ! [X0] : least_upper_bound(X0,identity) = X0,
    inference(superposition,[],[f33,f6]) ).

fof(f49,plain,
    ! [X0,X1] : multiply(least_upper_bound(identity,X1),X0) = least_upper_bound(X0,multiply(X1,X0)),
    inference(superposition,[],[f15,f34]) ).

fof(f53,plain,
    ! [X0,X1] : multiply(X1,X0) = least_upper_bound(X0,multiply(X1,X0)),
    inference(forward_demodulation,[],[f49,f33]) ).

fof(f87,plain,
    ! [X0] : sF1(X0) = least_upper_bound(X0,sF1(X0)),
    inference(superposition,[],[f53,f23]) ).

fof(f96,plain,
    ! [X0] : identity = least_upper_bound(X0,identity),
    inference(forward_demodulation,[],[f87,f24]) ).

fof(f97,plain,
    ! [X0] : identity = X0,
    inference(forward_demodulation,[],[f96,f35]) ).

fof(f147,plain,
    identity != sF3,
    inference(superposition,[],[f32,f97]) ).

fof(f148,plain,
    identity != identity,
    inference(forward_demodulation,[],[f147,f97]) ).

fof(f149,plain,
    $false,
    inference(trivial_inequality_removal,[],[f148]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP192-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.10/0.37  % Computer : n009.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Sun Sep 27 09:37:00 UTC 2026
% 0.10/0.38  % CPUTime  : 
% 0.10/0.38  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.41  Running first-order theorem proving
% 0.10/0.41  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
% 2.68/1.34  % (1778351)Detected a unit-equality problem, will run specialized UEQ schedule.
% 2.68/1.34  % (1778360)dis+10_14_to=lpo:sil=8000:tgt=full:drc=off:sp=const_frequency:sos=all:random_seed=4002918940:i=181:gtgl=5:bs=unit_only:fsr=off:gtg=exists_all_2999 on theBenchmark for (2999ds/181Mi)
% 2.68/1.34  % (1778360)First to succeed.
% 2.68/1.34  % (1778360)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1778351"
% 2.68/1.34  % (1778359)ott-1010_1_sfv=off:to=lpo:sil=8000:fdtod=off:sp=reverse_frequency:spb=goal_then_units:fd=preordered:random_seed=2851526863:i=136:bd=preordered:ins=2:av=off_2999 on theBenchmark for (2999ds/136Mi)
% 2.68/1.34  % (1778358)lrs+10_1_ncem=casc2026/models/loop5.pt:sil=128000:tgt=ground:npcc=on:spb=goal_then_units:urr=ec_only:random_seed=4167946480:i=130716:gtgl=4:add=on:doe=on:bd=all:gtg=exists_sym_2999 on theBenchmark for (2999ds/130716Mi)
% 2.68/1.34  % (1778357)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=1277434139:i=130792:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/130792Mi)
% 2.68/1.34  % (1778356)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=12990775:i=138329:kws=inv_arity_squared:fgj=on:bd=preordered_2999 on theBenchmark for (2999ds/138329Mi)
% 2.68/1.34  % (1778359)Refutation not found, incomplete strategy
% 2.68/1.34  % (1778359)------------------------------
% 2.68/1.34  % (1778359)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.68/1.34  % (1778359)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.68/1.34  % (1778359)CaDiCaL version: 2.1.3
% 2.68/1.34  % (1778359)Termination reason: Refutation not found, incomplete strategy
% 2.68/1.34  % (1778359)Time elapsed: 0.016 s
% 2.68/1.34  % (1778359)Peak memory usage: 87 MB
% 2.68/1.34  % (1778359)Instructions burned: 22 (million)
% 2.68/1.34  % (1778362)dis-1010_7_sil=8000:fde=unused:flr=on:random_seed=3274686453:i=1187:sd=4:av=off:ss=axioms:sgt=32_2999 on theBenchmark for (2999ds/1187Mi)
% 2.68/1.34  % (1778361)lrs+10_3_to=lpo:sil=64000:drc=off:fde=unused:sp=reverse_frequency:acc=on:bsr=on:fd=preordered:nwc=1:random_seed=1603141498:avsq=on:i=257:avsqr=16,3:bd=preordered:fsr=off_2999 on theBenchmark for (2999ds/257Mi)
% 2.68/1.34  % (1778362)Also succeeded, but the first one will report.
% 2.68/1.34  % (1778361)Also succeeded, but the first one will report.
% 2.68/1.34  % (1778360)Refutation found. Thanks to Tanya!
% 2.68/1.34  % SZS status Unsatisfiable for theBenchmark
% 2.68/1.34  % SZS output start Proof for theBenchmark
% See solution above
% 2.68/1.34  % (1778360)------------------------------
% 2.68/1.34  % (1778360)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.68/1.34  % (1778360)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.68/1.34  % (1778360)CaDiCaL version: 2.1.3
% 2.68/1.34  % (1778360)Termination reason: Refutation
% 2.68/1.34  % (1778360)Time elapsed: 0.003 s
% 2.68/1.34  % (1778360)Peak memory usage: 88 MB
% 2.68/1.34  % (1778360)Instructions burned: 4 (million)
% 2.68/1.34  % (1778360)------------------------------
% 2.68/1.34  % (1778360)------------------------------
% 2.68/1.34  % (1778351)Success in time 0.293 s
% 2.68/1.34  % Vampire exiting
%------------------------------------------------------------------------------