%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : GRP563-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 : n005.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.41s 0.51s
% Output : Refutation 0.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 3
% Syntax : Number of formulae : 33 ( 33 unt; 0 def)
% Number of atoms : 33 ( 32 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 : 62 ( 62 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : divide(divide(divide(X0,inverse(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,plain,
! [X0,X1] : divide(X0,inverse(X1)) = multiply(X0,X1),
inference(reorient_equations,[],[f2]) ).
fof(f4,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_3) ).
fof(f5,plain,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3)))),
inference(definition_unfolding,[],[f4,f3,f3,f3,f3]) ).
fof(f6,plain,
! [X2,X0,X1] : divide(X0,divide(divide(X1,inverse(X0)),divide(X1,inverse(X2)))) = X2,
inference(superposition,[],[f1,f1]) ).
fof(f7,plain,
! [X2,X3,X0,X1] : divide(divide(divide(divide(divide(X1,inverse(X0)),X2),inverse(X3)),divide(X1,X2)),X0) = X3,
inference(superposition,[],[f1,f1]) ).
fof(f13,plain,
! [X2,X3,X0,X1] : divide(divide(X0,divide(divide(divide(X1,inverse(inverse(X2))),X3),divide(X1,X3))),X0) = X2,
inference(superposition,[],[f7,f7]) ).
fof(f21,plain,
! [X2,X0] : divide(divide(X0,inverse(X2)),X0) = X2,
inference(forward_demodulation,[],[f13,f1]) ).
fof(f23,plain,
! [X0,X1] : divide(X0,divide(inverse(X1),inverse(X0))) = X1,
inference(superposition,[],[f21,f21]) ).
fof(f27,plain,
! [X0,X1] : divide(X0,divide(X1,X1)) = X0,
inference(superposition,[],[f1,f21]) ).
fof(f35,plain,
! [X0,X1] : divide(divide(X1,X1),inverse(X0)) = X0,
inference(superposition,[],[f27,f21]) ).
fof(f55,plain,
! [X2,X0,X1] : divide(X0,divide(X0,divide(divide(X1,X1),inverse(X2)))) = X2,
inference(superposition,[],[f6,f35]) ).
fof(f58,plain,
! [X2,X0,X1] : divide(divide(divide(divide(X1,X1),inverse(X2)),inverse(X0)),X0) = X2,
inference(superposition,[],[f1,f35]) ).
fof(f61,plain,
! [X2,X0] : divide(divide(X2,inverse(X0)),X0) = X2,
inference(forward_demodulation,[],[f58,f35]) ).
fof(f63,plain,
! [X2,X0] : divide(X0,divide(X0,X2)) = X2,
inference(forward_demodulation,[],[f55,f35]) ).
fof(f129,plain,
! [X0] : inverse(inverse(X0)) = X0,
inference(superposition,[],[f61,f35]) ).
fof(f152,plain,
! [X0,X1] : inverse(X0) = divide(divide(X1,X0),X1),
inference(superposition,[],[f21,f129]) ).
fof(f273,plain,
! [X0,X1] : divide(X0,X1) = inverse(divide(X1,X0)),
inference(superposition,[],[f152,f63]) ).
fof(f464,plain,
! [X0,X1] : divide(inverse(X0),inverse(X1)) = divide(X1,X0),
inference(superposition,[],[f6,f23]) ).
fof(f486,plain,
! [X0,X1] : divide(X0,inverse(X1)) = divide(X1,inverse(X0)),
inference(superposition,[],[f464,f129]) ).
fof(f489,plain,
! [X0,X1] : divide(inverse(X1),X0) = divide(inverse(X0),X1),
inference(superposition,[],[f464,f129]) ).
fof(f501,plain,
! [X2,X0,X1] : divide(X0,divide(divide(X0,X1),divide(inverse(X1),inverse(X2)))) = X2,
inference(superposition,[],[f6,f464]) ).
fof(f523,plain,
! [X2,X0,X1] : divide(X0,divide(divide(X0,X1),divide(X2,X1))) = X2,
inference(forward_demodulation,[],[f501,f464]) ).
fof(f723,plain,
divide(a3,inverse(divide(b3,inverse(c3)))) != divide(c3,inverse(divide(a3,inverse(b3)))),
inference(superposition,[],[f5,f486]) ).
fof(f770,plain,
divide(a3,inverse(divide(b3,inverse(c3)))) != divide(c3,divide(inverse(b3),a3)),
inference(forward_demodulation,[],[f723,f273]) ).
fof(f820,plain,
divide(c3,divide(inverse(b3),a3)) != divide(a3,divide(inverse(c3),b3)),
inference(forward_demodulation,[],[f770,f273]) ).
fof(f976,plain,
! [X2,X0,X1] : divide(X1,divide(X0,divide(X2,divide(X1,X0)))) = X2,
inference(superposition,[],[f523,f63]) ).
fof(f1112,plain,
! [X2,X0,X1] : divide(X0,inverse(divide(X1,X2))) = divide(X1,divide(X2,X0)),
inference(superposition,[],[f976,f61]) ).
fof(f1144,plain,
! [X2,X0,X1] : divide(X0,divide(X2,X1)) = divide(X1,divide(X2,X0)),
inference(forward_demodulation,[],[f1112,f273]) ).
fof(f1989,plain,
divide(a3,divide(inverse(c3),b3)) != divide(a3,divide(inverse(b3),c3)),
inference(superposition,[],[f820,f1144]) ).
fof(f2054,plain,
divide(a3,divide(inverse(b3),c3)) != divide(a3,divide(inverse(b3),c3)),
inference(forward_demodulation,[],[f1989,f489]) ).
fof(f2055,plain,
$false,
inference(trivial_inequality_removal,[],[f2054]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP563-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.12/0.39 % Computer : n005.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:07:17 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.42 Running first-order model finding
% 0.12/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.41/0.51 % (3769100)Will run a generic schedule for satisfiability detection.
% 0.41/0.51 % (3769110)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3800017954:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.41/0.51 % (3769106)% WARNING: option uhcvi not known.
% 0.41/0.51 % (3769107)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=132703711:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.41/0.51 % (3769106)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2405801963:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.41/0.51 % (3769108)dis+10_1_sil=32000:sp=arity:random_seed=2899525228:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.41/0.51 % (3769111)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2407377891:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.41/0.51 % (3769109)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2054505700:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.41/0.51 % (3769105)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1038511113_2999 on theBenchmark for (2999ds/0Mi)
% 0.41/0.51 % TRYING [1]
% 0.41/0.51 % TRYING [2]
% 0.41/0.51 % TRYING [3]
% 0.41/0.51 % TRYING [4]
% 0.41/0.51 % (3769110)Instruction limit reached!
% 0.41/0.51 % (3769110)------------------------------
% 0.41/0.51 % (3769110)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.41/0.51 % (3769110)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.41/0.51 % (3769110)CaDiCaL version: 2.1.3
% 0.41/0.51 % (3769110)Termination reason: Instruction limit
% 0.41/0.51 % (3769110)Termination phase: Saturation
% 0.41/0.51 % (3769110)Time elapsed: 0.040 s
% 0.41/0.51 % (3769110)Peak memory usage: 13 MB
% 0.41/0.51 % (3769110)Instructions burned: 133 (million)
% 0.41/0.51 % (3769119)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2234617118:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.41/0.51 % (3769107) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3769100-3769107"...
% 0.41/0.51 % TRYING [1]
% 0.41/0.51 % TRYING [2]
% 0.41/0.51 % TRYING [3]
% 0.41/0.51 % (3769107)...printing done.
% 0.41/0.51 % (3769107)Refutation found. Thanks to Tanya!
% 0.41/0.51 % SZS status Unsatisfiable for theBenchmark
% 0.41/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.41/0.51 % (3769107)------------------------------
% 0.41/0.51 % (3769107)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.41/0.51 % (3769107)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.41/0.51 % (3769107)CaDiCaL version: 2.1.3
% 0.41/0.51 % (3769107)Termination reason: Refutation
% 0.41/0.51 % (3769107)Time elapsed: 0.045 s
% 0.41/0.51 % (3769107)Peak memory usage: 12 MB
% 0.41/0.51 % (3769107)Instructions burned: 77 (million)
% 0.41/0.51 % (3769100)Success in time 0.082 s
% 0.41/0.51 % Vampire exiting
%------------------------------------------------------------------------------