%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : GRP610-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 : n013.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:13 AM UTC 2026
% Result : Unsatisfiable 0.86s 0.62s
% Output : Refutation 0.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 3
% Syntax : Number of formulae : 30 ( 30 unt; 0 def)
% Number of atoms : 30 ( 29 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 5 ( 5 ~; 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 : 58 ( 58 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : inverse(double_divide(inverse(double_divide(inverse(double_divide(X0,X1)),X2)),double_divide(X0,X2))) = X1,
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(f7,plain,
! [X2,X0,X1] : inverse(double_divide(X0,double_divide(inverse(double_divide(X1,X0)),double_divide(X1,X2)))) = X2,
inference(superposition,[],[f1,f1]) ).
fof(f10,plain,
! [X2,X3,X0,X1] : double_divide(inverse(double_divide(X2,X1)),double_divide(X2,X0)) = inverse(double_divide(inverse(double_divide(X0,X3)),double_divide(X1,X3))),
inference(superposition,[],[f1,f7]) ).
fof(f42,plain,
! [X2,X0,X1] : double_divide(inverse(double_divide(X1,X2)),double_divide(X1,inverse(double_divide(X2,X0)))) = X0,
inference(superposition,[],[f10,f1]) ).
fof(f46,plain,
! [X2,X0,X1] : inverse(double_divide(X2,inverse(double_divide(inverse(double_divide(X0,X1)),double_divide(X2,X1))))) = X0,
inference(superposition,[],[f7,f10]) ).
fof(f112,plain,
! [X2,X0,X1] : inverse(double_divide(X2,inverse(inverse(double_divide(inverse(double_divide(X0,X1)),double_divide(X0,X1)))))) = X2,
inference(superposition,[],[f46,f10]) ).
fof(f186,plain,
! [X0,X1] : inverse(double_divide(X1,inverse(inverse(double_divide(inverse(X0),X0))))) = X1,
inference(superposition,[],[f112,f42]) ).
fof(f188,plain,
! [X2,X0,X1] : inverse(double_divide(X2,inverse(double_divide(inverse(double_divide(X0,X1)),double_divide(X0,X1))))) = X2,
inference(superposition,[],[f112,f10]) ).
fof(f281,plain,
! [X0,X1] : inverse(double_divide(X1,inverse(double_divide(inverse(X0),X0)))) = X1,
inference(superposition,[],[f188,f42]) ).
fof(f283,plain,
! [X2,X0,X1] : inverse(double_divide(X2,double_divide(inverse(double_divide(X0,X1)),double_divide(X0,X1)))) = X2,
inference(superposition,[],[f188,f10]) ).
fof(f322,plain,
! [X0,X1] : inverse(double_divide(X1,inverse(inverse(inverse(double_divide(inverse(X0),X0)))))) = X1,
inference(superposition,[],[f281,f186]) ).
fof(f406,plain,
! [X0,X1] : inverse(double_divide(X1,double_divide(inverse(X0),X0))) = X1,
inference(superposition,[],[f283,f42]) ).
fof(f463,plain,
! [X0,X1] : inverse(double_divide(inverse(double_divide(inverse(X1),X0)),X1)) = X0,
inference(superposition,[],[f406,f1]) ).
fof(f518,plain,
! [X0,X1] : inverse(double_divide(X0,double_divide(inverse(X1),X0))) = X1,
inference(superposition,[],[f463,f463]) ).
fof(f595,plain,
! [X0] : inverse(inverse(X0)) = X0,
inference(superposition,[],[f518,f42]) ).
fof(f597,plain,
! [X0,X1] : double_divide(X1,double_divide(X1,X0)) = X0,
inference(superposition,[],[f518,f7]) ).
fof(f630,plain,
! [X0,X1] : inverse(X0) = double_divide(X0,double_divide(inverse(X1),X1)),
inference(superposition,[],[f595,f406]) ).
fof(f732,plain,
! [X0,X1] : inverse(inverse(double_divide(inverse(inverse(double_divide(X0,X1))),X0))) = X1,
inference(superposition,[],[f42,f630]) ).
fof(f776,plain,
! [X0,X1] : double_divide(inverse(X1),X1) = double_divide(X0,inverse(X0)),
inference(superposition,[],[f597,f630]) ).
fof(f812,plain,
! [X0,X1] : double_divide(inverse(inverse(double_divide(X0,X1))),X0) = X1,
inference(forward_demodulation,[],[f732,f595]) ).
fof(f839,plain,
! [X0,X1] : double_divide(double_divide(X0,X1),X0) = X1,
inference(forward_demodulation,[],[f812,f595]) ).
fof(f849,plain,
! [X0,X1] : double_divide(X0,X1) = double_divide(X1,X0),
inference(superposition,[],[f839,f597]) ).
fof(f1478,plain,
! [X0,X1] : double_divide(X0,inverse(X0)) = double_divide(X1,inverse(X1)),
inference(forward_demodulation,[],[f776,f849]) ).
fof(f1724,plain,
! [X0] : a2 != inverse(double_divide(a2,inverse(double_divide(X0,inverse(X0))))),
inference(superposition,[],[f5,f1478]) ).
fof(f2012,plain,
! [X0] : a2 != inverse(double_divide(a2,inverse(inverse(double_divide(inverse(X0),X0))))),
inference(superposition,[],[f1724,f322]) ).
fof(f2014,plain,
$false,
inference(forward_subsumption_resolution,[],[f2012,f186]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : GRP610-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.08 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.14/0.42 % Computer : n013.cluster.edu
% 0.14/0.42 % Model : x86_64 x86_64
% 0.14/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.42 % Memory : 8046.5625MB
% 0.14/0.42 % OS : Linux 6.8.0-71-generic
% 0.14/0.42 % CPULimit : 300
% 0.14/0.42 % WCLimit : 300
% 0.14/0.42 % DateTime : Sun Sep 27 10:09:06 UTC 2026
% 0.14/0.42 % CPUTime :
% 0.14/0.42 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.14/0.46 Running first-order model finding
% 0.14/0.46 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.86/0.62 % (4184214)Will run a generic schedule for satisfiability detection.
% 0.86/0.62 % (4184220)% WARNING: option uhcvi not known.
% 0.86/0.62 % (4184220)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1988813818:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.86/0.62 % (4184222)dis+10_1_sil=32000:sp=arity:random_seed=1298496206:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.86/0.62 % (4184223)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2207778536:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.86/0.62 % (4184219)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=609489893_2999 on theBenchmark for (2999ds/0Mi)
% 0.86/0.62 % (4184225)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=854009399:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.86/0.62 % (4184224)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3227793636:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.86/0.62 % TRYING [1]
% 0.86/0.62 % TRYING [2]
% 0.86/0.62 % (4184221)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1064356114:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.86/0.62 % TRYING [3]
% 0.86/0.62 % TRYING [4]
% 0.86/0.62 % (4184222)Instruction limit reached!
% 0.86/0.62 % (4184222)------------------------------
% 0.86/0.62 % (4184222)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.86/0.62 % (4184222)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.86/0.62 % (4184222)CaDiCaL version: 2.1.3
% 0.86/0.62 % (4184222)Termination reason: Instruction limit
% 0.86/0.62 % (4184222)Termination phase: Saturation
% 0.86/0.62 % (4184222)Time elapsed: 0.094 s
% 0.86/0.62 % (4184222)Peak memory usage: 12 MB
% 0.86/0.62 % (4184222)Instructions burned: 103 (million)
% 0.86/0.62 % (4184221) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-4184214-4184221"...
% 0.86/0.62 % (4184221)...printing done.
% 0.86/0.62 % (4184221)Refutation found. Thanks to Tanya!
% 0.86/0.62 % SZS status Unsatisfiable for theBenchmark
% 0.86/0.62 % SZS output start Proof for theBenchmark
% See solution above
% 0.86/0.62 % (4184221)------------------------------
% 0.86/0.62 % (4184221)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.86/0.62 % (4184221)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.86/0.62 % (4184221)CaDiCaL version: 2.1.3
% 0.86/0.62 % (4184221)Termination reason: Refutation
% 0.86/0.62 % (4184221)Time elapsed: 0.101 s
% 0.86/0.62 % (4184221)Peak memory usage: 13 MB
% 0.86/0.62 % (4184221)Instructions burned: 108 (million)
% 0.86/0.62 % (4184214)Success in time 0.144 s
% 0.86/0.62 % Vampire exiting
%------------------------------------------------------------------------------