%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : GRP490-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 : n009.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:57 AM UTC 2026
% Result : Unsatisfiable 0.15s 10.48s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 19 ( 19 unt; 0 def)
% Number of atoms : 19 ( 18 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 6 ( 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 : 12 ( 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : double_divide(double_divide(identity,X0),double_divide(identity,double_divide(double_divide(double_divide(X0,X1),identity),double_divide(X2,X1)))) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
fof(f2,axiom,
! [X0,X1] : multiply(X0,X1) = double_divide(double_divide(X1,X0),identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
fof(f3,axiom,
! [X0] : inverse(X0) = double_divide(X0,identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inverse) ).
fof(f4,axiom,
! [X0] : identity = double_divide(X0,inverse(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',identity) ).
fof(f5,negated_conjecture,
multiply(inverse(a1),a1) != identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_1) ).
fof(f6,plain,
identity != multiply(inverse(a1),a1),
inference(reorient_equations,[],[f5]) ).
fof(f7,plain,
! [X0] : identity = double_divide(X0,double_divide(X0,identity)),
inference(definition_unfolding,[],[f4,f3]) ).
fof(f8,plain,
identity != double_divide(double_divide(a1,double_divide(a1,identity)),identity),
inference(definition_unfolding,[],[f6,f2,f3]) ).
fof(f9,plain,
identity != double_divide(identity,identity),
inference(forward_demodulation,[],[f8,f7]) ).
fof(f15,plain,
! [X0] : double_divide(double_divide(X0,identity),identity) = double_divide(double_divide(identity,X0),double_divide(identity,identity)),
inference(superposition,[],[f1,f7]) ).
fof(f16,plain,
double_divide(identity,double_divide(identity,identity)) = double_divide(double_divide(double_divide(identity,identity),identity),identity),
inference(superposition,[],[f15,f7]) ).
fof(f19,plain,
identity = double_divide(double_divide(double_divide(identity,identity),identity),identity),
inference(forward_demodulation,[],[f16,f7]) ).
fof(f20,plain,
! [X0] : double_divide(double_divide(identity,double_divide(identity,identity)),double_divide(identity,double_divide(identity,double_divide(X0,identity)))) = X0,
inference(superposition,[],[f1,f19]) ).
fof(f24,plain,
! [X0] : double_divide(identity,double_divide(identity,double_divide(identity,double_divide(X0,identity)))) = X0,
inference(forward_demodulation,[],[f20,f7]) ).
fof(f25,plain,
double_divide(double_divide(identity,identity),identity) = double_divide(identity,double_divide(identity,double_divide(identity,identity))),
inference(superposition,[],[f24,f19]) ).
fof(f31,plain,
double_divide(identity,identity) = double_divide(double_divide(identity,identity),identity),
inference(forward_demodulation,[],[f25,f7]) ).
fof(f36,plain,
! [X0] : double_divide(identity,identity) = double_divide(double_divide(identity,X0),double_divide(identity,double_divide(double_divide(double_divide(X0,identity),identity),double_divide(identity,identity)))),
inference(superposition,[],[f1,f31]) ).
fof(f39,plain,
identity = double_divide(identity,identity),
inference(forward_demodulation,[],[f36,f1]) ).
fof(f43,plain,
$false,
inference(forward_subsumption_resolution,[],[f39,f9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP490-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.12/10.39 % Computer : n009.cluster.edu
% 0.12/10.39 % Model : x86_64 x86_64
% 0.12/10.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/10.39 % Memory : 8046.5625MB
% 0.12/10.39 % OS : Linux 6.8.0-71-generic
% 0.12/10.39 % CPULimit : 300
% 0.12/10.39 % WCLimit : 300
% 0.12/10.39 % DateTime : Sun Sep 27 10:06:11 UTC 2026
% 0.12/10.39 % CPUTime :
% 0.12/10.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.15/10.42 Running first-order model finding
% 0.15/10.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.15/10.48 % (1791586)Will run a generic schedule for satisfiability detection.
% 0.15/10.48 % (1791591)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3728095958_2999 on theBenchmark for (2999ds/0Mi)
% 0.15/10.48 % TRYING [1]
% 0.15/10.48 % TRYING [2]
% 0.15/10.48 % TRYING [3]
% 0.15/10.48 % TRYING [4]
% 0.15/10.48 % (1791592)% WARNING: option uhcvi not known.
% 0.15/10.48 % TRYING [5]
% 0.15/10.48 % (1791592)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=862593082:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.15/10.48 % (1791593)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4159013124:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.15/10.48 % (1791594)dis+10_1_sil=32000:sp=arity:random_seed=3438213013:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.15/10.48 % (1791595)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=589109346:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.15/10.48 % (1791596)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=416751215:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.15/10.48 % (1791597)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1964295128:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.15/10.48 % (1791593) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1791586-1791593"...
% 0.15/10.48 % (1791593)...printing done.
% 0.15/10.48 % (1791594) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1791586-1791594"...
% 0.15/10.48 % (1791595) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1791586-1791595"...
% 0.15/10.48 % (1791593)Refutation found. Thanks to Tanya!
% 0.15/10.48 % SZS status Unsatisfiable for theBenchmark
% 0.15/10.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/10.48 % (1791593)------------------------------
% 0.15/10.48 % (1791593)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.15/10.48 % (1791593)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.15/10.48 % (1791593)CaDiCaL version: 2.1.3
% 0.15/10.48 % (1791593)Termination reason: Refutation
% 0.15/10.48 % (1791593)Time elapsed: 0.003 s
% 0.15/10.48 % (1791593)Peak memory usage: 11 MB
% 0.15/10.48 % (1791593)Instructions burned: 3 (million)
% 0.15/10.48 % (1791586)Success in time 0.045 s
% 0.15/10.48 % Vampire exiting
%------------------------------------------------------------------------------