↑ Up

Vampire---5.0.1.UNS-Ref.s

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

% Computer : n003.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 2.64s 1.36s
% Output   : Refutation 2.64s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   38 (  24 unt;   3 def)
%            Number of atoms       :   53 (  25 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   30 (  15   ~;  12   |;   0   &)
%                                         (   3 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    5 (   3 usr;   4 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   25 (   0 sgn  25   !;   0   ?)

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

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

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

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

fof(f5,negated_conjecture,
    multiply(multiply(inverse(b2),b2),a2) != a2,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_2) ).

fof(f6,plain,
    a2 != multiply(multiply(inverse(b2),b2),a2),
    inference(reorient_equations,[],[f5]) ).

fof(f8,definition,
    ( spl0_1
  <=> a2 = multiply(multiply(inverse(b2),b2),a2) ),
    introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).

fof(f10,plain,
    ( a2 != multiply(multiply(inverse(b2),b2),a2)
    | spl0_1 ),
    inference(avatar_component_clause,[],[f8]) ).

fof(f11,plain,
    ~ spl0_1,
    inference(avatar_split_clause,[],[f6,f8]) ).

fof(f12,plain,
    ! [X2,X0,X1] : divide(inverse(divide(X0,X1)),divide(divide(X1,X2),X0)) = X2,
    inference(backward_demodulation,[],[f1,f3]) ).

fof(f13,plain,
    ! [X0,X1] : multiply(X0,X1) = divide(X0,inverse(X1)),
    inference(forward_demodulation,[],[f2,f3]) ).

fof(f15,plain,
    identity = inverse(identity),
    inference(superposition,[],[f4,f3]) ).

fof(f17,definition,
    ( spl0_2
  <=> identity = inverse(identity) ),
    introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).

fof(f19,plain,
    ( identity = inverse(identity)
    | ~ spl0_2 ),
    inference(avatar_component_clause,[],[f17]) ).

fof(f20,plain,
    spl0_2,
    inference(avatar_split_clause,[],[f15,f17]) ).

fof(f23,plain,
    ! [X0] : identity = multiply(inverse(X0),X0),
    inference(superposition,[],[f4,f13]) ).

fof(f24,plain,
    ! [X0] : inverse(inverse(X0)) = multiply(identity,X0),
    inference(superposition,[],[f3,f13]) ).

fof(f27,plain,
    ! [X0,X1] : inverse(inverse(X1)) = multiply(multiply(inverse(X0),X0),X1),
    inference(superposition,[],[f24,f23]) ).

fof(f28,plain,
    ( a2 != inverse(inverse(a2))
    | spl0_1 ),
    inference(backward_demodulation,[],[f10,f27]) ).

fof(f30,definition,
    ( spl0_3
  <=> a2 = inverse(inverse(a2)) ),
    introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).

fof(f32,plain,
    ( a2 != inverse(inverse(a2))
    | spl0_3 ),
    inference(avatar_component_clause,[],[f30]) ).

fof(f33,plain,
    ( ~ spl0_3
    | spl0_1 ),
    inference(avatar_split_clause,[],[f28,f8,f30]) ).

fof(f38,plain,
    ! [X0,X1] : divide(inverse(divide(X0,X1)),divide(identity,X0)) = X1,
    inference(superposition,[],[f12,f4]) ).

fof(f45,plain,
    ! [X0,X1] : divide(inverse(divide(X0,X1)),inverse(X0)) = X1,
    inference(forward_demodulation,[],[f38,f3]) ).

fof(f48,plain,
    ! [X0,X1] : multiply(inverse(divide(X0,X1)),X0) = X1,
    inference(forward_demodulation,[],[f45,f13]) ).

fof(f53,plain,
    ! [X0] : multiply(inverse(identity),X0) = X0,
    inference(superposition,[],[f48,f4]) ).

fof(f57,plain,
    ( ! [X0] : multiply(identity,X0) = X0
    | ~ spl0_2 ),
    inference(forward_demodulation,[],[f53,f19]) ).

fof(f58,plain,
    ( ! [X0] : inverse(inverse(X0)) = X0
    | ~ spl0_2 ),
    inference(forward_demodulation,[],[f57,f24]) ).

fof(f59,plain,
    ( $false
    | ~ spl0_2
    | spl0_3 ),
    inference(backward_subsumption_resolution,[],[f32,f58]) ).

fof(f64,plain,
    ( ~ spl0_2
    | spl0_3 ),
    inference(avatar_contradiction_clause,[],[f59]) ).

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

cnf(s2,plain,
    spl0_2,
    inference(sat_conversion,[],[f20]) ).

cnf(s4,plain,
    ( spl0_1
    | ~ spl0_3 ),
    inference(sat_conversion,[],[f33]) ).

cnf(s5,plain,
    ( ~ spl0_2
    | spl0_3 ),
    inference(sat_conversion,[],[f64]) ).

cnf(s6,plain,
    spl0_3,
    inference(rat,[],[s5,s2]) ).

cnf(s7,plain,
    spl0_1,
    inference(rat,[],[s4,s6]) ).

cnf(s8,plain,
    $false,
    inference(rat,[],[s1,s7]) ).

fof(f65,plain,
    $false,
    inference(avatar_sat_refutation,[],[s8]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP546-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.38  % Computer : n003.cluster.edu
% 0.12/0.38  % Model    : x86_64 x86_64
% 0.12/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38  % Memory   : 8046.5625MB
% 0.12/0.38  % OS       : Linux 6.8.0-71-generic
% 0.12/0.38  % CPULimit : 300
% 0.12/0.38  % WCLimit  : 300
% 0.12/0.38  % DateTime : Sun Sep 27 10:08:55 UTC 2026
% 0.12/0.38  % CPUTime  : 
% 0.12/0.38  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.41  Running first-order theorem proving
% 0.12/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.64/1.36  % (275077)Detected a unit-equality problem, will run specialized UEQ schedule.
% 2.64/1.36  % (275106)lrs+10_3_to=lpo:sil=64000:drc=off:fde=unused:sp=reverse_frequency:acc=on:bsr=on:fd=preordered:nwc=1:random_seed=1130279692:avsq=on:i=257:avsqr=16,3:bd=preordered:fsr=off_2999 on theBenchmark for (2999ds/257Mi)
% 2.64/1.36  % (275106)First to succeed.
% 2.64/1.36  % (275106)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-275077"
% 2.64/1.36  % (275102)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=117477633:i=130792:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/130792Mi)
% 2.64/1.36  % (275104)ott-1010_1_sfv=off:to=lpo:sil=8000:fdtod=off:sp=reverse_frequency:spb=goal_then_units:fd=preordered:random_seed=1677884280:i=136:bd=preordered:ins=2:av=off_2999 on theBenchmark for (2999ds/136Mi)
% 2.64/1.36  % (275101)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=1865241754:i=138329:kws=inv_arity_squared:fgj=on:bd=preordered_2999 on theBenchmark for (2999ds/138329Mi)
% 2.64/1.36  % (275103)lrs+10_1_ncem=casc2026/models/loop5.pt:sil=128000:tgt=ground:npcc=on:spb=goal_then_units:urr=ec_only:random_seed=4040160722:i=130716:gtgl=4:add=on:doe=on:bd=all:gtg=exists_sym_2999 on theBenchmark for (2999ds/130716Mi)
% 2.64/1.36  % (275104)Also succeeded, but the first one will report.
% 2.64/1.36  % (275107)dis-1010_7_sil=8000:fde=unused:flr=on:random_seed=4192130445:i=1187:sd=4:av=off:ss=axioms:sgt=32_2999 on theBenchmark for (2999ds/1187Mi)
% 2.64/1.36  % (275107)Also succeeded, but the first one will report.
% 2.64/1.36  % (275105)dis+10_14_to=lpo:sil=8000:tgt=full:drc=off:sp=const_frequency:sos=all:random_seed=1410598569:i=181:gtgl=5:bs=unit_only:fsr=off:gtg=exists_all_2999 on theBenchmark for (2999ds/181Mi)
% 2.64/1.36  % (275105)Also succeeded, but the first one will report.
% 2.64/1.36  % (275106)Refutation found. Thanks to Tanya!
% 2.64/1.36  % SZS status Unsatisfiable for theBenchmark
% 2.64/1.36  % SZS output start Proof for theBenchmark
% See solution above
% 2.64/1.36  % (275106)------------------------------
% 2.64/1.36  % (275106)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.64/1.36  % (275106)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.64/1.36  % (275106)CaDiCaL version: 2.1.3
% 2.64/1.36  % (275106)Termination reason: Refutation
% 2.64/1.36  % (275106)Time elapsed: 0.003 s
% 2.64/1.36  % (275106)Peak memory usage: 89 MB
% 2.64/1.36  % (275106)Instructions burned: 4 (million)
% 2.64/1.36  % (275106)------------------------------
% 2.64/1.36  % (275106)------------------------------
% 2.64/1.36  % (275077)Success in time 0.301 s
% 2.64/1.36  % Vampire exiting
%------------------------------------------------------------------------------