↑ Up

Vampire---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : GRP466-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 : n004.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:04 AM UTC 2026

% Result   : Unsatisfiable 2.68s 6.68s
% Output   : Refutation 2.68s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   17 (  14 unt;   1 def)
%            Number of atoms       :   20 (  10 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :    7 (   4   ~;   2   |;   0   &)
%                                         (   1 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   2 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   21 (   0 sgn  21   !;   0   ?)

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

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

fof(f3,negated_conjecture,
    multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_1) ).

fof(f5,definition,
    ( spl0_1
  <=> multiply(inverse(a1),a1) = multiply(inverse(b1),b1) ),
    introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).

fof(f7,plain,
    ( multiply(inverse(a1),a1) != multiply(inverse(b1),b1)
    | spl0_1 ),
    inference(avatar_component_clause,[],[f5]) ).

fof(f8,plain,
    ~ spl0_1,
    inference(avatar_split_clause,[],[f3,f5]) ).

fof(f9,plain,
    ! [X2,X3,X0,X1] : divide(divide(X0,X0),divide(X1,multiply(divide(X2,divide(X3,X1)),X3))) = X2,
    inference(backward_demodulation,[],[f1,f2]) ).

fof(f13,plain,
    ! [X2,X3,X0,X1,X4] : divide(X4,X4) = divide(divide(X1,X1),divide(multiply(divide(X0,divide(X2,X3)),X2),multiply(X0,X3))),
    inference(superposition,[],[f9,f9]) ).

fof(f47,plain,
    ! [X0,X1] : divide(X0,X0) = divide(X1,X1),
    inference(superposition,[],[f13,f13]) ).

fof(f92,plain,
    ! [X0,X1] : divide(X0,X0) = multiply(inverse(X1),X1),
    inference(superposition,[],[f2,f47]) ).

fof(f113,plain,
    ! [X0,X1] : multiply(inverse(X0),X0) = multiply(inverse(X1),X1),
    inference(superposition,[],[f2,f92]) ).

fof(f121,plain,
    ( $false
    | spl0_1 ),
    inference(backward_subsumption_resolution,[],[f7,f113]) ).

fof(f122,plain,
    spl0_1,
    inference(avatar_contradiction_clause,[],[f121]) ).

cnf(s1,plain,
    ~ spl0_1,
    inference(sat_conversion,[],[f8]) ).

cnf(s2,plain,
    spl0_1,
    inference(sat_conversion,[],[f122]) ).

cnf(s3,plain,
    $false,
    inference(rat,[],[s1,s2]) ).

fof(f123,plain,
    $false,
    inference(avatar_sat_refutation,[],[s3]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : GRP466-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/5.78  % Computer : n004.cluster.edu
% 0.10/5.78  % Model    : x86_64 x86_64
% 0.10/5.78  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.78  % Memory   : 8046.5625MB
% 0.10/5.78  % OS       : Linux 6.8.0-71-generic
% 0.10/5.78  % CPULimit : 300
% 0.10/5.78  % WCLimit  : 300
% 0.10/5.78  % DateTime : Sun Sep 27 10:05:28 UTC 2026
% 0.10/5.78  % CPUTime  : 
% 0.10/5.78  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/5.81  Running first-order theorem proving
% 0.14/5.81  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.68/6.68  % (3273539)Detected a unit-equality problem, will run specialized UEQ schedule.
% 2.68/6.68  % (3273549)lrs+10_3_to=lpo:sil=64000:drc=off:fde=unused:sp=reverse_frequency:acc=on:bsr=on:fd=preordered:nwc=1:random_seed=1027361333:avsq=on:i=257:avsqr=16,3:bd=preordered:fsr=off_2999 on theBenchmark for (2999ds/257Mi)
% 2.68/6.68  % (3273549)First to succeed.
% 2.68/6.68  % (3273549)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3273539"
% 2.68/6.68  % (3273547)ott-1010_1_sfv=off:to=lpo:sil=8000:fdtod=off:sp=reverse_frequency:spb=goal_then_units:fd=preordered:random_seed=1886920627:i=136:bd=preordered:ins=2:av=off_2999 on theBenchmark for (2999ds/136Mi)
% 2.68/6.68  % (3273544)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=2433917967:i=138329:kws=inv_arity_squared:fgj=on:bd=preordered_2999 on theBenchmark for (2999ds/138329Mi)
% 2.68/6.68  % (3273546)lrs+10_1_ncem=casc2026/models/loop5.pt:sil=128000:tgt=ground:npcc=on:spb=goal_then_units:urr=ec_only:random_seed=2165370831:i=130716:gtgl=4:add=on:doe=on:bd=all:gtg=exists_sym_2999 on theBenchmark for (2999ds/130716Mi)
% 2.68/6.68  % (3273545)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=543556704:i=130792:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/130792Mi)
% 2.68/6.68  % (3273547)Also succeeded, but the first one will report.
% 2.68/6.68  % (3273550)dis-1010_7_sil=8000:fde=unused:flr=on:random_seed=659637442:i=1187:sd=4:av=off:ss=axioms:sgt=32_2999 on theBenchmark for (2999ds/1187Mi)
% 2.68/6.68  % (3273550)Also succeeded, but the first one will report.
% 2.68/6.68  % (3273548)dis+10_14_to=lpo:sil=8000:tgt=full:drc=off:sp=const_frequency:sos=all:random_seed=2567554598:i=181:gtgl=5:bs=unit_only:fsr=off:gtg=exists_all_2999 on theBenchmark for (2999ds/181Mi)
% 2.68/6.68  % (3273548)Also succeeded, but the first one will report.
% 2.68/6.68  % (3273549)Refutation found. Thanks to Tanya!
% 2.68/6.68  % SZS status Unsatisfiable for theBenchmark
% 2.68/6.68  % SZS output start Proof for theBenchmark
% See solution above
% 2.68/6.68  % (3273549)------------------------------
% 2.68/6.68  % (3273549)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.68/6.68  % (3273549)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.68/6.68  % (3273549)CaDiCaL version: 2.1.3
% 2.68/6.68  % (3273549)Termination reason: Refutation
% 2.68/6.68  % (3273549)Time elapsed: 0.006 s
% 2.68/6.68  % (3273549)Peak memory usage: 89 MB
% 2.68/6.68  % (3273549)Instructions burned: 13 (million)
% 2.68/6.68  % (3273549)------------------------------
% 2.68/6.68  % (3273549)------------------------------
% 2.68/6.68  % (3273539)Success in time 0.318 s
% 2.68/6.68  % Vampire exiting
%------------------------------------------------------------------------------