%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : GRP445-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 : 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:17:51 AM UTC 2026
% Result : Unsatisfiable 0.14s 0.50s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 4
% Syntax : Number of formulae : 25 ( 25 unt; 0 def)
% Number of atoms : 25 ( 24 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 : 8 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 50 ( 50 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : divide(X0,divide(divide(divide(divide(X0,X0),X1),X2),divide(divide(divide(X0,X0),X0),X2))) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
fof(f2,axiom,
! [X2,X0,X1] : multiply(X0,X1) = divide(X0,divide(divide(X2,X2),X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
fof(f3,axiom,
! [X0,X1] : inverse(X0) = divide(divide(X1,X1),X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',inverse) ).
fof(f4,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_1) ).
fof(f5,plain,
! [X0,X1] : multiply(X0,X1) = divide(X0,inverse(X1)),
inference(forward_demodulation,[],[f2,f3]) ).
fof(f6,plain,
! [X2,X0,X1] : divide(X0,divide(divide(divide(divide(X0,X0),X1),X2),divide(inverse(X0),X2))) = X1,
inference(forward_demodulation,[],[f1,f3]) ).
fof(f7,plain,
! [X2,X0,X1] : divide(X0,divide(divide(inverse(X1),X2),divide(inverse(X0),X2))) = X1,
inference(forward_demodulation,[],[f6,f3]) ).
fof(f8,plain,
! [X0,X1] : inverse(X1) = divide(inverse(divide(X0,X0)),X1),
inference(superposition,[],[f3,f3]) ).
fof(f11,plain,
! [X0,X1] : multiply(divide(X0,X0),X1) = inverse(inverse(X1)),
inference(superposition,[],[f3,f5]) ).
fof(f13,plain,
! [X2,X3,X0,X1] : divide(X1,divide(X0,divide(inverse(X1),divide(divide(inverse(X0),X3),divide(inverse(inverse(X2)),X3))))) = X2,
inference(superposition,[],[f7,f7]) ).
fof(f16,plain,
! [X0,X1] : divide(X0,inverse(divide(inverse(X0),inverse(X1)))) = X1,
inference(superposition,[],[f7,f3]) ).
fof(f21,plain,
! [X0,X1] : multiply(X0,divide(inverse(X0),inverse(X1))) = X1,
inference(forward_demodulation,[],[f16,f5]) ).
fof(f26,plain,
! [X0,X1] : multiply(X0,multiply(inverse(X0),X1)) = X1,
inference(forward_demodulation,[],[f21,f5]) ).
fof(f27,plain,
! [X0,X1] : multiply(inverse(inverse(X1)),X0) = multiply(X1,X0),
inference(superposition,[],[f26,f26]) ).
fof(f36,plain,
! [X0,X1] : inverse(inverse(X0)) = multiply(inverse(divide(X1,X1)),X0),
inference(superposition,[],[f5,f8]) ).
fof(f55,plain,
! [X0,X1] : inverse(inverse(multiply(inverse(divide(X0,X0)),X1))) = X1,
inference(superposition,[],[f26,f11]) ).
fof(f56,plain,
! [X1] : inverse(inverse(inverse(inverse(X1)))) = X1,
inference(forward_demodulation,[],[f55,f36]) ).
fof(f60,plain,
! [X0,X1] : multiply(inverse(inverse(inverse(X0))),multiply(X0,X1)) = X1,
inference(superposition,[],[f26,f56]) ).
fof(f64,plain,
! [X0,X1] : multiply(inverse(X0),multiply(X0,X1)) = X1,
inference(forward_demodulation,[],[f60,f27]) ).
fof(f168,plain,
! [X0,X1] : divide(X1,divide(X0,X0)) = X1,
inference(superposition,[],[f13,f7]) ).
fof(f363,plain,
! [X0,X1] : divide(X1,inverse(divide(X0,X0))) = X1,
inference(superposition,[],[f168,f3]) ).
fof(f402,plain,
! [X0,X1] : multiply(X1,divide(X0,X0)) = X1,
inference(forward_demodulation,[],[f363,f5]) ).
fof(f563,plain,
! [X0,X1] : divide(X1,X1) = multiply(inverse(X0),X0),
inference(superposition,[],[f64,f402]) ).
fof(f2786,plain,
! [X0] : divide(X0,X0) != multiply(inverse(a1),a1),
inference(superposition,[],[f4,f563]) ).
fof(f2796,plain,
$false,
inference(forward_subsumption_resolution,[],[f2786,f563]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP445-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.09/0.37 % Computer : n004.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Sun Sep 27 10:04:52 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.41 Running first-order model finding
% 0.09/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.14/0.50 % (3272117)Will run a generic schedule for satisfiability detection.
% 0.14/0.50 % (3272127)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1309505461:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.14/0.50 % (3272123)% WARNING: option uhcvi not known.
% 0.14/0.50 % (3272122)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1192566958_2999 on theBenchmark for (2999ds/0Mi)
% 0.14/0.50 % (3272123)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=220790432:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.14/0.50 % (3272124)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2164128950:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.14/0.50 % (3272125)dis+10_1_sil=32000:sp=arity:random_seed=3725193798:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.14/0.50 % (3272128)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=865519874:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.14/0.50 % (3272126)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1385560887:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.14/0.50 % TRYING [1]
% 0.14/0.50 % TRYING [2]
% 0.14/0.50 % TRYING [3]
% 0.14/0.50 % TRYING [4]
% 0.14/0.50 % TRYING [5]
% 0.14/0.50 % (3272127)Instruction limit reached!
% 0.14/0.50 % (3272127)------------------------------
% 0.14/0.50 % (3272127)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.14/0.50 % (3272127)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.14/0.50 % (3272127)CaDiCaL version: 2.1.3
% 0.14/0.50 % (3272127)Termination reason: Instruction limit
% 0.14/0.50 % (3272127)Termination phase: Saturation
% 0.14/0.50 % (3272127)Time elapsed: 0.042 s
% 0.14/0.50 % (3272127)Peak memory usage: 12 MB
% 0.14/0.50 % (3272127)Instructions burned: 134 (million)
% 0.14/0.50 % (3272126) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3272117-3272126"...
% 0.14/0.50 % (3272126)...printing done.
% 0.14/0.50 % (3272126)Refutation found. Thanks to Tanya!
% 0.14/0.50 % SZS status Unsatisfiable for theBenchmark
% 0.14/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.50 % (3272126)------------------------------
% 0.14/0.50 % (3272126)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.14/0.50 % (3272126)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.14/0.50 % (3272126)CaDiCaL version: 2.1.3
% 0.14/0.50 % (3272126)Termination reason: Refutation
% 0.14/0.50 % (3272126)Time elapsed: 0.043 s
% 0.14/0.50 % (3272126)Peak memory usage: 12 MB
% 0.14/0.50 % (3272126)Instructions burned: 77 (million)
% 0.14/0.50 % (3272117)Success in time 0.085 s
% 0.14/0.50 % Vampire exiting
%------------------------------------------------------------------------------