%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : GRP586-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 : 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:18:09 AM UTC 2026
% Result : Unsatisfiable 0.17s 0.51s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 20 ( 20 unt; 0 def)
% Number of atoms : 20 ( 19 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 6 ( 6 ~; 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 : 34 ( 34 !; 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/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(multiply(inverse(b2),b2),a2) != a2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_2) ).
fof(f4,plain,
a2 != multiply(multiply(inverse(b2),b2),a2),
inference(reorient_equations,[],[f3]) ).
fof(f5,plain,
a2 != inverse(double_divide(a2,inverse(double_divide(b2,inverse(b2))))),
inference(definition_unfolding,[],[f4,f2,f2]) ).
fof(f6,plain,
! [X2,X3,X0,X1] : double_divide(X1,inverse(double_divide(inverse(double_divide(X0,inverse(X3))),inverse(double_divide(inverse(double_divide(double_divide(X1,X2),inverse(X0))),X2))))) = X3,
inference(superposition,[],[f1,f1]) ).
fof(f7,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(f18,plain,
! [X2,X0,X1] : double_divide(double_divide(X0,X2),inverse(double_divide(X0,inverse(double_divide(inverse(X1),X2))))) = X1,
inference(superposition,[],[f1,f7]) ).
fof(f35,plain,
! [X0,X1] : double_divide(inverse(double_divide(X0,inverse(X1))),inverse(X0)) = X1,
inference(superposition,[],[f6,f1]) ).
fof(f45,plain,
! [X2,X0,X1] : double_divide(inverse(double_divide(double_divide(X1,X2),inverse(X0))),X2) = double_divide(inverse(X0),inverse(X1)),
inference(superposition,[],[f35,f1]) ).
fof(f48,plain,
! [X0,X1] : double_divide(inverse(X0),inverse(inverse(double_divide(X1,inverse(X0))))) = X1,
inference(superposition,[],[f35,f35]) ).
fof(f68,plain,
! [X2,X0,X1] : double_divide(double_divide(inverse(double_divide(double_divide(inverse(X1),X2),inverse(X0))),X2),inverse(X0)) = X1,
inference(superposition,[],[f18,f35]) ).
fof(f82,plain,
! [X0,X1] : double_divide(double_divide(inverse(X0),inverse(inverse(X1))),inverse(X0)) = X1,
inference(forward_demodulation,[],[f68,f45]) ).
fof(f100,plain,
! [X0,X1] : inverse(double_divide(X0,inverse(X1))) = double_divide(inverse(X0),inverse(inverse(X1))),
inference(superposition,[],[f35,f48]) ).
fof(f277,plain,
! [X0,X1] : double_divide(inverse(X1),inverse(double_divide(inverse(X0),inverse(inverse(X0))))) = X1,
inference(superposition,[],[f1,f82]) ).
fof(f297,plain,
! [X0,X1] : double_divide(inverse(X1),double_divide(inverse(inverse(X0)),inverse(inverse(inverse(X0))))) = X1,
inference(forward_demodulation,[],[f277,f100]) ).
fof(f1512,plain,
a2 != double_divide(inverse(a2),inverse(inverse(double_divide(b2,inverse(b2))))),
inference(superposition,[],[f5,f100]) ).
fof(f1553,plain,
a2 != double_divide(inverse(a2),inverse(double_divide(inverse(b2),inverse(inverse(b2))))),
inference(forward_demodulation,[],[f1512,f100]) ).
fof(f1586,plain,
a2 != double_divide(inverse(a2),double_divide(inverse(inverse(b2)),inverse(inverse(inverse(b2))))),
inference(forward_demodulation,[],[f1553,f100]) ).
fof(f1609,plain,
$false,
inference(forward_subsumption_resolution,[],[f1586,f297]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP586-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.38 % Computer : n008.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Sun Sep 27 10:08:24 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.42 Running first-order model finding
% 0.11/0.42 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.17/0.51 % (1003405)Will run a generic schedule for satisfiability detection.
% 0.17/0.51 % (1003415)% WARNING: option uhcvi not known.
% 0.17/0.51 % (1003415)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=576036838:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.51 % (1003414)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2447926638_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.51 % (1003416)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3458380606:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.51 % (1003418)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2372368466:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.51 % (1003417)dis+10_1_sil=32000:sp=arity:random_seed=699125714:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.51 % (1003419)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1672935624:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.51 % (1003420)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1075436329:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/0.51 % TRYING [1]
% 0.17/0.51 % TRYING [2]
% 0.17/0.51 % TRYING [3]
% 0.17/0.51 % TRYING [4]
% 0.17/0.51 % (1003419) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1003405-1003419"...
% 0.17/0.51 % (1003419)...printing done.
% 0.17/0.51 % (1003419)Refutation found. Thanks to Tanya!
% 0.17/0.51 % SZS status Unsatisfiable for theBenchmark
% 0.17/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.51 % (1003419)------------------------------
% 0.17/0.51 % (1003419)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.51 % (1003419)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.51 % (1003419)CaDiCaL version: 2.1.3
% 0.17/0.51 % (1003419)Termination reason: Refutation
% 0.17/0.51 % (1003419)Time elapsed: 0.044 s
% 0.17/0.51 % (1003419)Peak memory usage: 12 MB
% 0.17/0.51 % (1003419)Instructions burned: 78 (million)
% 0.17/0.51 % (1003405)Success in time 0.08 s
% 0.17/0.51 % Vampire exiting
%------------------------------------------------------------------------------