%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : GRP517-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 : n004.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.18s 0.48s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 2
% 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 : 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 : 19 ( 19 !; 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(inverse(a1),a1) != multiply(inverse(b1),b1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_1) ).
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(f11,plain,
! [X0,X1] : multiply(multiply(inverse(X0),X1),X0) = X1,
inference(superposition,[],[f3,f1]) ).
fof(f14,plain,
! [X2,X0,X1] : multiply(X0,X1) = multiply(multiply(inverse(multiply(inverse(X1),X2)),X0),X2),
inference(superposition,[],[f11,f1]) ).
fof(f23,plain,
! [X0,X1] : multiply(inverse(X1),multiply(X0,X1)) = X0,
inference(superposition,[],[f1,f14]) ).
fof(f28,plain,
! [X0,X1] : inverse(X1) = multiply(inverse(multiply(X0,X1)),X0),
inference(superposition,[],[f23,f23]) ).
fof(f50,plain,
! [X0,X1] : multiply(inverse(X1),X1) = multiply(inverse(X0),X0),
inference(superposition,[],[f14,f28]) ).
fof(f125,plain,
! [X0] : multiply(inverse(a1),a1) != multiply(inverse(X0),X0),
inference(superposition,[],[f2,f50]) ).
fof(f137,plain,
$false,
inference(equality_resolution,[],[f125]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP517-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.14/0.39 % Computer : n004.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:22 UTC 2026
% 0.14/0.39 % CPUTime :
% 0.14/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.14/0.42 Running first-order model finding
% 0.14/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.18/0.48 % (3276485)Will run a generic schedule for satisfiability detection.
% 0.18/0.48 % (3276502)dis+10_1_sil=32000:sp=arity:random_seed=377459300:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.18/0.48 % (3276499)% WARNING: option uhcvi not known.
% 0.18/0.48 % (3276498)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2306102049_2999 on theBenchmark for (2999ds/0Mi)
% 0.18/0.48 % (3276499)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3140637001:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.18/0.48 % (3276500)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1662301614:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.18/0.48 % (3276503)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1533684475:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.18/0.48 % TRYING [1]
% 0.18/0.48 % (3276504)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3681686214:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.18/0.48 % TRYING [2]
% 0.18/0.48 % (3276505)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3427037283:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.18/0.48 % TRYING [3]
% 0.18/0.48 % TRYING [4]
% 0.18/0.48 % (3276505) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3276485-3276505"...
% 0.18/0.48 % (3276505)...printing done.
% 0.18/0.48 % (3276505)Refutation found. Thanks to Tanya!
% 0.18/0.48 % SZS status Unsatisfiable for theBenchmark
% 0.18/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.48 % (3276505)------------------------------
% 0.18/0.48 % (3276505)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.48 % (3276505)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.48 % (3276505)CaDiCaL version: 2.1.3
% 0.18/0.48 % (3276505)Termination reason: Refutation
% 0.18/0.48 % (3276505)Time elapsed: 0.007 s
% 0.18/0.48 % (3276505)Peak memory usage: 11 MB
% 0.18/0.48 % (3276505)Instructions burned: 9 (million)
% 0.18/0.48 % (3276485)Success in time 0.05 s
% 0.18/0.48 % Vampire exiting
%------------------------------------------------------------------------------