%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : GRP510-1 : TPTP v9.3.1. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n019.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:17:59 AM UTC 2026
% Result : Unsatisfiable 0.19s 0.47s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 2
% 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 : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 30 ( 30 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : multiply(multiply(multiply(X0,X1),X2),inverse(multiply(X0,X2))) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
fof(f2,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_2) ).
fof(f3,plain,
a2 != multiply(multiply(inverse(b2),b2),a2),
inference(reorient_equations,[],[f2]) ).
fof(f4,plain,
! [X2,X3,X0,X1] : inverse(multiply(X1,X2)) = multiply(multiply(X0,X3),inverse(multiply(multiply(multiply(X1,X0),X2),X3))),
inference(superposition,[],[f1,f1]) ).
fof(f5,plain,
! [X2,X0,X1] : multiply(X0,inverse(multiply(multiply(X1,X0),inverse(multiply(X1,X2))))) = X2,
inference(superposition,[],[f1,f1]) ).
fof(f23,plain,
! [X2,X0,X1] : inverse(multiply(X1,X2)) = multiply(multiply(X0,inverse(multiply(X1,X2))),inverse(X0)),
inference(superposition,[],[f4,f1]) ).
fof(f26,plain,
! [X2,X0,X1] : inverse(multiply(X1,multiply(X2,inverse(multiply(multiply(X1,X2),X0))))) = X0,
inference(superposition,[],[f4,f5]) ).
fof(f40,plain,
! [X2,X0,X1] : inverse(multiply(multiply(X0,X1),inverse(multiply(X0,multiply(X1,X2))))) = X2,
inference(superposition,[],[f26,f4]) ).
fof(f57,plain,
! [X3,X0] : multiply(multiply(X3,X0),inverse(X3)) = X0,
inference(superposition,[],[f23,f26]) ).
fof(f82,plain,
! [X0,X1] : inverse(X1) = multiply(X0,inverse(multiply(X1,X0))),
inference(superposition,[],[f57,f57]) ).
fof(f87,plain,
! [X0,X1] : multiply(X0,inverse(multiply(X1,inverse(X1)))) = X0,
inference(superposition,[],[f1,f57]) ).
fof(f109,plain,
! [X0] : inverse(inverse(X0)) = X0,
inference(superposition,[],[f40,f82]) ).
fof(f164,plain,
! [X0,X1] : multiply(multiply(X1,inverse(X1)),X0) = X0,
inference(superposition,[],[f87,f57]) ).
fof(f201,plain,
! [X0,X1] : multiply(multiply(inverse(X0),X0),X1) = X1,
inference(superposition,[],[f164,f109]) ).
fof(f270,plain,
a2 != a2,
inference(superposition,[],[f3,f201]) ).
fof(f292,plain,
$false,
inference(trivial_inequality_removal,[],[f270]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP510-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.14/0.39 % Computer : n019.cluster.edu
% 0.14/0.39 % Model : x86_64 x86_64
% 0.14/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.39 % Memory : 8046.5625MB
% 0.14/0.39 % OS : Linux 6.8.0-71-generic
% 0.14/0.39 % CPULimit : 300
% 0.14/0.39 % WCLimit : 300
% 0.14/0.39 % DateTime : Sun Sep 27 10:06:19 UTC 2026
% 0.14/0.39 % CPUTime :
% 0.14/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.14/0.42 Running first-order model finding
% 0.14/0.42 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.19/0.47 % (2859029)Will run a generic schedule for satisfiability detection.
% 0.19/0.47 % (2859041)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1239577829:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.47 % (2859040)% WARNING: option uhcvi not known.
% 0.19/0.47 % (2859041) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2859029-2859041"...
% 0.19/0.47 % (2859041)...printing done.
% 0.19/0.47 % (2859039)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2572475188_2999 on theBenchmark for (2999ds/0Mi)
% 0.19/0.47 % (2859041)Refutation found. Thanks to Tanya!
% 0.19/0.47 % SZS status Unsatisfiable for theBenchmark
% 0.19/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.47 % (2859041)------------------------------
% 0.19/0.47 % (2859041)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.47 % (2859041)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.47 % (2859041)CaDiCaL version: 2.1.3
% 0.19/0.47 % (2859041)Termination reason: Refutation
% 0.19/0.47 % (2859041)Time elapsed: 0.006 s
% 0.19/0.47 % (2859041)Peak memory usage: 11 MB
% 0.19/0.47 % (2859041)Instructions burned: 18 (million)
% 0.19/0.47 % (2859029)Success in time 0.032 s
% 0.19/0.47 % Vampire exiting
%------------------------------------------------------------------------------