↑ 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  : 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 SAT

% Computer : n018.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:11 AM UTC 2026

% Result   : Unsatisfiable 0.16s 0.52s
% Output   : Refutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   16 (  16 unt;   0 def)
%            Number of atoms       :   16 (  15 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    :   11 (   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   :   29 (  29   !;   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,
    inverse(double_divide(b,a)) != inverse(double_divide(a,b)),
    inference(definition_unfolding,[],[f3,f2,f2]) ).

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

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

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

fof(f37,plain,
    ! [X0,X1] : double_divide(X1,inverse(double_divide(inverse(X0),inverse(X1)))) = X0,
    inference(superposition,[],[f19,f1]) ).

fof(f52,plain,
    ! [X0,X1] : double_divide(double_divide(inverse(X0),inverse(inverse(X1))),inverse(X0)) = X1,
    inference(superposition,[],[f37,f37]) ).

fof(f106,plain,
    ! [X0,X1] : double_divide(X0,inverse(X1)) = double_divide(inverse(X1),inverse(inverse(X0))),
    inference(superposition,[],[f6,f52]) ).

fof(f147,plain,
    ! [X0,X1] : double_divide(double_divide(X0,inverse(X1)),inverse(X1)) = X0,
    inference(superposition,[],[f52,f106]) ).

fof(f177,plain,
    ! [X0] : inverse(inverse(X0)) = X0,
    inference(superposition,[],[f52,f147]) ).

fof(f186,plain,
    ! [X0,X1] : double_divide(X0,inverse(X1)) = double_divide(inverse(X1),X0),
    inference(superposition,[],[f106,f177]) ).

fof(f263,plain,
    ! [X0,X1] : double_divide(X0,X1) = double_divide(X1,X0),
    inference(superposition,[],[f186,f177]) ).

fof(f333,plain,
    inverse(double_divide(a,b)) != inverse(double_divide(a,b)),
    inference(superposition,[],[f4,f263]) ).

fof(f334,plain,
    $false,
    inference(trivial_inequality_removal,[],[f333]) ).

%------------------------------------------------------------------------------
%----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 SAT
% 0.10/0.37  % Computer : n018.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Sun Sep 27 10:10:08 UTC 2026
% 0.10/0.38  % CPUTime  : 
% 0.10/0.38  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.41  Running first-order model finding
% 0.10/0.41  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.16/0.52  % (2105449)Will run a generic schedule for satisfiability detection.
% 0.16/0.52  % (2105454)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1944390544_2999 on theBenchmark for (2999ds/0Mi)
% 0.16/0.52  % TRYING [1]
% 0.16/0.52  % TRYING [2]
% 0.16/0.52  % TRYING [3]
% 0.16/0.52  % (2105455)% WARNING: option uhcvi not known.
% 0.16/0.52  % (2105455)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1856607048:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.16/0.52  % (2105456)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3372554244:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.16/0.52  % (2105457)dis+10_1_sil=32000:sp=arity:random_seed=2103487532:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.16/0.52  % (2105460)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1897557522:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.16/0.52  % (2105459)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3137658862:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.16/0.52  % (2105458)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2501869714:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.16/0.52  % TRYING [4]
% 0.16/0.52  % (2105460) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2105449-2105460"...
% 0.16/0.52  % (2105460)...printing done.
% 0.16/0.52  % (2105460)Refutation found. Thanks to Tanya!
% 0.16/0.52  % SZS status Unsatisfiable for theBenchmark
% 0.16/0.52  % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.52  % (2105460)------------------------------
% 0.16/0.52  % (2105460)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.52  % (2105460)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.52  % (2105460)CaDiCaL version: 2.1.3
% 0.16/0.52  % (2105460)Termination reason: Refutation
% 0.16/0.52  % (2105460)Time elapsed: 0.034 s
% 0.16/0.52  % (2105460)Peak memory usage: 12 MB
% 0.16/0.52  % (2105460)Instructions burned: 31 (million)
% 0.16/0.52  % (2105449)Success in time 0.091 s
% 0.16/0.52  % Vampire exiting
%------------------------------------------------------------------------------