↑ Up

Vampire---5.0.1.UNS-Ref.s

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

% Computer : n006.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:14:50 AM UTC 2026

% Result   : Unsatisfiable 3.62s 1.43s
% Output   : Refutation 3.62s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   18
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   51 (  51 unt;   8 def)
%            Number of atoms       :   51 (  50 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    :    4 (   1 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   13 (  13 usr;   7 con; 0-3 aty)
%            Number of variables   :   45 (  45   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
    ! [X2,X0,X1] : divide(divide(identity,divide(X0,X1)),divide(divide(X1,X2),X0)) = X2,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).

fof(f2,negated_conjecture,
    ! [X0,X1] : multiply(X0,X1) = divide(X0,divide(identity,X1)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).

fof(f4,negated_conjecture,
    ! [X0] : identity = divide(X0,X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',identity) ).

fof(f5,negated_conjecture,
    multiply(a,b) != multiply(b,a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_4) ).

fof(f6,plain,
    divide(a,divide(identity,b)) != divide(b,divide(identity,a)),
    inference(definition_unfolding,[],[f5,f2,f2]) ).

fof(f7,definition,
    ! [X0,X1] : sF0(X0,X1) = divide(identity,divide(X0,X1)),
    introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).

fof(f8,plain,
    ! [X0,X1] : divide(identity,divide(X0,X1)) = sF0(X0,X1),
    inference(reorient_equations,[],[f7]) ).

fof(f9,definition,
    ! [X2,X0,X1] : sF1(X1,X2,X0) = divide(divide(X1,X2),X0),
    introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).

fof(f10,plain,
    ! [X2,X0,X1] : divide(divide(X1,X2),X0) = sF1(X1,X2,X0),
    inference(reorient_equations,[],[f9]) ).

fof(f11,definition,
    ! [X2,X0,X1] : sF2(X0,X1,X2) = divide(sF0(X0,X1),sF1(X1,X2,X0)),
    introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).

fof(f12,plain,
    ! [X2,X0,X1] : divide(sF0(X0,X1),sF1(X1,X2,X0)) = sF2(X0,X1,X2),
    inference(reorient_equations,[],[f11]) ).

fof(f13,plain,
    ! [X2,X0,X1] : sF2(X0,X1,X2) = X2,
    inference(definition_folding,[],[f1,f12,f10,f8]) ).

fof(f14,definition,
    ! [X0] : sF3(X0) = divide(X0,X0),
    introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).

fof(f15,plain,
    ! [X0] : divide(X0,X0) = sF3(X0),
    inference(reorient_equations,[],[f14]) ).

fof(f16,plain,
    ! [X0] : identity = sF3(X0),
    inference(definition_folding,[],[f4,f15]) ).

fof(f17,definition,
    sF4 = divide(identity,b),
    introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).

fof(f18,plain,
    divide(identity,b) = sF4,
    inference(reorient_equations,[],[f17]) ).

fof(f19,definition,
    sF5 = divide(a,sF4),
    introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).

fof(f20,plain,
    divide(a,sF4) = sF5,
    inference(reorient_equations,[],[f19]) ).

fof(f21,definition,
    sF6 = divide(identity,a),
    introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).

fof(f22,plain,
    divide(identity,a) = sF6,
    inference(reorient_equations,[],[f21]) ).

fof(f23,definition,
    sF7 = divide(b,sF6),
    introduced(definition,[new_symbols(definition,[sF7])],[function_definition]) ).

fof(f24,plain,
    divide(b,sF6) = sF7,
    inference(reorient_equations,[],[f23]) ).

fof(f25,plain,
    sF5 != sF7,
    inference(definition_folding,[],[f6,f24,f22,f20,f18]) ).

fof(f26,plain,
    ! [X0] : identity = divide(X0,X0),
    inference(forward_demodulation,[],[f16,f15]) ).

fof(f27,plain,
    ! [X2,X0,X1] : divide(sF0(X0,X1),sF1(X1,X2,X0)) = X2,
    inference(forward_demodulation,[],[f13,f12]) ).

fof(f28,plain,
    ! [X2,X0,X1] : divide(sF0(X0,X1),divide(divide(X1,X2),X0)) = X2,
    inference(forward_demodulation,[],[f27,f10]) ).

fof(f29,plain,
    ! [X2,X0,X1] : divide(divide(identity,divide(X0,X1)),divide(divide(X1,X2),X0)) = X2,
    inference(forward_demodulation,[],[f28,f8]) ).

fof(f30,plain,
    ! [X0,X1] : divide(divide(identity,identity),divide(divide(X0,X1),X0)) = X1,
    inference(superposition,[],[f29,f26]) ).

fof(f31,plain,
    ! [X0] : divide(divide(identity,sF6),divide(divide(a,X0),identity)) = X0,
    inference(superposition,[],[f29,f22]) ).

fof(f44,plain,
    ! [X0,X1] : divide(identity,divide(divide(X0,X1),X0)) = X1,
    inference(forward_demodulation,[],[f30,f26]) ).

fof(f45,plain,
    ! [X0] : divide(identity,divide(identity,X0)) = X0,
    inference(superposition,[],[f44,f26]) ).

fof(f46,plain,
    a = divide(identity,divide(sF6,identity)),
    inference(superposition,[],[f44,f22]) ).

fof(f47,plain,
    b = divide(identity,divide(sF4,identity)),
    inference(superposition,[],[f44,f18]) ).

fof(f51,plain,
    sF6 = divide(identity,divide(sF7,b)),
    inference(superposition,[],[f44,f24]) ).

fof(f55,plain,
    a = divide(identity,sF6),
    inference(superposition,[],[f45,f22]) ).

fof(f56,plain,
    b = divide(identity,sF4),
    inference(superposition,[],[f45,f18]) ).

fof(f69,plain,
    sF4 = divide(identity,divide(b,identity)),
    inference(superposition,[],[f44,f56]) ).

fof(f87,plain,
    divide(identity,b) = divide(sF4,identity),
    inference(superposition,[],[f45,f47]) ).

fof(f92,plain,
    sF4 = divide(sF4,identity),
    inference(forward_demodulation,[],[f87,f18]) ).

fof(f114,plain,
    divide(identity,divide(sF6,identity)) = divide(sF7,b),
    inference(superposition,[],[f44,f51]) ).

fof(f118,plain,
    a = divide(sF7,b),
    inference(forward_demodulation,[],[f114,f46]) ).

fof(f121,plain,
    b = divide(identity,divide(a,sF7)),
    inference(superposition,[],[f44,f118]) ).

fof(f125,plain,
    ! [X0] : divide(a,divide(divide(a,X0),identity)) = X0,
    inference(forward_demodulation,[],[f31,f55]) ).

fof(f169,plain,
    divide(identity,divide(b,identity)) = divide(a,sF7),
    inference(superposition,[],[f44,f121]) ).

fof(f173,plain,
    sF4 = divide(a,sF7),
    inference(forward_demodulation,[],[f169,f69]) ).

fof(f188,plain,
    sF7 = divide(a,divide(sF4,identity)),
    inference(superposition,[],[f125,f173]) ).

fof(f194,plain,
    divide(a,sF4) = sF7,
    inference(forward_demodulation,[],[f188,f92]) ).

fof(f196,plain,
    sF5 = sF7,
    inference(forward_demodulation,[],[f194,f20]) ).

fof(f201,plain,
    sF5 != sF5,
    inference(superposition,[],[f25,f196]) ).

fof(f202,plain,
    $false,
    inference(trivial_inequality_removal,[],[f201]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : GRP548-1 : TPTP v9.3.1. Bugfixed v2.7.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.36  % Computer : n006.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Sun Sep 27 10:06:40 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.42  Running first-order theorem proving
% 0.13/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
% 3.62/1.43  % (2756237)Detected a unit-equality problem, will run specialized UEQ schedule.
% 3.62/1.43  % (2756247)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=2911039158:i=130792:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/130792Mi)
% 3.62/1.43  % (2756248)lrs+10_1_ncem=casc2026/models/loop5.pt:sil=128000:tgt=ground:npcc=on:spb=goal_then_units:urr=ec_only:random_seed=2067823087:i=130716:gtgl=4:add=on:doe=on:bd=all:gtg=exists_sym_2999 on theBenchmark for (2999ds/130716Mi)
% 3.62/1.43  % (2756251)lrs+10_3_to=lpo:sil=64000:drc=off:fde=unused:sp=reverse_frequency:acc=on:bsr=on:fd=preordered:nwc=1:random_seed=2663713135:avsq=on:i=257:avsqr=16,3:bd=preordered:fsr=off_2999 on theBenchmark for (2999ds/257Mi)
% 3.62/1.43  % (2756250)dis+10_14_to=lpo:sil=8000:tgt=full:drc=off:sp=const_frequency:sos=all:random_seed=1196007195:i=181:gtgl=5:bs=unit_only:fsr=off:gtg=exists_all_2999 on theBenchmark for (2999ds/181Mi)
% 3.62/1.43  % (2756249)ott-1010_1_sfv=off:to=lpo:sil=8000:fdtod=off:sp=reverse_frequency:spb=goal_then_units:fd=preordered:random_seed=2121498248:i=136:bd=preordered:ins=2:av=off_2999 on theBenchmark for (2999ds/136Mi)
% 3.62/1.43  % (2756252)dis-1010_7_sil=8000:fde=unused:flr=on:random_seed=2687291874:i=1187:sd=4:av=off:ss=axioms:sgt=32_2999 on theBenchmark for (2999ds/1187Mi)
% 3.62/1.43  % (2756246)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=1553354021:i=138329:kws=inv_arity_squared:fgj=on:bd=preordered_2999 on theBenchmark for (2999ds/138329Mi)
% 3.62/1.43  % (2756250)First to succeed.
% 3.62/1.43  % (2756252)Also succeeded, but the first one will report.
% 3.62/1.43  % (2756250)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2756237"
% 3.62/1.43  % (2756251)Also succeeded, but the first one will report.
% 3.62/1.43  % (2756249)Also succeeded, but the first one will report.
% 3.62/1.43  % (2756250)Refutation found. Thanks to Tanya!
% 3.62/1.43  % SZS status Unsatisfiable for theBenchmark
% 3.62/1.43  % SZS output start Proof for theBenchmark
% See solution above
% 3.62/1.43  % (2756250)------------------------------
% 3.62/1.43  % (2756250)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.62/1.43  % (2756250)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.62/1.43  % (2756250)CaDiCaL version: 2.1.3
% 3.62/1.43  % (2756250)Termination reason: Refutation
% 3.62/1.43  % (2756250)Time elapsed: 0.007 s
% 3.62/1.43  % (2756250)Peak memory usage: 88 MB
% 3.62/1.43  % (2756250)Instructions burned: 9 (million)
% 3.62/1.43  % (2756250)------------------------------
% 3.62/1.43  % (2756250)------------------------------
% 3.62/1.43  % (2756237)Success in time 0.428 s
% 3.62/1.43  % Vampire exiting
%------------------------------------------------------------------------------