↑ Up

Vampire---5.0.1.UNS-Ref.s

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

% Computer : n015.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:51 AM UTC 2026

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

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

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

fof(f3,negated_conjecture,
    multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_3) ).

fof(f4,plain,
    divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3)))),
    inference(definition_unfolding,[],[f3,f2,f2,f2,f2]) ).

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

fof(f6,plain,
    ! [X2,X0,X1] : divide(divide(X1,X2),divide(X0,X2)) = sF0(X1,X2,X0),
    inference(reorient_equations,[],[f5]) ).

fof(f7,definition,
    ! [X2,X0,X1] : sF1(X1,X2,X0) = inverse(sF0(X1,X2,X0)),
    introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).

fof(f8,plain,
    ! [X2,X0,X1] : inverse(sF0(X1,X2,X0)) = sF1(X1,X2,X0),
    inference(reorient_equations,[],[f7]) ).

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

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

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

fof(f12,definition,
    sF3 = inverse(b3),
    introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).

fof(f13,plain,
    inverse(b3) = sF3,
    inference(reorient_equations,[],[f12]) ).

fof(f14,definition,
    sF4 = divide(a3,sF3),
    introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).

fof(f15,plain,
    divide(a3,sF3) = sF4,
    inference(reorient_equations,[],[f14]) ).

fof(f16,definition,
    sF5 = inverse(c3),
    introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).

fof(f17,plain,
    inverse(c3) = sF5,
    inference(reorient_equations,[],[f16]) ).

fof(f18,definition,
    sF6 = divide(sF4,sF5),
    introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).

fof(f19,plain,
    divide(sF4,sF5) = sF6,
    inference(reorient_equations,[],[f18]) ).

fof(f20,definition,
    sF7 = divide(b3,sF5),
    introduced(definition,[new_symbols(definition,[sF7])],[function_definition]) ).

fof(f21,plain,
    divide(b3,sF5) = sF7,
    inference(reorient_equations,[],[f20]) ).

fof(f22,definition,
    sF8 = inverse(sF7),
    introduced(definition,[new_symbols(definition,[sF8])],[function_definition]) ).

fof(f23,plain,
    inverse(sF7) = sF8,
    inference(reorient_equations,[],[f22]) ).

fof(f24,definition,
    sF9 = divide(a3,sF8),
    introduced(definition,[new_symbols(definition,[sF9])],[function_definition]) ).

fof(f25,plain,
    divide(a3,sF8) = sF9,
    inference(reorient_equations,[],[f24]) ).

fof(f26,plain,
    sF6 != sF9,
    inference(definition_folding,[],[f4,f25,f23,f21,f17,f19,f17,f15,f13]) ).

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

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

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

fof(f30,plain,
    ! [X2,X3,X0,X1] : divide(X1,inverse(divide(X0,divide(X1,inverse(divide(divide(X0,X3),divide(X2,X3))))))) = X2,
    inference(superposition,[],[f29,f29]) ).

fof(f33,plain,
    ! [X0] : b3 = divide(X0,inverse(divide(sF7,divide(X0,sF5)))),
    inference(superposition,[],[f29,f21]) ).

fof(f51,plain,
    b3 = divide(sF4,inverse(divide(sF7,sF6))),
    inference(superposition,[],[f33,f19]) ).

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

fof(f124,plain,
    ! [X0,X1] : divide(X0,inverse(divide(X1,X0))) = X1,
    inference(superposition,[],[f30,f120]) ).

fof(f142,plain,
    a3 = divide(sF3,inverse(sF4)),
    inference(superposition,[],[f124,f15]) ).

fof(f149,plain,
    sF4 = divide(inverse(divide(sF7,sF6)),inverse(b3)),
    inference(superposition,[],[f124,f51]) ).

fof(f156,plain,
    sF4 = divide(inverse(divide(sF7,sF6)),sF3),
    inference(forward_demodulation,[],[f149,f13]) ).

fof(f308,plain,
    inverse(divide(sF7,sF6)) = divide(sF3,inverse(sF4)),
    inference(superposition,[],[f124,f156]) ).

fof(f309,plain,
    a3 = inverse(divide(sF7,sF6)),
    inference(forward_demodulation,[],[f308,f142]) ).

fof(f315,plain,
    sF7 = divide(sF6,a3),
    inference(superposition,[],[f124,f309]) ).

fof(f330,plain,
    sF6 = divide(a3,inverse(sF7)),
    inference(superposition,[],[f124,f315]) ).

fof(f331,plain,
    sF6 = divide(a3,sF8),
    inference(forward_demodulation,[],[f330,f23]) ).

