%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : GRP559-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 : n003.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:06 AM UTC 2026
% Result : Unsatisfiable 0.21s 0.60s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 3
% Syntax : Number of formulae : 26 ( 26 unt; 0 def)
% Number of atoms : 26 ( 25 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 7 ( 7 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 46 ( 46 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : divide(X0,inverse(divide(divide(X1,X2),divide(X0,X2)))) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
fof(f2,axiom,
! [X0,X1] : multiply(X0,X1) = divide(X0,inverse(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
fof(f3,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_3) ).
fof(f4,plain,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3)))),
inference(definition_unfolding,[],[f3,f2,f2,f2,f2]) ).
fof(f5,plain,
! [X2,X3,X0,X1] : divide(X1,inverse(divide(X0,divide(X1,inverse(divide(divide(X0,X3),divide(X2,X3))))))) = X2,
inference(superposition,[],[f1,f1]) ).
fof(f11,plain,
! [X0,X1] : divide(X1,inverse(divide(X0,X0))) = X1,
inference(superposition,[],[f5,f1]) ).
fof(f15,plain,
! [X0,X1] : divide(X0,inverse(divide(X1,X0))) = X1,
inference(superposition,[],[f5,f11]) ).
fof(f26,plain,
! [X0,X1] : divide(inverse(divide(X1,X1)),inverse(X0)) = X0,
inference(superposition,[],[f15,f11]) ).
fof(f55,plain,
! [X2,X3,X0,X1] : divide(X0,divide(inverse(divide(X1,X1)),inverse(divide(divide(X0,X2),divide(X3,X2))))) = X3,
inference(superposition,[],[f5,f26]) ).
fof(f64,plain,
! [X2,X0,X1] : divide(inverse(divide(X1,X1)),inverse(divide(divide(X2,inverse(X0)),X0))) = X2,
inference(superposition,[],[f1,f26]) ).
fof(f66,plain,
! [X2,X0] : divide(divide(X2,inverse(X0)),X0) = X2,
inference(forward_demodulation,[],[f64,f26]) ).
fof(f67,plain,
! [X2,X3,X0] : divide(X0,divide(divide(X0,X2),divide(X3,X2))) = X3,
inference(forward_demodulation,[],[f55,f26]) ).
fof(f183,plain,
! [X0,X1] : divide(X0,divide(X0,X1)) = X1,
inference(superposition,[],[f66,f15]) ).
fof(f193,plain,
! [X0,X1] : divide(X0,inverse(X1)) = divide(X1,inverse(X0)),
inference(superposition,[],[f15,f66]) ).
fof(f211,plain,
! [X0,X1] : divide(X1,X0) = inverse(divide(X0,X1)),
inference(superposition,[],[f183,f15]) ).
fof(f610,plain,
divide(a3,inverse(divide(b3,inverse(c3)))) != divide(c3,inverse(divide(a3,inverse(b3)))),
inference(superposition,[],[f4,f193]) ).
fof(f632,plain,
! [X0,X1] : divide(inverse(X0),X1) = inverse(divide(X0,inverse(X1))),
inference(superposition,[],[f211,f193]) ).
fof(f641,plain,
! [X0,X1] : divide(inverse(X1),X0) = divide(inverse(X0),X1),
inference(forward_demodulation,[],[f632,f211]) ).
fof(f659,plain,
divide(a3,inverse(divide(b3,inverse(c3)))) != divide(c3,divide(inverse(b3),a3)),
inference(forward_demodulation,[],[f610,f211]) ).
fof(f709,plain,
divide(c3,divide(inverse(b3),a3)) != divide(a3,divide(inverse(c3),b3)),
inference(forward_demodulation,[],[f659,f211]) ).
fof(f1230,plain,
! [X2,X0,X1] : divide(X1,X0) = divide(divide(X1,divide(X0,X2)),X2),
inference(superposition,[],[f67,f67]) ).
fof(f1363,plain,
! [X2,X0,X1] : divide(X2,inverse(divide(X0,X1))) = divide(X0,divide(X1,X2)),
inference(superposition,[],[f15,f1230]) ).
fof(f1387,plain,
! [X2,X0,X1] : divide(X0,divide(X1,X2)) = divide(X2,divide(X1,X0)),
inference(forward_demodulation,[],[f1363,f211]) ).
fof(f2025,plain,
divide(a3,divide(inverse(c3),b3)) != divide(a3,divide(inverse(b3),c3)),
inference(superposition,[],[f709,f1387]) ).
fof(f2092,plain,
divide(a3,divide(inverse(b3),c3)) != divide(a3,divide(inverse(b3),c3)),
inference(forward_demodulation,[],[f2025,f641]) ).
fof(f2093,plain,
$false,
inference(trivial_inequality_removal,[],[f2092]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP559-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.12/0.39 % Computer : n003.cluster.edu
% 0.12/0.39 % Model : x86_64 x86_64
% 0.12/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.39 % Memory : 8046.5625MB
% 0.12/0.39 % OS : Linux 6.8.0-71-generic
% 0.12/0.39 % CPULimit : 300
% 0.12/0.39 % WCLimit : 300
% 0.12/0.39 % DateTime : Sun Sep 27 10:09:25 UTC 2026
% 0.12/0.40 % CPUTime :
% 0.12/0.40 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.17/0.45 Running first-order model finding
% 0.17/0.45 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.21/0.60 % (276721)Will run a generic schedule for satisfiability detection.
% 0.21/0.60 % (276729)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3113689686_2999 on theBenchmark for (2999ds/0Mi)
% 0.21/0.60 % TRYING [1]
% 0.21/0.60 % TRYING [2]
% 0.21/0.60 % TRYING [3]
% 0.21/0.60 % TRYING [4]
% 0.21/0.60 % (276730)% WARNING: option uhcvi not known.
% 0.21/0.60 % (276732)dis+10_1_sil=32000:sp=arity:random_seed=4271332805:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.21/0.60 % (276730)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1611779447:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.21/0.60 % (276731)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1706179723:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.21/0.60 % (276736)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1507114609:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.21/0.60 % (276734)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1965215655:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.21/0.60 % (276735)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=242921474:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.21/0.60 % TRYING [5]
% 0.21/0.60 % (276731) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-276721-276731"...
% 0.21/0.60 % (276731)...printing done.
% 0.21/0.60 % (276731)Refutation found. Thanks to Tanya!
% 0.21/0.60 % SZS status Unsatisfiable for theBenchmark
% 0.21/0.60 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.60 % (276731)------------------------------
% 0.21/0.60 % (276731)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.60 % (276731)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.60 % (276731)CaDiCaL version: 2.1.3
% 0.21/0.60 % (276731)Termination reason: Refutation
% 0.21/0.60 % (276731)Time elapsed: 0.073 s
% 0.21/0.60 % (276731)Peak memory usage: 12 MB
% 0.21/0.60 % (276731)Instructions burned: 70 (million)
% 0.21/0.60 % (276721)Success in time 0.136 s
% 0.21/0.60 % Vampire exiting
%------------------------------------------------------------------------------