%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : GRP588-1 : TPTP v9.3.1. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n014.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:10 AM UTC 2026
% Result : Unsatisfiable 0.13s 0.49s
% Output : Refutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 3
% Syntax : Number of formulae : 31 ( 31 unt; 0 def)
% Number of atoms : 31 ( 30 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 9 ( 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 : 73 ( 73 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : double_divide(X0,inverse(double_divide(inverse(double_divide(double_divide(X0,X1),inverse(X2))),X1))) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
fof(f2,axiom,
! [X0,X1] : multiply(X0,X1) = inverse(double_divide(X1,X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
fof(f3,negated_conjecture,
multiply(a,b) != multiply(b,a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_4) ).
fof(f4,plain,
inverse(double_divide(b,a)) != inverse(double_divide(a,b)),
inference(definition_unfolding,[],[f3,f2,f2]) ).
fof(f6,plain,
! [X2,X3,X0,X1] : double_divide(inverse(double_divide(double_divide(double_divide(X1,X2),X3),inverse(X0))),X3) = double_divide(X1,inverse(double_divide(inverse(X0),X2))),
inference(superposition,[],[f1,f1]) ).
fof(f11,plain,
! [X2,X0,X1] : double_divide(double_divide(X0,X2),inverse(double_divide(X0,inverse(double_divide(inverse(X1),X2))))) = X1,
inference(superposition,[],[f1,f6]) ).
fof(f22,plain,
! [X2,X0,X1] : double_divide(double_divide(double_divide(inverse(X1),X2),inverse(double_divide(inverse(X0),X2))),inverse(X0)) = X1,
inference(superposition,[],[f11,f11]) ).
fof(f31,plain,
! [X2,X0,X1] : double_divide(X0,inverse(double_divide(double_divide(double_divide(inverse(X1),X2),X2),inverse(X0)))) = X1,
inference(superposition,[],[f22,f1]) ).
fof(f43,plain,
! [X2,X3,X0,X1] : double_divide(double_divide(double_divide(double_divide(inverse(X0),X1),X1),inverse(double_divide(double_divide(inverse(X2),X3),X3))),inverse(X0)) = X2,
inference(superposition,[],[f31,f31]) ).
fof(f47,plain,
! [X2,X3,X0,X1] : double_divide(X1,inverse(double_divide(inverse(X0),X2))) = double_divide(double_divide(double_divide(inverse(X0),X3),X3),inverse(double_divide(X1,X2))),
inference(superposition,[],[f1,f31]) ).
fof(f88,plain,
! [X2,X3,X0,X1] : double_divide(double_divide(double_divide(inverse(X0),X1),X1),inverse(double_divide(inverse(X2),inverse(double_divide(double_divide(inverse(X2),X3),X3))))) = X0,
inference(superposition,[],[f31,f47]) ).
fof(f95,plain,
! [X2,X3,X0] : double_divide(inverse(X2),inverse(double_divide(inverse(X0),inverse(double_divide(double_divide(inverse(X2),X3),X3))))) = X0,
inference(forward_demodulation,[],[f88,f47]) ).
fof(f107,plain,
! [X2,X0,X1] : double_divide(double_divide(inverse(X1),inverse(double_divide(double_divide(inverse(X1),X2),X2))),inverse(X0)) = X0,
inference(superposition,[],[f95,f1]) ).
fof(f143,plain,
! [X2,X3,X0,X1] : double_divide(X0,inverse(double_divide(double_divide(inverse(X1),inverse(double_divide(double_divide(inverse(X1),X2),X2))),inverse(double_divide(inverse(X3),inverse(X0)))))) = X3,
inference(superposition,[],[f11,f107]) ).
fof(f148,plain,
! [X3,X0] : double_divide(X0,inverse(double_divide(inverse(X3),inverse(X0)))) = X3,
inference(forward_demodulation,[],[f143,f107]) ).
fof(f187,plain,
! [X0,X1] : double_divide(double_divide(X1,inverse(X1)),inverse(X0)) = X0,
inference(superposition,[],[f148,f1]) ).
fof(f217,plain,
! [X0,X1] : double_divide(inverse(X0),inverse(double_divide(X1,inverse(X1)))) = X0,
inference(superposition,[],[f187,f148]) ).
fof(f259,plain,
! [X2,X0,X1] : double_divide(double_divide(X0,inverse(double_divide(inverse(X2),inverse(double_divide(X1,inverse(X1)))))),inverse(X2)) = X0,
inference(superposition,[],[f22,f217]) ).
fof(f271,plain,
! [X2,X0,X1] : double_divide(inverse(X0),inverse(double_divide(inverse(double_divide(X0,inverse(X2))),inverse(double_divide(X1,inverse(X1)))))) = X2,
inference(superposition,[],[f1,f217]) ).
fof(f272,plain,
! [X2,X0] : double_divide(inverse(X0),inverse(double_divide(X0,inverse(X2)))) = X2,
inference(forward_demodulation,[],[f271,f217]) ).
fof(f277,plain,
! [X2,X0] : double_divide(double_divide(X0,inverse(X2)),inverse(X2)) = X0,
inference(forward_demodulation,[],[f259,f217]) ).
fof(f466,plain,
! [X0] : inverse(inverse(X0)) = X0,
inference(superposition,[],[f272,f148]) ).
fof(f521,plain,
! [X0,X1] : double_divide(double_divide(inverse(X0),X0),inverse(X1)) = X1,
inference(superposition,[],[f187,f466]) ).
fof(f526,plain,
! [X0,X1] : double_divide(double_divide(X1,X0),X0) = X1,
inference(superposition,[],[f277,f466]) ).
fof(f706,plain,
! [X2,X0,X1] : double_divide(double_divide(X0,inverse(double_divide(double_divide(inverse(X1),X2),X2))),inverse(inverse(X0))) = X1,
inference(superposition,[],[f43,f521]) ).
fof(f744,plain,
! [X2,X0,X1] : double_divide(double_divide(X0,inverse(double_divide(double_divide(inverse(X1),X2),X2))),X0) = X1,
inference(forward_demodulation,[],[f706,f466]) ).
fof(f747,plain,
! [X0,X1] : double_divide(double_divide(X0,inverse(inverse(X1))),X0) = X1,
inference(forward_demodulation,[],[f744,f526]) ).
fof(f748,plain,
! [X0,X1] : double_divide(double_divide(X0,X1),X0) = X1,
inference(forward_demodulation,[],[f747,f466]) ).
fof(f784,plain,
! [X0,X1] : double_divide(X0,X1) = double_divide(X1,X0),
inference(superposition,[],[f526,f748]) ).
fof(f1051,plain,
inverse(double_divide(a,b)) != inverse(double_divide(a,b)),
inference(superposition,[],[f4,f784]) ).
fof(f1052,plain,
$false,
inference(trivial_inequality_removal,[],[f1051]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP588-1 : TPTP v9.3.1. Bugfixed v2.7.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.36 % Computer : n014.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Sun Sep 27 10:07:31 UTC 2026
% 0.08/0.37 % CPUTime :
% 0.08/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.41 Running first-order model finding
% 0.13/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.13/0.49 % (573229)Will run a generic schedule for satisfiability detection.
% 0.13/0.49 % (573238)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3067448047:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.13/0.49 % (573235)% WARNING: option uhcvi not known.
% 0.13/0.49 % (573235)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1358651945:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.13/0.49 % (573237)dis+10_1_sil=32000:sp=arity:random_seed=3315465113:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.13/0.49 % (573236)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2567392464:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.13/0.49 % (573234)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=489922763_2999 on theBenchmark for (2999ds/0Mi)
% 0.13/0.49 % TRYING [1]
% 0.13/0.49 % TRYING [2]
% 0.13/0.49 % TRYING [3]
% 0.13/0.49 % (573239)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3578365962:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.13/0.49 % (573240)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1272206238:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.13/0.49 % TRYING [4]
% 0.13/0.49 % (573236) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-573229-573236"...
% 0.13/0.49 % (573236)...printing done.
% 0.13/0.49 % (573236)Refutation found. Thanks to Tanya!
% 0.13/0.49 % SZS status Unsatisfiable for theBenchmark
% 0.13/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.49 % (573236)------------------------------
% 0.13/0.49 % (573236)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.13/0.49 % (573236)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.13/0.49 % (573236)CaDiCaL version: 2.1.3
% 0.13/0.49 % (573236)Termination reason: Refutation
% 0.13/0.49 % (573236)Time elapsed: 0.032 s
% 0.13/0.49 % (573236)Peak memory usage: 12 MB
% 0.13/0.49 % (573236)Instructions burned: 54 (million)
% 0.13/0.49 % (573229)Success in time 0.066 s
% 0.13/0.49 % Vampire exiting
%------------------------------------------------------------------------------