%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : GRP468-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 : n008.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:54 AM UTC 2026
% Result : Unsatisfiable 0.47s 0.50s
% Output : Refutation 0.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 3
% Syntax : Number of formulae : 24 ( 24 unt; 0 def)
% Number of atoms : 24 ( 23 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 6 ( 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 : 58 ( 58 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X3,X0,X1] : divide(divide(X0,X0),divide(X1,divide(divide(X2,divide(X3,X1)),inverse(X3)))) = X2,
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(f6,plain,
! [X2,X3,X0,X1,X4] : divide(X4,X4) = divide(divide(X1,X1),divide(divide(divide(X0,divide(X2,X3)),inverse(X2)),divide(X0,inverse(X3)))),
inference(superposition,[],[f1,f1]) ).
fof(f16,plain,
! [X0,X1] : divide(X0,X0) = divide(X1,X1),
inference(superposition,[],[f6,f6]) ).
fof(f32,plain,
! [X2,X3,X0,X1] : divide(divide(X1,X1),divide(X2,divide(divide(X3,divide(X0,X0)),inverse(X2)))) = X3,
inference(superposition,[],[f1,f16]) ).
fof(f34,plain,
! [X2,X3,X0,X1] : divide(X3,X2) = divide(divide(X1,X1),divide(X2,divide(divide(X0,X0),inverse(X3)))),
inference(superposition,[],[f1,f16]) ).
fof(f70,plain,
! [X2,X0,X1] : divide(X0,X0) = divide(X1,divide(divide(X2,X2),inverse(X1))),
inference(superposition,[],[f34,f16]) ).
fof(f120,plain,
! [X2,X3,X0,X1] : divide(divide(X1,X1),divide(inverse(X2),divide(divide(X0,X0),inverse(divide(X3,X3))))) = X2,
inference(superposition,[],[f1,f70]) ).
fof(f123,plain,
! [X2,X3] : divide(divide(X3,X3),inverse(X2)) = X2,
inference(forward_demodulation,[],[f120,f34]) ).
fof(f131,plain,
! [X2,X0,X1] : divide(divide(X1,X1),divide(X2,X0)) = divide(X0,X2),
inference(superposition,[],[f1,f123]) ).
fof(f241,plain,
! [X2,X3,X0] : divide(divide(divide(X0,divide(X3,X2)),inverse(X3)),X2) = X0,
inference(superposition,[],[f131,f1]) ).
fof(f262,plain,
! [X2,X3,X0,X1] : divide(X0,divide(X2,X2)) = divide(divide(X3,X3),divide(inverse(X0),divide(X1,X1))),
inference(superposition,[],[f34,f131]) ).
fof(f283,plain,
! [X2,X0,X1] : divide(X0,divide(X2,X2)) = divide(divide(X1,X1),inverse(X0)),
inference(forward_demodulation,[],[f262,f131]) ).
fof(f301,plain,
! [X2,X0] : divide(X0,divide(X2,X2)) = X0,
inference(forward_demodulation,[],[f283,f123]) ).
fof(f324,plain,
! [X2,X0,X1] : divide(divide(X1,X1),divide(X2,divide(X0,inverse(X2)))) = X0,
inference(superposition,[],[f32,f301]) ).
fof(f351,plain,
! [X2,X0] : divide(divide(X0,inverse(X2)),X2) = X0,
inference(forward_demodulation,[],[f324,f131]) ).
fof(f370,plain,
! [X0,X1] : divide(X0,X1) = inverse(divide(X1,X0)),
inference(superposition,[],[f351,f131]) ).
fof(f1122,plain,
! [X2,X0,X1] : divide(X0,inverse(divide(X1,X2))) = divide(divide(X0,inverse(X1)),X2),
inference(superposition,[],[f241,f351]) ).
fof(f1180,plain,
! [X2,X0,X1] : divide(X0,divide(X2,X1)) = divide(divide(X0,inverse(X1)),X2),
inference(forward_demodulation,[],[f1122,f370]) ).
fof(f1336,plain,
divide(a3,inverse(divide(b3,inverse(c3)))) != divide(a3,divide(inverse(c3),b3)),
inference(superposition,[],[f4,f1180]) ).
fof(f1350,plain,
divide(a3,divide(inverse(c3),b3)) != divide(a3,divide(inverse(c3),b3)),
inference(forward_demodulation,[],[f1336,f370]) ).
fof(f1351,plain,
$false,
inference(trivial_inequality_removal,[],[f1350]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP468-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.38 % Computer : n008.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Sun Sep 27 10:06:11 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.16/0.41 Running first-order model finding
% 0.16/0.41 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.47/0.50 % (996655)Will run a generic schedule for satisfiability detection.
% 0.47/0.50 % (996661)% WARNING: option uhcvi not known.
% 0.47/0.50 % (996661)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1900841080:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.47/0.50 % (996660)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3535387528_2999 on theBenchmark for (2999ds/0Mi)
% 0.47/0.50 % (996663)dis+10_1_sil=32000:sp=arity:random_seed=3130277630:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.47/0.50 % (996662)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2299457076:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.47/0.50 % (996664)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1233338046:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.47/0.50 % TRYING [1]
% 0.47/0.50 % TRYING [2]
% 0.47/0.50 % TRYING [3]
% 0.47/0.50 % (996666)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1610477897:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.47/0.50 % TRYING [4]
% 0.47/0.50 % (996665)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1117926932:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.47/0.50 % (996662) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-996655-996662"...
% 0.47/0.50 % (996662)...printing done.
% 0.47/0.50 % (996662)Refutation found. Thanks to Tanya!
% 0.47/0.50 % SZS status Unsatisfiable for theBenchmark
% 0.47/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.47/0.50 % (996662)------------------------------
% 0.47/0.50 % (996662)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.47/0.50 % (996662)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.47/0.50 % (996662)CaDiCaL version: 2.1.3
% 0.47/0.50 % (996662)Termination reason: Refutation
% 0.47/0.50 % (996662)Time elapsed: 0.031 s
% 0.47/0.50 % (996662)Peak memory usage: 12 MB
% 0.47/0.50 % (996662)Instructions burned: 50 (million)
% 0.47/0.50 % (996655)Success in time 0.072 s
% 0.47/0.50 % Vampire exiting
%------------------------------------------------------------------------------