%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : GRP513-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 : n016.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.17s 0.48s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% 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 : 4 ( 4 ~; 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 : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 44 ( 44 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : multiply(X0,multiply(multiply(X1,X2),inverse(multiply(X0,X2)))) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
fof(f2,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_1) ).
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(f123,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,[],[f123,f1]) ).
fof(f177,plain,
! [X0,X1] : multiply(X0,inverse(X0)) = multiply(X1,inverse(X1)),
inference(superposition,[],[f123,f12]) ).
fof(f240,plain,
! [X0,X1] : multiply(multiply(X1,inverse(X0)),X0) = X1,
inference(superposition,[],[f1,f173]) ).
fof(f242,plain,
! [X0,X1] : multiply(multiply(X1,X0),inverse(X0)) = X1,
inference(forward_demodulation,[],[f240,f77]) ).
fof(f266,plain,
! [X0,X1] : multiply(X0,X1) = multiply(X1,X0),
inference(superposition,[],[f12,f242]) ).
fof(f327,plain,
multiply(inverse(a1),a1) != multiply(b1,inverse(b1)),
inference(superposition,[],[f2,f266]) ).
fof(f360,plain,
multiply(b1,inverse(b1)) != multiply(a1,inverse(a1)),
inference(forward_demodulation,[],[f327,f266]) ).
fof(f764,plain,
! [X0] : multiply(X0,inverse(X0)) != multiply(a1,inverse(a1)),
inference(superposition,[],[f360,f177]) ).
fof(f765,plain,
$false,
inference(forward_subsumption_resolution,[],[f764,f177]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP513-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.38 % Computer : n016.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 10:11:02 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.42 Running first-order model finding
% 0.11/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.17/0.48 % (2397774)Will run a generic schedule for satisfiability detection.
% 0.17/0.48 % (2397785)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4042120542:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/0.48 % (2397780)% WARNING: option uhcvi not known.
% 0.17/0.48 % (2397779)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2225630980_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.48 % (2397781)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1376166548:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.48 % (2397780)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3628797314:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.48 % (2397782)dis+10_1_sil=32000:sp=arity:random_seed=2383094062:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.48 % (2397784)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3572603025:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.48 % TRYING [1]
% 0.17/0.48 % (2397783)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1505639767:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.48 % TRYING [2]
% 0.17/0.48 % TRYING [3]
% 0.17/0.48 % TRYING [4]
% 0.17/0.48 % (2397781) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2397774-2397781"...
% 0.17/0.48 % (2397781)...printing done.
% 0.17/0.48 % (2397781)Refutation found. Thanks to Tanya!
% 0.17/0.48 % SZS status Unsatisfiable for theBenchmark
% 0.17/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.49 % (2397781)------------------------------
% 0.17/0.49 % (2397781)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.49 % (2397781)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.49 % (2397781)CaDiCaL version: 2.1.3
% 0.17/0.49 % (2397781)Termination reason: Refutation
% 0.17/0.49 % (2397781)Time elapsed: 0.022 s
% 0.17/0.49 % (2397781)Peak memory usage: 11 MB
% 0.17/0.49 % (2397781)Instructions burned: 36 (million)
% 0.17/0.49 % (2397774)Success in time 0.061 s
% 0.17/0.49 % Vampire exiting
%------------------------------------------------------------------------------