↑ Up

Vampire---5.0.1.UNS-Ref.s

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

% Result   : Unsatisfiable 3.44s 1.27s
% Output   : Refutation 3.44s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   20
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   30 (  30 unt;   0 def)
%            Number of atoms       :   30 (  29 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    2 (   2   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    8 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   69 (  69   !;   0   ?)

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

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

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

fof(f4,plain,
    ! [X2,X0,X1] : double_divide(double_divide(X0,X1),multiply(inverse(double_divide(inverse(X2),X1)),X0)) = X2,
    inference(forward_demodulation,[],[f1,f2]) ).

fof(f5,plain,
    ! [X2,X0,X1] : double_divide(double_divide(X0,X1),multiply(multiply(X1,inverse(X2)),X0)) = X2,
    inference(forward_demodulation,[],[f4,f2]) ).

fof(f6,plain,
    ! [X2,X3,X0,X1] : double_divide(X0,multiply(multiply(multiply(multiply(X2,inverse(X0)),X1),inverse(X3)),double_divide(X1,X2))) = X3,
    inference(superposition,[],[f5,f5]) ).

fof(f8,plain,
    ! [X2,X0,X1] : inverse(X0) = multiply(multiply(multiply(X1,inverse(X0)),X2),double_divide(X2,X1)),
    inference(superposition,[],[f2,f5]) ).

fof(f11,plain,
    ! [X2,X3,X0,X1] : inverse(X1) = multiply(multiply(multiply(multiply(multiply(X2,inverse(X0)),X3),inverse(X1)),double_divide(X3,X2)),X0),
    inference(superposition,[],[f8,f5]) ).

fof(f12,plain,
    ! [X2,X0,X1] : double_divide(double_divide(double_divide(inverse(X1),X2),multiply(X2,inverse(X0))),inverse(X0)) = X1,
    inference(superposition,[],[f5,f8]) ).

fof(f103,plain,
    ! [X2,X3,X0,X1] : inverse(X1) = multiply(multiply(inverse(X0),double_divide(double_divide(X3,X2),multiply(multiply(X2,inverse(inverse(X1))),X3))),X0),
    inference(superposition,[],[f11,f11]) ).

fof(f110,plain,
    ! [X2,X3,X0,X1] : double_divide(X0,multiply(inverse(X0),double_divide(double_divide(X3,X1),multiply(multiply(X1,inverse(inverse(X2))),X3)))) = X2,
    inference(superposition,[],[f6,f11]) ).

fof(f128,plain,
    ! [X2,X0] : double_divide(X0,multiply(inverse(X0),inverse(X2))) = X2,
    inference(forward_demodulation,[],[f110,f5]) ).

fof(f129,plain,
    ! [X0,X1] : inverse(X1) = multiply(multiply(inverse(X0),inverse(X1)),X0),
    inference(forward_demodulation,[],[f103,f5]) ).

fof(f130,plain,
    ! [X2,X0,X1] : double_divide(double_divide(X1,X0),multiply(multiply(X0,X1),inverse(X2))) = X2,
    inference(superposition,[],[f128,f2]) ).

fof(f149,plain,
    ! [X0,X1] : double_divide(double_divide(X1,inverse(X1)),inverse(X0)) = X0,
    inference(superposition,[],[f5,f129]) ).

fof(f170,plain,
    ! [X2,X0,X1] : double_divide(X1,X0) = double_divide(double_divide(X2,inverse(X2)),multiply(X0,X1)),
    inference(superposition,[],[f149,f2]) ).

fof(f206,plain,
    ! [X0,X1] : double_divide(double_divide(inverse(X0),inverse(inverse(X1))),inverse(X0)) = X1,
    inference(superposition,[],[f130,f129]) ).

fof(f361,plain,
    ! [X0,X1] : double_divide(inverse(X0),multiply(inverse(X1),X1)) = X0,
    inference(superposition,[],[f170,f130]) ).

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

fof(f462,plain,
    ! [X2,X0,X1] : double_divide(double_divide(double_divide(inverse(X1),multiply(inverse(X2),X2)),inverse(X0)),inverse(X0)) = X1,
    inference(superposition,[],[f12,f407]) ).

fof(f483,plain,
    ! [X0,X1] : double_divide(double_divide(X1,inverse(X0)),inverse(X0)) = X1,
    inference(forward_demodulation,[],[f462,f361]) ).

fof(f492,plain,
    ! [X0] : inverse(inverse(X0)) = X0,
    inference(superposition,[],[f483,f206]) ).

fof(f534,plain,
    ! [X0,X1] : double_divide(double_divide(X0,inverse(inverse(X1))),X0) = X1,
    inference(superposition,[],[f206,f492]) ).

fof(f540,plain,
    ! [X0,X1] : double_divide(double_divide(X1,X0),X0) = X1,
    inference(superposition,[],[f483,f492]) ).

fof(f541,plain,
    ! [X0,X1] : double_divide(double_divide(X0,X1),X0) = X1,
    inference(forward_demodulation,[],[f534,f492]) ).

fof(f685,plain,
    ! [X0,X1] : double_divide(X0,X1) = double_divide(X1,X0),
    inference(superposition,[],[f540,f541]) ).

fof(f786,plain,
    ! [X0,X1] : multiply(X0,X1) = inverse(double_divide(X0,X1)),
    inference(superposition,[],[f2,f685]) ).

fof(f1832,plain,
    ! [X0,X1] : multiply(X0,X1) = multiply(X1,X0),
    inference(superposition,[],[f786,f2]) ).

fof(f2056,plain,
    multiply(a,b) != multiply(a,b),
    inference(superposition,[],[f3,f1832]) ).

fof(f2057,plain,
    $false,
    inference(trivial_inequality_removal,[],[f2056]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP600-1 : TPTP v9.3.1. Bugfixed v2.7.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.38  % Computer : n009.cluster.edu
% 0.11/0.38  % Model    : x86_64 x86_64
% 0.11/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38  % Memory   : 8046.5625MB
% 0.11/0.38  % OS       : Linux 6.8.0-71-generic
% 0.11/0.38  % CPULimit : 300
% 0.11/0.38  % WCLimit  : 300
% 0.11/0.38  % DateTime : Sun Sep 27 10:08:00 UTC 2026
% 0.11/0.39  % CPUTime  : 
% 0.11/0.39  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.42  Running first-order theorem proving
% 0.11/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.44/1.27  % (1796530)Detected a unit-equality problem, will run specialized UEQ schedule.
% 3.44/1.27  % (1796614)dis-1010_7_sil=8000:fde=unused:flr=on:random_seed=2536670281:i=1187:sd=4:av=off:ss=axioms:sgt=32_2999 on theBenchmark for (2999ds/1187Mi)
% 3.44/1.27  % (1796611)ott-1010_1_sfv=off:to=lpo:sil=8000:fdtod=off:sp=reverse_frequency:spb=goal_then_units:fd=preordered:random_seed=484751783:i=136:bd=preordered:ins=2:av=off_2999 on theBenchmark for (2999ds/136Mi)
% 3.44/1.27  % (1796612)dis+10_14_to=lpo:sil=8000:tgt=full:drc=off:sp=const_frequency:sos=all:random_seed=444721900:i=181:gtgl=5:bs=unit_only:fsr=off:gtg=exists_all_2999 on theBenchmark for (2999ds/181Mi)
% 3.44/1.27  % (1796610)lrs+10_1_ncem=casc2026/models/loop5.pt:sil=128000:tgt=ground:npcc=on:spb=goal_then_units:urr=ec_only:random_seed=4017380720:i=130716:gtgl=4:add=on:doe=on:bd=all:gtg=exists_sym_2999 on theBenchmark for (2999ds/130716Mi)
% 3.44/1.27  % (1796613)lrs+10_3_to=lpo:sil=64000:drc=off:fde=unused:sp=reverse_frequency:acc=on:bsr=on:fd=preordered:nwc=1:random_seed=3722072484:avsq=on:i=257:avsqr=16,3:bd=preordered:fsr=off_2999 on theBenchmark for (2999ds/257Mi)
% 3.44/1.27  % (1796608)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=505785578:i=138329:kws=inv_arity_squared:fgj=on:bd=preordered_2999 on theBenchmark for (2999ds/138329Mi)
% 3.44/1.27  % (1796609)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=327663275:i=130792:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/130792Mi)
% 3.44/1.27  % (1796614)First to succeed.
% 3.44/1.27  % (1796614)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1796530"
% 3.44/1.27  % (1796611)Instruction limit reached! 
% 3.44/1.27  % (1796611)------------------------------
% 3.44/1.27  % (1796611)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.44/1.27  % (1796611)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.44/1.27  % (1796611)CaDiCaL version: 2.1.3
% 3.44/1.27  % (1796611)Termination reason: Instruction limit
% 3.44/1.27  % (1796611)Termination phase: Saturation
% 3.44/1.27  % (1796611)Time elapsed: 0.079 s
% 3.44/1.27  % (1796611)Peak memory usage: 88 MB
% 3.44/1.27  % (1796611)Instructions burned: 137 (million)
% 3.44/1.27  % (1796612)Instruction limit reached! 
% 3.44/1.27  % (1796612)------------------------------
% 3.44/1.27  % (1796612)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.44/1.27  % (1796612)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.44/1.27  % (1796612)CaDiCaL version: 2.1.3
% 3.44/1.27  % (1796612)Termination reason: Instruction limit
% 3.44/1.27  % (1796612)Termination phase: Saturation
% 3.44/1.27  % (1796612)Time elapsed: 0.097 s
% 3.44/1.27  % (1796612)Peak memory usage: 90 MB
% 3.44/1.27  % (1796612)Instructions burned: 182 (million)
% 3.44/1.27  % (1796613)Also succeeded, but the first one will report.
% 3.44/1.27  % (1796679)lrs-1011_1_ncem=casc2026/models/loop8.pt:sil=32000:npcc=on:prc=on:fde=unused:lcm=predicate:bsr=on:flr=on:random_seed=1996738593:i=2051:gtgl=2:fgj=on:bd=all:gtg=exists_top_2997 on theBenchmark for (2997ds/2051Mi)
% 3.44/1.27  % (1796691)lrs-1002_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:npcc=on:random_seed=1450293109:i=4948:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/4948Mi)
% 3.44/1.27  % (1796614)Refutation found. Thanks to Tanya!
% 3.44/1.27  % SZS status Unsatisfiable for theBenchmark
% 3.44/1.27  % SZS output start Proof for theBenchmark
% See solution above
% 3.44/1.27  % (1796614)------------------------------
% 3.44/1.27  % (1796614)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.44/1.27  % (1796614)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.44/1.27  % (1796614)CaDiCaL version: 2.1.3
% 3.44/1.27  % (1796614)Termination reason: Refutation
% 3.44/1.27  % (1796614)Time elapsed: 0.051 s
% 3.44/1.27  % (1796614)Peak memory usage: 89 MB
% 3.44/1.27  % (1796614)Instructions burned: 86 (million)
% 3.44/1.27  % (1796614)------------------------------
% 3.44/1.27  % (1796614)------------------------------
% 3.44/1.27  % (1796530)Success in time 0.438 s
% 3.44/1.27  % Vampire exiting
%------------------------------------------------------------------------------