↑ Up

Vampire---5.0.1.UNS-Ref.s

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

% Result   : Unsatisfiable 5.50s 1.67s
% Output   : Refutation 5.50s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   33 (  33 unt;   1 def)
%            Number of atoms       :   33 (  25 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    5 (   5   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    8 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   67 (  67   !;   0   ?)

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

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

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

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

fof(f5,definition,
    ~ sP0(multiply(multiply(a3,b3),c3)),
    introduced(definition,[new_symbols(definition,[sP0])],[inequality_splitting_name_introduction]) ).

fof(f6,plain,
    sP0(multiply(a3,multiply(b3,c3))),
    inference(inequality_splitting,[],[f4,f5]) ).

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

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

fof(f9,plain,
    sP0(divide(a3,inverse(multiply(b3,c3)))),
    inference(backward_demodulation,[],[f6,f7]) ).

fof(f10,plain,
    ~ sP0(multiply(divide(a3,inverse(b3)),c3)),
    inference(backward_demodulation,[],[f5,f7]) ).

fof(f11,plain,
    ! [X2,X0,X1] : divide(X0,divide(divide(inverse(X1),X2),divide(inverse(X0),X2))) = X1,
    inference(forward_demodulation,[],[f8,f3]) ).

fof(f12,plain,
    ~ sP0(divide(divide(a3,inverse(b3)),inverse(c3))),
    inference(forward_demodulation,[],[f10,f7]) ).

fof(f13,plain,
    sP0(divide(a3,inverse(divide(b3,inverse(c3))))),
    inference(forward_demodulation,[],[f9,f7]) ).

fof(f14,plain,
    ! [X0,X1] : inverse(X1) = divide(inverse(divide(X0,X0)),X1),
    inference(superposition,[],[f3,f3]) ).

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

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

fof(f22,plain,
    ! [X0,X1] : divide(X0,inverse(divide(inverse(X0),inverse(X1)))) = X1,
    inference(superposition,[],[f11,f3]) ).

fof(f32,plain,
    ! [X0,X1] : divide(inverse(inverse(X1)),inverse(X0)) = divide(X1,inverse(X0)),
    inference(superposition,[],[f22,f22]) ).

fof(f39,plain,
    ! [X2,X0,X1] : divide(X1,divide(X0,divide(inverse(X1),inverse(divide(inverse(inverse(X2)),inverse(X0)))))) = X2,
    inference(superposition,[],[f11,f22]) ).

fof(f46,plain,
    ! [X2,X0,X1] : divide(X1,divide(X0,divide(inverse(X1),inverse(divide(X2,inverse(X0)))))) = X2,
    inference(backward_demodulation,[],[f39,f32]) ).

fof(f54,plain,
    ! [X2,X0,X1] : divide(X2,divide(X1,divide(inverse(X2),inverse(divide(inverse(inverse(X0)),inverse(X1)))))) = X0,
    inference(superposition,[],[f19,f3]) ).

fof(f55,plain,
    ! [X0,X1] : divide(X1,divide(X0,X0)) = X1,
    inference(superposition,[],[f19,f11]) ).

fof(f72,plain,
    ! [X0] : inverse(inverse(X0)) = X0,
    inference(forward_demodulation,[],[f54,f46]) ).

fof(f82,plain,
    ! [X2,X3,X0,X1] : divide(X1,divide(divide(inverse(X2),divide(divide(inverse(X0),X3),divide(X1,X3))),X0)) = X2,
    inference(backward_demodulation,[],[f21,f72]) ).

fof(f163,plain,
    ! [X2,X3,X0,X1] : divide(X3,X3) = divide(X2,divide(inverse(divide(divide(inverse(X0),X1),divide(X2,X1))),X0)),
    inference(superposition,[],[f82,f14]) ).

fof(f470,plain,
    ! [X0,X1] : divide(divide(X1,inverse(X0)),X0) = X1,
    inference(superposition,[],[f46,f55]) ).

fof(f527,plain,
    ! [X0,X1] : divide(divide(X1,X0),inverse(X0)) = X1,
    inference(superposition,[],[f470,f72]) ).

fof(f742,plain,
    ! [X2,X3,X0,X1] : divide(divide(divide(inverse(inverse(divide(X1,inverse(X2)))),X3),divide(X2,X3)),divide(X0,X0)) = X1,
    inference(superposition,[],[f46,f163]) ).

fof(f755,plain,
    ! [X2,X3,X1] : divide(divide(inverse(inverse(divide(X1,inverse(X2)))),X3),divide(X2,X3)) = X1,
    inference(forward_demodulation,[],[f742,f55]) ).

fof(f805,plain,
    ! [X2,X3,X1] : divide(divide(divide(X1,inverse(X2)),X3),divide(X2,X3)) = X1,
    inference(forward_demodulation,[],[f755,f72]) ).

fof(f2603,plain,
    ! [X2,X0,X1] : divide(divide(X0,inverse(X1)),X2) = divide(X0,inverse(divide(X1,X2))),
    inference(superposition,[],[f527,f805]) ).

fof(f2619,plain,
    ~ sP0(divide(a3,inverse(divide(b3,inverse(c3))))),
    inference(backward_demodulation,[],[f12,f2603]) ).

fof(f2675,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f2619,f13]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP447-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.38  % Computer : n014.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:04:46 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.38  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.41  Running first-order theorem proving
% 0.15/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
% 5.50/1.67  % (564066)Detected a unit-equality problem, will run specialized UEQ schedule.
% 5.50/1.67  % (564074)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=518221473:i=130792:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/130792Mi)
% 5.50/1.67  % (564083)dis-1010_7_sil=8000:fde=unused:flr=on:random_seed=952083652:i=1187:sd=4:av=off:ss=axioms:sgt=32_2999 on theBenchmark for (2999ds/1187Mi)
% 5.50/1.67  % (564076)lrs+10_1_ncem=casc2026/models/loop5.pt:sil=128000:tgt=ground:npcc=on:spb=goal_then_units:urr=ec_only:random_seed=4245040553:i=130716:gtgl=4:add=on:doe=on:bd=all:gtg=exists_sym_2999 on theBenchmark for (2999ds/130716Mi)
% 5.50/1.67  % (564072)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=4213106560:i=138329:kws=inv_arity_squared:fgj=on:bd=preordered_2999 on theBenchmark for (2999ds/138329Mi)
% 5.50/1.67  % (564078)ott-1010_1_sfv=off:to=lpo:sil=8000:fdtod=off:sp=reverse_frequency:spb=goal_then_units:fd=preordered:random_seed=3189115927:i=136:bd=preordered:ins=2:av=off_2999 on theBenchmark for (2999ds/136Mi)
% 5.50/1.67  % (564082)lrs+10_3_to=lpo:sil=64000:drc=off:fde=unused:sp=reverse_frequency:acc=on:bsr=on:fd=preordered:nwc=1:random_seed=2840323875:avsq=on:i=257:avsqr=16,3:bd=preordered:fsr=off_2999 on theBenchmark for (2999ds/257Mi)
% 5.50/1.67  % (564080)dis+10_14_to=lpo:sil=8000:tgt=full:drc=off:sp=const_frequency:sos=all:random_seed=3766822151:i=181:gtgl=5:bs=unit_only:fsr=off:gtg=exists_all_2999 on theBenchmark for (2999ds/181Mi)
% 5.50/1.67  % (564078)First to succeed.
% 5.50/1.67  % (564078)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-564066"
% 5.50/1.67  % (564082)Also succeeded, but the first one will report.
% 5.50/1.67  % (564080)Instruction limit reached! 
% 5.50/1.67  % (564080)------------------------------
% 5.50/1.67  % (564080)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.50/1.67  % (564080)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.50/1.67  % (564080)CaDiCaL version: 2.1.3
% 5.50/1.67  % (564080)Termination reason: Instruction limit
% 5.50/1.67  % (564080)Termination phase: Saturation
% 5.50/1.67  % (564080)Time elapsed: 0.169 s
% 5.50/1.67  % (564080)Peak memory usage: 89 MB
% 5.50/1.67  % (564080)Instructions burned: 182 (million)
% 5.50/1.67  % (564083)Also succeeded, but the first one will report.
% 5.50/1.67  % (564102)lrs-1011_1_ncem=casc2026/models/loop8.pt:sil=32000:npcc=on:prc=on:fde=unused:lcm=predicate:bsr=on:flr=on:random_seed=659880528:i=2051:gtgl=2:fgj=on:bd=all:gtg=exists_top_2994 on theBenchmark for (2994ds/2051Mi)
% 5.50/1.67  % (564078)Refutation found. Thanks to Tanya!
% 5.50/1.67  % SZS status Unsatisfiable for theBenchmark
% 5.50/1.67  % SZS output start Proof for theBenchmark
% See solution above
% 5.50/1.67  % (564078)------------------------------
% 5.50/1.67  % (564078)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.50/1.67  % (564078)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.50/1.67  % (564078)CaDiCaL version: 2.1.3
% 5.50/1.67  % (564078)Termination reason: Refutation
% 5.50/1.67  % (564078)Time elapsed: 0.121 s
% 5.50/1.67  % (564078)Peak memory usage: 89 MB
% 5.50/1.67  % (564078)Instructions burned: 122 (million)
% 5.50/1.67  % (564078)------------------------------
% 5.50/1.67  % (564078)------------------------------
% 5.50/1.67  % (564066)Success in time 0.715 s
% 5.50/1.67  % Vampire exiting
%------------------------------------------------------------------------------