↑ 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  : GRP665-10 : TPTP v9.3.1. Released v8.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT

% Computer : n012.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:29 AM UTC 2026

% Result   : Unsatisfiable 0.14s 0.49s
% Output   : Refutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   10 (  10 unt;   0 def)
%            Number of atoms       :   10 (   9 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    2 (   2   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   13 (  13   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f2,axiom,
    ! [X0,X1] : ld(X0,mult(X0,X1)) = X1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f02) ).

fof(f8,axiom,
    ! [X2,X0,X1] : mult(mult(X0,X1),X2) = mult(mult(X0,X2),ld(X2,mult(X1,X2))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f08) ).

fof(f9,axiom,
    ! [X0] : mult(op_c,X0) = mult(X0,op_c),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f09) ).

fof(f10,negated_conjecture,
    mult(op_c,mult(x0,x1)) != mult(mult(op_c,x0),x1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal) ).

fof(f32,plain,
    ! [X0] : ld(op_c,mult(X0,op_c)) = X0,
    inference(superposition,[],[f2,f9]) ).

fof(f77,plain,
    ! [X0,X1] : mult(mult(X0,X1),op_c) = mult(mult(op_c,X0),ld(op_c,mult(X1,op_c))),
    inference(superposition,[],[f8,f9]) ).

fof(f105,plain,
    ! [X0,X1] : mult(mult(X0,X1),op_c) = mult(mult(op_c,X0),X1),
    inference(forward_demodulation,[],[f77,f32]) ).

fof(f112,plain,
    ! [X0,X1] : mult(op_c,mult(X0,X1)) = mult(mult(op_c,X0),X1),
    inference(forward_demodulation,[],[f105,f9]) ).

fof(f365,plain,
    mult(op_c,mult(x0,x1)) != mult(op_c,mult(x0,x1)),
    inference(superposition,[],[f10,f112]) ).

fof(f382,plain,
    $false,
    inference(trivial_inequality_removal,[],[f365]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP665-10 : TPTP v9.3.1. Released v8.1.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.39  % Computer : n012.cluster.edu
% 0.11/0.39  % Model    : x86_64 x86_64
% 0.11/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.39  % Memory   : 8046.5625MB
% 0.11/0.39  % OS       : Linux 6.8.0-71-generic
% 0.11/0.39  % CPULimit : 300
% 0.11/0.39  % WCLimit  : 300
% 0.11/0.39  % DateTime : Sun Sep 27 10:33:05 UTC 2026
% 0.11/0.39  % CPUTime  : 
% 0.11/0.39  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.42  Running first-order model finding
% 0.11/0.43  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.14/0.49  % (2178280)Will run a generic schedule for satisfiability detection.
% 0.14/0.49  % (2178286)% WARNING: option uhcvi not known.
% 0.14/0.49  % (2178290)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2728010568:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.14/0.49  % (2178285)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1657928727_2999 on theBenchmark for (2999ds/0Mi)
% 0.14/0.49  % (2178288)dis+10_1_sil=32000:sp=arity:random_seed=378783049:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.14/0.49  % (2178286)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3435941775:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.14/0.49  % (2178291)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2791399152:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.14/0.49  % (2178289)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2612815797:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.14/0.49  % (2178287)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1373500543:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.14/0.49  % TRYING [1]
% 0.14/0.49  % TRYING [2]
% 0.14/0.49  % TRYING [3]
% 0.14/0.49  % TRYING [4]
% 0.14/0.49  % (2178289) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2178280-2178289"...
% 0.14/0.49  % (2178289)...printing done.
% 0.14/0.49  % (2178289)Refutation found. Thanks to Tanya!
% 0.14/0.49  % SZS status Unsatisfiable for theBenchmark
% 0.14/0.49  % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.49  % (2178289)------------------------------
% 0.14/0.49  % (2178289)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.14/0.49  % (2178289)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.14/0.49  % (2178289)CaDiCaL version: 2.1.3
% 0.14/0.49  % (2178289)Termination reason: Refutation
% 0.14/0.49  % (2178289)Time elapsed: 0.009 s
% 0.14/0.49  % (2178289)Peak memory usage: 11 MB
% 0.14/0.49  % (2178289)Instructions burned: 16 (million)
% 0.14/0.49  % (2178280)Success in time 0.054 s
% 0.14/0.49  % Vampire exiting
%------------------------------------------------------------------------------