↑ Up

Vampire-SAT---5.0.1.UNS-Ref.s

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

% Computer : n006.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:18:06 AM UTC 2026

% Result   : Unsatisfiable 0.12s 0.47s
% Output   : Refutation 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   19 (  19 unt;   0 def)
%            Number of atoms       :   19 (  18 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    3 (   3   ~;   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   :   36 (  36   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X2,X0,X1] : divide(divide(divide(X0,inverse(X1)),X2),divide(X0,X2)) = X1,
    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,plain,
    ! [X0,X1] : divide(X0,inverse(X1)) = multiply(X0,X1),
    inference(reorient_equations,[],[f2]) ).

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

fof(f5,plain,
    divide(a,inverse(b)) != divide(b,inverse(a)),
    inference(definition_unfolding,[],[f4,f3,f3]) ).

fof(f6,plain,
    ! [X2,X0,X1] : divide(X0,divide(divide(X1,inverse(X0)),divide(X1,inverse(X2)))) = X2,
    inference(superposition,[],[f1,f1]) ).

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

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

fof(f21,plain,
    ! [X2,X0] : divide(divide(X0,inverse(X2)),X0) = X2,
    inference(forward_demodulation,[],[f13,f1]) ).

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

fof(f27,plain,
    ! [X0,X1] : divide(X0,divide(X1,X1)) = X0,
    inference(superposition,[],[f1,f21]) ).

fof(f35,plain,
    ! [X0,X1] : divide(divide(X1,X1),inverse(X0)) = X0,
    inference(superposition,[],[f27,f21]) ).

fof(f58,plain,
    ! [X2,X0,X1] : divide(divide(divide(divide(X1,X1),inverse(X2)),inverse(X0)),X0) = X2,
    inference(superposition,[],[f1,f35]) ).

fof(f61,plain,
    ! [X2,X0] : divide(divide(X2,inverse(X0)),X0) = X2,
    inference(forward_demodulation,[],[f58,f35]) ).

fof(f129,plain,
    ! [X0] : inverse(inverse(X0)) = X0,
    inference(superposition,[],[f61,f35]) ).

fof(f464,plain,
    ! [X0,X1] : divide(inverse(X0),inverse(X1)) = divide(X1,X0),
    inference(superposition,[],[f6,f23]) ).

fof(f486,plain,
    ! [X0,X1] : divide(X0,inverse(X1)) = divide(X1,inverse(X0)),
    inference(superposition,[],[f464,f129]) ).

fof(f726,plain,
    divide(a,inverse(b)) != divide(a,inverse(b)),
    inference(superposition,[],[f5,f486]) ).

fof(f749,plain,
    $false,
    inference(trivial_inequality_removal,[],[f726]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP564-1 : TPTP v9.3.1. Bugfixed v2.7.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.38  % Computer : n006.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:07:10 UTC 2026
% 0.12/0.39  % CPUTime  : 
% 0.12/0.39  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.42  Running first-order model finding
% 0.12/0.42  Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.47  % (2757902)Will run a generic schedule for satisfiability detection.
% 0.12/0.47  % (2757909)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3399281333:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.12/0.47  % (2757908)% WARNING: option uhcvi not known.
% 0.12/0.47  % (2757907)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2690342346_2999 on theBenchmark for (2999ds/0Mi)
% 0.12/0.47  % (2757908)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3530663831:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.12/0.47  % (2757910)dis+10_1_sil=32000:sp=arity:random_seed=2600665642:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.12/0.47  % (2757911)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1198070265:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.12/0.47  % (2757912)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2066665499:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.12/0.47  % TRYING [1]
% 0.12/0.47  % TRYING [2]
% 0.12/0.47  % TRYING [3]
% 0.12/0.47  % TRYING [4]
% 0.12/0.47  % (2757913)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2317062330:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.12/0.47  % (2757909) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2757902-2757909"...
% 0.12/0.47  % (2757909)...printing done.
% 0.12/0.47  % (2757909)Refutation found. Thanks to Tanya!
% 0.12/0.47  % SZS status Unsatisfiable for theBenchmark
% 0.12/0.47  % SZS output start Proof for theBenchmark
% See solution above
% 0.12/0.47  % (2757909)------------------------------
% 0.12/0.47  % (2757909)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.12/0.47  % (2757909)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.12/0.47  % (2757909)CaDiCaL version: 2.1.3
% 0.12/0.47  % (2757909)Termination reason: Refutation
% 0.12/0.47  % (2757909)Time elapsed: 0.012 s
% 0.12/0.47  % (2757909)Peak memory usage: 11 MB
% 0.12/0.47  % (2757909)Instructions burned: 27 (million)
% 0.12/0.47  % (2757902)Success in time 0.041 s
% 0.12/0.47  % Vampire exiting
%------------------------------------------------------------------------------