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

% 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:18:01 AM UTC 2026

% Result   : Unsatisfiable 0.13s 0.43s
% Output   : Refutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   17 (  17 unt;   0 def)
%            Number of atoms       :   17 (  16 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    4 (   4   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    7 (   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   :   34 (  34   !;   0   ?)

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

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

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

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

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

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

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

fof(f65,plain,
    ! [X2,X0,X1] : multiply(X1,X0) = multiply(multiply(inverse(X2),X0),multiply(X1,X2)),
    inference(superposition,[],[f50,f11]) ).

fof(f213,plain,
    ! [X2,X0,X1] : multiply(inverse(multiply(multiply(inverse(X2),X1),X2)),multiply(X0,X1)) = X0,
    inference(superposition,[],[f22,f65]) ).

fof(f226,plain,
    ! [X0,X1] : multiply(inverse(X1),multiply(X0,X1)) = X0,
    inference(forward_demodulation,[],[f213,f11]) ).

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

fof(f299,plain,
    ! [X2,X0,X1] : multiply(X1,X0) = multiply(X0,multiply(X1,multiply(inverse(X2),X2))),
    inference(superposition,[],[f50,f246]) ).

fof(f321,plain,
    ! [X0,X1] : multiply(X0,X1) = multiply(X1,X0),
    inference(forward_demodulation,[],[f299,f246]) ).

fof(f403,plain,
    multiply(a3,multiply(b3,c3)) != multiply(c3,multiply(a3,b3)),
    inference(superposition,[],[f2,f321]) ).

fof(f419,plain,
    multiply(a3,multiply(b3,c3)) != multiply(a3,multiply(c3,b3)),
    inference(forward_demodulation,[],[f403,f50]) ).

fof(f456,plain,
    multiply(a3,multiply(b3,c3)) != multiply(a3,multiply(b3,c3)),
    inference(forward_demodulation,[],[f419,f321]) ).

fof(f457,plain,
    $false,
    inference(trivial_inequality_removal,[],[f456]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP519-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.35  % Computer : n014.cluster.edu
% 0.10/0.35  % Model    : x86_64 x86_64
% 0.10/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35  % Memory   : 8046.5625MB
% 0.10/0.35  % OS       : Linux 6.8.0-71-generic
% 0.10/0.35  % CPULimit : 300
% 0.10/0.35  % WCLimit  : 300
% 0.10/0.35  % DateTime : Sun Sep 27 10:06:47 UTC 2026
% 0.10/0.35  % CPUTime  : 
% 0.10/0.35  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/0.38  Running first-order model finding
% 0.13/0.38  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.13/0.43  % (570842)Will run a generic schedule for satisfiability detection.
% 0.13/0.43  % (570852)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1619846303:i=88024:add=on:rawr=on_3000 on theBenchmark for (3000ds/88024Mi)
% 0.13/0.43  % (570851)% WARNING: option uhcvi not known.
% 0.13/0.43  % (570849)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1537022841_3000 on theBenchmark for (3000ds/0Mi)
% 0.13/0.43  % (570854)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3959328536:i=116_3000 on theBenchmark for (3000ds/116Mi)
% 0.13/0.43  % (570851)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3322730574:i=135531:add=off:rawr=on_3000 on theBenchmark for (3000ds/135531Mi)
% 0.13/0.43  % (570853)dis+10_1_sil=32000:sp=arity:random_seed=350217504:i=103:fgj=on_3000 on theBenchmark for (3000ds/103Mi)
% 0.13/0.43  % (570856)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3827704219:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_3000 on theBenchmark for (3000ds/159Mi)
% 0.13/0.43  % (570855)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1556738463:i=131_3000 on theBenchmark for (3000ds/131Mi)
% 0.13/0.43  % TRYING [1]
% 0.13/0.43  % TRYING [2]
% 0.13/0.43  % TRYING [3]
% 0.13/0.43  % TRYING [4]
% 0.13/0.43  % (570853) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-570842-570853"...
% 0.13/0.43  % (570853)...printing done.
% 0.13/0.43  % (570853)Refutation found. Thanks to Tanya!
% 0.13/0.43  % SZS status Unsatisfiable for theBenchmark
% 0.13/0.43  % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.43  % (570853)------------------------------
% 0.13/0.43  % (570853)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.13/0.43  % (570853)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.13/0.43  % (570853)CaDiCaL version: 2.1.3
% 0.13/0.43  % (570853)Termination reason: Refutation
% 0.13/0.43  % (570853)Time elapsed: 0.013 s
% 0.13/0.43  % (570853)Peak memory usage: 11 MB
% 0.13/0.43  % (570853)Instructions burned: 22 (million)
% 0.13/0.43  % (570842)Success in time 0.038 s
% 0.13/0.43  % Vampire exiting
%------------------------------------------------------------------------------