↑ 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  : GRP515-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 : n001.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:00 AM UTC 2026

% Result   : Unsatisfiable 0.52s 0.52s
% Output   : Refutation 0.52s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   20 (  20 unt;   0 def)
%            Number of atoms       :   20 (  19 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    2 (   2   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :   10 (   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   :   47 (  47   !;   0   ?)

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

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

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

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

fof(f19,plain,
    ! [X3,X0,X1] : multiply(X1,multiply(X0,inverse(multiply(X1,multiply(X0,inverse(X3)))))) = X3,
    inference(forward_demodulation,[],[f14,f9]) ).

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

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

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

fof(f77,plain,
    ! [X2,X0,X1] : multiply(multiply(X0,X1),X2) = multiply(multiply(X0,X2),X1),
    inference(superposition,[],[f57,f36]) ).

fof(f124,plain,
    ! [X2,X0,X1] : multiply(X2,X1) = multiply(X2,multiply(multiply(X0,inverse(X0)),X1)),
    inference(superposition,[],[f57,f77]) ).

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

fof(f231,plain,
    ! [X0,X1] : multiply(multiply(X1,inverse(X0)),X0) = X1,
    inference(superposition,[],[f12,f173]) ).

fof(f246,plain,
    ! [X0,X1] : multiply(multiply(X1,X0),inverse(X0)) = X1,
    inference(forward_demodulation,[],[f231,f77]) ).

fof(f265,plain,
    ! [X2,X0,X1] : multiply(multiply(X0,X1),X2) = multiply(multiply(X1,X2),X0),
    inference(superposition,[],[f36,f246]) ).

fof(f266,plain,
    ! [X0,X1] : multiply(X0,X1) = multiply(X1,X0),
    inference(superposition,[],[f12,f246]) ).

fof(f2088,plain,
    ! [X2,X0,X1] : multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
    inference(superposition,[],[f265,f266]) ).

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

fof(f2912,plain,
    $false,
    inference(trivial_inequality_removal,[],[f2857]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : GRP515-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.37  % Computer : n001.cluster.edu
% 0.12/0.37  % Model    : x86_64 x86_64
% 0.12/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37  % Memory   : 8046.5625MB
% 0.12/0.37  % OS       : Linux 6.8.0-71-generic
% 0.12/0.37  % CPULimit : 300
% 0.12/0.37  % WCLimit  : 300
% 0.12/0.37  % DateTime : Sun Sep 27 10:12:15 UTC 2026
% 0.12/0.37  % CPUTime  : 
% 0.12/0.37  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.39  Running first-order model finding
% 0.12/0.39  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.52/0.52  % (3329172)Will run a generic schedule for satisfiability detection.
% 0.52/0.52  % (3329178)% WARNING: option uhcvi not known.
% 0.52/0.52  % (3329181)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3265719407:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.52/0.52  % (3329178)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1622573281:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.52/0.52  % (3329180)dis+10_1_sil=32000:sp=arity:random_seed=1819908669:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.52/0.52  % (3329177)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3116817592_2999 on theBenchmark for (2999ds/0Mi)
% 0.52/0.52  % (3329182)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1189102798:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.52/0.52  % TRYING [1]
% 0.52/0.52  % TRYING [2]
% 0.52/0.52  % TRYING [3]
% 0.52/0.52  % TRYING [4]
% 0.52/0.52  % (3329179)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=393709641:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.52/0.52  % (3329183)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1192453994:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.52/0.52  % (3329181)Instruction limit reached! 
% 0.52/0.52  % (3329181)------------------------------
% 0.52/0.52  % (3329181)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.52/0.52  % (3329181)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.52/0.52  % (3329181)CaDiCaL version: 2.1.3
% 0.52/0.52  % (3329181)Termination reason: Instruction limit
% 0.52/0.52  % (3329181)Termination phase: Saturation
% 0.52/0.52  % (3329181)Time elapsed: 0.045 s
% 0.52/0.52  % (3329181)Peak memory usage: 13 MB
% 0.52/0.52  % (3329181)Instructions burned: 118 (million)
% 0.52/0.52  % (3329180)Instruction limit reached! 
% 0.52/0.52  % (3329180)------------------------------
% 0.52/0.52  % (3329180)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.52/0.52  % (3329180)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.52/0.52  % (3329180)CaDiCaL version: 2.1.3
% 0.52/0.52  % (3329180)Termination reason: Instruction limit
% 0.52/0.52  % (3329180)Termination phase: Saturation
% 0.52/0.52  % (3329180)Time elapsed: 0.055 s
% 0.52/0.52  % (3329180)Peak memory usage: 12 MB
% 0.52/0.52  % (3329180)Instructions burned: 103 (million)
% 0.52/0.52  % TRYING [5]
% 0.52/0.52  % (3329193)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1561667499:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.52/0.52  % TRYING [1]
% 0.52/0.52  % TRYING [2]
% 0.52/0.52  % TRYING [3]
% 0.52/0.52  % TRYING [4]
% 0.52/0.52  % (3329182)Instruction limit reached! 
% 0.52/0.52  % (3329182)------------------------------
% 0.52/0.52  % (3329182)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.52/0.52  % (3329182)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.52/0.52  % (3329182)CaDiCaL version: 2.1.3
% 0.52/0.52  % (3329182)Termination reason: Instruction limit
% 0.52/0.52  % (3329182)Termination phase: Saturation
% 0.52/0.52  % (3329182)Time elapsed: 0.074 s
% 0.52/0.52  % (3329182)Peak memory usage: 13 MB
% 0.52/0.52  % (3329182)Instructions burned: 131 (million)
% 0.52/0.52  % (3329194)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=861093335:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 0.52/0.52  % (3329179) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3329172-3329179"...
% 0.52/0.52  % (3329179)...printing done.
% 0.52/0.52  % (3329179)Refutation found. Thanks to Tanya!
% 0.52/0.52  % SZS status Unsatisfiable for theBenchmark
% 0.52/0.52  % SZS output start Proof for theBenchmark
% See solution above
% 0.52/0.52  % (3329179)------------------------------
% 0.52/0.52  % (3329179)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.52/0.52  % (3329179)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.52/0.52  % (3329179)CaDiCaL version: 2.1.3
% 0.52/0.52  % (3329179)Termination reason: Refutation
% 0.52/0.52  % (3329179)Time elapsed: 0.073 s
% 0.52/0.52  % (3329179)Peak memory usage: 12 MB
% 0.52/0.52  % (3329179)Instructions burned: 114 (million)
% 0.52/0.52  % (3329172)Success in time 0.118 s
% 0.52/0.52  % Vampire exiting
%------------------------------------------------------------------------------