↑ 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  : GRP118-1 : TPTP v9.3.1. Released v1.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT

% Computer : n026.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:16:42 AM UTC 2026

% Result   : Unsatisfiable 0.15s 0.48s
% Output   : Refutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   21 (  21 unt;   0 def)
%            Number of atoms       :   21 (  20 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    :    8 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   42 (  42   !;   0   ?)

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

fof(f2,negated_conjecture,
    multiply(multiply(a,b),c) != multiply(a,multiply(b,c)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_order3) ).

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

fof(f12,plain,
    ! [X2,X0,X1] : multiply(multiply(X1,X0),multiply(identity,X2)) = multiply(X1,multiply(X0,X2)),
    inference(superposition,[],[f6,f1]) ).

fof(f22,plain,
    ! [X2,X0,X1] : multiply(X0,multiply(X0,multiply(multiply(multiply(X0,X1),X2),multiply(X2,X2)))) = X1,
    inference(superposition,[],[f1,f12]) ).

fof(f25,plain,
    ! [X2,X0,X1] : multiply(X0,multiply(multiply(X0,multiply(X0,multiply(X1,X2))),multiply(identity,multiply(multiply(identity,X2),multiply(identity,X2))))) = X1,
    inference(superposition,[],[f1,f12]) ).

fof(f34,plain,
    ! [X2,X0,X1] : multiply(X0,multiply(X0,multiply(multiply(X0,multiply(X1,X2)),multiply(multiply(identity,X2),multiply(identity,X2))))) = X1,
    inference(forward_demodulation,[],[f25,f12]) ).

fof(f45,plain,
    ! [X2,X0,X1] : multiply(X0,multiply(X0,multiply(multiply(X0,multiply(X1,X2)),multiply(identity,multiply(X2,X2))))) = X1,
    inference(forward_demodulation,[],[f34,f12]) ).

fof(f50,plain,
    ! [X2,X0,X1] : multiply(X0,multiply(X0,multiply(X0,multiply(multiply(X1,X2),multiply(X2,X2))))) = X1,
    inference(forward_demodulation,[],[f45,f12]) ).

fof(f60,plain,
    ! [X0,X1] : multiply(X0,multiply(X0,multiply(multiply(X0,X1),multiply(identity,identity)))) = X1,
    inference(superposition,[],[f22,f12]) ).

fof(f71,plain,
    ! [X0,X1] : multiply(X0,multiply(X0,multiply(X0,multiply(X1,identity)))) = X1,
    inference(forward_demodulation,[],[f60,f12]) ).

fof(f108,plain,
    ! [X0,X1] : multiply(multiply(X1,multiply(X0,X0)),X0) = X1,
    inference(superposition,[],[f50,f50]) ).

fof(f147,plain,
    ! [X0,X1] : multiply(X0,multiply(multiply(multiply(identity,X1),multiply(identity,X1)),X1)) = X0,
    inference(superposition,[],[f12,f108]) ).

fof(f159,plain,
    ! [X0,X1] : multiply(X0,multiply(multiply(identity,multiply(X1,X1)),X1)) = X0,
    inference(forward_demodulation,[],[f147,f12]) ).

fof(f165,plain,
    ! [X0] : multiply(X0,identity) = X0,
    inference(forward_demodulation,[],[f159,f108]) ).

fof(f173,plain,
    ! [X0,X1] : multiply(X1,multiply(X1,multiply(X1,X0))) = X0,
    inference(superposition,[],[f71,f165]) ).

fof(f218,plain,
    ! [X0] : identity = multiply(X0,multiply(X0,X0)),
    inference(superposition,[],[f173,f165]) ).

fof(f257,plain,
    ! [X0] : multiply(identity,X0) = X0,
    inference(superposition,[],[f108,f218]) ).

fof(f296,plain,
    ! [X2,X0,X1] : multiply(multiply(X1,X2),X0) = multiply(X1,multiply(X2,X0)),
    inference(superposition,[],[f12,f257]) ).

fof(f731,plain,
    multiply(a,multiply(b,c)) != multiply(a,multiply(b,c)),
    inference(superposition,[],[f2,f296]) ).

fof(f769,plain,
    $false,
    inference(trivial_inequality_removal,[],[f731]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP118-1 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.38  % Computer : n026.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 09:22:42 UTC 2026
% 0.11/0.39  % CPUTime  : 
% 0.11/0.39  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.42  Running first-order model finding
% 0.11/0.42  Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/0.48  % (2568567)Will run a generic schedule for satisfiability detection.
% 0.15/0.48  % (2568576)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1839480324:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.15/0.48  % (2568573)% WARNING: option uhcvi not known.
% 0.15/0.48  % (2568572)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=453250341_2999 on theBenchmark for (2999ds/0Mi)
% 0.15/0.48  % (2568574)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2672054508:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.15/0.48  % (2568575)dis+10_1_sil=32000:sp=arity:random_seed=684042345:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.15/0.48  % (2568573)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=443893950:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.15/0.48  % (2568578)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=356983004:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.15/0.48  % (2568577)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1562187428:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.15/0.48  % TRYING [1]
% 0.15/0.48  % TRYING [2]
% 0.15/0.48  % TRYING [3]
% 0.15/0.48  % TRYING [4]
% 0.15/0.48  % (2568574) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2568567-2568574"...
% 0.15/0.48  % TRYING [5]
% 0.15/0.48  % (2568574)...printing done.
% 0.15/0.48  % (2568574)Refutation found. Thanks to Tanya!
% 0.15/0.48  % SZS status Unsatisfiable for theBenchmark
% 0.15/0.48  % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.48  % (2568574)------------------------------
% 0.15/0.48  % (2568574)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.15/0.48  % (2568574)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.15/0.48  % (2568574)CaDiCaL version: 2.1.3
% 0.15/0.48  % (2568574)Termination reason: Refutation
% 0.15/0.48  % (2568574)Time elapsed: 0.018 s
% 0.15/0.48  % (2568574)Peak memory usage: 11 MB
% 0.15/0.48  % (2568574)Instructions burned: 29 (million)
% 0.15/0.48  % (2568567)Success in time 0.055 s
% 0.15/0.48  % Vampire exiting
%------------------------------------------------------------------------------