%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : GRP593-1 : TPTP v9.3.1. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n007.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.18s 0.48s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 3
% Syntax : Number of formulae : 25 ( 25 unt; 0 def)
% Number of atoms : 25 ( 24 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 : 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 : 51 ( 51 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : inverse(double_divide(double_divide(X0,X1),inverse(double_divide(X0,inverse(double_divide(X2,X1)))))) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
fof(f2,axiom,
! [X0,X1] : multiply(X0,X1) = inverse(double_divide(X1,X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
fof(f3,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_1) ).
fof(f4,plain,
inverse(double_divide(a1,inverse(a1))) != inverse(double_divide(b1,inverse(b1))),
inference(definition_unfolding,[],[f3,f2,f2]) ).
fof(f6,plain,
! [X2,X0,X1] : inverse(double_divide(double_divide(double_divide(X1,X2),inverse(double_divide(X0,X2))),X0)) = X1,
inference(superposition,[],[f1,f1]) ).
fof(f9,plain,
! [X2,X3,X0,X1] : double_divide(double_divide(X0,X3),inverse(double_divide(X2,X3))) = inverse(double_divide(double_divide(X1,X2),inverse(double_divide(X1,X0)))),
inference(superposition,[],[f1,f6]) ).
fof(f41,plain,
! [X2,X0,X1] : double_divide(double_divide(inverse(double_divide(X0,X1)),X2),inverse(double_divide(X1,X2))) = X0,
inference(superposition,[],[f9,f1]) ).
fof(f45,plain,
! [X2,X0,X1] : inverse(double_divide(inverse(double_divide(double_divide(X0,X1),inverse(double_divide(X0,X2)))),X1)) = X2,
inference(superposition,[],[f6,f9]) ).
fof(f111,plain,
! [X2,X0,X1] : inverse(double_divide(inverse(inverse(double_divide(double_divide(X0,X1),inverse(double_divide(X0,X1))))),X2)) = X2,
inference(superposition,[],[f45,f9]) ).
fof(f187,plain,
! [X3,X0,X1] : inverse(double_divide(inverse(double_divide(double_divide(X0,X1),inverse(double_divide(X0,X1)))),X3)) = X3,
inference(superposition,[],[f111,f9]) ).
fof(f282,plain,
! [X3,X0,X1] : inverse(double_divide(double_divide(double_divide(X0,X1),inverse(double_divide(X0,X1))),X3)) = X3,
inference(superposition,[],[f187,f9]) ).
fof(f390,plain,
! [X3,X0] : inverse(double_divide(double_divide(X0,inverse(X0)),X3)) = X3,
inference(superposition,[],[f282,f41]) ).
fof(f462,plain,
! [X0,X1] : inverse(double_divide(X1,inverse(double_divide(X0,inverse(X1))))) = X0,
inference(superposition,[],[f390,f1]) ).
fof(f531,plain,
! [X0,X1] : inverse(double_divide(double_divide(X0,inverse(X1)),X0)) = X1,
inference(superposition,[],[f462,f462]) ).
fof(f594,plain,
! [X0] : inverse(inverse(X0)) = X0,
inference(superposition,[],[f531,f41]) ).
fof(f596,plain,
! [X0,X1] : double_divide(double_divide(X0,X1),X1) = X0,
inference(superposition,[],[f531,f6]) ).
fof(f624,plain,
! [X0,X1] : inverse(X0) = double_divide(double_divide(X1,inverse(X1)),X0),
inference(superposition,[],[f594,f390]) ).
fof(f746,plain,
! [X0,X1] : inverse(inverse(double_divide(X0,inverse(inverse(double_divide(X1,X0)))))) = X1,
inference(superposition,[],[f41,f624]) ).
fof(f769,plain,
! [X0,X1] : double_divide(X1,inverse(X1)) = double_divide(inverse(X0),X0),
inference(superposition,[],[f596,f624]) ).
fof(f806,plain,
! [X0,X1] : double_divide(X0,inverse(inverse(double_divide(X1,X0)))) = X1,
inference(forward_demodulation,[],[f746,f594]) ).
fof(f838,plain,
! [X0,X1] : double_divide(X0,double_divide(X1,X0)) = X1,
inference(forward_demodulation,[],[f806,f594]) ).
fof(f848,plain,
! [X0,X1] : double_divide(X0,X1) = double_divide(X1,X0),
inference(superposition,[],[f838,f596]) ).
fof(f1167,plain,
! [X0,X1] : double_divide(X0,inverse(X0)) = double_divide(X1,inverse(X1)),
inference(forward_demodulation,[],[f769,f848]) ).
fof(f1447,plain,
! [X0] : inverse(double_divide(a1,inverse(a1))) != inverse(double_divide(X0,inverse(X0))),
inference(superposition,[],[f4,f1167]) ).
fof(f1702,plain,
$false,
inference(equality_resolution,[],[f1447]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP593-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.39 % Computer : n007.cluster.edu
% 0.11/0.39 % Model : x86_64 x86_64
% 0.11/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.39 % Memory : 8046.5625MB
% 0.11/0.39 % OS : Linux 6.8.0-71-generic
% 0.11/0.39 % CPULimit : 300
% 0.11/0.39 % WCLimit : 300
% 0.11/0.39 % DateTime : Sun Sep 27 10:05:55 UTC 2026
% 0.11/0.40 % CPUTime :
% 0.11/0.40 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.43 Running first-order model finding
% 0.11/0.43 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.48 % (1182360)Will run a generic schedule for satisfiability detection.
% 0.18/0.48 % (1182367)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3404184994:i=88024:add=on:rawr=on_3000 on theBenchmark for (3000ds/88024Mi)
% 0.18/0.48 % (1182366)% WARNING: option uhcvi not known.
% 0.18/0.48 % (1182365)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1110581785_3000 on theBenchmark for (3000ds/0Mi)
% 0.18/0.48 % (1182370)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1668316838:i=131_3000 on theBenchmark for (3000ds/131Mi)
% 0.18/0.48 % (1182368)dis+10_1_sil=32000:sp=arity:random_seed=391917044:i=103:fgj=on_3000 on theBenchmark for (3000ds/103Mi)
% 0.18/0.48 % (1182371)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=333982397:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_3000 on theBenchmark for (3000ds/159Mi)
% 0.18/0.48 % (1182369)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4243944566:i=116_3000 on theBenchmark for (3000ds/116Mi)
% 0.18/0.48 % TRYING [1]
% 0.18/0.48 % TRYING [2]
% 0.18/0.48 % TRYING [3]
% 0.18/0.48 % (1182366)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3092951101:i=135531:add=off:rawr=on_3000 on theBenchmark for (3000ds/135531Mi)
% 0.18/0.48 % TRYING [4]
% 0.18/0.48 % (1182367) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1182360-1182367"...
% 0.18/0.48 % (1182367)...printing done.
% 0.18/0.48 % (1182367)Refutation found. Thanks to Tanya!
% 0.18/0.48 % SZS status Unsatisfiable for theBenchmark
% 0.18/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.48 % (1182367)------------------------------
% 0.18/0.48 % (1182367)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.48 % (1182367)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.48 % (1182367)CaDiCaL version: 2.1.3
% 0.18/0.48 % (1182367)Termination reason: Refutation
% 0.18/0.48 % (1182367)Time elapsed: 0.029 s
% 0.18/0.48 % (1182367)Peak memory usage: 13 MB
% 0.18/0.48 % (1182367)Instructions burned: 95 (million)
% 0.18/0.48 % (1182360)Success in time 0.044 s
% 0.18/0.48 % Vampire exiting
%------------------------------------------------------------------------------