fof(f332,plain,
    sF6 = sF9,
    inference(forward_demodulation,[],[f331,f25]) ).

fof(f337,plain,
    sF6 != sF6,
    inference(superposition,[],[f26,f332]) ).

fof(f338,plain,
    $false,
    inference(trivial_inequality_removal,[],[f337]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP559-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37  % Computer : n015.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 10:11:00 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.41  Running first-order theorem proving
% 0.14/0.41  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
% 5.24/1.72  % (1432559)Detected a unit-equality problem, will run specialized UEQ schedule.
% 5.24/1.72  % (1432580)ott-1010_1_sfv=off:to=lpo:sil=8000:fdtod=off:sp=reverse_frequency:spb=goal_then_units:fd=preordered:random_seed=4151905542:i=136:bd=preordered:ins=2:av=off_2999 on theBenchmark for (2999ds/136Mi)
% 5.24/1.72  % (1432577)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=521907847:i=138329:kws=inv_arity_squared:fgj=on:bd=preordered_2999 on theBenchmark for (2999ds/138329Mi)
% 5.24/1.72  % (1432578)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=579930464:i=130792:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/130792Mi)
% 5.24/1.72  % (1432579)lrs+10_1_ncem=casc2026/models/loop5.pt:sil=128000:tgt=ground:npcc=on:spb=goal_then_units:urr=ec_only:random_seed=4160189839:i=130716:gtgl=4:add=on:doe=on:bd=all:gtg=exists_sym_2999 on theBenchmark for (2999ds/130716Mi)
% 5.24/1.72  % (1432582)lrs+10_3_to=lpo:sil=64000:drc=off:fde=unused:sp=reverse_frequency:acc=on:bsr=on:fd=preordered:nwc=1:random_seed=4284170181:avsq=on:i=257:avsqr=16,3:bd=preordered:fsr=off_2999 on theBenchmark for (2999ds/257Mi)
% 5.24/1.72  % (1432583)dis-1010_7_sil=8000:fde=unused:flr=on:random_seed=1671433487:i=1187:sd=4:av=off:ss=axioms:sgt=32_2999 on theBenchmark for (2999ds/1187Mi)
% 5.24/1.72  % (1432580)Instruction limit reached! 
% 5.24/1.72  % (1432580)------------------------------
% 5.24/1.72  % (1432580)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.24/1.72  % (1432580)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.24/1.72  % (1432580)CaDiCaL version: 2.1.3
% 5.24/1.72  % (1432580)Termination reason: Instruction limit
% 5.24/1.72  % (1432580)Termination phase: Saturation
% 5.24/1.72  % (1432580)Time elapsed: 0.068 s
% 5.24/1.72  % (1432580)Peak memory usage: 89 MB
% 5.24/1.72  % (1432580)Instructions burned: 136 (million)
% 5.24/1.72  % (1432581)dis+10_14_to=lpo:sil=8000:tgt=full:drc=off:sp=const_frequency:sos=all:random_seed=2001188982:i=181:gtgl=5:bs=unit_only:fsr=off:gtg=exists_all_2999 on theBenchmark for (2999ds/181Mi)
% 5.24/1.72  % (1432581)First to succeed.
% 5.24/1.72  % (1432581)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1432559"
% 5.24/1.72  % (1432582)Also succeeded, but the first one will report.
% 5.24/1.72  % (1432598)lrs-1011_1_ncem=casc2026/models/loop8.pt:sil=32000:npcc=on:prc=on:fde=unused:lcm=predicate:bsr=on:flr=on:random_seed=3701380805:i=2051:gtgl=2:fgj=on:bd=all:gtg=exists_top_2997 on theBenchmark for (2997ds/2051Mi)
% 5.24/1.72  % (1432581)Refutation found. Thanks to Tanya!
% 5.24/1.72  % SZS status Unsatisfiable for theBenchmark
% 5.24/1.72  % SZS output start Proof for theBenchmark
% See solution above
% 5.24/1.72  % (1432581)------------------------------
% 5.24/1.72  % (1432581)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.24/1.72  % (1432581)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.24/1.72  % (1432581)CaDiCaL version: 2.1.3
% 5.24/1.72  % (1432581)Termination reason: Refutation
% 5.24/1.72  % (1432581)Time elapsed: 0.024 s
% 5.24/1.72  % (1432581)Peak memory usage: 88 MB
% 5.24/1.72  % (1432581)Instructions burned: 21 (million)
% 5.24/1.72  % (1432581)------------------------------
% 5.24/1.72  % (1432581)------------------------------
% 5.24/1.72  % (1432559)Success in time 0.656 s
% 5.24/1.72  % Vampire exiting
%------------------------------------------------------------------------------